Return to Answer

><>, 1 byte per line, (削除) 243 (削除ここまで) 161 bytes

2D languages FTW! Although writing loops and branches using goto instructions instead of the 2D structure is not fun.

v
1
:
3
%
:
@
&
0
7
4
*
&
?
.
~
~
"
e
l
p
p
A
"
o
o
o
o
o
:
5
%
&
0
d
4
*
&
?
.
~
"
e
i
P
"
o
o
o
@
@
~
$
$
&
0
6
b
*
&
?
!
.
~
~
:
n
:
{
:
}
=
?
;
a
o
1
+
0
1
.

Try it online, or watch it at the fish playground!

The fish swims downward along the code, using conditional gotos to skip things depending on what divides the accumulator.

I believe this meets the spec: whatever newlines are removed, the fish always hits the initial v (the only direction-changing instruction present), so the fish always swims downwards in the first column. Thus deleting a newline has the effect of simply removing the next character from the fish's path, and I don't think you can remove any of the characters without changing the output.

><>, 1 byte per line, (削除) 243 (削除ここまで) (削除) 161 (削除ここまで) 135 bytes

-26 bytes thanks to Jo King!

2D languages FTW! Although writing loops and branches using goto instructions instead of the 2D structure is not fun.

v
l
:
:
3
%
:
&
0
4
7
*
&
?
.
~
~
"
e
l
p
p
A
"
o
o
o
o
o
$
5
%
:
&
0
a
5
*
&
?
.
~
~
"
e
i
P
"
o
o
o
*
0
@
?
n
?
~
l
{
:
}
=
?
;
a
o
1

Try it online!, or watch it at the fish playground!

The fish swims downward along the code, using conditional gotos to skip things depending on what divides the accumulator.

I believe this meets the spec: whatever newlines are removed, the fish always hits the initial v (the only direction-changing instruction present), so the fish always swims downwards in the first column. Thus deleting a newline has the effect of simply removing the next character from the fish's path, and I don't think you can remove any of the characters without changing the output.

><>, 1 byte per line, 243 bytes

2D languages FTW! Although writing loops and ifs using goto instructions instead of the 2D structure is not fun.

v
1
:
f
%
&
0
4
a
*
1
+
&
?
.
~
~
"
e
i
P
e
l
p
p
A
"
o
o
o
o
o
o
o
o
0
a
a
*
7
+
.
:
5
%
&
0
7
a
*
1
+
&
?
.
~
~
"
e
i
P
"
o
o
o
0
a
a
*
7
+
.
:
3
%
&
0
a
a
*
5
+
&
?
.
~
~
"
e
l
p
p
A
"
o
o
o
o
o
0
a
a
*
7
+
.
:
n
:
{
:
}
=
?
;
a
o
1
+
0
1
.

Try it online, or watch it at the fish playground!

The fish swims downward in the first column, using conditional gotos to skip things depending on what divides the accumulator.

I believe this meets the spec: whatever newlines are removed, the fish always meets the initial v (the only direction-changing instruction present), so the fish always swims downwards in the first column. Thus deleting a newline has the effect of simply removing the next character from the fish's path, and I don't think you can remove any of the characters without changing the output.

><>, 1 byte per line, (削除) 243 (削除ここまで) 161 bytes

2D languages FTW! Although writing loops and branches using goto instructions instead of the 2D structure is not fun.

v
1
:
3
%
:
@
&
0
7
4
*
&
?
.
~
~
"
e
l
p
p
A
"
o
o
o
o
o
:
5
%
&
0
d
4
*
&
?
.
~
"
e
i
P
"
o
o
o
@
@
~
$
$
&
0
6
b
*
&
?
!
.
~
~
:
n
:
{
:
}
=
?
;
a
o
1
+
0
1
.

Try it online, or watch it at the fish playground!

The fish swims downward along the code, using conditional gotos to skip things depending on what divides the accumulator.

I believe this meets the spec: whatever newlines are removed, the fish always hits the initial v (the only direction-changing instruction present), so the fish always swims downwards in the first column. Thus deleting a newline has the effect of simply removing the next character from the fish's path, and I don't think you can remove any of the characters without changing the output.

><>, 1 byte per line

2D languages FTW! Although writing loops and ifs using goto instructions instead of the 2D structure is not fun.

v
1
:
f
%
&
0
4
a
*
1
+
&
?
.
~
~
"
e
i
P
e
l
p
p
A
"
o
o
o
o
o
o
o
o
0
a
a
*
7
+
.
:
5
%
&
0
7
a
*
1
+
&
?
.
~
~
"
e
i
P
"
o
o
o
0
a
a
*
7
+
.
:
3
%
&
0
a
a
*
5
+
&
?
.
~
~
"
e
l
p
p
A
"
o
o
o
o
o
0
a
a
*
7
+
.
:
n
:
{
:
}
=
?
;
a
o
1
+
0
1
.

Try it online, or watch it at the fish playground!

The fish swims downward in the first column, using conditional gotos to skip things depending on what divides the accumulator.

I believe this meets the spec: whatever newlines are removed, the fish always meets the initial v (the only direction-changing instruction present), so the fish always swims downwards in the first column. Thus deleting a newline has the effect of simply removing the next character from the fish's path, and I don't think you can remove any of the characters without changing the output.

><>, 1 byte per line, 243 bytes

2D languages FTW! Although writing loops and ifs using goto instructions instead of the 2D structure is not fun.

v
1
:
f
%
&
0
4
a
*
1
+
&
?
.
~
~
"
e
i
P
e
l
p
p
A
"
o
o
o
o
o
o
o
o
0
a
a
*
7
+
.
:
5
%
&
0
7
a
*
1
+
&
?
.
~
~
"
e
i
P
"
o
o
o
0
a
a
*
7
+
.
:
3
%
&
0
a
a
*
5
+
&
?
.
~
~
"
e
l
p
p
A
"
o
o
o
o
o
0
a
a
*
7
+
.
:
n
:
{
:
}
=
?
;
a
o
1
+
0
1
.

Try it online, or watch it at the fish playground!

The fish swims downward in the first column, using conditional gotos to skip things depending on what divides the accumulator.

I believe this meets the spec: whatever newlines are removed, the fish always meets the initial v (the only direction-changing instruction present), so the fish always swims downwards in the first column. Thus deleting a newline has the effect of simply removing the next character from the fish's path, and I don't think you can remove any of the characters without changing the output.