Skip to content

Commit

Permalink
fix: problem data
Browse files Browse the repository at this point in the history
  • Loading branch information
exKAZUu committed Sep 21, 2024
1 parent 5143c48 commit 8e0359c
Showing 1 changed file with 8 additions and 8 deletions.
16 changes: 8 additions & 8 deletions src/problems/problemData.ts
Original file line number Diff line number Diff line change
Expand Up @@ -343,7 +343,7 @@ public class Main {
public static void main(String[] args) {
Turtle 亀 = new Turtle(); // sid
int i = 0; // sid
while (i < 2) {
while (i < <2-3>) {
i++; // sid
亀.前に進む(); // sid
亀.右を向く(); // sid
Expand Down Expand Up @@ -535,7 +535,7 @@ for (s.set('i', 0); s.get('i') < <4-6>; s.set('i', s.get('i') + 1)) {
public class Main {
public static void main(String[] args) {
Turtle t = new Turtle(); // sid
for (int i = 0; i < <4-6>, i++) { // sid
for (int i = 0; i < <4-6>; i++) { // sid
if (i < <2-3>) t.前に進む(); // sid
else if (i == <2-3>) t.左を向く(); // sid
else t.後に戻る(); // sid
Expand Down Expand Up @@ -563,7 +563,7 @@ for (s.set('i', 0); s.get('i') < <5-7>; s.set('i', s.get('i') + 1)) {
public class Main {
public static void main(String[] args) {
Turtle t = new Turtle(); // sid
for (int i = 0; i < <5-7>, i++) { // sid
for (int i = 0; i < <5-7>; i++) { // sid
if (i % 4 == 0) t.前に進む(); // sid
else if (i % 4 == 1) t.右を向く(); // sid
else if (i % 4 == 2) t.前に進む(); // sid
Expand Down Expand Up @@ -921,7 +921,7 @@ function double(a) {
public class Main {
public static void main(String[] args) {
Turtle t = new Turtle(); // sid
int x = 二倍する(<2-3>) // sid
int x = 二倍する(<2-3>); // sid
N歩前に進める(t, x);
}
static void N歩前に進める(Turtle t, int n) {
Expand Down Expand Up @@ -1000,7 +1000,7 @@ public class Main {
if (等しいか(i, j))
t.右を向く(); // sid
else
t.二歩前に進める(t);
二歩前に進める(t);
}
t.左を向く(); // sid
}
Expand Down Expand Up @@ -1067,7 +1067,7 @@ for (s.set('i', 0); s.get('i') < s.get('arr').length; s.set('i', s.get('i') + 1)
public class Main {
public static void main(String[] args) {
Turtle t = new Turtle(); // sid
int [] arr = { 0, 1, 0, 2, 0 }; // sid
int[] arr = { 0, 1, 0, 2, 0 }; // sid
for (int i = 0; i < arr.length; i++) { // sid
switch (arr[i]) {
case 0:
Expand Down Expand Up @@ -1102,8 +1102,8 @@ for (const cmd of [0, 1, 0, 2, 0]) {
public class Main {
public static void main(String[] args) {
Turtle t = new Turtle(); // sid
int [] arr = { 0, 1, 0, 2, 0 }; // sid
for (int cmd : array) { // sid
int[] arr = { 0, 1, 0, 2, 0 }; // sid
for (int cmd : arr) { // sid
switch (cmd) {
case 0:
t.前に進む(); break; // sid
Expand Down

0 comments on commit 8e0359c

Please sign in to comment.