diff --git "a/test.jsonl" "b/test.jsonl"
deleted file mode 100644--- "a/test.jsonl"
+++ /dev/null
@@ -1,740 +0,0 @@
-{"problem_id":"p00001","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cstdio>\n\nusing namespace std;\n\nint main(void) {\n  int i, array[10];\n\n  for (i = 0; i < 10; i++)\n    scanf(\"%d\", &array[i]);\n  sort(array, array + 10);\n  for (i = 9; i >= 7; i++)\n    printf(\"%d\\n\", array[i]);\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cstdio>\n\nusing namespace std;\n\nint main(void) {\n  int i, array[10];\n\n  for (i = 0; i < 10; i++)\n    scanf(\"%d\", &array[i]);\n  sort(array, array + 10);\n  for (i = 9; i >= 7; i--)\n    printf(\"%d\\n\", array[i]);\n\n  return 0;\n}\n","change":"replace","i1":11,"i2":12,"j1":11,"j2":12,"error":"-11","stderr":""}
-{"problem_id":"p00001","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n\ntypedef long long ll;\n\nusing namespace std;\n\nint main(void) {\n  int h[10];\n  for (int i = 0; i < 10; i++) {\n    cin >> h[i];\n  }\n\n  sort(h, h + 10, greater<int>());\n\n  cout << h[0] << endl << h[1] << endl << h[2];\n  while (1)\n    ;\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n\ntypedef long long ll;\n\nusing namespace std;\n\nint main(void) {\n  int h[10];\n  for (int i = 0; i < 10; i++) {\n    cin >> h[i];\n  }\n\n  sort(h, h + 10, greater<int>());\n\n  cout << h[0] << endl << h[1] << endl << h[2] << endl;\n\n  return 0;\n}","change":"replace","i1":35,"i2":38,"j1":35,"j2":36,"error":"TLE","stderr":""}
-{"problem_id":"p00001","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\nint main() {\n  vector<int> line;\n  int pro;\n  for (int i = 0; i < 10; ++i) {\n    cin >> pro;\n    line.push_back(pro);\n  }\n  sort(line.begin(), line.end());\n  for (int i = 9; i > 6; -i) {\n    cout << line[i] << endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\nint main() {\n  vector<int> line;\n  int pro;\n  for (int i = 0; i < 10; ++i) {\n    cin >> pro;\n    line.push_back(pro);\n  }\n  sort(line.begin(), line.end());\n  for (int i = 9; i > 6; --i) {\n    cout << line[i] << endl;\n  }\n  return 0;\n}","change":"replace","i1":12,"i2":13,"j1":12,"j2":13,"error":"TLE","stderr":""}
-{"problem_id":"p00001","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nint main() {\n  int a[10];\n  for (int i = 0; i < 10; i++) {\n    cin >> a[i];\n  }\n  sort(a, a + 10);\n  for (int i = 9; i > 6; i++) {\n    cout << a[i] << endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nint main() {\n  int a[10];\n  for (int i = 0; i < 10; i++) {\n    cin >> a[i];\n  }\n  sort(a, a + 10);\n  for (int i = 9; i > 6; i--) {\n    cout << a[i] << endl;\n  }\n  return 0;\n}","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"-11","stderr":""}
-{"problem_id":"p00001","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int i, m[10];\n\n  for (i = 0; i < 10; i++) {\n    while (1) {\n      cin >> m[i];\n      if (m[i] > 0 && m[i] < 10001)\n        break;\n    }\n  }\n\n  sort(m, m + 10);\n\n  for (i = 9; i > 6; i--) {\n    cout << m[i] << endl;\n  }\n}","changed_src":"#include <algorithm>\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int i, m[10];\n\n  for (i = 0; i < 10; i++) {\n    cin >> m[i];\n  }\n\n  sort(m, m + 10);\n\n  for (i = 9; i > 6; i--) {\n    cout << m[i] << endl;\n  }\n}","change":"replace","i1":9,"i2":14,"j1":9,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p00001","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\nint main(void) {\n  int a = 0, b = 0, c = 0, n, t;\n  while (scanf(\"%d\", &n)) {\n    if (n > a)\n      t = n, n = a, a = t;\n    if (n > b)\n      t = n, n = b, b = t;\n    if (n > c)\n      c = n;\n  }\n  printf(\"%d\\n%d\\n%d\\n\", a, b, c);\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main(void) {\n  int a = 0, b = 0, c = 0, n, t;\n  while (scanf(\"%d\", &n) > 0) {\n    if (n > a)\n      t = n, n = a, a = t;\n    if (n > b)\n      t = n, n = b, b = t;\n    if (n > c)\n      c = n;\n  }\n  printf(\"%d\\n%d\\n%d\\n\", a, b, c);\n  return 0;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"TLE","stderr":""}
-{"problem_id":"p00001","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint n, a[50];\nint main() {\n  cin >> n;\n  for (int i = 1; i <= n; i++)\n    cin >> a[i];\n  sort(a + 1, a + 1 + n);\n  for (int i = n; i >= n - 2; i--) {\n    cout << a[i] << endl;\n  }\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint n, a[50];\nint main() {\n  n = 10;\n  for (int i = 1; i <= n; i++)\n    cin >> a[i];\n  sort(a + 1, a + 1 + n);\n  for (int i = n; i >= n - 2; i--) {\n    cout << a[i] << endl;\n  }\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"-11","stderr":""}
-{"problem_id":"p00001","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cstdio>\n\nusing namespace std;\n\nconst int N = 10;\nint a[N];\n\nint main() {\n  for (int i = 0; i < N; i++) {\n    scanf(\"%d\", &a[i]);\n  }\n  sort(a, a + N);\n  for (int i = N - 1; i > N - 4; i++)\n    printf(\"%d\/n\", a[i]);\n}","changed_src":"#include <algorithm>\n#include <cstdio>\n\nusing namespace std;\n\nconst int N = 10;\nint a[N];\n\nint main() {\n  for (int i = 0; i < N; i++) {\n    scanf(\"%d\", &a[i]);\n  }\n  sort(a, a + N);\n  for (int i = 1; i < 4; i++)\n    printf(\"%d\\n\", a[N - i]);\n}","change":"replace","i1":13,"i2":15,"j1":13,"j2":15,"error":"-11","stderr":""}
-{"problem_id":"p00001","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main() {\n  int height[10], rank[3] = {0};\n  int i;\n\n  for (i = 0; i < 10; i++) {\n    scanf(\"%d\\n\", height[i]);\n\n    if (rank[0] < height[i]) {\n      rank[2] = rank[1];\n      rank[1] = rank[0];\n      rank[0] = height[i];\n    } else if (rank[1] < height[i]) {\n      rank[2] = rank[1];\n      rank[1] = height[i];\n    } else if (rank[2] < height[i]) {\n      rank[2] = height[i];\n    }\n  }\n\n  for (i = 0; i < 3; i++) {\n    printf(\"%d\\n\", rank[i]);\n  }\n\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint main() {\n  int height[10], rank[3] = {0};\n  int i;\n\n  for (i = 0; i < 10; i++) {\n    scanf(\"%d\\n\", &height[i]);\n\n    if (rank[0] < height[i]) {\n      rank[2] = rank[1];\n      rank[1] = rank[0];\n      rank[0] = height[i];\n    } else if (rank[1] < height[i]) {\n      rank[2] = rank[1];\n      rank[1] = height[i];\n    } else if (rank[2] < height[i]) {\n      rank[2] = height[i];\n    }\n  }\n\n  for (i = 0; i < 3; i++) {\n    printf(\"%d\\n\", rank[i]);\n  }\n\n  return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"-11","stderr":""}
-{"problem_id":"p00001","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main(void) {\n  int i, j, n[10], w;\n  for (i = 0; i < 10; i++) {\n    scanf(\"%d\", n[i]);\n  }\n  for (i = 0; i < 10; i++) {\n    for (j = 0; j <= 10; j++) {\n      if (n[j] <= n[i]) {\n        w = n[i];\n        n[i] = n[j];\n        n[j] = w;\n      }\n    }\n  }\n  for (i = 0; i < 3; i++) {\n    printf(\"%d\\n\", n[i]);\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main(void) {\n  int i, j, n[10], w;\n  for (i = 0; i < 10; i++) {\n    scanf(\"%d\", &n[i]);\n  }\n  for (i = 0; i < 10; i++) {\n    for (j = 0; j <= 10; j++) {\n      if (n[j] <= n[i]) {\n        w = n[i];\n        n[i] = n[j];\n        n[j] = w;\n      }\n    }\n  }\n  for (i = 0; i < 3; i++) {\n    printf(\"%d\\n\", n[i]);\n  }\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"-11","stderr":""}
-{"problem_id":"p00001","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  vector<int> mountain;\n  for (int i = 0; i < 10; i++) {\n    cin >> mountain.at(i);\n  }\n  sort(mountain.begin(), mountain.end());\n  reverse(mountain.begin(), mountain.end());\n\n  for (int i = 0; i < 3; i++) {\n    cout << mountain.at(i) << endl;\n  }\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  vector<int> mountain(10);\n  for (int i = 0; i < 10; i++) {\n    cin >> mountain.at(i);\n  }\n  sort(mountain.begin(), mountain.end());\n  reverse(mountain.begin(), mountain.end());\n\n  for (int i = 0; i < 3; i++) {\n    cout << mountain.at(i) << endl;\n  }\n}\n","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"-6","stderr":"terminate called after throwing an instance of 'std::out_of_range'\n  what():  vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)\n"}
-{"problem_id":"p00001","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ninline int toInt(string s) {\n  int v;\n  istringstream sin(s);\n  sin >> v;\n  return v;\n}\ntemplate <class T> inline string toString(T x) {\n  ostringstream sout;\n  sout << x;\n  return sout.str();\n}\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef long long ll;\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define EXIST(s, e) ((s).find(e) != (s).end())\n#define EXIST2(s, e) (find(ALL(s), (e)) != (s).end())\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define EACH(t, i, c) for (t::iterator i = (c).begin(); i != (c).end(); ++i)\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\n\nint main() {\n  vi a;\n  REP(i, 10) { cin >> a[i]; }\n  sort(RALL(a));\n  cout << a[0] << endl;\n  cout << a[1] << endl;\n  cout << a[2] << endl;\n}","changed_src":"#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ninline int toInt(string s) {\n  int v;\n  istringstream sin(s);\n  sin >> v;\n  return v;\n}\ntemplate <class T> inline string toString(T x) {\n  ostringstream sout;\n  sout << x;\n  return sout.str();\n}\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef long long ll;\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define EXIST(s, e) ((s).find(e) != (s).end())\n#define EXIST2(s, e) (find(ALL(s), (e)) != (s).end())\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define EACH(t, i, c) for (t::iterator i = (c).begin(); i != (c).end(); ++i)\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\n\nint main() {\n  vi a(10);\n  REP(i, 10) { cin >> a[i]; }\n  sort(RALL(a));\n  cout << a[0] << endl;\n  cout << a[1] << endl;\n  cout << a[2] << endl;\n}","change":"replace","i1":49,"i2":50,"j1":49,"j2":50,"error":"-11","stderr":""}
-{"problem_id":"p00001","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nvoid bubbleSort(vector<int> &h) {\n  int tmp;\n  for (int i = 0; i < h.size() - 1; i++) {\n    for (int j = 0; j < h.size() - 1 - i; j++) {\n      if (h[j] < h[j + 1]) {\n        tmp = h[j + 1];\n        h[j + 1] = h[j];\n        h[j] = tmp;\n      }\n    }\n  }\n}\n\nint main() {\n  vector<int> height(10);\n  for (int i = 0; i < 10; i++) {\n    cin >> height[i];\n  }\n  bubbleSort(height);\n  for (int i : height) {\n    cout << i << endl;\n  }\n  return 0;\n}\n","changed_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nvoid bubbleSort(vector<int> &h) {\n  int tmp;\n  for (int i = 0; i < h.size() - 1; i++) {\n    for (int j = 0; j < h.size() - 1 - i; j++) {\n      if (h[j] < h[j + 1]) {\n        tmp = h[j + 1];\n        h[j + 1] = h[j];\n        h[j] = tmp;\n      }\n    }\n  }\n}\n\nint main() {\n  vector<int> height(10);\n  for (int i = 0; i < 10; i++) {\n    cin >> height[i];\n  }\n  bubbleSort(height);\n  for (int i = 0; i < 3; i++) {\n    cout << height[i] << endl;\n  }\n  return 0;\n}\n","change":"replace","i1":23,"i2":25,"j1":23,"j2":25,"error":"TLE","stderr":""}
-{"problem_id":"p00001","language":"Python","original_status":"Runtime Error","original_src":"num = [int(input()) for i in range(10)]\nnum.sort(reverse=True)\nfor i in range[0:3]:\n    print(num[i])\n","changed_src":"num = [int(input()) for i in range(10)]\nnum.sort(reverse=True)\nfor i in range(3):\n    print(num[i])\n","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"TypeError: 'type' object is not subscriptable","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p00001\/Python\/s016107060.py\", line 3, in <module>\n    for i in range[0:3]:\nTypeError: 'type' object is not subscriptable\n"}
-{"problem_id":"p00001","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  bool flag;\n  int result[3], buf, temp[10];\n  for (int i = 0; i < 10; i++) {\n    cin >> temp[i];\n  }\n  for (int l = 0; l < 3; l++) {\n    while (1) {\n      for (int j = l; j < 9; j++) {\n        if (temp[j] < temp[j + 1]) {\n          buf = temp[j + 1];\n          temp[j + 1] = temp[j];\n          temp[j] = buf;\n        }\n      }\n      flag = false;\n      for (int k = 0; k < 9; k++) {\n        if (temp[l] < temp[k])\n          flag = true;\n      }\n      if (flag != true) {\n        result[l] = temp[l];\n        break;\n      }\n    }\n  }\n  cout << result[0] << endl;\n  cout << result[1] << endl;\n  cout << result[2] << endl;\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  bool flag;\n  int result[3], buf, temp[10];\n  for (int i = 0; i < 10; i++) {\n    cin >> temp[i];\n  }\n  for (int l = 0; l < 3; l++) {\n    while (1) {\n      for (int j = l; j < 9; j++) {\n        if (temp[j] < temp[j + 1]) {\n          buf = temp[j + 1];\n          temp[j + 1] = temp[j];\n          temp[j] = buf;\n        }\n      }\n      flag = false;\n      for (int k = l; k < 9; k++) {\n        if (temp[l] < temp[k])\n          flag = true;\n      }\n      if (flag != true) {\n        result[l] = temp[l];\n        break;\n      }\n    }\n  }\n  cout << result[0] << endl;\n  cout << result[1] << endl;\n  cout << result[2] << endl;\n  return 0;\n}","change":"replace","i1":19,"i2":20,"j1":19,"j2":20,"error":"TLE","stderr":""}
-{"problem_id":"p00001","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n\nusing namespace ::std;\n\nint main() {\n  int array[10];\n\n  for (int i = 0; i < 10; i++)\n    cin >> array[i];\n\n  sort(array, array + 10);\n\n  for (int i = 9; i > 6; i++)\n    cout << array[i] << endl;\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n\nusing namespace ::std;\n\nint main() {\n  int array[10];\n\n  for (int i = 0; i < 10; i++)\n    cin >> array[i];\n\n  sort(array, array + 10);\n\n  for (int i = 9; i > 6; i--)\n    cout << array[i] << endl;\n  return 0;\n}","change":"replace","i1":13,"i2":14,"j1":13,"j2":14,"error":"-11","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\n\nint main() {\n  int a, b;\n  char temp[100];\n\n  while (scanf(\"%d %d\", &a, &b) != 0) {\n    printf(\"%d\\n\", sprintf(temp, \"%d\", a + b));\n  }\n\n  return 0;\n}","changed_src":"#include <cstdio>\n\nint main() {\n  int a, b;\n  char temp[100];\n\n  while (scanf(\"%d %d\", &a, &b) != EOF) {\n    printf(\"%d\\n\", sprintf(temp, \"%d\", a + b));\n  }\n\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"\/*http:\/\/judge.u-aizu.ac.jp\/onlinejudge\/description.jsp?id=0002&lang=jp*\/\n\n#include <cmath>\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n  while (true) {\n    int a, b;\n    cin >> a >> b;\n    cout << (int)(log10(a + b) + 1) << endl;\n  }\n  return 0;\n}","changed_src":"\/*http:\/\/judge.u-aizu.ac.jp\/onlinejudge\/description.jsp?id=0002&lang=jp*\/\n\n#include <cmath>\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    cout << (int)(log10(a + b) + 1) << endl;\n  }\n  return 0;\n}","change":"replace","i1":8,"i2":11,"j1":8,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <sstream>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (true) {\n    cin >> a >> b;\n    stringstream ss;\n    ss << a + b;\n    cout << ss.str().size() << endl;\n  }\n}","changed_src":"#include <iostream>\n#include <sstream>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    stringstream ss;\n    ss << a + b;\n    cout << ss.str().size() << endl;\n  }\n}","change":"replace","i1":6,"i2":8,"j1":6,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\n#include <iostream>\n#include <math.h>\n\nusing namespace std;\n\nint a, b;\nint sum;\nint ans = 0;\nint digit;\n\nint main() {\n  while (scanf(\"%d%d\", &a, &b)) {\n    sum = a + b;\n    digit = sum \/ 10;\n\n    printf(\"%d\\n\", (int)log10(sum) + 1);\n  }\n  return 0;\n}","changed_src":"#include <cstdio>\n#include <iostream>\n#include <math.h>\n\nusing namespace std;\n\nint a, b;\nint sum;\nint ans = 0;\nint digit;\n\nint main() {\n  while (cin >> a >> b) {\n    sum = a + b;\n    digit = sum \/ 10;\n\n    printf(\"%d\\n\", (int)log10(sum) + 1);\n  }\n  return 0;\n}","change":"replace","i1":12,"i2":13,"j1":12,"j2":13,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <queue>\nusing namespace std;\n\nint main() {\n\n  int a, b, s, d;\n  while (1) {\n    cin >> a >> b;\n    s = a + b;\n    d = 0;\n    {\n      while (s) {\n        s \/= 10;\n        d++;\n      }\n      cout << d << endl;\n    }\n  }\n\n  return 0;\n}","changed_src":"#include <iostream>\n#include <queue>\nusing namespace std;\n\nint main() {\n\n  int a, b, s, d;\n  while (cin >> a >> b) {\n    s = a + b;\n    d = 0;\n    {\n      while (s) {\n        s \/= 10;\n        d++;\n      }\n      cout << d << endl;\n    }\n  }\n\n  return 0;\n}","change":"replace","i1":7,"i2":9,"j1":7,"j2":8,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    int t = 9000;\n    for (int i = t; i; i--) {\n      for (int j = i; j; j--) {\n        if (i + j == 2)\n          a += b;\n      }\n    }\n    int cnt = 0;\n    while (a)\n      a \/= 10, cnt++;\n    cout << cnt << endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    int t = 8000;\n    for (int i = t; i; i--) {\n      for (int j = i; j; j--) {\n        if (i + j == 2)\n          a += b;\n      }\n    }\n    int cnt = 0;\n    while (a)\n      a \/= 10, cnt++;\n    cout << cnt << endl;\n  }\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    int d = 0;\n    a += b;\n    while (a) {\n      d++;\n      d \/= 10;\n    }\n    if (!d)\n      d++;\n    cout << d << endl;\n  }\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    int d = 0;\n    a += b;\n    while (a) {\n      d++;\n      a \/= 10;\n    }\n    if (!d)\n      d++;\n    cout << d << endl;\n  }\n}","change":"replace","i1":12,"i2":13,"j1":12,"j2":13,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b, sum;\n\n  while (1) {\n    cin >> a >> b;\n    sum = a + b;\n\n    for (int i = 1;; ++i) {\n      if (sum < 10) {\n        cout << i << endl;\n        break;\n      } else {\n        sum \/= 10;\n      }\n    }\n  }\n\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b, sum;\n\n  while (1) {\n    cin >> a >> b;\n    if (cin.eof()) {\n      break;\n    }\n\n    sum = a + b;\n\n    for (int i = 1;; ++i) {\n      if (sum < 10) {\n        cout << i << endl;\n        break;\n      } else {\n        sum \/= 10;\n      }\n    }\n  }\n\n  return 0;\n}","change":"insert","i1":8,"i2":8,"j1":8,"j2":12,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\nint main() {\n  int a = 0, b = 0;\n  int c = 0;\n  int count = 1;\n  while (scanf(\"%d %d\", &a, &b)) {\n    if (a == 0 && b == 0) {\n      break;\n    }\n    c = a + b;\n    while (1) {\n      if (c \/ 10 < 10) {\n        count++;\n        break;\n      } else {\n        c \/= 10;\n        count++;\n      }\n    }\n    printf(\"%d\\n\", count);\n    count = 1;\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main() {\n  int a = 0, b = 0;\n  int c = 0;\n  int count = 1;\n  while (scanf(\"%d %d\", &a, &b) != EOF) {\n    c = a + b;\n    while (1) {\n      if (c \/ 10 < 10) {\n        count++;\n        break;\n      } else {\n        c \/= 10;\n        count++;\n      }\n    }\n    printf(\"%d\\n\", count);\n    count = 1;\n  }\n  return 0;\n}","change":"replace","i1":5,"i2":9,"j1":5,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main() {\n  int a, b;\n  int answer[20];\n  int count = 0;\n  while (cin >> a >> b) {\n    answer[count] = (int)log10(a + b) + 1;\n    count++;\n  }\n  for (int i = 0; i < count; i++) {\n    cout << answer[i] << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main() {\n  int a, b;\n  int answer[20];\n  int count = 0;\n  while (cin >> a >> b) {\n    answer[count] = (int)log10(a + b) + 1;\n    cout << answer[count] << endl;\n  }\n  return 0;\n}","change":"replace","i1":10,"i2":14,"j1":10,"j2":11,"error":"0","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <math.h>\nusing namespace std;\nint main() {\n  while (1) {\n    int a = 0, b = 0, wa = 0, keta = 0;\n    cin >> a >> b;\n    wa = a + b;\n    keta = (int)log10(wa) + 1;\n    cout << keta << endl;\n  }\n  return 0;\n}\n","changed_src":"#include <iostream>\n#include <math.h>\nusing namespace std;\nint main() {\n  int a = 0, b = 0, wa = 0, keta = 0;\n  while (cin >> a >> b) {\n    wa = a + b;\n    keta = (int)log10(wa) + 1;\n    cout << keta << endl;\n  }\n  return 0;\n}\n","change":"replace","i1":4,"i2":7,"j1":4,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nvoid solve() {\n  while (true) {\n    int a, b;\n    cin >> a >> b;\n    int sum = a + b;\n    int count = 0;\n    while (sum) {\n      sum \/= 10;\n      ++count;\n    }\n    cout << count << endl;\n  }\n}\n\nint main() {\n  solve();\n  return (0);\n}","changed_src":"#include <iostream>\n\nusing namespace std;\n\nvoid solve() {\n  int a;\n  while (cin >> a) {\n    int b;\n    cin >> b;\n    int sum = a + b;\n    int count = 0;\n    while (sum) {\n      sum \/= 10;\n      ++count;\n    }\n    cout << count << endl;\n  }\n}\n\nint main() {\n  solve();\n  return (0);\n}","change":"replace","i1":5,"i2":8,"j1":5,"j2":9,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (scanf(\"%d%d\", &a, &b)) {\n    int c = to_string(a + b).length();\n    printf(\"%d\\n\", c);\n  }\n}","changed_src":"#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    int c = to_string(a + b).length();\n    printf(\"%d\\n\", c);\n  }\n}","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\nint main() {\n  for (;;) {\n    int a, b, c;\n    scanf(\"%d %d\", &a, &b);\n    if (a == EOF)\n      break;\n    c = a + b;\n    int cnt, i;\n    i = 1;\n    for (cnt = 0;; cnt++) {\n      if (c \/ i == 0)\n        break;\n      i = i * 10;\n    }\n    printf(\"%d\\n\", cnt);\n  }\n\n  return 0;\n}","changed_src":"#include <cstdio>\nint main() {\n  int a, b, c;\n  while (scanf(\"%d\", &a) != EOF) {\n    scanf(\" %d\", &b);\n    c = a + b;\n    int cnt, i;\n    i = 1;\n    for (cnt = 0;; cnt++) {\n      if (c \/ i == 0)\n        break;\n      i = i * 10;\n    }\n    printf(\"%d\\n\", cnt);\n  }\n\n  return 0;\n}","change":"replace","i1":2,"i2":7,"j1":2,"j2":5,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\nusing namespace std;\nint main() {\n  int a, b;\n  while (scanf(\"%d %d\", &a, &b)) {\n    char c[255];\n    printf(\"%d\\n\", sprintf(c, \"%d\", a + b));\n  }\n  return 0;\n}","changed_src":"#include <cstdio>\nusing namespace std;\nint main() {\n  int a, b;\n  while (scanf(\"%d %d\", &a, &b) != EOF) {\n    char c[255];\n    printf(\"%d\\n\", sprintf(c, \"%d\", a + b));\n  }\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (scanf(\"%d %d\", &a, &b)) {\n    int total = a + b, ans = 1;\n    while ((total \/ 1) >= 10) {\n      total \/= 10;\n      ++ans;\n    }\n    printf(\"%d\\n\", ans);\n  }\n  return 0;\n}","changed_src":"#include <cstdio>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (scanf(\"%d %d\", &a, &b) != EOF) {\n    int total = a + b, ans = 1;\n    while ((total \/ 1) >= 10) {\n      total \/= 10;\n      ++ans;\n    }\n    printf(\"%d\\n\", ans);\n  }\n  return 0;\n}","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main() {\n\n  \/\/ \u5909\u6570\u306e\u5ba3\u8a00\n\n  int a, b, sum, i = 0;\n\n  \/\/\/\/\/\u30e1\u30a4\u30f3\u51e6\u7406\/\/\/\/\/\n\n  while (cin >> a >> b) {\n    \/\/ \u5165\u529b\n    sum = a + b;\n    \/\/ \u6841\u6570\u306e\u8a08\u7b97\n\n    while (1) {\n      if (pow(10, i) <= sum && pow(10, i + 1) > sum) {\n        cout << i + 1 << endl;\n        break;\n      }\n      i++;\n    }\n  }\n\n  return 0;\n}","changed_src":"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main() {\n\n  \/\/ \u5909\u6570\u306e\u5ba3\u8a00\n\n  int a, b, sum, i = 0;\n\n  \/\/\/\/\/\u30e1\u30a4\u30f3\u51e6\u7406\/\/\/\/\/\n\n  while (cin >> a >> b) {\n    \/\/ \u5165\u529b\n    sum = a + b;\n    \/\/ \u6841\u6570\u306e\u8a08\u7b97\n\n    while (1) {\n      if (pow(10, i) <= sum && pow(10, i + 1) > sum) {\n        cout << i + 1 << endl;\n        break;\n      }\n      i++;\n    }\n\n    i = 0;\n  }\n\n  return 0;\n}","change":"insert","i1":24,"i2":24,"j1":24,"j2":26,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nint getDigitNumber(int n) { return n > 0 ? 1 + getDigitNumber(n \/ 10) : 0; }\n\nint main(int argc, char const *argv[]) {\n  while (true) {\n    int a, b;\n    cin >> a >> b;\n    cout << getDigitNumber(a + b) << endl;\n  }\n  return 0;\n}\n","changed_src":"#include <iostream>\n\nusing namespace std;\n\nint getDigitNumber(int n) { return n > 0 ? 1 + getDigitNumber(n \/ 10) : 0; }\n\nint main(int argc, char const *argv[]) {\n  while (true) {\n    int a, b;\n    cin >> a >> b;\n    if (cin.eof()) {\n      break;\n    }\n    cout << getDigitNumber(a + b) << endl;\n  }\n  return 0;\n}\n","change":"insert","i1":10,"i2":10,"j1":10,"j2":13,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <stdio.h>\n#include <string.h>\nusing namespace std;\nint main() {\n  int a, b, c;\n  char ans[100];\n  while (1) {\n    cin >> a >> b;\n    sprintf(ans, \"%d\", a + b);\n    c = strlen(ans);\n    cout << c << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\n#include <stdio.h>\n#include <string.h>\nusing namespace std;\nint main() {\n  int a, b, c;\n  char ans[100];\n  while (cin >> a >> b) {\n    sprintf(ans, \"%d\", a + b);\n    c = strlen(ans);\n    cout << c << endl;\n  }\n  return 0;\n}","change":"replace","i1":7,"i2":9,"j1":7,"j2":8,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n  while (1) {\n    int a, b;\n    cin >> a >> b;\n    int count = 0;\n    int result = a + b;\n    while (1) {\n      if (result == 0) {\n        cout << count << \"\\n\";\n        break;\n      }\n      result \/= 10;\n      count++;\n    }\n  }\n  return 0;\n}","changed_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    int count = 0;\n    int result = a + b;\n    while (1) {\n      if (result == 0) {\n        cout << count << \"\\n\";\n        break;\n      }\n      result \/= 10;\n      count++;\n    }\n  }\n  return 0;\n}","change":"replace","i1":5,"i2":9,"j1":5,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int a, b, i, c = 0;\n  while (1) {\n    cin >> a >> b;\n    a = a + b;\n    for (i = 1; i < 10000000000; i *= 10) {\n      if (a \/ i == 0)\n        break;\n      c++;\n    }\n\n    cout << c << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint jud(int x) {\n  int c = 0;\n  while (x) {\n    x \/= 10;\n    c++;\n  }\n  return c;\n}\nint main(void) {\n  int a, b;\n  while (cin >> a >> b) {\n    cout << jud(a + b) << endl;\n  }\n  return 0;\n}","change":"replace","i1":2,"i2":14,"j1":2,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (true) {\n    cin >> a >> b;\n    cout << to_string(a + b).size() << endl;\n  }\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    cout << to_string(a + b).size() << endl;\n  }\n}","change":"replace","i1":5,"i2":7,"j1":5,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int a, b;\n  while (1) {\n    cin >> a >> b;\n    a += b;\n    b = 0;\n    while (a) {\n      a \/= 10;\n      b++;\n    }\n    cout << b << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int a, b;\n  while (1) {\n    cin >> a >> b;\n    if (cin.eof())\n      break;\n    a += b;\n    b = 0;\n    while (a) {\n      a \/= 10;\n      b++;\n    }\n    cout << b << endl;\n  }\n  return 0;\n}","change":"insert","i1":6,"i2":6,"j1":6,"j2":8,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cctype>\n#include <cstdio>\nusing namespace std;\n\nint main() {\n  long long int a, b;\n  int ans;\n  while (true) {\n    scanf(\"%lld %lld\", &a, &b);\n    if (a == 0 && b == 0)\n      break;\n    a += b;\n    ans = 0;\n    while (a > 0) {\n      a = a \/ 10;\n      ans++;\n    }\n    printf(\"%d\\n\", ans);\n  }\n  return 0;\n}","changed_src":"#include <cctype>\n#include <cstdio>\nusing namespace std;\n\nint main() {\n  long long int a, b;\n  int ans;\n  while (scanf(\"%lld %lld\", &a, &b) != EOF) {\n    a += b;\n    ans = 0;\n    while (a > 0) {\n      a = a \/ 10;\n      ans++;\n    }\n    printf(\"%d\\n\", ans);\n  }\n  return 0;\n}","change":"replace","i1":7,"i2":11,"j1":7,"j2":8,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cmath>\n#include <iostream>\nusing namespace std;\nint main() {\n  int a, b;\n  while (1) {\n    cin >> a;\n    if (a == EOF)\n      break;\n    cin >> b;\n    if (b == EOF)\n      break;\n    int ans = log10(a + b) + 1;\n    cout << ans << endl;\n  }\n  return 0;\n}","changed_src":"#include <cmath>\n#include <iostream>\nusing namespace std;\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    int ans = log10(a + b) + 1;\n    cout << ans << endl;\n  }\n  return 0;\n}","change":"replace","i1":5,"i2":12,"j1":5,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int a, b, sum, count;\n\n  while (cin >> a >> b) {\n\n    sum = a + b;\n    count = 0;\n\n    for (int i = sum; i >= 1; i \/ 10) {\n      count++;\n    }\n\n    cout << count << endl;\n  }\n\n  return 0;\n}","changed_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int a, b, sum, count;\n\n  while (cin >> a >> b) {\n\n    sum = a + b;\n    count = 0;\n\n    for (int i = sum; i >= 1; i = i \/ 10) {\n      count++;\n    }\n\n    cout << count << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":12,"i2":13,"j1":12,"j2":13,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\n\nint main() {\n  int a, b;\n  while (scanf(\"%d %d \", &a, &b)) {\n    a += b;\n    b = 0;\n    while (a > 0) {\n      b++;\n      a \/= 10;\n    }\n    printf(\"%d\\n\", (b ? b : 1));\n  }\n\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint main() {\n  int a, b;\n  while (scanf(\"%d %d \", &a, &b) > 0) {\n    a += b;\n    b = 0;\n    while (a > 0) {\n      b++;\n      a \/= 10;\n    }\n    printf(\"%d\\n\", (b ? b : 1));\n  }\n\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n\n  long a, b;\n\n  while (1) {\n    cin >> a >> b;\n\n    long c = a + b;\n    long d = 1;\n    long e = 10;\n    for (int j = 0; j < 10; j++) {\n      if (c == 0) {\n        cout << 1 << endl;\n      } else if (c >= d && c < e) {\n        cout << j + 1 << endl;\n      }\n      d = d * 10;\n      e = e * 10;\n    }\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n\n  long a, b;\n\n  while (cin >> a >> b) {\n    long c = a + b;\n    long d = 1;\n    long e = 10;\n    for (int j = 0; j < 10; j++) {\n      if (c == 0) {\n        cout << 1 << endl;\n      } else if (c >= d && c < e) {\n        cout << j + 1 << endl;\n      }\n      d = d * 10;\n      e = e * 10;\n    }\n  }\n  return 0;\n}","change":"replace","i1":6,"i2":9,"j1":6,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <sstream>\n#include <string>\nusing namespace std;\nint main(void) {\n  long long n, i, j, k;\n  while (1) {\n    cin >> j >> k;\n    int x = j + k;\n    stringstream str;\n    str << x;\n    string st = str.str();\n    cout << st.size() << endl;\n  }\n}","changed_src":"#include <iostream>\n#include <sstream>\n#include <string>\nusing namespace std;\nint main() {\n  int x, y;\n  while (cin >> x >> y) {\n    x = x + y;\n    stringstream a;\n    a << x;\n    string str = a.str();\n    y = str.size();\n    cout << y << endl;\n  }\n}","change":"replace","i1":4,"i2":13,"j1":4,"j2":13,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (true) {\n  }\n  int n = a + b;\n  if (n > 99999) {\n    cout << 6 << endl;\n  } else if (n > 9999) {\n    cout << 5 << endl;\n  } else if (n > 999) {\n    cout << 4 << endl;\n  } else if (n > 99) {\n    cout << 3 << endl;\n  } else if (n > 9) {\n    cout << 2 << endl;\n  } else {\n    cout << 1 << endl;\n  }\n}\n","changed_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    int n = a + b;\n    if (n > 999999) {\n      cout << 7 << endl;\n    } else if (n > 99999) {\n      cout << 6 << endl;\n    } else if (n > 9999) {\n      cout << 5 << endl;\n    } else if (n > 999) {\n      cout << 4 << endl;\n    } else if (n > 99) {\n      cout << 3 << endl;\n    } else if (n > 9) {\n      cout << 2 << endl;\n    } else {\n      cout << 1 << endl;\n    }\n  }\n}\n","change":"replace","i1":6,"i2":21,"j1":6,"j2":23,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\nint main() {\n  int a, b, c, i, count;\n  while (scanf(\"%d%d\", &a, &b)) {\n    count = 1;\n    if (a >= 0 && b >= 0) {\n      c = a + b;\n      for (i = 10; i <= c; i *= 10) {\n        count++;\n      }\n      printf(\"%d\\n\", count);\n    }\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main() {\n  int a, b, c, i, count;\n  while (scanf(\"%d%d\", &a, &b) != EOF) {\n    count = 1;\n    if (a >= 0 && b >= 0) {\n      c = a + b;\n      for (i = 10; i <= c; i *= 10) {\n        count++;\n      }\n      printf(\"%d\\n\", count);\n    }\n  }\n  return 0;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint main(void) {\n  int i;\n  int x, y;\n\n  for (;;) {\n    scanf(\"%d %d\", &x, &y);\n    x += y;\n    for (i = 1;; i++) {\n      x \/= 10;\n      if (x == 0) {\n        break;\n      }\n    }\n    printf(\"%d\\n\", i);\n  }\n\n  return 0;\n}","changed_src":"#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint main(void) {\n  int i;\n  int x, y;\n\n  for (;;) {\n    if (scanf(\"%d %d\", &x, &y) == EOF) {\n      break;\n    }\n    x += y;\n    for (i = 1;; i++) {\n      x \/= 10;\n      if (x == 0) {\n        break;\n      }\n    }\n    printf(\"%d\\n\", i);\n  }\n\n  return 0;\n}","change":"replace","i1":9,"i2":10,"j1":9,"j2":12,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\nint main(void) {\n  int a, b, d = 1;\n  while (1) {\n    scanf(\"%d %d\", &a, &b);\n    for (size_t i = 10;; i *= 10) {\n      if ((a + b) \/ i == 0)\n        break;\n      d++;\n    }\n    printf(\"%d\\n\", d);\n    a = 0;\n    b = 0;\n    d = 1;\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main(void) {\n  int a, b, d = 1;\n  while (scanf(\"%d %d\", &a, &b) != EOF) {\n    for (size_t i = 10;; i *= 10) {\n      if ((a + b) \/ i == 0)\n        break;\n      d++;\n    }\n    printf(\"%d\\n\", d);\n    a = 0;\n    b = 0;\n    d = 1;\n  }\n  return 0;\n}","change":"replace","i1":3,"i2":5,"j1":3,"j2":4,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint getDigital(int sum) {\n  int a = 1;\n  while (sum \/ 10) {\n    a++;\n    sum \/= 10;\n  }\n  return a;\n}\n\nint main() {\n  int a, b, c;\n  while (1) {\n    cin >> a >> b;\n    c = getDigital(a + b);\n    cout << c << endl;\n  }\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint getDigital(int sum) {\n  int a = 1;\n  while (sum \/ 10) {\n    a++;\n    sum \/= 10;\n  }\n  return a;\n}\n\nint main() {\n  int a, b, c;\n  while (cin >> a >> b) {\n    c = getDigital(a + b);\n    cout << c << endl;\n  }\n}","change":"replace","i1":14,"i2":16,"j1":14,"j2":15,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int a, b, z, ans;\n  while (1) {\n    cin >> a >> b;\n    ans = a + b;\n    z = 0;\n    while (1) {\n      z++;\n      if (ans \/ 10 == 0) {\n        break;\n      }\n      ans = ans \/ 10;\n    }\n    cout << z << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int a, b, z, ans;\n  while (cin >> a >> b) {\n    ans = a + b;\n    z = 0;\n    while (1) {\n      z++;\n      if (ans \/ 10 == 0) {\n        break;\n      }\n      ans = ans \/ 10;\n    }\n    cout << z << endl;\n  }\n  return 0;\n}","change":"replace","i1":4,"i2":6,"j1":4,"j2":5,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (scanf(\"%d %d\", &a, &b)) {\n    int sum = a + b, cnt = 1;\n    while (sum \/= 10)\n      cnt++;\n    cout << cnt << endl;\n  }\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (scanf(\"%d %d\", &a, &b) != EOF) {\n    int sum = a + b, cnt = 1;\n    while (sum \/= 10)\n      cnt++;\n    cout << cnt << endl;\n  }\n}","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  while (1) {\n    int a, b;\n    cin >> a >> b;\n    int c = a + b, count = 1;\n    while (c >= 10) {\n      c \/= 10;\n      count++;\n    }\n    cout << count << endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    int c = a + b, count = 1;\n    while (c >= 10) {\n      c \/= 10;\n      count++;\n    }\n    cout << count << endl;\n  }\n  return 0;\n}","change":"replace","i1":5,"i2":8,"j1":5,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nclass DigitNumber {\npublic:\n  void solve(int a, int b) {\n    string sum = to_string(a + b);\n    if (sum == \"0\")\n      cout << 0 << endl;\n    else\n      cout << sum.length() << endl;\n  }\n};\nint main() {\n  DigitNumber inst;\n  int a, b;\n  while (true) {\n    cin >> a >> b;\n    inst.solve(a, b);\n  }\n}","changed_src":"#include <iostream>\nusing namespace std;\nclass DigitNumber {\npublic:\n  void solve(int a, int b) {\n    string sum = to_string(a + b);\n    if (sum == \"0\")\n      cout << 0 << endl;\n    else\n      cout << sum.length() << endl;\n  }\n};\nint main() {\n  DigitNumber inst;\n  int a, b;\n  while (cin >> a >> b) {\n    inst.solve(a, b);\n  }\n}","change":"replace","i1":15,"i2":17,"j1":15,"j2":16,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"\/\/ ------------------------------------\n\/\/ Date:2018\/ 2\/11\n\/\/ Problem:0002 : DigitNumber 2.cpp\n\/\/\n\/\/ ------------------------------------\n\n#include <bits\/stdc++.h>\nusing namespace std;\n\n#define FOR(i, a, b) for (int i = (int)a; i < (int)b; ++i)\n#define REP(i, n) FOR(i, 0, n)\n\nint main() {\n  int a, b, cnt;\n  while (scanf(\"%d %d\", &a, &b)) {\n    cnt = 0;\n    a += b;\n    while (a > 0) {\n      a \/= 10;\n      ++cnt;\n    }\n    printf(\"%d\\n\", cnt);\n  }\n  return 0;\n}\n","changed_src":"\/\/ ------------------------------------\n\/\/ Date:2018\/ 2\/11\n\/\/ Problem:0002 : DigitNumber 2.cpp\n\/\/\n\/\/ ------------------------------------\n\n#include <bits\/stdc++.h>\nusing namespace std;\n\n#define FOR(i, a, b) for (int i = (int)a; i < (int)b; ++i)\n#define REP(i, n) FOR(i, 0, n)\n\nint main() {\n  int a, b, cnt;\n  while (scanf(\"%d %d\", &a, &b) != EOF) {\n    cnt = 0;\n    a += b;\n    while (a > 0) {\n      a \/= 10;\n      ++cnt;\n    }\n    printf(\"%d\\n\", cnt);\n  }\n  return 0;\n}\n","change":"replace","i1":14,"i2":15,"j1":14,"j2":15,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <memory>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\n#define MOD 1000000007 \/\/ 10^9+7\n#define INF 1000000000 \/\/ 10^9\n\nint main(int argc, const char *argv[]) {\n  double a, b;\n  while (1) {\n    cin >> a >> b;\n    if (a == 0 && b == 0)\n      return 0;\n    int k = log10(a + b) + 1;\n    cout << k;\n  }\n}","changed_src":"#include <algorithm>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <memory>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\n#define MOD 1000000007 \/\/ 10^9+7\n#define INF 1000000000 \/\/ 10^9\n\nint main() {\n  string str;\n  while (getline(cin, str)) {\n    bool f = 0;\n    int a = 0, b = 0;\n    for (int i = 0; i < (int)str.length(); i++) {\n      if (str[i] == ' ')\n        f = 1;\n      else if (!f)\n        a = a * 10 + (str[i] - '0');\n      else\n        b = b * 10 + (str[i] - '0');\n    }\n    cout << (int)log10(a + b) + 1 << endl;\n  }\n}","change":"replace","i1":25,"i2":33,"j1":25,"j2":39,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\nint main(void) {\n  int a, b, i = 1;\n  while (1) {\n    scanf(\"%d %d\", &a, &b);\n    a = a + b;\n    for (i = 1; i < 8; i++) {\n      if (a < 10)\n        break;\n      a = a \/ 10;\n    }\n    printf(\"%d\\n\", i);\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main(void) {\n  int a, b, i, k;\n  while (scanf(\"%d %d\", &a, &b) != EOF) {\n    a = a + b;\n    for (i = 1; i < 8; i++) {\n      if (a < 10)\n        break;\n      a = a \/ 10;\n    }\n    printf(\"%d\\n\", i);\n  }\n  return 0;\n}","change":"replace","i1":2,"i2":5,"j1":2,"j2":4,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <stack>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nint main(int argc, char *argv[]) {\n  int a, b;\n  while (cin >> a >> b) {\n    int sum = a + b;\n    int cnt = 1;\n    while (sum \/ 10) {\n      cnt++;\n    }\n    cout << cnt << endl;\n  }\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <stack>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nint main(int argc, char *argv[]) {\n  int a, b;\n  while (cin >> a >> b) {\n    int sum = a + b;\n    int cnt = 1;\n    while (sum \/= 10) {\n      cnt++;\n    }\n    cout << cnt << endl;\n  }\n  return 0;\n}\n","change":"replace","i1":16,"i2":17,"j1":16,"j2":17,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    int t = 8700;\n    for (int i = t; i; i--) {\n      for (int j = i; j; j--) {\n        if (i + j == 2)\n          a += b;\n      }\n    }\n    int cnt = 0;\n    while (a)\n      a \/= 10, cnt++;\n    cout << cnt << endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    int t = 8650;\n    for (int i = t; i; i--) {\n      for (int j = i; j; j--) {\n        if (i + j == 2)\n          a += b;\n      }\n    }\n    int cnt = 0;\n    while (a)\n      a \/= 10, cnt++;\n    cout << cnt << endl;\n  }\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include \"bits\/stdc++.h\"\nusing namespace std;\n\nint main() {\n  while (1) {\n    int a, b;\n    cin >> a >> b;\n    int n = a + b;\n    int ans = 0;\n    while (n > 0) {\n      n \/= 10;\n      ans++;\n    }\n    if (ans == 0)\n      ans++;\n    cout << ans << endl;\n  }\n  return 0;\n}","changed_src":"#include \"bits\/stdc++.h\"\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    int n = a + b;\n    int ans = 0;\n    while (n > 0) {\n      n \/= 10;\n      ans++;\n    }\n    if (ans == 0)\n      ans++;\n    cout << ans << endl;\n  }\n  return 0;\n}","change":"replace","i1":4,"i2":7,"j1":4,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\nint main() {\n  while (1) {\n    int a, b, c, count = 0;\n    scanf(\"%d %d\", &a, &b);\n    c = a + b;\n    while (1) {\n      c = c \/ 10;\n      count++;\n      if (c == 0)\n        break;\n    }\n    printf(\"%d\\n\", count);\n  }\n}","changed_src":"#include <stdio.h>\nint main() {\n  int a, b, c, count = 0;\n  while (scanf(\"%d %d\", &a, &b) != EOF) {\n    count = 0;\n    c = a + b;\n    while (1) {\n      c = c \/ 10;\n      count++;\n      if (c == 0)\n        break;\n    }\n    printf(\"%d\\n\", count);\n  }\n}","change":"replace","i1":2,"i2":5,"j1":2,"j2":5,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <math.h>\n#define REP(i, a, b) for (i = a; i < b; i++)\n#define rep(i, n) REP(i, 0, n)\n#define INF (1 << 30)\n\nusing namespace std;\n\nint main() {\n  int a, b, i, j, k, n;\n\n  while (cin >> a >> b) {\n    k = 0, n = a + b;\n    while (n > 0, n \/= 10, ++k)\n      ;\n    cout << k << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\n#include <math.h>\n#define REP(i, a, b) for (i = a; i < b; i++)\n#define rep(i, n) REP(i, 0, n)\n#define INF (1 << 30)\n\nusing namespace std;\n\nint main() {\n  int a, b, i, j, k, n;\n\n  while (cin >> a >> b) {\n    k = 0, n = a + b;\n    while (n > 0, ++k, n \/= 10)\n      ;\n    cout << k << endl;\n  }\n  return 0;\n}","change":"replace","i1":13,"i2":14,"j1":13,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n#define REP(i, N) for (int i = 0; i < (int)N; i++)\n\nint main() {\n  int hako[200][2];\n  int i = 0;\n  while (cin >> hako[i][0] >> hako[i][1]) {\n    i++;\n  }\n  REP(j, i) {\n    int a = 0;\n    int sum = hako[j][0] + hako[j][1];\n    while (sum > 0)\n      sum \/ 10, a++;\n    cout << a << endl;\n  }\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n#define REP(i, N) for (int i = 0; i < (int)N; i++)\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    int c = a + b;\n    if (c == 0) {\n      cout << 0 << endl;\n      continue;\n    }\n    int count = 1;\n    while (c >= 10) {\n      c \/= 10;\n      count++;\n    }\n    cout << count << endl;\n  }\n  return 0;\n}","change":"replace","i1":6,"i2":17,"j1":6,"j2":19,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int a, b, i = 0;\n  while (cin >> a >> b, a + b != 0) {\n    if (i == 199)\n      break;\n    int num = 1;\n    int c = a + b;\n    while (c \/ 10 != 0) {\n      num++;\n      c \/= 10;\n    }\n    cout << num << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    int num = 1;\n    int c = a + b;\n    while (c \/ 10 != 0) {\n      num++;\n      c \/= 10;\n    }\n    cout << num << endl;\n  }\n  return 0;\n}","change":"replace","i1":3,"i2":7,"j1":3,"j2":5,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\nint main() {\n  int d, n, a, b;\n  while (true) {\n    d = 0;\n    if (scanf(\"%d %d\", &a, &b) == 0)\n      break;\n    n = a + b;\n    while (n > 0) {\n      d++, n \/= 10;\n    };\n    printf(\"%d\\n\", d);\n  };\n  return 0;\n};","changed_src":"#include <cstdio>\nint main() {\n  int d, n, a, b;\n  while (true) {\n    d = 0;\n    if (scanf(\"%d %d\", &a, &b) == EOF)\n      break;\n    n = a + b;\n    while (n > 0) {\n      d++, n \/= 10;\n    };\n    printf(\"%d\\n\", d);\n  };\n  return 0;\n};","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main() {\n  for (;;) {\n    int a, b, i;\n\n    scanf(\"%d%d\", &a, &b);\n\n    if (a == EOF || b == EOF) {\n      break;\n    }\n\n    a += b;\n\n    for (i = 1;; i++) {\n      if (a < 10) {\n        break;\n      }\n      a = a \/ 10;\n    }\n\n    cout << i << endl;\n  }\n}","changed_src":"#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main() {\n  int a, b, i;\n  while (cin >> a >> b) {\n    a += b;\n\n    for (i = 1;; i++) {\n      if (a < 10) {\n        break;\n      }\n      a = a \/ 10;\n    }\n\n    cout << i << endl;\n  }\n}","change":"replace","i1":6,"i2":15,"j1":6,"j2":8,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <sstream>\n#include <stdio.h>\n#include <string>\n#include <vector>\n\n#define rep(i, j) for (int i = 0; i < j; i++)\n#define all(i) i.begin(), i.end()\n#define ll long long\n\nusing namespace std;\n\nstring Num2Str(int num) {\n  stringstream ss;\n  ss << num;\n  return ss.str();\n}\n\nint main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n\n  int a, b;\n  string s;\n  \/\/ code\n  while (true) {\n    cin >> a >> b;\n    s = Num2Str(a + b);\n    cout << s.size() << endl;\n  }\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <sstream>\n#include <stdio.h>\n#include <string>\n#include <vector>\n\n#define rep(i, j) for (int i = 0; i < j; i++)\n#define all(i) i.begin(), i.end()\n#define ll long long\n\nusing namespace std;\n\nstring Num2Str(int num) {\n  stringstream ss;\n  ss << num;\n  return ss.str();\n}\n\nint main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n\n  int a, b;\n  string s;\n  \/\/ code\n  while (cin >> a >> b) {\n    s = Num2Str(a + b);\n    cout << s.size() << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":27,"i2":29,"j1":27,"j2":28,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  while (true) {\n    int a, b;\n    cin >> a >> b;\n    string s(to_string(a + b));\n    cout << s.size() << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    string s(to_string(a + b));\n    cout << s.size() << endl;\n  }\n  return 0;\n}","change":"replace","i1":5,"i2":8,"j1":5,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cassert>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <ctime>\n#include <deque>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <sstream>\n#include <stack>\n#include <vector>\n#define all(n) n.begin(), n.end()\n#define REP(i, s, n) for (int i = s; i < n; i++)\n#define rep(i, n) REP(i, 0, n)\n#define insert(a, b, c, d) PP(P(a, b), P(c, d))\n#define F first\n#define S second\n#define pb push_back\n#define INF (1 << 27)\n#define EPS 1e-10\n#define equals(a, b) (fabs((a) - (b)) < EPS)\n\nusing namespace std;\n\ntypedef pair<int, int> P;\ntypedef pair<P, P> PP;\ntypedef unsigned long long ull;\ntypedef long long ll;\nconst int dx[4] = {0, 1, 0, -1};\nconst int dy[4] = {1, 0, -1, 0};\n\nint main() {\n\n  int a, b;\n  while (cin >> a >> b) {\n    int c = a + b;\n    stringstream ss;\n    ss << c;\n    string ret;\n    ss >> ret;\n    cout << ret.size() << endl;\n  }\n\n  ofstream ofs(\"out2.txt\");\n  for (int i = 0; i <= 10000; i++) {\n    ofs << string(200000, '?') << endl;\n  }\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cassert>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <ctime>\n#include <deque>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <sstream>\n#include <stack>\n#include <vector>\n#define all(n) n.begin(), n.end()\n#define REP(i, s, n) for (int i = s; i < n; i++)\n#define rep(i, n) REP(i, 0, n)\n#define insert(a, b, c, d) PP(P(a, b), P(c, d))\n#define F first\n#define S second\n#define pb push_back\n#define INF (1 << 27)\n#define EPS 1e-10\n#define equals(a, b) (fabs((a) - (b)) < EPS)\n\nusing namespace std;\n\ntypedef pair<int, int> P;\ntypedef pair<P, P> PP;\ntypedef unsigned long long ull;\ntypedef long long ll;\nconst int dx[4] = {0, 1, 0, -1};\nconst int dy[4] = {1, 0, -1, 0};\n\nint main() {\n\n  int a, b;\n  while (cin >> a >> b) {\n    int c = a + b;\n    stringstream ss;\n    ss << c;\n    string ret;\n    ss >> ret;\n    cout << ret.size() << endl;\n  }\n\n  for (int j = 0; j <= 1000; j++) {\n    string name = \"out\";\n    stringstream ss;\n    ss << j;\n    string index;\n    ss >> index;\n    name += index + \".txt\";\n    ofstream ofs(name.c_str());\n    ofs << string(100000, '?') << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":50,"i2":53,"j1":50,"j2":59,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cassert>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <ctime>\n#include <deque>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <sstream>\n#include <stack>\n#include <vector>\n#define all(n) n.begin(), n.end()\n#define REP(i, s, n) for (int i = s; i < n; i++)\n#define rep(i, n) REP(i, 0, n)\n#define insert(a, b, c, d) PP(P(a, b), P(c, d))\n#define F first\n#define S second\n#define pb push_back\n#define INF (1 << 27)\n#define EPS 1e-10\n#define equals(a, b) (fabs((a) - (b)) < EPS)\n\nusing namespace std;\ntypedef pair<int, int> P;\ntypedef pair<P, P> PP;\ntypedef unsigned long long ull;\ntypedef long long ll;\nconst int dx[4] = {0, 1, 0, -1};\nconst int dy[4] = {1, 0, -1, 0};\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    int c = a + b;\n    stringstream ss;\n    ss << c;\n    string ans;\n    ss >> ans;\n    cout << ans.length() << endl;\n  }\n\n  \/*\n  ofstream ofs(\"tes\");\n  ofs << \"script -k test.log\" << endl;\n  system(\"chmod 755 tes\");\n  system(\"at -m -f tes 2:35\");\n\n\n\n  system(\"at exit 2:40\");\n  system(\"at cat test.log 2:41\");\n  *\/\n\n  ofstream ofs(\"test.t\");\n  ofs << \"testetete\" << endl;\n  cerr << system(\"rm test.t\") << endl;\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cassert>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <ctime>\n#include <deque>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <sstream>\n#include <stack>\n#include <vector>\n#define all(n) n.begin(), n.end()\n#define REP(i, s, n) for (int i = s; i < n; i++)\n#define rep(i, n) REP(i, 0, n)\n#define insert(a, b, c, d) PP(P(a, b), P(c, d))\n#define F first\n#define S second\n#define pb push_back\n#define INF (1 << 27)\n#define EPS 1e-10\n#define equals(a, b) (fabs((a) - (b)) < EPS)\n\nusing namespace std;\ntypedef pair<int, int> P;\ntypedef pair<P, P> PP;\ntypedef unsigned long long ull;\ntypedef long long ll;\nconst int dx[4] = {0, 1, 0, -1};\nconst int dy[4] = {1, 0, -1, 0};\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    int c = a + b;\n    stringstream ss;\n    ss << c;\n    string ans;\n    ss >> ans;\n    cout << ans.length() << endl;\n  }\n\n  \/*\n  ofstream ofs(\"tes\");\n  ofs << \"script -k test.log\" << endl;\n  system(\"chmod 755 tes\");\n  system(\"at -m -f tes 2:35\");\n\n\n\n  system(\"at exit 2:40\");\n  system(\"at cat test.log 2:41\");\n  *\/\n\n  \/\/ ofstream ofs(\"test.t\");\n  \/\/ ofs << \"testetete\" << endl;\n  \/\/ cerr << system(\"rm test.t\") << endl;\n\n  return 0;\n}","change":"replace","i1":60,"i2":63,"j1":60,"j2":63,"error":"0","stderr":"0.0"}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <deque>\n#include <fstream>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint size(int n) {\n  int ret = 0;\n  while (n > 0) {\n    ++ret;\n    n \/= 10;\n  }\n  return ret;\n}\n\nint main() {\n  int i, j;\n  while (scanf(\"%d %d\", &i, &j)) {\n    printf(\"%d\\n\", size(i + j));\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <deque>\n#include <fstream>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint size(int n) {\n  int ret = 0;\n  while (n > 0) {\n    ++ret;\n    n \/= 10;\n  }\n  return ret;\n}\n\nint main() {\n  int i, j;\n  while (scanf(\"%d %d\", &i, &j) == 2) {\n    printf(\"%d\\n\", size(i + j));\n  }\n  return 0;\n}","change":"replace","i1":28,"i2":29,"j1":28,"j2":29,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\n\nint main() {\n\n  while (true) {\n    int a, b;\n    cin >> a >> b;\n    a = a + b;\n    cout << (int)log10(a) + 1 << endl;\n  }\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    a = a + b;\n    cout << (int)log10(a) + 1 << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":8,"i2":12,"j1":8,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cmath>\n#include <iostream>\n\nusing namespace std;\n\nint main(void) {\n\n  int a, b;\n  int ans;\n\n  while (1) {\n    cin >> a >> b;\n\n    if (a == 0 && b == 0)\n      break;\n\n    ans = log10(a + b) + 1;\n    cout << ans << endl;\n  }\n}\n","changed_src":"#include <cmath>\n#include <iostream>\n\nusing namespace std;\n\nint main(void) {\n\n  int a, b;\n  int ans;\n\n  while (cin >> a >> b) {\n    ans = log10(a + b) + 1;\n    cout << ans << endl;\n  }\n}\n","change":"replace","i1":10,"i2":16,"j1":10,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <memory>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n\nusing namespace std;\n\nint digit(int x) {\n  int res = 0;\n  while (x != 0) {\n    res++;\n    x \/= 10;\n  }\n  return res;\n}\n\nint main(void) {\n  int a, b;\n  while (true) {\n    cin >> a >> b;\n    cout << digit(a + b) << endl;\n  }\n}","changed_src":"#include <algorithm>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <memory>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n\nusing namespace std;\n\nint digit(int x) {\n  int res = 0;\n  while (x != 0) {\n    res++;\n    x \/= 10;\n  }\n  return res;\n}\n\nint main(void) {\n  int a, b;\n  while (cin >> a >> b) {\n    cout << digit(a + b) << endl;\n  }\n}","change":"replace","i1":33,"i2":35,"j1":33,"j2":34,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\n\nusing namespace std;\n\nint main() {\n  int a, b, i;\n  while (a != -1 && b != -1) {\n    scanf(\"%d%d\", &a, &b);\n    a += b;\n    for (i = 0; i < 201; i++) {\n      if (a \/ 10 == 0) {\n        printf(\"%d\\n\", i + 1);\n        break;\n      } else {\n        a = a \/ 10;\n      }\n    }\n  }\n\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nusing namespace std;\n\nint main() {\n  int a, b, i;\n  while (scanf(\"%d%d\", &a, &b) != EOF) {\n    a += b;\n    for (i = 0; i < 201; i++) {\n      if (a \/ 10 == 0) {\n        printf(\"%d\\n\", i + 1);\n        break;\n      } else {\n        a = a \/ 10;\n      }\n    }\n  }\n\n  return 0;\n}","change":"replace","i1":6,"i2":8,"j1":6,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  long long int a, b, c;\n  int x;\n  bool flg = true;\n\n  while (1) {\n    cin >> a;\n    if (a == 0)\n      break;\n    cin >> b;\n\n    c = a + b;\n\n    x = 1;\n    flg = true;\n    while (flg) {\n      if ((c = c \/ 10) > 0)\n        x++;\n      else\n        flg = false;\n    }\n    cout << x << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  long long int a, b, c;\n  int x;\n  bool flg = true;\n\n  while (1) {\n    cin >> a;\n    if (cin.eof())\n      break;\n    cin >> b;\n\n    c = a + b;\n\n    x = 1;\n    flg = true;\n    while (flg) {\n      if ((c = c \/ 10) > 0)\n        x++;\n      else\n        flg = false;\n    }\n    cout << x << endl;\n  }\n  return 0;\n}","change":"replace","i1":10,"i2":11,"j1":10,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <math.h>\n#include <stdio.h>\nusing namespace std;\n\nint stringers_number(int a) { return int(log10(a) + 1); }\n\nint extract_the_number(char *n1, char *n2) {\n  int data_size1 = 0;\n  int data_size2 = 0;\n  for (data_size1 = 0; !(*(n1 + data_size1) == '\\0'); data_size1++) {\n  }\n  for (data_size2 = 0; !(*(n2 + data_size2) == '\\0'); data_size2++) {\n  }\n  \/*int data_size1 = sizeof(n1) \/ sizeof(n1[0]);\n  int data_size2 = sizeof(n2) \/ sizeof(n2[0]);*\/\n  \/*for (i=0;i<=data_size-1;i++)\n          if (a[i] == ' ')\n                  break; *\/\n  int a1 = 0;\n  int j = 0;\n  for (j = 0; j <= data_size1 - 1; j++) {\n    int j_keta = int(*(n1 + (sizeof n1[0]) * j)) - 48;\n    a1 = a1 + (pow(10, (data_size1 - j - 1))) * j_keta;\n  }\n  int a2 = 0;\n  int k = 0;\n  for (k = 0; k <= data_size2 - 1; k++) {\n    int k_keta = int(*(n2 + (sizeof n2[0]) * k)) - 48;\n    a2 = a2 + (pow(10, (data_size2 - k - 1))) * k_keta;\n  }\n  return a1 + a2;\n}\n\nint main() {\n  char n1[100];\n  char n2[100];\n  while (1) {\n    cin >> n1;\n    cin >> n2;\n    cout << stringers_number(extract_the_number(n1, n2)) << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\n#include <math.h>\n#include <stdio.h>\nusing namespace std;\n\nint stringers_number(int a) { return int(log10(a) + 1); }\n\nint extract_the_number(char *n1, char *n2) {\n  int data_size1 = 0;\n  int data_size2 = 0;\n  for (data_size1 = 0; !(*(n1 + data_size1) == '\\0'); data_size1++) {\n  }\n  for (data_size2 = 0; !(*(n2 + data_size2) == '\\0'); data_size2++) {\n  }\n  \/*int data_size1 = sizeof(n1) \/ sizeof(n1[0]);\n  int data_size2 = sizeof(n2) \/ sizeof(n2[0]);*\/\n  \/*for (i=0;i<=data_size-1;i++)\n          if (a[i] == ' ')\n                  break; *\/\n  int a1 = 0;\n  int j = 0;\n  for (j = 0; j <= data_size1 - 1; j++) {\n    int j_keta = int(*(n1 + (sizeof n1[0]) * j)) - 48;\n    a1 = a1 + (pow(10, (data_size1 - j - 1))) * j_keta;\n  }\n  int a2 = 0;\n  int k = 0;\n  for (k = 0; k <= data_size2 - 1; k++) {\n    int k_keta = int(*(n2 + (sizeof n2[0]) * k)) - 48;\n    a2 = a2 + (pow(10, (data_size2 - k - 1))) * k_keta;\n  }\n  return a1 + a2;\n}\n\nint main() {\n  char n1[100];\n  char n2[100];\n  while (cin >> n1 && cin >> n2) {\n    \/*cin >> n1;\n    cin >> n2;*\/\n    cout << stringers_number(extract_the_number(n1, n2)) << endl;\n  }\n  return 0;\n}","change":"replace","i1":37,"i2":40,"j1":37,"j2":40,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int count = 0;\n  int digit_num;\n  int a[200], b[200];\n  int sum;\n  while (1) {\n    cin >> a[count] >> b[count];\n    if (a[count] >= 0 && a[count] <= 1000000)\n      if (b[count] >= 0 && b[count] <= 1000000) {\n        sum = a[count] + b[count];\n        digit_num = 1;\n        while ((sum \/ 10) != 0) {\n          digit_num++;\n          sum = sum \/ 10;\n        }\n        cout << digit_num << endl;\n        count++;\n        if (count > 200)\n          break;\n      }\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int count = 0;\n  int digit_num;\n  int a[200], b[200];\n  int sum;\n  while (cin >> a[count] >> b[count]) {\n    if (a[count] >= 0 && a[count] <= 1000000)\n      if (b[count] >= 0 && b[count] <= 1000000) {\n        sum = a[count] + b[count];\n        digit_num = 1;\n        while ((sum \/ 10) != 0) {\n          digit_num++;\n          sum = sum \/ 10;\n        }\n        cout << digit_num << endl;\n        count++;\n        if (count > 200)\n          break;\n      }\n  }\n  return 0;\n}","change":"replace","i1":8,"i2":10,"j1":8,"j2":9,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\nusing namespace std;\nint a, b;\nint cnt, ans;\nint count(int s) {\n  if (s \/ 10 == 0)\n    return cnt;\n  else {\n    cnt++;\n    count(s \/ 10);\n  }\n}\nint main() {\n  while (scanf(\"%d %d\", &a, &b)) {\n    cnt = 1;\n    ans = count(a + b);\n    printf(\"%d\\n\", ans);\n  }\n  return 0;\n}","changed_src":"#include <cstdio>\nusing namespace std;\nint a, b;\nint cnt, ans;\nint count(int s) {\n  if (s \/ 10 == 0)\n    return cnt;\n  else {\n    cnt++;\n    count(s \/ 10);\n  }\n}\nint main() {\n  while (scanf(\"%d %d\", &a, &b) != EOF) {\n    cnt = 1;\n    ans = count(a + b);\n    printf(\"%d\\n\", ans);\n  }\n  return 0;\n}","change":"replace","i1":13,"i2":14,"j1":13,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cmath>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  while (true) {\n    long int a, b;\n    cin >> a >> b;\n    long int c = a + b;\n    double r = log10(c) + 1;\n    long int s = r;\n    cout << s << endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  long int a, b, c, s;\n  double r;\n  while (cin >> a >> b) {\n    c = a + b;\n    r = log10(c) + 1;\n    s = r;\n    cout << s << endl;\n  }\n  return 0;\n}","change":"replace","i1":6,"i2":12,"j1":6,"j2":12,"error":"TLE","stderr":""}
-{"problem_id":"p00002","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\n\nint main() {\n  int a;\n  int b;\n  while (scanf(\"%d %d\", &a, &b)) {\n    int result = a + b;\n    int digit = 0;\n    while (result != 0) {\n      digit++;\n      result \/= 10;\n    }\n\n    printf(\"%d\\n\", digit);\n  }\n}","changed_src":"#include <stdio.h>\n\nint main() {\n  int a;\n  int b;\n  while (scanf(\"%d %d\", &a, &b) != EOF) {\n    int result = a + b;\n    int digit = 0;\n    while (result != 0) {\n      digit++;\n      result \/= 10;\n    }\n\n    printf(\"%d\\n\", digit);\n  }\n}","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p00003","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\n#define ALL(co) co.begin(), co.end()\n\ntypedef long long LL;\ntypedef pair<int, int> P;\ntypedef pair<P, P> PP;\ntypedef vector<int> Array;\ntypedef vector<int> LArray;\n\nconst int INF = 1 << 29;\nconst LL LINF = 1LL << 60;\n\nint itiv;\ninline int getInt() { return (cin >> itiv, itiv); }\nvoid readAll(Array &vec, int n) {\n  for (int i = 0; i < n; i++)\n    cin >> vec[i];\n}\ninline bool between(int first, int last, int n) {\n  return first <= n && n <= last;\n}\ninline bool inRange(int begin, int end, int n) { return begin <= n && n < end; }\ninline bool inRange(int size, int n) { return 0 <= n && n < size; }\n\nint m, n;\nint dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};\nint dr[] = {0, -1, 0, 1}, dc[] = {-1, 0, 1, 0};\n\nint main(void) {\n  while (cin >> n && n) {\n    for (int i = 0; i < n; i++) {\n      Array arr(3);\n      readAll(arr, n);\n      cout << \"YES\" << endl;\n      \/\/ sort(ALL(arr));\n      \/\/ cout << (arr[2] * arr[2] == arr[0] * arr[0] + arr[1] * arr[1] ? \"YES\" :\n      \/\/ \"NO\") << endl;\n    }\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\n#define ALL(co) co.begin(), co.end()\n\ntypedef long long LL;\ntypedef pair<int, int> P;\ntypedef pair<P, P> PP;\ntypedef vector<int> Array;\ntypedef vector<int> LArray;\n\nconst int INF = 1 << 29;\nconst LL LINF = 1LL << 60;\n\nint itiv;\ninline int getInt() { return (cin >> itiv, itiv); }\nvoid readAll(Array &vec, int n) {\n  for (int i = 0; i < n; i++)\n    cin >> vec[i];\n}\ninline bool between(int first, int last, int n) {\n  return first <= n && n <= last;\n}\ninline bool inRange(int begin, int end, int n) { return begin <= n && n < end; }\ninline bool inRange(int size, int n) { return 0 <= n && n < size; }\n\nint m, n;\nint dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};\nint dr[] = {0, -1, 0, 1}, dc[] = {-1, 0, 1, 0};\n\nint main(void) {\n  while (cin >> n && n) {\n    for (int i = 0; i < n; i++) {\n      vector<int> arr(3);\n      for (int i = 0; i < 3; i++) {\n        cin >> arr[i];\n      }\n      sort(ALL(arr));\n      cout << (arr[2] * arr[2] == arr[0] * arr[0] + arr[1] * arr[1] ? \"YES\"\n                                                                    : \"NO\")\n           << endl;\n    }\n  }\n  return 0;\n}","change":"replace","i1":46,"i2":52,"j1":46,"j2":54,"error":"0","stderr":""}
-{"problem_id":"p00003","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <math.h>\n#include <vector>\n\nusing namespace std;\n\nint maxnum(int f, int s, int t) {\n\n  if (f >= s && f >= t) {\n\n    return 0;\n\n  } else if (s >= f && s >= t) {\n\n    return 1;\n\n  } else {\n\n    return 2;\n  }\n}\n\nbool solve() {\n\n  int n;\n  vector<int[3]> set;\n  bool f;\n\n  cin >> n;\n\n  for (long i = 0; i < n; i++) {\n\n    for (long j = 0; j < 3; j++) {\n\n      cin >> set[i][j];\n    }\n  }\n\n  for (long i = 0; i < n; i++) {\n\n    f = (pow(set[i][0], 2) == (pow(set[i][1], 2) + pow(set[i][2], 2)) ||\n         pow(set[i][1], 2) == (pow(set[i][0], 2) + pow(set[i][2], 2)) ||\n         pow(set[i][2], 2) == (pow(set[i][0], 2) + pow(set[i][1], 2)));\n    f ? cout << \"YES\\n\" : cout << \"NO\\n\";\n  }\n\n  return 0;\n}\n\nint main() { return solve(); }","changed_src":"#include <iostream>\n#include <math.h>\n#include <vector>\n\nusing namespace std;\n\nint maxnum(int f, int s, int t) {\n\n  if (f >= s && f >= t) {\n\n    return 0;\n\n  } else if (s >= f && s >= t) {\n\n    return 1;\n\n  } else {\n\n    return 2;\n  }\n}\n\nbool solve() {\n\n  int n;\n  int set[1000][3];\n  bool f;\n\n  cin >> n;\n\n  for (long i = 0; i < n; i++) {\n\n    for (long j = 0; j < 3; j++) {\n\n      cin >> set[i][j];\n    }\n  }\n\n  for (long i = 0; i < n; i++) {\n\n    f = (pow(set[i][0], 2) == (pow(set[i][1], 2) + pow(set[i][2], 2)) ||\n         pow(set[i][1], 2) == (pow(set[i][0], 2) + pow(set[i][2], 2)) ||\n         pow(set[i][2], 2) == (pow(set[i][0], 2) + pow(set[i][1], 2)));\n    f ? cout << \"YES\\n\" : cout << \"NO\\n\";\n  }\n\n  return 0;\n}\n\nint main() { return solve(); }","change":"replace","i1":25,"i2":26,"j1":25,"j2":26,"error":"-11","stderr":""}
-{"problem_id":"p00003","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)\n#define REP(i, n) for (int i = 0; i < (n); i++)\n#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)\n#define ALL(a) (a).begin(), (a).end()\n\nint main() {\n  int n;\n  cin >> n;\n\n  REP(i, n) {\n    vector<int> v(3);\n    REP(j, 3) { cin >> v[i]; }\n    sort(ALL(v));\n    if (pow(v[0], 2) + pow(v[1], 2) == pow(v[2], 2))\n      cout << \"YES\" << endl;\n    else\n      cout << \"NO\" << endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)\n#define REP(i, n) for (int i = 0; i < (n); i++)\n#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)\n#define ALL(a) (a).begin(), (a).end()\n\nint main() {\n  int n;\n  cin >> n;\n\n  REP(i, n) {\n    vector<int> v(3);\n    REP(j, 3) { cin >> v[j]; }\n    sort(ALL(v));\n    if (pow(v[0], 2) + pow(v[1], 2) == pow(v[2], 2))\n      cout << \"YES\" << endl;\n    else\n      cout << \"NO\" << endl;\n  }\n  return 0;\n}","change":"replace","i1":18,"i2":19,"j1":18,"j2":19,"error":"0","stderr":""}
-{"problem_id":"p00003","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nint main() {\n  int a, b, c, n, i;\n  std::cin >> n;\n  for (i = 0; i = n; i++) {\n    std::cin >> a >> b >> c;\n    if (a * a == b * b + c * c)\n      std::cout << \"YES\" << std::endl;\n    else if (b * b == a * a + c * c)\n      std::cout << \"YES\" << std::endl;\n    else if (c * c == a * a + b * b)\n      std::cout << \"YES\" << std::endl;\n    else\n      std::cout << \"NO\" << std::endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nint main() {\n  int a, b, c, n, i;\n  std::cin >> n;\n  for (i = 0; i < n; i++) {\n    std::cin >> a >> b >> c;\n    if (a * a == b * b + c * c)\n      std::cout << \"YES\" << std::endl;\n    else if (b * b == a * a + c * c)\n      std::cout << \"YES\" << std::endl;\n    else if (c * c == a * a + b * b)\n      std::cout << \"YES\" << std::endl;\n    else\n      std::cout << \"NO\" << std::endl;\n  }\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"TLE","stderr":""}
-{"problem_id":"p00003","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <iterator>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n#define REP(i, m, n) for (int i = m; i < n; i++)\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rp(i, c) rep(i, (int)c.size())\n#define fr(i, c)                                                               \\\n  for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)\n#define mp make_pair\n#define pb push_back\n#define all(c) (c).begin(), (c).end()\n#define rall(u) (u).rbegin(), (u).rend()\n#define dbg(x) cerr << #x << \" = \" << (x) << endl\n#define v_delete(a, b) (a).erase(remove((a).begin(), (a).end(), b), (a).end())\n#define v_unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())\n#define VV(T) vector<vector<T>>\n#define init(a, b) memset((a), (b), sizeof((a)))\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef pair<int, int> pi;\nconst int inf = 1 << 28;\nconst double INF = 1e10, EPS = 1e-9;\n\ntemplate <class T> int SIZE(T a) { return a.size(); }\ntemplate <class T> string IntToString(T num) {\n  string res;\n  stringstream ss;\n  ss << num;\n  return ss.str();\n}\ntemplate <class T> T StringToInt(string str) {\n  T res = 0;\n  for (int i = 0; i < SIZE(str); i++)\n    res = (res * 10 + str[i] - '0');\n  return res;\n}\ntemplate <class T> T gcd(T a, T b) {\n  if (b == 0)\n    return a;\n  return gcd(b, a % b);\n}\ntemplate <class T> T lcm(T a, T b) { return a \/ gcd(a, b) * b; }\n\ntemplate <class T> void input(T &a, int n) {\n  for (int i = 0; i < n; ++i)\n    cin >> a[i];\n}\ntemplate <class T> void input(T *a, int n) {\n  for (int i = 0; i < n; ++i)\n    cin >> a[i];\n}\ntypedef pair<int, int> pii;\n\ninline bool IN(int x, int y, int w, int h) {\n  return 0 <= x && x < w && 0 <= y && y < h;\n}\n\nint main() {\n  int n;\n  while (cin >> n, n) {\n    rep(nn, n) {\n      int l[3];\n      rep(i, 3) { cin >> l[i]; }\n      sort(l, l + 3);\n      if (pow(l[2], 2.0) == pow(l[1], 2.0) + pow(l[0], 2.0)) {\n        cout << \"YES\" << endl;\n      } else {\n        cout << \"NO\" << endl;\n      }\n    }\n  }\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <iterator>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n#define REP(i, m, n) for (int i = m; i < n; i++)\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rp(i, c) rep(i, (int)c.size())\n#define fr(i, c)                                                               \\\n  for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)\n#define mp make_pair\n#define pb push_back\n#define all(c) (c).begin(), (c).end()\n#define rall(u) (u).rbegin(), (u).rend()\n#define dbg(x) cerr << #x << \" = \" << (x) << endl\n#define v_delete(a, b) (a).erase(remove((a).begin(), (a).end(), b), (a).end())\n#define v_unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())\n#define VV(T) vector<vector<T>>\n#define init(a, b) memset((a), (b), sizeof((a)))\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef pair<int, int> pi;\nconst int inf = 1 << 28;\nconst double INF = 1e10, EPS = 1e-9;\n\ntemplate <class T> int SIZE(T a) { return a.size(); }\ntemplate <class T> string IntToString(T num) {\n  string res;\n  stringstream ss;\n  ss << num;\n  return ss.str();\n}\ntemplate <class T> T StringToInt(string str) {\n  T res = 0;\n  for (int i = 0; i < SIZE(str); i++)\n    res = (res * 10 + str[i] - '0');\n  return res;\n}\ntemplate <class T> T gcd(T a, T b) {\n  if (b == 0)\n    return a;\n  return gcd(b, a % b);\n}\ntemplate <class T> T lcm(T a, T b) { return a \/ gcd(a, b) * b; }\n\ntemplate <class T> void input(T &a, int n) {\n  for (int i = 0; i < n; ++i)\n    cin >> a[i];\n}\ntemplate <class T> void input(T *a, int n) {\n  for (int i = 0; i < n; ++i)\n    cin >> a[i];\n}\ntypedef pair<int, int> pii;\n\ninline bool IN(int x, int y, int w, int h) {\n  return 0 <= x && x < w && 0 <= y && y < h;\n}\n\nint main() {\n  int n;\n  cin >> n;\n  rep(nn, n) {\n    int l[3];\n    rep(i, 3) { cin >> l[i]; }\n    sort(l, l + 3);\n    if (pow(l[2], 2.0) == pow(l[1], 2.0) + pow(l[0], 2.0)) {\n      cout << \"YES\" << endl;\n    } else {\n      cout << \"NO\" << endl;\n    }\n  }\n\n  return 0;\n}","change":"replace","i1":79,"i2":89,"j1":79,"j2":88,"error":"TLE","stderr":""}
-{"problem_id":"p00003","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int a[100], b[100], c[100], n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> a[i] >> b[i] >> c[i];\n    a[i] *= a[i];\n    b[i] *= b[i];\n    c[i] *= c[i];\n  }\n  for (int i = 0; i < n; i++) {\n    if (a[i] + b[i] == c[i] || a[i] + c[i] == b[i] || b[i] + c[i] == a[i]) {\n      cout << \"YES\" << endl;\n    } else {\n      cout << \"NO\" << endl;\n    }\n  }\n  return (0);\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int a[10000], b[10000], c[10000], n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> a[i] >> b[i] >> c[i];\n    a[i] *= a[i];\n    b[i] *= b[i];\n    c[i] *= c[i];\n  }\n  for (int i = 0; i < n; i++) {\n    if (a[i] + b[i] == c[i] || a[i] + c[i] == b[i] || b[i] + c[i] == a[i]) {\n      cout << \"YES\" << endl;\n    } else {\n      cout << \"NO\" << endl;\n    }\n  }\n  return (0);\n}\n","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p00003","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\n#define ALL(co) co.begin(), co.end()\n\ntypedef long long LL;\ntypedef pair<int, int> P;\ntypedef pair<P, P> PP;\ntypedef vector<int> Array;\ntypedef vector<int> LArray;\n\nconst int INF = 1 << 29;\nconst LL LINF = 1LL << 60;\n\nint itiv;\ninline int getInt() { return (cin >> itiv, itiv); }\nvoid readAll(Array &vec, int n) {\n  for (int i = 0; i < n; i++)\n    cin >> vec[i];\n}\ninline bool between(int first, int last, int n) {\n  return first <= n && n <= last;\n}\ninline bool inRange(int begin, int end, int n) { return begin <= n && n < end; }\ninline bool inRange(int size, int n) { return 0 <= n && n < size; }\n\nint m, n;\nint dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};\nint dr[] = {0, -1, 0, 1}, dc[] = {-1, 0, 1, 0};\n\nint main(void) {\n  while (cin >> n && n) {\n    for (int i = 0; i < n; i++) {\n      vector<int> arr(3);\n      for (int i = 0; i < n; i++)\n        cin >> arr[i];\n      sort(ALL(arr));\n      cout << (arr[2] * arr[2] == arr[0] * arr[0] + arr[1] * arr[1] ? \"YES\"\n                                                                    : \"NO\")\n           << endl;\n    }\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\n#define ALL(co) co.begin(), co.end()\n\ntypedef long long LL;\ntypedef pair<int, int> P;\ntypedef pair<P, P> PP;\ntypedef vector<int> Array;\ntypedef vector<int> LArray;\n\nconst int INF = 1 << 29;\nconst LL LINF = 1LL << 60;\n\nint itiv;\ninline int getInt() { return (cin >> itiv, itiv); }\nvoid readAll(Array &vec, int n) {\n  for (int i = 0; i < n; i++)\n    cin >> vec[i];\n}\ninline bool between(int first, int last, int n) {\n  return first <= n && n <= last;\n}\ninline bool inRange(int begin, int end, int n) { return begin <= n && n < end; }\ninline bool inRange(int size, int n) { return 0 <= n && n < size; }\n\nint m, n;\nint dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};\nint dr[] = {0, -1, 0, 1}, dc[] = {-1, 0, 1, 0};\n\nint main(void) {\n  while (cin >> n && n) {\n    for (int i = 0; i < n; i++) {\n      vector<int> arr(3);\n      readAll(arr, 3);\n      sort(ALL(arr));\n      cout << (arr[2] * arr[2] == arr[0] * arr[0] + arr[1] * arr[1] ? \"YES\"\n                                                                    : \"NO\")\n           << endl;\n    }\n  }\n  return 0;\n}","change":"replace","i1":47,"i2":49,"j1":47,"j2":48,"error":"0","stderr":""}
-{"problem_id":"p00003","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <queue>\nusing namespace std;\n\nint ary[3][1010];\nint main() {\n  priority_queue<int> que;\n  int N;\n  cin >> N;\n  int a;\n  for (int i = 1; i <= N; i++) {\n    for (int j = 0; j <= 2; j++) {\n      cin >> a;\n      que.push(a);\n    }\n    for (int j = 0; j <= 2; j++) {\n      ary[i][j] = que.top();\n      que.pop();\n    }\n  }\n  for (int i = 1; i <= N; i++) {\n    if (ary[i][0] * ary[i][0] ==\n        ary[i][1] * ary[i][1] + ary[i][2] * ary[i][2]) {\n      cout << \"YES\" << endl;\n    } else {\n      cout << \"NO\" << endl;\n    }\n  }\n  return 0;\n}","changed_src":"#include <iostream>\n#include <queue>\nusing namespace std;\n\nint ary[1010][3];\nint main() {\n  priority_queue<int> que;\n  int N;\n  cin >> N;\n  int a;\n  for (int i = 1; i <= N; i++) {\n    for (int j = 0; j <= 2; j++) {\n      cin >> a;\n      que.push(a);\n    }\n    for (int j = 0; j <= 2; j++) {\n      ary[i][j] = que.top();\n      que.pop();\n    }\n  }\n  for (int i = 1; i <= N; i++) {\n    if (ary[i][0] * ary[i][0] ==\n        ary[i][1] * ary[i][1] + ary[i][2] * ary[i][2]) {\n      cout << \"YES\" << endl;\n    } else {\n      cout << \"NO\" << endl;\n    }\n  }\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p00003","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main() {\n\n  int N = 0, a = 0, b = 0, c = 0, i;\n\n  scanf(\"%d\", &N);\n  for (i = 0; i < N; i++) {\n    scanf(\"%d %d %d\", a, b, c);\n    if (a * a + b * b == c * c) {\n      printf(\"YES\\n\");\n    } else if (a * a + c * c == b * b) {\n      printf(\"YES\\n\");\n    } else if (b * b + c * c == a * a) {\n      printf(\"YES\\n\");\n    } else {\n      printf(\"NO\\n\");\n    }\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint main() {\n\n  int N = 0, a = 0, b = 0, c = 0, i;\n\n  scanf(\"%d\", &N);\n  for (i = 0; i < N; i++) {\n    scanf(\"%d %d %d\", &a, &b, &c);\n\n    if (a * a + b * b == c * c) {\n      printf(\"YES\\n\");\n    } else if (a * a + c * c == b * b) {\n      printf(\"YES\\n\");\n    } else if (b * b + c * c == a * a) {\n      printf(\"YES\\n\");\n    } else {\n      printf(\"NO\\n\");\n    }\n  }\n  return 0;\n}","change":"replace","i1":8,"i2":9,"j1":8,"j2":10,"error":"-11","stderr":""}
-{"problem_id":"p00003","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n  long long n, a, b, c;\n  cin >> n;\n  long long tmp[3];\n  for (int i = 0; i < n; i++) {\n    cin >> a >> b >> c;\n    tmp[0] = a;\n    tmp[1] = b;\n    tmp[2] = c;\n    sort(tmp, tmp + n);\n    if (tmp[0] * tmp[0] + tmp[1] * tmp[1] == tmp[2] * tmp[2]) {\n      cout << \"YES\" << endl;\n    } else {\n      cout << \"NO\" << endl;\n    }\n  }\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n  long long n, a, b, c;\n  cin >> n;\n  long long tmp[3];\n  for (int i = 0; i < n; i++) {\n    cin >> a >> b >> c;\n    tmp[0] = a;\n    tmp[1] = b;\n    tmp[2] = c;\n    sort(tmp, tmp + 3);\n    if (tmp[0] * tmp[0] + tmp[1] * tmp[1] == tmp[2] * tmp[2]) {\n      cout << \"YES\" << endl;\n    } else {\n      cout << \"NO\" << endl;\n    }\n  }\n  return 0;\n}\n","change":"replace","i1":11,"i2":12,"j1":11,"j2":12,"error":"0","stderr":""}
-{"problem_id":"p00003","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int n[200][3];\n  int len = 0, m;\n  cin >> m;\n  while (cin >> n[len][0] >> n[len][1] >> n[len][2]) {\n    n[len][0] *= n[len][0];\n    n[len][1] *= n[len][1];\n    n[len][2] *= n[len][2];\n    len++;\n  }\n  for (int i = 0; i < len; i++) {\n    if (n[i][0] == (n[i][1] + n[i][2]))\n      cout << \"YES\" << endl;\n    else if (n[i][1] == (n[i][2] + n[i][0]))\n      cout << \"YES\" << endl;\n    else if (n[i][2] == (n[i][0] + n[i][1]))\n      cout << \"YES\" << endl;\n    else\n      cout << \"NO\" << endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int n[1000][3];\n  int len = 0, m;\n  cin >> m;\n  while (cin >> n[len][0] >> n[len][1] >> n[len][2]) {\n    n[len][0] *= n[len][0];\n    n[len][1] *= n[len][1];\n    n[len][2] *= n[len][2];\n    len++;\n  }\n  for (int i = 0; i < len; i++) {\n    if (n[i][0] == (n[i][1] + n[i][2]))\n      cout << \"YES\" << endl;\n    else if (n[i][1] == (n[i][2] + n[i][0]))\n      cout << \"YES\" << endl;\n    else if (n[i][2] == (n[i][0] + n[i][1]))\n      cout << \"YES\" << endl;\n    else\n      cout << \"NO\" << endl;\n  }\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"0","stderr":""}
-{"problem_id":"p00003","language":"Python","original_status":"Runtime Error","original_src":"import sys\n\ninput()\nfor e in sys.stdin:\n    a, b, c = sorted(int(e.split()))\n    if a**2 + b**2 == c**2:\n        print(\"YES\")\n    else:\n        print(\"NO\")\n","changed_src":"import sys\n\ninput()\nfor e in sys.stdin:\n    a, b, c = sorted(map(int, e.split()))\n    if a**2 + b**2 == c**2:\n        print(\"YES\")\n    else:\n        print(\"NO\")\n","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"TypeError: int() argument must be a string, a bytes-like object or a real number, not 'list'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p00003\/Python\/s173702518.py\", line 4, in <module>\n    a, b, c = sorted(int(e.split()))\nTypeError: int() argument must be a string, a bytes-like object or a real number, not 'list'\n"}
-{"problem_id":"p00003","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <stdio.h>\nusing namespace std;\n\nint triangle(int a, int b, int c) {\n  a = a * a;\n  b = b * b;\n  c = c * c;\n\n  if (a == (b + c))\n    return 0;\n  else if (b == (a + c))\n    return 0;\n  else if (c == (a + b))\n    return 0;\n  else\n    return 1;\n}\n\nint main() {\n  int n;\n  int a, b, c;\n  int i = 0;\n\n  scanf(\"%d\", &n);\n\n  while (i < n) {\n    scanf(\"%d %d %d\", &a, &b, &c);\n\n    if (triangle(a, b, c) == 0) {\n      cout << \"YES\\n\";\n    } else {\n      cout << \"NO\\n\";\n    }\n  }\n  return 0;\n}","changed_src":"#include <iostream>\n#include <stdio.h>\nusing namespace std;\n\nint triangle(int a, int b, int c) {\n  a = a * a;\n  b = b * b;\n  c = c * c;\n\n  if (a == (b + c))\n    return 0;\n  else if (b == (a + c))\n    return 0;\n  else if (c == (a + b))\n    return 0;\n  else\n    return 1;\n}\n\nint main() {\n  int n;\n  int a, b, c;\n  int i = 0;\n\n  scanf(\"%d\", &n);\n\n  while (i < n) {\n    scanf(\"%d %d %d\", &a, &b, &c);\n\n    if (triangle(a, b, c) == 0) {\n      cout << \"YES\\n\";\n    } else {\n      cout << \"NO\\n\";\n    }\n    i++;\n  }\n  return 0;\n}","change":"insert","i1":34,"i2":34,"j1":34,"j2":35,"error":"TLE","stderr":""}
-{"problem_id":"p00003","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nint main() {\n  int n;\n  while (cin >> n) {\n    vector<string> ans;\n    for (int i = 0; i < n; ++i) {\n      int x, y, z;\n      cin >> x >> y >> z;\n      if (x < y + z && y < z + x && z < x + y) {\n        if (x * x == y * y + z * z || y * y == z * z + x * x ||\n            z * z == x * x + y * y) {\n          ans.push_back(\"YES\");\n        }\n      } else {\n        ans.push_back(\"NO\");\n      }\n    }\n    for (int i = 0; i < n; ++i) {\n      cout << ans[i] << endl;\n    }\n  }\n  return 0;\n}","changed_src":"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nint main() {\n  int n;\n  while (cin >> n) {\n    vector<string> ans;\n    for (int i = 0; i < n; ++i) {\n      int x, y, z;\n      cin >> x >> y >> z;\n      if (x * x == y * y + z * z || y * y == z * z + x * x ||\n          z * z == x * x + y * y) {\n        ans.push_back(\"YES\");\n      } else {\n        ans.push_back(\"NO\");\n      }\n    }\n    for (int i = 0; i < n; ++i) {\n      cout << ans[i] << endl;\n    }\n  }\n  return 0;\n}","change":"replace","i1":11,"i2":16,"j1":11,"j2":14,"error":"-11","stderr":""}
-{"problem_id":"p00003","language":"Python","original_status":"Runtime Error","original_src":"while True:\n    try:\n        input_line = input()\n        if input_line == \"\":\n            break\n        else:\n            nums = list(map(int, input_line.split()))\n            max_num = max(nums)\n            nums.remove(max_num)\n            if max_num**2 == nums[0] ** 2 + nums[1] ** 2:\n                print(\"YES\")\n            else:\n                print(\"NO\")\n    except EOFError:\n        break\n","changed_src":"n = int(input())\nfor i in range(0, n):\n    nums = list(map(int, input().split()))\n    max_num = max(nums)\n    nums.remove(max_num)\n    if max_num**2 == nums[0] ** 2 + nums[1] ** 2:\n        print(\"YES\")\n    else:\n        print(\"NO\")\n","change":"replace","i1":0,"i2":15,"j1":0,"j2":9,"error":"IndexError: list index out of range","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p00003\/Python\/s398056618.py\", line 10, in <module>\n    if max_num**2 == nums[0]**2 + nums[1]**2:\nIndexError: list index out of range\n"}
-{"problem_id":"p00003","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n\n  int n;\n\n  cin >> n;\n\n  vector<int> v(3);\n\n  for (int i = 0; i < n; ++i) {\n    for (int j = 0; i < 3; ++j) {\n      cin >> v[j];\n    }\n    sort(v.begin(), v.end());\n    if (v[0] * v[0] + v[1] * v[1] == v[2] * v[2])\n      cout << \"YES\" << endl;\n    else\n      cout << \"NO\" << endl;\n  }\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n\n  int n;\n\n  cin >> n;\n\n  vector<int> v(3);\n\n  for (int i = 0; i < n; ++i) {\n    cin >> v[0] >> v[1] >> v[2];\n\n    sort(v.begin(), v.end());\n    if (v[0] * v[0] + v[1] * v[1] == v[2] * v[2])\n      cout << \"YES\" << endl;\n    else\n      cout << \"NO\" << endl;\n  }\n}\n","change":"replace","i1":12,"i2":15,"j1":12,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p00004","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nconst double EPS = 1e-8;\ntypedef vector<double> Vec;\ntypedef vector<Vec> Mat;\n\nvoid show(const Mat &m) {\n  puts(\"====\");\n  for (int i = 0; i < m.size(); i++) {\n    for (int j = 0; j < m[i].size(); j++) {\n      printf(\"%f \", m[i][j]);\n    }\n    puts(\"\");\n  }\n  puts(\"====\");\n}\n\nVec gauss_jordan(const Mat &A, const Vec &b) {\n  int n = A.size();\n  Mat B(n, Vec(n + 1));\n\n  for (int i = 0; i < n; i++) {\n    for (int j = 0; j < n; j++) {\n      B[i][j] = A[i][j];\n    }\n    B[i][n] = b[i];\n  }\n\n  for (int i = 0; i < n; i++) {\n    int pivot = i;\n    for (int j = i; j < n; j++) {\n      if (abs(B[j][i]) > abs(B[pivot][i])) {\n        pivot = j;\n      }\n    }\n    swap(B[i], B[pivot]);\n\n    if (abs(B[i][i]) < EPS)\n      return Vec();\n\n    for (int j = i + 1; j <= n; j++) {\n      B[i][j] \/= B[i][i];\n    }\n    for (int j = 0; j < n; j++) {\n      if (i != j) {\n        for (int k = i + 1; k <= n; k++) {\n          B[j][k] -= B[j][i] * B[i][k];\n        }\n      }\n    }\n\n    \/\/ show(B);\n  }\n\n  Vec x(n);\n  for (int i = 0; i < n; i++) {\n    x[i] = B[i][n];\n  }\n\n  return x;\n}\n\nint main() {\n  while (true) {\n    Mat A(2, Vec(2));\n    Vec b(2);\n\n    for (int i = 0; i < 2; i++) {\n      for (int j = 0; j < 2; j++) {\n        scanf(\"%lf\", &A[i][j]);\n      }\n      scanf(\"%lf\", &b[i]);\n    }\n\n    Vec res = gauss_jordan(A, b);\n    printf(\"%.3f %.3f\\n\", res[0], res[1]);\n  }\n\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nconst double EPS = 1e-8;\ntypedef vector<double> Vec;\ntypedef vector<Vec> Mat;\n\nvoid show(const Mat &m) {\n  puts(\"====\");\n  for (int i = 0; i < m.size(); i++) {\n    for (int j = 0; j < m[i].size(); j++) {\n      printf(\"%f \", m[i][j]);\n    }\n    puts(\"\");\n  }\n  puts(\"====\");\n}\n\nVec gauss_jordan(const Mat &A, const Vec &b) {\n  int n = A.size();\n  Mat B(n, Vec(n + 1));\n\n  for (int i = 0; i < n; i++) {\n    for (int j = 0; j < n; j++) {\n      B[i][j] = A[i][j];\n    }\n    B[i][n] = b[i];\n  }\n\n  for (int i = 0; i < n; i++) {\n    int pivot = i;\n    for (int j = i; j < n; j++) {\n      if (abs(B[j][i]) > abs(B[pivot][i])) {\n        pivot = j;\n      }\n    }\n    swap(B[i], B[pivot]);\n\n    if (abs(B[i][i]) < EPS)\n      return Vec();\n\n    for (int j = i + 1; j <= n; j++) {\n      B[i][j] \/= B[i][i];\n    }\n    for (int j = 0; j < n; j++) {\n      if (i != j) {\n        for (int k = i + 1; k <= n; k++) {\n          B[j][k] -= B[j][i] * B[i][k];\n        }\n      }\n    }\n\n    \/\/ show(B);\n  }\n\n  Vec x(n);\n  for (int i = 0; i < n; i++) {\n    x[i] = B[i][n];\n  }\n\n  return x;\n}\n\nint main() {\n  while (true) {\n    Mat A(2, Vec(2));\n    Vec b(2);\n\n    for (int i = 0; i < 2; i++) {\n      for (int j = 0; j < 2; j++) {\n        if (scanf(\"%lf\", &A[i][j]) == EOF)\n          return 0;\n      }\n      scanf(\"%lf\", &b[i]);\n    }\n\n    Vec res = gauss_jordan(A, b);\n    printf(\"%.3f %.3f\\n\", res[0], res[1]);\n  }\n\n  return 0;\n}","change":"replace","i1":70,"i2":71,"j1":70,"j2":72,"error":"-11","stderr":""}
-{"problem_id":"p00004","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\n\nusing namespace std;\n\nint main() {\n  double a, b, c, d, e, f;\n  while (scanf(\"%lf %lf %lf %lf %lf %lf\", &a, &b, &c, &d, &e, &f)) {\n    printf(\"%.3f %.3f\\n\", (c * e - b * f) \/ (a * e - b * d),\n           (c * d - a * f) \/ (b * d - a * e));\n  }\n\n  return 0;\n}","changed_src":"#include <cstdio>\n\nusing namespace std;\n\nint main() {\n  double a, b, c, d, e, f;\n  while (scanf(\"%lf %lf %lf %lf %lf %lf\", &a, &b, &c, &d, &e, &f) != -1) {\n    double x = (c * e - b * f) \/ (a * e - b * d);\n    double y = (c * d - a * f) \/ (b * d - a * e);\n    if (x == -0)\n      x = 0;\n    if (y == -0)\n      y = 0;\n    printf(\"%.3f %.3f\\n\", x, y);\n  }\n\n  return 0;\n}","change":"replace","i1":6,"i2":9,"j1":6,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p00004","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main(void) {\n  while (scanf(\"\") != EOF) {\n    float equ[2][3];\n    for (int i = 0; i < 2; i++)\n      for (int j = 0; j < 3; j++)\n        cin >> equ[i][j];\n    float delta = -equ[0][0] * equ[1][1] + equ[0][1]\n\n                                               * equ[1][0];\n    float y = (-equ[0][0] * equ[1][2] + equ[0][2] * equ\n\n                                                        [1][0]) \/\n              delta;\n    float x = (equ[0][2] - equ[0][1] * y) \/ equ[0][0];\n    printf(\"%.3f %.3f\\n\", x, y);\n  }\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main(void) {\n  float a, b, c, d, e, f;\n  while (cin >> a >> b >> c >> d >> e >> f) {\n    float delta = -a * e + b * d;\n    float y = (-a * f + c * d) \/ delta;\n    float x = (c - b * y) \/ a;\n    printf(\"%.3f %.3f\\n\", x, y);\n  }\n}","change":"replace","i1":4,"i2":17,"j1":4,"j2":9,"error":"TLE","stderr":""}
-{"problem_id":"p00004","language":"C++","original_status":"Time Limit Exceeded","original_src":"\/*************************************************************************\n        > File Name: 23.cpp\n        > Author: ralph\n        > Mail: 1694487365@qq.com\n        > Created Time: 2018\u5e7412\u670821\u65e5 \u661f\u671f\u4e94 21\u65f632\u520648\u79d2\n ************************************************************************\/\n\n#include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n  double a, b, c, d, e, f;\n  while (scanf(\"%lf%lf%lf%lf%lf%lf\", &a, &b, &c, &d, &e, &f)) {\n    printf(\"%.3f %.3f\\n\",\n           (c * e - b * f) \/ (a * e - b * d) == 0\n               ? 0.000\n               : (c * e - b * f) \/ (a * e - b * d),\n           (a * f - c * d) \/ (a * e - b * d) == 0\n               ? 0.000\n               : (a * f - c * d) \/ (a * e - b * d));\n  }\n}\n","changed_src":"\/*************************************************************************\n        > File Name: 23.cpp\n        > Author: ralph\n        > Mail: 1694487365@qq.com\n        > Created Time: 2018\u5e7412\u670821\u65e5 \u661f\u671f\u4e94 21\u65f632\u520648\u79d2\n ************************************************************************\/\n\n#include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n  double a, b, c, d, e, f;\n  while (scanf(\"%lf%lf%lf%lf%lf%lf\", &a, &b, &c, &d, &e, &f) != EOF) {\n    double ans1 = (c * e - b * f) \/ (a * e - b * d),\n           ans2 = (a * f - c * d) \/ (a * e - b * d);\n    printf(\"%.3f %.3f\\n\", ans1 == 0 ? 0 : ans1, ans2 == 0 ? 0 : ans2);\n  }\n}\n","change":"replace","i1":11,"i2":19,"j1":11,"j2":15,"error":"TLE","stderr":""}
-{"problem_id":"p00004","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\n\nint main() {\n  while (1) {\n    float a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, x = 0, y = 0;\n    scanf(\"%f %f %f %f %f %f\", &a, &b, &c, &d, &e, &f);\n    y = (c * d - f * a) \/ (b * d - e * a);\n    x = (c - b * y) \/ a;\n    printf(\"%.3f %.3f\\n\", x, y);\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint main() {\n  float a, b, c, d, e, f, x, y;\n\n  while (scanf(\"%f %f %f %f %f %f\", &a, &b, &c, &d, &e, &f) != EOF) {\n    y = (c * d - f * a) \/ (b * d - e * a);\n    x = (c - b * y) \/ a;\n    printf(\"%.3f %.3f\\n\", x, y);\n  }\n  return 0;\n}","change":"replace","i1":3,"i2":6,"j1":3,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p00004","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <stdio.h>\nusing namespace std;\nint main() {\n  double a, b, c, d, e, f, x, y;\n  while (scanf(\"%lf %lf %lf %lf %lf %lf\", &a, &b, &c, &d, &e, &f)) {\n    y = (c * d - f * a) \/ (b * d - a * e);\n    x = (c - b * y) \/ a;\n    printf(\"%.3f %.3f\\n\", x, y);\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <stdio.h>\nusing namespace std;\nint main() {\n  double a, b, c, d, e, f, x, y;\n  while (scanf(\"%lf %lf %lf %lf %lf %lf\", &a, &b, &c, &d, &e, &f) != EOF) {\n    y = (c * d - f * a) \/ (b * d - a * e);\n    x = (c - b * y) \/ a;\n    printf(\"%.3f %.3f\\n\", x, y);\n  }\n  return 0;\n}","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p00004","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n#include <stdio.h>\n\nusing namespace std;\n\ndouble a, b, c, d, e, f;\ndouble x, y;\n\nint main() {\n  while (1) {\n    cin >> a >> b >> c >> d >> e >> f;\n    y = (c - f * a \/ d) \/ (b - e * a \/ d);\n    x = -b \/ a * y + c \/ a;\n    printf(\"%.3lf %.3lf\\n\", x, y);\n  }\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <stdio.h>\n\nusing namespace std;\n\ndouble a, b, c, d, e, f;\ndouble x, y;\n\nint main() {\n  while (cin >> a >> b >> c >> d >> e >> f) {\n    double det = a * e - b * d;\n    x = (c * e - b * f) \/ det;\n    y = (a * f - c * d) \/ det;\n    if (x == -0)\n      x = 0;\n    if (y == -0)\n      y = 0;\n    printf(\"%.3f %.3f\\n\", x, y);\n  }\n}","change":"replace","i1":10,"i2":15,"j1":10,"j2":19,"error":"TLE","stderr":""}
-{"problem_id":"p00004","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\nint main() {\n  double a, b, c, d, e, f, x, y;\n  while (scanf(\"%lf%lf%lf%lf%lf%lf\", &a, &b, &c, &d, &e, &f)) {\n    x = ((c * e - f * b) \/ (a * e - d * b));\n    y = ((c - a * x) \/ b);\n    if (x > 0)\n      x += 0.0005;\n    else\n      x -= 0.0005;\n    if (y > 0)\n      x += 0.0005;\n    else\n      y = -0.0005;\n    printf(\"%.3ld %.3ld\", x, y);\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main() {\n  double a, b, c, d, e, f;\n  while (scanf(\"%lf%lf%lf%lf%lf%lf\", &a, &b, &c, &d, &e, &f) != -1) {\n    printf(\"%.3lf %.3lf\\n\",\n           (c * e - f * b) == 0 ? 0 : (c * e - f * b) \/ (a * e - d * b),\n           (c * d - a * f) == 0 ? 0 : (c * d - a * f) \/ (b * d - a * e));\n  }\n  return 0;\n}","change":"replace","i1":2,"i2":15,"j1":2,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p00004","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nint main() {\n  for (float a, b, c, d, e, f, x, y, g, h;\n       std::cin.eof() || (std::cin >> a >> b >> c >> d >> e >> f, 1);\n       printf(\"%.3f %.3f\\n\", x, y))\n    g = b * d - a * e, h = c * d - a * f,\n    d * g ? (x = f \/ d - e * h \/ g \/ d,\n             y = b ? c \/ b - a * x \/ b : f \/ e - d * x \/ e)\n          : (y = h \/ g, x = a ? c \/ a - b * y \/ a : f \/ d - e * y \/ d);\n}","changed_src":"#include <iostream>\nint main() {\n  for (float a, b, c, d, e, f, x, y, g, h;; printf(\"%.3f %.3f\\n\", x, y)) {\n    std::cin >> a >> b >> c >> d >> e >> f;\n    if (std::cin.eof())\n      break;\n    g = b * d - a * e;\n    h = c * d - a * f;\n    d *g ? (x = f \/ d - e * h \/ g \/ d,\n            y = b ? c \/ b - a * x \/ b : f \/ e - d * x \/ e)\n         : (y = h \/ g, x = a ? c \/ a - b * y \/ a : f \/ d - e * y \/ d);\n  }\n}","change":"replace","i1":2,"i2":9,"j1":2,"j2":12,"error":"TLE","stderr":""}
-{"problem_id":"p00004","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iomanip>\n#include <iostream>\n\ndouble halfadjust(double x) {\n  int tmp = (x * 10000);\n  tmp = tmp % 10;\n  double ans = static_cast<double>(static_cast<int>(x * 1000));\n  ans = ans \/ 1000;\n  if (tmp >= 5)\n    ans += 0.001;\n  if (tmp <= -5)\n    ans -= 0.001;\n  return ans;\n}\n\ndouble a, b, c, d, e, f;\n\nvoid solve() {\n  using namespace std;\n  double x = (c * e - b * f) \/ (a * e - b * d);\n  double y = (c * d - a * f) \/ (b * d - a * e);\n  cout << setprecision(3) << fixed << halfadjust(x) << ' ';\n  cout << halfadjust(y) << endl;\n  cout << setprecision(6);\n}\n\nint main() {\n  while (true) {\n    std::cin >> a >> b >> c >> d >> e >> f;\n    if (!a && !b && !c && !d && !e && !f)\n      break;\n    solve();\n  }\n  return 0;\n}","changed_src":"#include <iomanip>\n#include <iostream>\n\ndouble halfadjust(double x) {\n  int tmp = (x * 10000);\n  tmp = tmp % 10;\n  double ans = static_cast<double>(static_cast<int>(x * 1000));\n  ans = ans \/ 1000;\n  if (tmp >= 5)\n    ans += 0.001;\n  if (tmp <= -5)\n    ans -= 0.001;\n  return ans;\n}\n\ndouble a, b, c, d, e, f;\n\nvoid solve() {\n  using namespace std;\n  double x = (c * e - b * f) \/ (a * e - b * d);\n  double y = (c * d - a * f) \/ (b * d - a * e);\n  cout << setprecision(3) << fixed << halfadjust(x) << ' ';\n  cout << halfadjust(y) << endl;\n  cout << setprecision(6);\n}\n\nint main() {\n  using std::cin;\n  while (cin >> a && cin >> b && cin >> c && cin >> d && cin >> e && cin >> f) {\n    solve();\n  }\n  return 0;\n}","change":"replace","i1":27,"i2":31,"j1":27,"j2":29,"error":"TLE","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main() {\n  string str;\n  cin >> str;\n  int i = 0, j = str.size() - 1;\n  while (i < j) {\n    char tmp;\n    tmp = str[i];\n    str[i] = str[j];\n    str[j] = tmp;\n  }\n  cout << str << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main() {\n  string str;\n  cin >> str;\n  int i = 0, j = str.size() - 1;\n  while (i < j) {\n    char tmp;\n    tmp = str[i];\n    str[i] = str[j];\n    str[j] = tmp;\n    ++i;\n    --j;\n  }\n  cout << str << endl;\n  return 0;\n}","change":"insert","i1":14,"i2":14,"j1":14,"j2":16,"error":"TLE","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cmath>\n#include <cstdint>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <set>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\n\nconstexpr int INF = 1000000000; \/* 1e+9a *\/\nconstexpr int MODULO = 1000000007;\n\n#define int long\n\n#define REP(i, f, n) for (int i = (f); i < (n); ++i)\n#define PER(i, f, n) for (int i = (n - 1); i >= f; --i)\n\nconstexpr int evx[4] = {1, 0, -1, 0};\nconstexpr int evy[4] = {0, 1, 0, -1};\n\n\/\/----------------------------------\n\/\/----------------------------------\n\nsigned main() {\n  ios::sync_with_stdio(false);\n  string s;\n  cin >> s;\n  PER(i, s.size(), 0)\n  cout << s[i];\n  cout << endl;\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <cstdint>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <set>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\n\nconstexpr int INF = 1000000000; \/* 1e+9a *\/\nconstexpr int MODULO = 1000000007;\n\n#define int long\n\n#define REP(i, f, n) for (int i = (f); i < (n); ++i)\n#define PER(i, f, n) for (int i = (n - 1); i >= f; --i)\n\nconstexpr int evx[4] = {1, 0, -1, 0};\nconstexpr int evy[4] = {0, 1, 0, -1};\n\n\/\/----------------------------------\n\/\/----------------------------------\n\nsigned main() {\n  ios::sync_with_stdio(false);\n  string s;\n  cin >> s;\n  PER(i, 0, s.size())\n  cout << s[i];\n  cout << endl;\n}","change":"replace","i1":32,"i2":33,"j1":32,"j2":33,"error":"-11","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  char str[20];\n  int i, j;\n  scanf(\"%s\", str);\n\n  for (i = 0; str[i] != '\\0'; i++) {\n  }\n\n  for (j = i - 1; j > -1; j--) {\n    printf(\"%c\", str[j]);\n  }\n\n  puts(\"\");\n\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main() {\n  char str[21];\n  int i, j;\n  scanf(\"%s\", str);\n\n  for (i = 0; str[i] != '\\0'; i++) {\n  }\n\n  for (j = i - 1; j > -1; j--) {\n    printf(\"%c\", str[j]);\n  }\n\n  puts(\"\");\n\n  return 0;\n}","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main() {\n  string str;\n  cin >> str;\n\n  for (int i = str.size() - 1; i >= 0; i++) {\n    cout << str[i];\n  }\n  cout << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main() {\n  string str;\n  cin >> str;\n\n  for (int i = str.size() - 1; i >= 0; i--) {\n    cout << str[i];\n  }\n  cout << endl;\n  return 0;\n}","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"-11","stderr":""}
-{"problem_id":"p00006","language":"Python","original_status":"Runtime Error","original_src":"print(input[::-1])\n","changed_src":"print(input()[::-1])\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: 'builtin_function_or_method' object is not subscriptable","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p00006\/Python\/s441661847.py\", line 1, in <module>\n    print(input[::-1])\nTypeError: 'builtin_function_or_method' object is not subscriptable\n"}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n#include <string.h>\n\nint main(void) {\n  char str[20];\n  scanf(\"%s\", str);\n  for (int i = strlen(str) - 1; i > 0; i--)\n    printf(\"%s\", str[i - 1]);\n  printf(\"\\n\");\n  return 0;\n}","changed_src":"#include <stdio.h>\n#include <string.h>\n\nint main(void) {\n  char str[20];\n  scanf(\"%s\", str);\n  for (int i = strlen(str) - 1; i >= 0; i--) {\n    printf(\"%c\", str[i]);\n  }\n  printf(\"\\n\");\n  return 0;\n}","change":"replace","i1":6,"i2":8,"j1":6,"j2":9,"error":"-11","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  string str;\n  cin >> str;\n  for (size_t i = str.size() - 1; i >= 0; --i) {\n    cout << str[i];\n  }\n  cout << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  string str;\n  cin >> str;\n  for (size_t i = str.size() - 1; i >= 0; --i) {\n    if (i == -1)\n      break;\n    cout << str[i];\n  }\n  cout << endl;\n  return 0;\n}","change":"insert","i1":8,"i2":8,"j1":8,"j2":10,"error":"-11","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <math.h>\n#include <string>\n#include <vector>\n\nint main(void);\nstd::string rev_string(std::string str);\n\nint main() {\n  std::string str = \"\";\n  \/\/ char str[20];\n  std::cin >> str;\n  std::cout << rev_string(str) << std::endl;\n\n  while (1)\n    ;\n  return 0;\n}\n\n\/\/*\nstd::string rev_string(std::string str) {\n  int i;\n  int len = str.length();\n  for (i = 0; i < len \/ 2; i++) {\n    char temp = str[i];\n    str[i] = str[len - i - 1];\n    str[len - i - 1] = temp;\n  }\n\n  return str;\n}\n\/\/*\/\n","changed_src":"#include <iostream>\n#include <math.h>\n#include <string>\n#include <vector>\n\nint main(void);\nstd::string rev_string(std::string str);\n\nint main() {\n  std::string str = \"\";\n  \/\/ char str[20];\n  std::cin >> str;\n  std::cout << rev_string(str) << std::endl;\n\n  \/\/ while (1);\n  return 0;\n}\n\n\/\/*\nstd::string rev_string(std::string str) {\n  int i;\n  int len = str.length();\n  for (i = 0; i < len \/ 2; i++) {\n    char temp = str[i];\n    str[i] = str[len - i - 1];\n    str[len - i - 1] = temp;\n  }\n\n  return str;\n}\n\/\/*\/\n","change":"replace","i1":14,"i2":16,"j1":14,"j2":15,"error":"TLE","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <cstring>\n#include <iostream>\nusing namespace std;\nint main() {\n  char in[20], out[20];\n  cin >> in;\n  int len = strlen(in);\n  for (int i = 0; i < len; i++) {\n    out[len - i - 1] = in[i];\n  }\n  out[len] = 0;\n  cout << out << endl;\n  return 0;\n}","changed_src":"#include <cstring>\n#include <iostream>\nusing namespace std;\nint main() {\n  char in[21], out[21];\n  cin >> in;\n  int len = strlen(in);\n  for (int i = 0; i < len; i++) {\n    out[len - i - 1] = in[i];\n  }\n  out[len] = 0;\n  cout << out << endl;\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <bitset>\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <iterator>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <time.h>\n#include <vector>\nusing namespace std;\n#define FOR(I, F, N) for (int I = F; I < (int)(N); I++)\n#define rep(i, n) FOR(i, 0, n)\n#define FIN(V) cout << V << endl\n#define pb push_back\n#define INF (1 << 30)\ntypedef pair<int, int> P;\ntypedef long long ll;\ntypedef priority_queue<int> pq;\nint StrToInt(string);\nstring IntToStr(int);\nint dx[4] = {1, -1, 0, 0};\nint dy[4] = {0, 0, 1, -1};\n\nint main(void) {\n  string S;\n  cin >> S;\n  for (int i = S.size();; i--)\n    cout << S[i];\n  cout << endl;\n\n  return 0;\n}\n\nint StrToInt(string s) {\n  stringstream ss;\n  ss << s;\n  int val;\n  ss >> val;\n  return val;\n}\nstring IntToStr(int i) {\n  stringstream ss;\n  ss << i;\n  return ss.str();\n}","changed_src":"#include <algorithm>\n#include <bitset>\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <iterator>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <time.h>\n#include <vector>\nusing namespace std;\n#define FOR(I, F, N) for (int I = F; I < (int)(N); I++)\n#define rep(i, n) FOR(i, 0, n)\n#define FIN(V) cout << V << endl\n#define pb push_back\n#define INF (1 << 30)\ntypedef pair<int, int> P;\ntypedef long long ll;\ntypedef priority_queue<int> pq;\nint StrToInt(string);\nstring IntToStr(int);\nint dx[4] = {1, -1, 0, 0};\nint dy[4] = {0, 0, 1, -1};\n\nint main(void) {\n  string S;\n  cin >> S;\n  for (int i = S.size(); i--;)\n    cout << S[i];\n  cout << endl;\n\n  return 0;\n}\n\nint StrToInt(string s) {\n  stringstream ss;\n  ss << s;\n  int val;\n  ss >> val;\n  return val;\n}\nstring IntToStr(int i) {\n  stringstream ss;\n  ss << i;\n  return ss.str();\n}","change":"replace","i1":31,"i2":32,"j1":31,"j2":32,"error":"-11","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <cstdio>\n#include <cstring>\nusing namespace std;\nint main() {\n  char str[20];\n  scanf(\"%s\", str);\n  int len = strlen(str);\n  for (int i = len - 1; i >= 0; i--) {\n    printf(\"%c\", str[i]);\n  }\n  printf(\"\\n\");\n  return 0;\n}\n","changed_src":"#include <cstdio>\n#include <cstring>\nusing namespace std;\nint main() {\n  char str[21];\n  scanf(\"%s\", str);\n  int len = strlen(str);\n  for (int i = len - 1; i >= 0; i--) {\n    printf(\"%c\", str[i]);\n  }\n  printf(\"\\n\");\n  return 0;\n}\n","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\n\nint main(void) {\n  string str;\n  cin >> str;\n  int l = str.size();\n  for (int i = l; i >= 0; i++) {\n    cout << str[i];\n  }\n  cout << endl;\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main(void) {\n  string str;\n  cin >> str;\n  int l = str.size();\n  for (int i = l; i > 0; i--) {\n    cout << str[i - 1];\n  }\n  cout << endl;\n  return 0;\n}","change":"replace","i1":7,"i2":9,"j1":7,"j2":9,"error":"-11","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <string.h>\nusing namespace std;\nint main() {\n  string x;\n  int i;\n  cin >> x;\n  for (i = x.size();; i--) {\n    cout << x[i];\n  }\n  cout << endl;\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <string.h>\nusing namespace std;\nint main() {\n  string x;\n  int i;\n  cin >> x;\n  for (i = x.size(); i--;) {\n    cout << x[i];\n  }\n  cout << endl;\n  return 0;\n}","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"-11","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  string str;\n  cin >> str;\n  int n = str.size();\n  for (int i = n - 1; i >= 0; i++) {\n    cout << str[i];\n  }\n  cout << endl;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  string str;\n  cin >> str;\n  int n = str.size();\n  for (int i = n - 1; i >= 0; i--) {\n    cout << str[i];\n  }\n  cout << endl;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"-11","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n#include <string.h>\n\nint main(void) {\n  char str[20], reversed_str[20];\n  scanf(\"%s\", str);\n  int len = strlen(str);\n\n  int i;\n  for (i = 0; i < len; ++i) {\n    reversed_str[i] = str[len - 1 - i];\n  }\n  reversed_str[len] = '\\0';\n\n  printf(\"%s\\n\", reversed_str);\n\n  return 0;\n}","changed_src":"#include <stdio.h>\n#include <string.h>\n\nint main(void) {\n  char str[21], reversed_str[21];\n  scanf(\"%s\", str);\n  int len = strlen(str);\n\n  int i;\n  for (i = 0; i < len; ++i) {\n    reversed_str[i] = str[len - 1 - i];\n  }\n  reversed_str[len] = '\\0';\n\n  printf(\"%s\\n\", reversed_str);\n\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <string>\nusing namespace std;\nstring s;\nint main() {\n  cin >> s;\n  for (unsigned i = s.size() - 1; i >= 0; i--)\n    cout << s[i];\n  return 0;\n}","changed_src":"#include <iostream>\n#include <string>\nusing namespace std;\nstring s;\nint main() {\n  cin >> s;\n  for (string::reverse_iterator it = s.rbegin(); it != s.rend(); it++)\n    cout << *it;\n  cout << endl;\n  return 0;\n}","change":"replace","i1":6,"i2":8,"j1":6,"j2":9,"error":"-11","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int n = 0;\n  char a[1000];\n  for (int i = 0; i < 1000; i++)\n    a[i] = '\\0';\n  scanf(\"%s\", a);\n  while (a[n] != '\\0')\n    n++;\n  for (int i = n - 1; i >= 0; i++)\n    printf(\"%c\", a[i]);\n  printf(\"\\n\");\n}","changed_src":"#include <stdio.h>\nint main() {\n  int n = 0;\n  char a[1000];\n  for (int i = 0; i < 1000; i++)\n    a[i] = '\\0';\n  scanf(\"%s\", a);\n  while (a[n] != '\\0')\n    n++;\n  for (int i = n - 1; i >= 0; i--)\n    printf(\"%c\", a[i]);\n  printf(\"\\n\");\n}","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"-11","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <string>\nusing namespace std;\nint main() {\n  char a;\n  string str;\n  cin >> str;\n  for (int i = 0; i != str.size() - 1 - i; i++) {\n    a = str[i];\n    str[i] = str[str.size() - 1 - i];\n    str[str.size() - 1 - i] = a;\n  }\n  cout << str << endl;\n}","changed_src":"#include <iostream>\n#include <string>\nusing namespace std;\nint main() {\n  char a;\n  string str;\n  cin >> str;\n  for (int i = 0; i < str.size() - 1 - i; i++) {\n    a = str[i];\n    str[i] = str[str.size() - 1 - i];\n    str[str.size() - 1 - i] = a;\n  }\n  cout << str << endl;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"-11","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <string>\nusing namespace std;\nint main() {\n  string s;\n  cin >> s;\n  if (s.size() <= 20) {\n    for (int i = s.size();; i--) {\n      cout << s[i];\n    }\n    cout << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\n#include <string>\nusing namespace std;\nint main() {\n  string s;\n  cin >> s;\n  if (s.size() <= 20) {\n    for (int i = s.size(); i--;) {\n      cout << s[i];\n    }\n    cout << endl;\n  }\n  return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"-11","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n\n  string s;\n\n  cin >> s;\n\n  for (int i = s.size() - 1; i >= 0; ++i)\n    cout << s[i];\n\n  cout << endl;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n\n  string s;\n\n  cin >> s;\n\n  for (int i = s.size() - 1; i >= 0; --i)\n    cout << s[i];\n\n  cout << endl;\n}\n","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"-11","stderr":""}
-{"problem_id":"p00006","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main() {\n  string str;\n  cin >> str;\n  for (int i = str.size() - 1; i >= 0; i++)\n    cout << str[i];\n  cout << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main() {\n  string str;\n  cin >> str;\n  for (int i = str.size() - 1; i >= 0; i--)\n    cout << str[i];\n  cout << endl;\n  return 0;\n}","change":"replace","i1":8,"i2":9,"j1":8,"j2":9,"error":"-11","stderr":""}
-{"problem_id":"p00007","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cmath>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n\n  while (1) {\n    int m = 100000;\n    while (n--) {\n      m = ceil(m * 1.05 \/ 1000) * 1000;\n    }\n    cout << m << endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n\n  while (cin >> n) {\n    int m = 100000;\n    while (n--) {\n      m = ceil(m * 1.05 \/ 1000) * 1000;\n    }\n    cout << m << endl;\n  }\n  return 0;\n}","change":"replace","i1":8,"i2":9,"j1":8,"j2":9,"error":"TLE","stderr":""}
-{"problem_id":"p00007","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int n, debt = 100000;\n  cin >> n;\n  while (n--) {\n    debt = debt * 1.05;\n    debt += 999;\n    debt \/= 1000;\n    debt *= 1000;\n  }\n  cout << debt << endl;\n  while (1)\n    ;\n  return 0;\n}","changed_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int n, debt = 100000;\n  cin >> n;\n  while (n--) {\n    debt = debt * 1.05;\n    debt += 999;\n    debt \/= 1000;\n    debt *= 1000;\n  }\n  cout << debt << endl;\n  return 0;\n}","change":"delete","i1":14,"i2":16,"j1":14,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p00007","language":"Python","original_status":"Runtime Error","original_src":"import math\n\nr = 100\nn = input()\nfor i in range(n):\n    r = math.ceil(r * 1.05)\nprint(r * 1000)\n","changed_src":"import math\n\nr = 100\nn = int(input())\nfor i in range(n):\n    r = math.ceil(r * 1.05)\nprint(r * 1000)\n","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"TypeError: 'str' object cannot be interpreted as an integer","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p00007\/Python\/s183798433.py\", line 5, in <module>\n    for i in range(n):\nTypeError: 'str' object cannot be interpreted as an integer\n"}
-{"problem_id":"p00018","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nint main() {\n  int num[5];\n\n  for (int i = 0; i = 4; i++)\n    cin >> num[i];\n\n  sort(num, num + 5);\n\n  for (int i = 4; i = 1; i--)\n    cout << num[i] << \" \";\n\n  cout << num[0] << \"\\n\";\n}","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nint main() {\n  int in[5];\n  for (int i = 0; i < 5; i++)\n    cin >> in[i];\n  sort(in, in + 5, greater<int>());\n  for (int i = 0; i < 4; i++)\n    cout << in[i] << \" \";\n  cout << in[4] << endl;\n}","change":"replace","i1":4,"i2":15,"j1":4,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p00018","language":"Python","original_status":"Runtime Error","original_src":"print(*sorted(map(int, input().spilt()))[::-1])\n","changed_src":"print(*sorted(map(int, input().split()))[::-1])\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"AttributeError: 'str' object has no attribute 'spilt'. Did you mean: 'split'?","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p00018\/Python\/s371735785.py\", line 1, in <module>\n    print(*sorted(map(int, input().spilt()))[::-1])\nAttributeError: 'str' object has no attribute 'spilt'. Did you mean: 'split'?\n"}
-{"problem_id":"p00031","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n  int weight[] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512};\n  int gram;\n  vector<int> ans;\n  while (cin >> gram) {\n    for (int i = 9; i >= 0; i--) {\n      if (gram >= weight[i]) {\n        ans.push_back(i);\n        gram -= weight[i];\n      }\n    }\n\n    for (size_t i = ans.size() - 1; i >= 0; i--) {\n      cout << weight[ans[i]];\n      if (i != 0)\n        cout << ' ';\n    }\n    cout << endl;\n    ans.clear();\n  }\n  return 0;\n}","changed_src":"#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n  int weight[] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512};\n  int gram;\n  vector<int> ans;\n  while (cin >> gram) {\n    for (int i = 9; i >= 0; i--) {\n      if (gram >= weight[i]) {\n        ans.push_back(i);\n        gram -= weight[i];\n      }\n    }\n\n    for (int i = ans.size() - 1; i >= 0; i--) {\n      cout << weight[ans[i]];\n      if (i != 0)\n        cout << ' ';\n    }\n    cout << endl;\n    ans.clear();\n  }\n  return 0;\n}","change":"replace","i1":17,"i2":18,"j1":17,"j2":18,"error":"-11","stderr":""}
-{"problem_id":"p00031","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n#include <string.h>\n\nint main(void) {\n  char line[80];\n\n  int w;\n\n  int f[10];\n  int u[10];\n\n  int k = 512;\n  for (int &d : f) {\n    d = k;\n    k >>= 1;\n  }\n\n  while (true) {\n    if (fgets(line, sizeof line, stdin) == NULL) {\n      break;\n    }\n    if (sscanf(line, \"%d\", &w) != 1) {\n      break;\n    }\n\n    int p;\n    for (p = 0; p < 10; p++) {\n      if (w > f[p]) {\n        break;\n      }\n    }\n\n    memset(u, 0, sizeof u);\n\n    int t = f[p];\n    u[p] = 1;\n    p++;\n\n    while (true) {\n      if (t == w) {\n        break;\n      } else if (t > w) {\n        t -= f[p - 1];\n        u[p - 1] = 0;\n      }\n\n      t += f[p];\n      u[p] = 1;\n      p++;\n    }\n\n    const char *sp = \"\";\n    for (int i = 9; i >= 0; i--) {\n      if (u[i]) {\n        printf(\"%s%d\", sp, f[i]);\n        if (*sp == 0) {\n          sp = \" \";\n        }\n      }\n    }\n    printf(\"\\n\");\n  }\n\n  return 0;\n}","changed_src":"#include <stdio.h>\n#include <string.h>\n\nint main(void) {\n  char line[80];\n\n  int w;\n\n  int f[10];\n  int u[10];\n\n  int k = 512;\n  for (int &d : f) {\n    d = k;\n    k >>= 1;\n  }\n\n  while (true) {\n    if (fgets(line, sizeof line, stdin) == NULL) {\n      break;\n    }\n    if (sscanf(line, \"%d\", &w) != 1) {\n      break;\n    }\n\n    int p;\n    for (p = 0; p < 10; p++) {\n      if (w >= f[p]) {\n        break;\n      }\n    }\n\n    memset(u, 0, sizeof u);\n\n    int t = f[p];\n    u[p] = 1;\n    p++;\n\n    while (true) {\n      if (t == w) {\n        break;\n      } else if (t > w) {\n        t -= f[p - 1];\n        u[p - 1] = 0;\n      }\n\n      t += f[p];\n      u[p] = 1;\n      p++;\n    }\n\n    const char *sp = \"\";\n    for (int i = 9; i >= 0; i--) {\n      if (u[i]) {\n        printf(\"%s%d\", sp, f[i]);\n        if (*sp == 0) {\n          sp = \" \";\n        }\n      }\n    }\n    printf(\"\\n\");\n  }\n\n  return 0;\n}","change":"replace","i1":27,"i2":28,"j1":27,"j2":28,"error":"0","stderr":""}
-{"problem_id":"p00031","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\nint main() {\n  int n, s;\n  while (scanf(\"%d\", &n)) {\n    for (s = 1; n; s *= 2) {\n      n &s &&printf(\"%d%c\", s, n - s ? 32 : 10);\n      n -= n & s;\n    }\n  }\n}","changed_src":"#include <cstdio>\nint main() {\n  int n, s;\n  while (scanf(\"%d\", &n) + 1) {\n    for (s = 1; n; s *= 2) {\n      n &s &&printf(\"%d%c\", s, n - s ? 32 : 10);\n      n -= n & s;\n    }\n  }\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"TLE","stderr":""}
-{"problem_id":"p00031","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int w;\n  while (cin >> w) {\n    bool flag = 0;\n    for (int i = 1; w >= 0; i *= 2) {\n      if (w % 2 > 0) {\n        if (flag) {\n          cout << ' ';\n        }\n        cout << i;\n        flag = 1;\n        w--;\n      }\n      w \/= 2;\n    }\n    cout << endl;\n  }\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int w;\n  while (cin >> w) {\n    bool flag = 0;\n    for (int i = 1; w > 0; i *= 2) {\n      if (w % 2 > 0) {\n        if (flag) {\n          cout << ' ';\n        }\n        cout << i;\n        flag = 1;\n        w--;\n      }\n      w \/= 2;\n    }\n    cout << endl;\n  }\n  return 0;\n}\n","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p00031","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\nint inf = 1000000000;\n\nint main(void) {\n\n  int n;\n  while (cin >> n) {\n    cerr << n << endl;\n    if (n == 0)\n      break;\n    int a = 1024;\n    vector<int> b;\n    while (a != 0) {\n      if (n \/ a != 0) {\n        n %= a;\n        b.push_back(a);\n      }\n      a \/= 2;\n    }\n    for (int i = 0; i < b.size(); i++) {\n      if (i != b.size() - 1)\n        cout << b[b.size() - 1 - i] << \" \";\n      else\n        cout << b[b.size() - 1 - i] << endl;\n    }\n  }\n\n  return 0;\n}\n\n\/\/ EOF","changed_src":"#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\nint inf = 1000000000;\n\nint main(void) {\n\n  int n;\n  while (cin >> n) {\n    if (n == 0)\n      break;\n    int a = 1024;\n    vector<int> b;\n    while (a != 0) {\n      if (n \/ a != 0) {\n        n %= a;\n        b.push_back(a);\n      }\n      a \/= 2;\n    }\n    for (int i = 0; i < b.size(); i++) {\n      if (i != b.size() - 1)\n        cout << b[b.size() - 1 - i] << \" \";\n      else\n        cout << b[b.size() - 1 - i] << endl;\n    }\n  }\n\n  return 0;\n}\n\n\/\/ EOF","change":"delete","i1":20,"i2":21,"j1":20,"j2":20,"error":"0","stderr":"5\n7\n127\n"}
-{"problem_id":"p00031","language":"Python","original_status":"Runtime Error","original_src":"while True:\n    g = int(input())\n    now = 512\n    ans = []\n    while True:\n        if g == 0:\n            break\n        elif g >= now:\n            g -= now\n            ans.append(now)\n        now \/\/= 2\n    temp = \"\"\n    for i in ans[::-1]:\n        temp += str(i) + \" \"\n    print(temp[:-1])\n","changed_src":"import sys\n\nfor line in sys.stdin:\n    g = int(line)\n    now = 512\n    ans = []\n    while True:\n        if g == 0:\n            break\n        elif g >= now:\n            g -= now\n            ans.append(now)\n        now \/\/= 2\n    temp = \"\"\n    for i in ans[::-1]:\n        temp += str(i) + \" \"\n    print(temp[:-1])\n","change":"replace","i1":0,"i2":2,"j1":0,"j2":4,"error":"EOFError: EOF when reading a line","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p00031\/Python\/s012591157.py\", line 2, in <module>\n    g = int(input())\nEOFError: EOF when reading a line\n"}
-{"problem_id":"p00505","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\n\/\/---------------------------\nusing namespace std;\n\/\/---------------------------\n#define REP(i, n) for (int i = 0; i < (n); i++)\n#define P(x) cout << (x) << \"\\n\"\n\n#define MOD 1000000007 \/\/ 1e9+7\n#define PI 3.1415926525\n#define ll long long int \/\/ 10^18\n#define INF 1000000001   \/\/ 1e9+1\n\nint dx[4] = {1, -1, 0, 0};\nint dy[4] = {0, 0, 1, -1};\n\/\/---------------------------\nint a[3], b[4];\n\nint main() {\n  std::ios::sync_with_stdio(false);\n  std::cin.tie(0);\n\n  \/\/ ifstream in(\"input.txt\");\n  \/\/ cin.rdbuf(in.rdbuf());\n\n  while (true) {\n    cin >> a[0] >> a[1] >> a[2];\n    sort(a, a + 3);\n    if (a[2] == a[0] + a[1])\n      break;\n    b[0]++;\n    int rec = a[2] * a[2] - a[1] * a[1] - a[0] * a[0];\n    if (rec == 0)\n      b[1]++;\n    if (rec > 0)\n      b[3]++;\n    if (rec < 0)\n      b[2]++;\n  }\n  REP(i, 4) { cout << b[i] << \" \\n\"[i == 3]; }\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\n\/\/---------------------------\nusing namespace std;\n\/\/---------------------------\n#define REP(i, n) for (int i = 0; i < (n); i++)\n#define P(x) cout << (x) << \"\\n\"\n\n#define MOD 1000000007 \/\/ 1e9+7\n#define PI 3.1415926525\n#define ll long long int \/\/ 10^18\n#define INF 1000000001   \/\/ 1e9+1\n\nint dx[4] = {1, -1, 0, 0};\nint dy[4] = {0, 0, 1, -1};\n\/\/---------------------------\nint a[3], b[4];\n\nint main() {\n  std::ios::sync_with_stdio(false);\n  std::cin.tie(0);\n\n  \/\/ ifstream in(\"input.txt\");\n  \/\/ cin.rdbuf(in.rdbuf());\n\n  while (true) {\n    cin >> a[0] >> a[1] >> a[2];\n    sort(a, a + 3);\n    if (a[2] >= a[0] + a[1])\n      break;\n    b[0]++;\n    int rec = a[2] * a[2] - a[1] * a[1] - a[0] * a[0];\n    if (rec == 0)\n      b[1]++;\n    if (rec > 0)\n      b[3]++;\n    if (rec < 0)\n      b[2]++;\n  }\n  REP(i, 4) { cout << b[i] << \" \\n\"[i == 3]; }\n  return 0;\n}\n","change":"replace","i1":27,"i2":28,"j1":27,"j2":28,"error":"TLE","stderr":""}
-{"problem_id":"p00505","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cmath>\n#include <iostream>\nusing namespace std;\nint a[3], p, q, r;\nint main() {\n  while (true) {\n    cin >> a[0] >> a[1] >> a[2];\n    sort(a, a + 3);\n    if (a[0] + a[1] <= a[2]) {\n      cout << p + q + r << ' ' << p << ' ' << q << ' ' << r << ' ' << endl;\n    }\n    if (a[0] * a[0] + a[1] * a[1] == a[2] * a[2]) {\n      p++;\n    }\n    if (a[0] * a[0] + a[1] * a[1] > a[2] * a[2]) {\n      q++;\n    }\n    if (a[0] * a[0] + a[1] * a[1] < a[2] * a[2]) {\n      r++;\n    }\n  }\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <iostream>\nusing namespace std;\nint a[3], p, q, r;\nint main() {\n  while (true) {\n    cin >> a[0] >> a[1] >> a[2];\n    sort(a, a + 3);\n    if (a[0] + a[1] <= a[2]) {\n      cout << p + q + r << ' ' << p << ' ' << q << ' ' << r << endl;\n      break;\n    }\n    if (a[0] * a[0] + a[1] * a[1] == a[2] * a[2]) {\n      p++;\n    }\n    if (a[0] * a[0] + a[1] * a[1] > a[2] * a[2]) {\n      q++;\n    }\n    if (a[0] * a[0] + a[1] * a[1] < a[2] * a[2]) {\n      r++;\n    }\n  }\n}","change":"replace","i1":10,"i2":11,"j1":10,"j2":12,"error":"TLE","stderr":""}
-{"problem_id":"p00505","language":"Python","original_status":"Runtime Error","original_src":"result = [0] * 3\nwhile 1:\n    a, b, c = sorted(list(map(int, input().split())))\n    if a + b > c:\n        flag = c * c - b * b - a * a\n        if flag == 0:\n            result[0] += 1\n        elif flag > 0:\n            result[1] += 1\n        else:\n            result[2] += 1\nprint(sum(result), *result)\n","changed_src":"acute, right, obtuse = 0, 0, 0\nwhile True:\n    a, b, c = sorted(map(int, input().split()))\n    if a + b <= c:\n        print(acute + right + obtuse, right, acute, obtuse)\n        break\n    d = a**2 + b**2\n    e = c**2\n    if d == e:\n        right += 1\n    elif d < e:\n        obtuse += 1\n    else:\n        acute += 1\n","change":"replace","i1":0,"i2":12,"j1":0,"j2":14,"error":"EOFError: EOF when reading a line","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p00505\/Python\/s014459241.py\", line 3, in <module>\n    a, b, c = sorted(list(map(int, input().split())))\nEOFError: EOF when reading a line\n"}
-{"problem_id":"p00586","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (1) {\n    cin >> a >> b;\n    cout << a + b << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    cout << a + b << endl;\n  }\n  return 0;\n}","change":"replace","i1":5,"i2":7,"j1":5,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p00586","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\nusing namespace std;\nint main(int argc, const char *argv[]) {\n\n  \/\/ insert code here...\n  int a, b;\n  while (scanf(\"%d %d\", &a, &b) != 0) {\n    printf(\"%d\\n\", a + b);\n  }\n  return 0;\n}","changed_src":"#include <cstdio>\nusing namespace std;\nint main(int argc, const char *argv[]) {\n\n  \/\/ insert code here...\n  int a, b;\n  while (scanf(\"%d %d\", &a, &b) != EOF) {\n    printf(\"%d\\n\", a + b);\n  }\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p00586","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main(void) {\n  int a, b;\n  while (cin >> a >> b, a + b)\n    cout << a + b << endl;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main(void) {\n  int a, b;\n  while (cin >> a >> b)\n    cout << a + b << endl;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"TLE","stderr":""}
-{"problem_id":"p00586","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\n\nint main() {\n  int a, b;\n  while (scanf(\"%d %d\", &a, &b)) {\n    printf(\"%d\\n\", a + b);\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint main() {\n  int a, b;\n  while (scanf(\"%d %d\", &a, &b) != EOF) {\n    printf(\"%d\\n\", a + b);\n  }\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"TLE","stderr":""}
-{"problem_id":"p00586","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (true) {\n    cin >> a >> b;\n    cout << a + b << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (cin >> a >> b) {\n    cout << a + b << endl;\n  }\n  return 0;\n}","change":"replace","i1":5,"i2":7,"j1":5,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p00586","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (scanf(\"%d %d\", &a, &b)) {\n    for (int i = 0; i < b; i++)\n      a++;\n    cout << a << endl;\n  }\n\n  return 0;\n}","changed_src":"#include <cstdio>\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int a, b, c;\n  while (scanf(\"%d %d\", &a, &b) == 2) {\n    cout << a + b << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":6,"i2":11,"j1":6,"j2":9,"error":"TLE","stderr":""}
-{"problem_id":"p00586","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main() {\n  while (1) {\n    int a, b;\n    std::cin >> a >> b;\n    std::cout << a + b << '\\n';\n  }\n}\n","changed_src":"#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main() {\n  int a, b;\n  while (std::cin >> a >> b) {\n    std::cout << a + b << '\\n';\n  }\n}\n","change":"replace","i1":6,"i2":9,"j1":6,"j2":8,"error":"TLE","stderr":""}
-{"problem_id":"p00586","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cmath>\n#include <iostream>\nusing namespace std;\n\nint a, b;\n\nint main() {\n  while (cin >> a >> b) {\n    int c = 0;\n    while (c < 100000000 && c + c \/ 2 != 2)\n      c++;\n    cout << a + b + c % 9 - 1 << endl;\n  }\n}","changed_src":"#include <cmath>\n#include <iostream>\nusing namespace std;\n\nint a, b;\n\nint main() {\n  while (cin >> a >> b) {\n    int c = 0;\n    while (c < 10000000 && c + c \/ 2 != 2)\n      c++;\n    cout << a + b + c % 9 - 1 << endl;\n  }\n}","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p00586","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <functional>\n#include <iostream>\n#include <math.h>\n#include <queue>\n#include <stack>\n#include <stdio.h>\n#include <string>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\nusing namespace std;\n\nint main() {\n\n  stack<int> st; \/\/ \u30b9\u30bf\u30c3\u30af\u3092\u5ba3\u8a00\uff0b\u521d\u671f\u5316\n\n  int a, b, c, d, e, num;\n  int i, j, k;\n  int arr[100];\n  int arr2[100][100];\n  char crr[100];\n  char crr2[100][100];\n  string str;\n  stack<int> istk;    \/\/ \u6574\u6570\u5024\u3092\u683c\u7d0d\u3059\u308b\u30b9\u30bf\u30c3\u30af\u3092\u5ba3\u8a00\n  stack<string> sstk; \/\/ \u6587\u5b57\u5217\u3092\u683c\u7d0d\u3059\u308b\u30b9\u30bf\u30c3\u30af\u3092\u5ba3\u8a00\n  queue<int> ique;    \/\/ \u6574\u6570\u5024\u3092\u683c\u7d0d\u3059\u308b\u30ad\u30e5\u30fc\u3092\u5ba3\u8a00\n  queue<string> sque; \/\/ \u6587\u5b57\u5217\u3092\u683c\u7d0d\u3059\u308b\u30ad\u30e5\u30fc\u3092\u5ba3\u8a00\n\n  while (1) {\n\n    cin >> num;\n\n    cin >> a;\n\n    if (a == EOF || num == EOF)\n      break;\n\n    cout << a + num << endl;\n  }\n\n  return 0;\n}","changed_src":"#include <functional>\n#include <iostream>\n#include <math.h>\n#include <queue>\n#include <stack>\n#include <stdio.h>\n#include <string>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\nusing namespace std;\n\nint main() {\n\n  stack<int> st; \/\/ \u30b9\u30bf\u30c3\u30af\u3092\u5ba3\u8a00\uff0b\u521d\u671f\u5316\n\n  int a, b, c, d, e, num;\n  int i, j, k;\n  int arr[100];\n  int arr2[100][100];\n  char crr[100];\n  char crr2[100][100];\n  string str;\n  stack<int> istk;    \/\/ \u6574\u6570\u5024\u3092\u683c\u7d0d\u3059\u308b\u30b9\u30bf\u30c3\u30af\u3092\u5ba3\u8a00\n  stack<string> sstk; \/\/ \u6587\u5b57\u5217\u3092\u683c\u7d0d\u3059\u308b\u30b9\u30bf\u30c3\u30af\u3092\u5ba3\u8a00\n  queue<int> ique;    \/\/ \u6574\u6570\u5024\u3092\u683c\u7d0d\u3059\u308b\u30ad\u30e5\u30fc\u3092\u5ba3\u8a00\n  queue<string> sque; \/\/ \u6587\u5b57\u5217\u3092\u683c\u7d0d\u3059\u308b\u30ad\u30e5\u30fc\u3092\u5ba3\u8a00\n\n  while (scanf(\"%d %d\", &a, &num) == 2) {\n\n    cout << a + num << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":27,"i2":35,"j1":27,"j2":28,"error":"TLE","stderr":""}
-{"problem_id":"p00586","language":"Python","original_status":"Time Limit Exceeded","original_src":"x = input()\nwhile x:\n    a, b = x.split(\" \")\n    print(int(a) + int(b))\n","changed_src":"import sys\n\nfor line in sys.stdin:\n    if line == None or line == \"\/n\":\n        break\n    a, b = line.split(\" \")\n    print(int(a) + int(b))\n","change":"replace","i1":0,"i2":3,"j1":0,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p00705","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n\/\/ #define N 101\n#define N 11\nusing namespace std;\n\nint main() {\n  int n, q, m, d;\n  int data[N];\n\n  while (cin >> n >> q && (n || q)) {\n\n    \/\/    cout << \"n=\"<<n<<\" q=\"<<q << endl;\n\n    for (int i = 0; i < N; i++)\n      data[i] = 0;\n\n    for (int i = 0; i < n; i++) {\n      cin >> m;\n      for (int i = 0; i < m; i++) {\n        cin >> d;\n        data[d]++;\n      }\n    }\n\n    \/*\n    for( int i=0;i<N;i++ )\n      cout << \"  day\"<<i <<\"=\"<<data[i]<<\" person\" << endl;\n    *\/\n\n    int max = -1, mm = -1;\n    for (d = 0; d < N; d++)\n      if (max < data[d]) {\n        max = data[d];\n        mm = d;\n      }\n\n    if (max < q)\n      cout << \"0\" << endl;\n    else\n      cout << mm << endl;\n  }\n\n  return 0;\n}","changed_src":"#include <iostream>\n\/\/ #define N 101\n#define N 101\nusing namespace std;\n\nint main() {\n  int n, q, m, d;\n  int data[N];\n\n  while (cin >> n >> q && (n || q)) {\n\n    \/\/    cout << \"n=\"<<n<<\" q=\"<<q << endl;\n\n    for (int i = 0; i < N; i++)\n      data[i] = 0;\n\n    for (int i = 0; i < n; i++) {\n      cin >> m;\n      for (int i = 0; i < m; i++) {\n        cin >> d;\n        data[d]++;\n      }\n    }\n\n    \/*\n    for( int i=0;i<N;i++ )\n      cout << \"  day\"<<i <<\"=\"<<data[i]<<\" person\" << endl;\n    *\/\n\n    int max = -1, mm = -1;\n    for (d = 0; d < N; d++)\n      if (max < data[d]) {\n        max = data[d];\n        mm = d;\n      }\n\n    if (max < q)\n      cout << \"0\" << endl;\n    else\n      cout << mm << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p00705","language":"Python","original_status":"Runtime Error","original_src":"import collections\n\nwhile True:\n    N, Q = map(int, input().split())\n    if N == 0 and Q == 0:\n        break\n    D = []\n    for _ in range(N):\n        i = list(map(int, input().split()))\n        del i[0]\n        [D.append(ii) for ii in i]\n    c = collections.Counter(D)\n    cc = c.most_common()\n    if cc[0][1] >= Q:\n        print(cc[0][0])\n    else:\n        print(0)\n","changed_src":"import collections\n\nwhile True:\n    N, Q = map(int, input().split())\n    if N == 0 and Q == 0:\n        break\n    D = []\n    for _ in range(N):\n        i = list(map(int, input().split()))\n        del i[0]\n        [D.append(ii) for ii in i]\n    if not len(D) == 0:\n        c = collections.Counter(D)\n        cc = c.most_common()\n        # print(cc)\n        if cc[0][1] >= Q:\n            ans = 1000000\n            tmp = cc[0][1]\n            for i in range(len(cc)):\n                if cc[i][1] == tmp:\n                    ans = min(cc[i][0], ans)\n            print(ans)\n        else:\n            print(0)\n    else:\n        print(0)\n","change":"replace","i1":11,"i2":15,"j1":11,"j2":24,"error":"0","stderr":""}
-{"problem_id":"p00705","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\n#pragma warning(disable : 4996)\nint N, Q, M, D, R[100];\nint main() {\n  while (true) {\n    scanf(\"%d%d\", &N, &Q);\n    if (N == 0 && Q == 0)\n      break;\n    for (int i = 0; i < 100; i++)\n      R[i] = 0;\n    for (int i = 0; i < N; i++) {\n      scanf(\"%d\", &M);\n      for (int j = 0; j < M; j++) {\n        scanf(\"%d\", &D);\n        R[--D]++;\n      }\n    }\n    int ptr = 0;\n    for (int i = 0; i < 100;) {\n      if (R[i] >= Q) {\n        if (ptr == 0) {\n          ptr = i + 1;\n        } else if (R[i] > R[ptr - 1]) {\n          ptr = i + 1;\n        }\n      }\n    }\n    printf(\"%d\\n\", ptr);\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\n#pragma warning(disable : 4996)\nint N, Q, M, D, R[100];\nint main() {\n  while (true) {\n    scanf(\"%d%d\", &N, &Q);\n    if (N == 0 && Q == 0)\n      break;\n    for (int i = 0; i < 100; i++)\n      R[i] = 0;\n    for (int i = 0; i < N; i++) {\n      scanf(\"%d\", &M);\n      for (int j = 0; j < M; j++) {\n        scanf(\"%d\", &D);\n        R[--D]++;\n      }\n    }\n    int ptr = 0;\n    for (int i = 0; i < 100; i++) {\n      if (R[i] >= Q) {\n        if (ptr == 0) {\n          ptr = i + 1;\n        } else if (R[i] > R[ptr - 1]) {\n          ptr = i + 1;\n        }\n      }\n    }\n    printf(\"%d\\n\", ptr);\n  }\n  return 0;\n}","change":"replace","i1":18,"i2":19,"j1":18,"j2":19,"error":"TLE","stderr":""}
-{"problem_id":"p00705","language":"C++","original_status":"Runtime Error","original_src":"#include <cstdio>\n#include <cstring>\n#include <iostream>\n\n#define MAX 50\n\nusing namespace std;\nint main() {\n  int n, q, m;\n  int d[MAX], date;\n  while (cin >> n >> q) {\n    if (n == 0 && q == 0)\n      break;\n    memset(d, 0, sizeof(d));\n\n    while (n--) {\n      cin >> m;\n      for (int i = 0; i < m; i++) {\n        cin >> date;\n        d[date]++;\n      }\n    }\n    bool flag = 0;\n    int ans = 0, tmp = 0;\n\n    for (int i = 1; i < MAX; i++) {\n      if (d[i] >= q) {\n        if (i >= ans && d[i] > tmp) {\n          ans = i;\n          tmp = d[i];\n          flag = 1;\n        }\n      }\n    }\n\n    if (flag == 1)\n      cout << ans << endl;\n    else\n      cout << 0 << endl;\n  }\n  return 0;\n}","changed_src":"#include <cstdio>\n#include <cstring>\n#include <iostream>\n\n#define MAX 100\n\nusing namespace std;\nint main() {\n  int n, q, m;\n  int d[MAX], date;\n  while (cin >> n >> q) {\n    if (n == 0 && q == 0)\n      break;\n    memset(d, 0, sizeof(d));\n\n    while (n--) {\n      cin >> m;\n      for (int i = 0; i < m; i++) {\n        cin >> date;\n        d[date]++;\n      }\n    }\n    bool flag = 0;\n    int ans = 0, tmp = 0;\n\n    for (int i = 1; i < MAX; i++) {\n      if (d[i] >= q) {\n        if (i >= ans && d[i] > tmp) {\n          ans = i;\n          tmp = d[i];\n          flag = 1;\n        }\n      }\n    }\n\n    if (flag == 1)\n      cout << ans << endl;\n    else\n      cout << 0 << endl;\n  }\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  int n, m;\n  int w[1500], h[1500];\n  cin >> n >> m;\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &w[i]);\n  for (int i = 0; i < m; i++)\n    scanf(\"%d\", &h[i]);\n  while (n) {\n    vector<int> x;\n    vector<int> y;\n    for (int i = 0; i < n; i++) {\n      int a = 0;\n      for (int j = i; j < n; j++) {\n        a += w[j];\n        x[a]++;\n      }\n    }\n    for (int i = 0; i < m; i++) {\n      int b = 0;\n      for (int j = i; j < m; j++) {\n        b += h[j];\n        y[b]++;\n      }\n    }\n\n    int ave = 0;\n    for (int i = 0; i < 1500 * 1000; i++) {\n      \/\/ if(y[i]!=0)cout << i << \" \" << y[i] << \" \/ \";\n      ave += x[i] * y[i];\n    }\n    cout << ave << endl;\n\n    cin >> n >> m;\n    for (int i = 0; i < n; i++)\n      scanf(\"%d\", &w[i]);\n    for (int i = 0; i < m; i++)\n      scanf(\"%d\", &h[i]);\n  }\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  int n, m;\n  int w[1500], h[1500];\n  cin >> n >> m;\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &w[i]);\n  for (int i = 0; i < m; i++)\n    scanf(\"%d\", &h[i]);\n  while (n) {\n    vector<int> x(1501 * 1001);\n    vector<int> y(1501 * 1001);\n    for (int i = 0; i < n; i++) {\n      int a = 0;\n      for (int j = i; j < n; j++) {\n        a += w[j];\n        x[a]++;\n      }\n    }\n    for (int i = 0; i < m; i++) {\n      int b = 0;\n      for (int j = i; j < m; j++) {\n        b += h[j];\n        y[b]++;\n      }\n    }\n\n    int ave = 0;\n    for (int i = 0; i < 1500 * 1000; i++) {\n      \/\/ if(y[i]!=0)cout << i << \" \" << y[i] << \" \/ \";\n      ave += x[i] * y[i];\n    }\n    cout << ave << endl;\n\n    cin >> n >> m;\n    for (int i = 0; i < n; i++)\n      scanf(\"%d\", &w[i]);\n    for (int i = 0; i < m; i++)\n      scanf(\"%d\", &h[i]);\n  }\n  return 0;\n}\n","change":"replace","i1":12,"i2":14,"j1":12,"j2":14,"error":"-11","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\n\n#define INF 1e9\n#define llINF 1e18\n#define MOD 1e9 + 7\n#define pb push_back\n#define mp make_pair\n#define F first\n#define S second\n#define ll long long\nusing namespace std;\nint main() {\n  int n, m;\n  while (cin >> n >> m, n) {\n    int num[2500100] = {};\n    int takasa[1600] = {};\n    short num2[1600] = {};\n    ll ans = 0;\n    for (int i = 1; i <= n; i++) {\n      int a;\n      cin >> a;\n      takasa[i] = takasa[i - 1] + a;\n    }\n    for (int i = 1; i <= m; i++) {\n      int a;\n      cin >> a;\n      num2[i] = num2[i - 1] + a;\n      for (int j = 0; j < i; j++) {\n        num[num2[i] - num2[j]]++;\n      }\n    }\n    for (int i = 0; i <= n; i++) {\n      for (int j = 0; j < i; j++) {\n        ans += num[takasa[i] - takasa[j]];\n      }\n    }\n    cout << ans << endl;\n  }\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\n\n#define INF 1e9\n#define llINF 1e18\n#define MOD 1e9 + 7\n#define pb push_back\n#define mp make_pair\n#define F first\n#define S second\n#define ll long long\nusing namespace std;\nint main() {\n  int n, m;\n  while (cin >> n >> m, n) {\n    int num[2500100] = {};\n    int takasa[10600] = {};\n    int num2[10600] = {};\n    ll ans = 0;\n    for (int i = 1; i <= n; i++) {\n      int a;\n      cin >> a;\n      takasa[i] = takasa[i - 1] + a;\n    }\n    for (int i = 1; i <= m; i++) {\n      int a;\n      cin >> a;\n      num2[i] = num2[i - 1] + a;\n      for (int j = 0; j < i; j++) {\n        num[num2[i] - num2[j]]++;\n      }\n    }\n    for (int i = 0; i <= n; i++) {\n      for (int j = 0; j < i; j++) {\n        ans += num[takasa[i] - takasa[j]];\n      }\n    }\n    cout << ans << endl;\n  }\n  return 0;\n}\n","change":"replace","i1":15,"i2":17,"j1":15,"j2":17,"error":"-11","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <stack>\n#include <string>\n#include <vector>\n\n#define rep(i, x) for (int i = 0; i < x; i++)\n#define rrep(i, x) for (int i = x - 1; i >= 0; i--)\n#define rep_to(a, i, x) for (int i = a; i < x; i++)\n\nusing namespace std;\n\nint main() {\n  int N, M;\n\n  while (cin >> N >> M && M && N) {\n    int h[10000] = {};\n    int w[10000] = {};\n    unsigned long long sum_h[10000] = {};\n    unsigned long long sum_w[10000] = {};\n    long long h_c[225000] = {};\n    long long w_c[225000] = {};\n\n    rep(i, N) {\n      cin >> h[i];\n      sum_h[i + 1] = sum_h[i] + h[i];\n    }\n    rep(i, M) {\n      cin >> w[i];\n      sum_w[i + 1] = sum_w[i] + w[i];\n    }\n\n    rep(i, N) rep(j, N - i) h_c[sum_h[j + i + 1] - sum_h[j]]++;\n    rep(i, M) rep(j, M - i) w_c[sum_w[j + i + 1] - sum_w[j]]++;\n\n    long long count = 0;\n    rep(i, min(sum_h[N], sum_w[M]) + 1) count += h_c[i] * w_c[i];\n    cout << count << endl;\n  }\n  return 0;\n}","changed_src":"#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <stack>\n#include <string>\n#include <vector>\n\n#define rep(i, x) for (int i = 0; i < x; i++)\n#define rrep(i, x) for (int i = x - 1; i >= 0; i--)\n#define rep_to(a, i, x) for (int i = a; i < x; i++)\n\nusing namespace std;\n\nint main() {\n  int N, M;\n\n  while (cin >> N >> M && M && N) {\n    int h[10000] = {};\n    int w[10000] = {};\n    unsigned long long sum_h[10000] = {};\n    unsigned long long sum_w[10000] = {};\n    long long h_c[510000] = {};\n    long long w_c[500000] = {};\n\n    rep(i, N) {\n      cin >> h[i];\n      sum_h[i + 1] = sum_h[i] + h[i];\n    }\n    rep(i, M) {\n      cin >> w[i];\n      sum_w[i + 1] = sum_w[i] + w[i];\n    }\n\n    rep(i, N) rep(j, N - i) h_c[sum_h[j + i + 1] - sum_h[j]]++;\n    rep(i, M) rep(j, M - i) w_c[sum_w[j + i + 1] - sum_w[j]]++;\n\n    long long count = 0;\n    rep(i, min(sum_h[N], sum_w[M]) + 1) count += h_c[i] * w_c[i];\n    cout << count << endl;\n  }\n  return 0;\n}","change":"replace","i1":24,"i2":26,"j1":24,"j2":26,"error":"0","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\nconst int MAX = 100000;\nint main() {\n\n  for (int n, m; cin >> n >> m, n && m;) {\n    int h[1500], w[1500], a0[MAX + 10] = {}, a1[MAX + 10] = {};\n    for (int i = 0; i < n; i++)\n      cin >> h[i];\n    for (int i = 0; i < m; i++)\n      cin >> w[i];\n    for (int i = 1; i <= n; i++)\n      for (int j = 0; j < n - i + 1; j++) {\n        int r = 0;\n        for (int k = 0; k < i; k++)\n          r += h[j + k];\n        a0[r]++;\n      }\n    for (int i = 1; i <= m; i++)\n      for (int j = 0; j < m - i + 1; j++) {\n        int r = 0;\n        for (int k = 0; k < i; k++)\n          r += w[j + k];\n        a1[r]++;\n      }\n    int r = 0;\n    for (int i = 1; i <= MAX; i++)\n      r += a0[i] * a1[i];\n    cout << r << endl;\n  }\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\nconst int MAX = 1500000;\nint main() {\n\n  for (int n, m; cin >> n >> m, n && m;) {\n    int h[1500], w[1500], a0[MAX + 10] = {}, a1[MAX + 10] = {};\n    for (int i = 0; i < n; i++)\n      cin >> h[i];\n    for (int i = 0; i < m; i++)\n      cin >> w[i];\n    for (int i = 1; i <= n; i++)\n      for (int j = 0; j < n - i + 1; j++) {\n        int r = 0;\n        for (int k = 0; k < i; k++)\n          r += h[j + k];\n        a0[r]++;\n      }\n    for (int i = 1; i <= m; i++)\n      for (int j = 0; j < m - i + 1; j++) {\n        int r = 0;\n        for (int k = 0; k < i; k++)\n          r += w[j + k];\n        a1[r]++;\n      }\n    int r = 0;\n    for (int i = 1; i <= MAX; i++)\n      r += a0[i] * a1[i];\n    cout << r << endl;\n  }\n  return 0;\n}","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p01140","language":"Python","original_status":"Time Limit Exceeded","original_src":"from collections import Counter\n\nwhile True:\n    N, M = map(int, input().split())\n    if N == 0 and M == 0:\n        break\n    H = [int(input()) for _ in range(N)]\n    W = [int(input()) for _ in range(M)]\n    all_H = Counter(\n        sorted([sum(H[i:j]) for i in range(N) for j in range(i + 1, N + 1)])\n    )\n    all_W = Counter(\n        sorted([sum(W[i:j]) for i in range(M) for j in range(i + 1, M + 1)])\n    )\n    ans = 0\n    for k, v in all_H.items():\n        if k in all_H:\n            ans += v * all_W[k]\n    print(ans)\n","changed_src":"from collections import Counter\n\nwhile True:\n    N, M = map(int, input().split())\n    if N == 0 and M == 0:\n        break\n    H = [int(input()) for _ in range(N)]\n    W = [int(input()) for _ in range(M)]\n\n    all_H = []\n    for i in range(N):\n        s = 0\n        for j in range(i, N):\n            s += H[j]\n            all_H.append(s)\n\n    all_W = []\n    for i in range(M):\n        s = 0\n        for j in range(i, M):\n            s += W[j]\n            all_W.append(s)\n\n    all_H = Counter(all_H)\n    all_W = Counter(all_W)\n    ans = 0\n    for k, v in all_H.items():\n        if k in all_H:\n            ans += v * all_W[k]\n    print(ans)\n","change":"replace","i1":8,"i2":14,"j1":8,"j2":25,"error":"TLE","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\nint main() {\n\n  int w, h;\n  cin >> w >> h;\n  int wl[1501] = {}, hl[1501] = {};\n  int wb, hb;\n  int i, j, k;\n  while (w != 0) {\n    for (i = 0; i < w; i++) {\n      cin >> wb;\n      wl[i + 1] = wl[i] + wb;\n    }\n    for (i = 0; i < h; i++) {\n      cin >> hb;\n      hl[i + 1] = hl[i] + hb;\n    }\n    vector<int> ws, hs;\n\n    for (i = 0; i <= w; i++) {\n      for (j = i + 1; j <= w; j++) {\n        ws.push_back(wl[j] - wl[i]);\n      }\n    }\n    for (i = 0; i <= h; i++) {\n      for (j = i + 1; j <= h; j++) {\n        hs.push_back(hl[j] - hl[i]);\n      }\n    }\n\n    sort(ws.begin(), ws.end());\n    sort(hs.begin(), hs.end());\n    \/*\n    for(i=0;i<ws.size();i++) cout << ws[i] << \",\";\n    cout << endl;\n    for(i=0;i<hs.size();i++) cout << hs[i] << \",\";\n    cout << endl;\n    *\/\n    int wc = 0, hc = 0;\n    int x, y;\n    int o = 0;\n    while (!(wc + 1 >= ws.size() && hc + 1 >= hs.size())) {\n\n      if (ws[wc] == hs[hc]) {\n        x = 0;\n        y = 0;\n        while (ws[wc + x] == ws[wc] && wc + x < ws.size())\n          x++;\n        while (hs[hc + y] == hs[hc] && hc + y < hs.size())\n          y++;\n        \/\/ cout << x*y << endl;\n        o += x * y;\n        wc += x;\n        hc += y;\n      } else if (ws[wc] > hs[hc]) {\n        while (ws[wc] > hs[hc] && hc < hs.size())\n          hc++;\n      } else {\n        while (ws[wc] < hs[hc] && wc < ws.size())\n          wc++;\n      }\n      \/\/ cout << wc<<\":\"<<hc<<endl;\n    }\n    cout << o << endl;\n\n    cin >> w >> h;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\nint main() {\n\n  int w, h;\n  cin >> w >> h;\n  int wl[1501] = {}, hl[1501] = {};\n  int wb, hb;\n  int i, j, k;\n  while (w != 0) {\n    for (i = 0; i < w; i++) {\n      cin >> wb;\n      wl[i + 1] = wl[i] + wb;\n    }\n    for (i = 0; i < h; i++) {\n      cin >> hb;\n      hl[i + 1] = hl[i] + hb;\n    }\n    vector<int> ws, hs;\n\n    for (i = 0; i <= w; i++) {\n      for (j = i + 1; j <= w; j++) {\n        ws.push_back(wl[j] - wl[i]);\n      }\n    }\n    for (i = 0; i <= h; i++) {\n      for (j = i + 1; j <= h; j++) {\n        hs.push_back(hl[j] - hl[i]);\n      }\n    }\n\n    sort(ws.begin(), ws.end());\n    sort(hs.begin(), hs.end());\n    \/*\n    for(i=0;i<ws.size();i++) cout << ws[i] << \",\";\n    cout << endl;\n    for(i=0;i<hs.size();i++) cout << hs[i] << \",\";\n    cout << endl;\n    *\/\n    int wc = 0, hc = 0;\n    int x, y;\n    int o = 0;\n    while (!(wc >= ws.size() || hc >= hs.size())) {\n\n      if (ws[wc] == hs[hc]) {\n        x = 0;\n        y = 0;\n        while (ws[wc + x] == ws[wc] && wc + x < ws.size())\n          x++;\n        while (hs[hc + y] == hs[hc] && hc + y < hs.size())\n          y++;\n        \/\/ cout << x*y << endl;\n        o += x * y;\n        wc += x;\n        hc += y;\n      } else if (ws[wc] > hs[hc]) {\n        while (ws[wc] > hs[hc] && hc < hs.size())\n          hc++;\n      } else {\n        while (ws[wc] < hs[hc] && wc < ws.size())\n          wc++;\n      }\n      \/\/ cout << wc<<\":\"<<hc<<endl;\n    }\n    cout << o << endl;\n\n    cin >> w >> h;\n  }\n  return 0;\n}","change":"replace","i1":44,"i2":45,"j1":44,"j2":45,"error":"TLE","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nint w[1501] = {0}, h[1501] = {0};\nint W[2250000] = {0}, H[2250000] = {0};\n\nint sum(int *a, int i, int n, int size) {\n  int s = 0;\n  for (int j = n; j--;) {\n    if (i >= size) {\n      return 0;\n    }\n    s += a[i++];\n  }\n  return s;\n}\n\nint main() {\n  int n, m, w_, h_;\n  while (cin >> n >> m, n || m) {\n    \/\/ int cnt_h[1001] = {0}\n    int cnt_w[100000] = {0};\n\n    for (int i = 0; i < n; i++) {\n      cin >> h[i];\n    }\n    int i_ = 0;\n    for (int j = 1; j <= n; j++) {\n      for (int i = 0; i + j <= n; i++) {\n        H[i_++] = sum(h, i, j, n);\n      }\n    }\n    \/*for(int i=0 ; i<i_ ; i++ ){\n            cnt_h[ H[i] ]++;\n    }*\/\n\n    for (int i = 0; i < m; i++) {\n      cin >> w[i];\n    }\n    int j_ = 0;\n    for (int j = 1; j <= m; j++) {\n      for (int i = 0; i + j <= m; i++) {\n        W[j_++] = sum(w, i, j, m);\n      }\n    }\n    for (int i = 0; i < j_; i++) {\n      cnt_w[W[i]] += 1;\n    }\n    \/*for(int i=0 ; i<j_ ; i++ ){\n            cout << \"W[\" << i << \"] : \" << W[i] << endl;\n    }*\/\n\n    int ans = 0;\n    for (int i = 0; i < i_; i++) {\n      \/\/ if( H[i] <= 1000 && H[i] >= 0 )\n      ans += cnt_w[H[i]];\n      \/\/ for(int j=0 ; j < j_ ; j++ ){\n      \/\/\tif( W[j] == H[i] ) ans++;\n      \/\/ }\n    }\n    \/\/ cout << \"ans : \" << ans << endl;\n    cout << ans << endl;\n  }\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nint w[1501] = {0}, h[1501] = {0};\nint W[2250000] = {0}, H[2250000] = {0};\n\nint sum(int *a, int i, int n, int size) {\n  int s = 0;\n  for (int j = n; j--;) {\n    if (i >= size) {\n      return 0;\n    }\n    s += a[i++];\n  }\n  return s;\n}\n\nint main() {\n  int n, m, w_, h_;\n  while (cin >> n >> m, n || m) {\n    \/\/ int cnt_h[1001] = {0}\n    int cnt_w[1000000] = {0};\n\n    for (int i = 0; i < n; i++) {\n      cin >> h[i];\n    }\n    int i_ = 0;\n    for (int j = 1; j <= n; j++) {\n      for (int i = 0; i + j <= n; i++) {\n        H[i_++] = sum(h, i, j, n);\n      }\n    }\n    \/*for(int i=0 ; i<i_ ; i++ ){\n            cnt_h[ H[i] ]++;\n    }*\/\n\n    for (int i = 0; i < m; i++) {\n      cin >> w[i];\n    }\n    int j_ = 0;\n    for (int j = 1; j <= m; j++) {\n      for (int i = 0; i + j <= m; i++) {\n        W[j_++] = sum(w, i, j, m);\n      }\n    }\n    for (int i = 0; i < j_; i++) {\n      cnt_w[W[i]] += 1;\n    }\n    \/*for(int i=0 ; i<j_ ; i++ ){\n            cout << \"W[\" << i << \"] : \" << W[i] << endl;\n    }*\/\n\n    int ans = 0;\n    for (int i = 0; i < i_; i++) {\n      \/\/ if( H[i] <= 1000 && H[i] >= 0 )\n      ans += cnt_w[H[i]];\n      \/\/ for(int j=0 ; j < j_ ; j++ ){\n      \/\/\tif( W[j] == H[i] ) ans++;\n      \/\/ }\n    }\n    \/\/ cout << \"ans : \" << ans << endl;\n    cout << ans << endl;\n  }\n}","change":"replace","i1":23,"i2":24,"j1":23,"j2":24,"error":"0","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Time Limit Exceeded","original_src":"\/\/ include\n\/\/------------------------------------------\n#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n\nusing namespace std;\n\n\/\/ typedef\n\/\/------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef long long LL;\n\n\/\/ container util\n\/\/------------------------------------------\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define EACH(i, c)                                                             \\\n  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).end())\n#define SORT(c) sort((c).begin(), (c).end())\n\n\/\/ repetition\n\/\/------------------------------------------\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n\n\/\/ constant\n\/\/--------------------------------------------\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\n\nint main() {\n  cin.tie(0);\n  ios_base::sync_with_stdio(false);\n\n  int N, M;\n  while (cin >> N >> M, N) {\n    VI h(N + 1, 0), w(M + 1, 0);\n    REP(i, N) {\n      int x;\n      cin >> x;\n      h[i + 1] = h[i] + x;\n    }\n    REP(i, M) {\n      int x;\n      cin >> x;\n      w[i + 1] = w[i] + x;\n    }\n    int ans = 0;\n    if (N < M) {\n      for (int i = 0; i <= N; ++i)\n        for (int j = 0; j < i; ++j) {\n          int sz = h[i] - h[j], s = 0, e = 0;\n          for (; e <= M;) {\n            int tmp = w[e] - w[s];\n            if (tmp == sz) {\n              ++ans;\n              ++e, ++s;\n            } else if (tmp < sz) {\n              ++e;\n            } else {\n              ++s;\n            }\n          }\n        }\n    } else {\n      for (int i = 0; i <= M; ++i)\n        for (int j = 0; j < i; ++j) {\n          int sz = w[i] - w[j], s = 0, e = 0;\n          for (; e <= N;) {\n            int tmp = h[e] - h[s];\n            if (tmp == sz) {\n              ++ans;\n              ++e, ++s;\n            } else if (tmp < sz) {\n              ++e;\n            } else {\n              ++s;\n            }\n          }\n        }\n    }\n    cout << ans << endl;\n  }\n\n  return 0;\n}","changed_src":"\/\/ include\n\/\/------------------------------------------\n#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n\nusing namespace std;\n\n\/\/ typedef\n\/\/------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef long long LL;\n\n\/\/ container util\n\/\/------------------------------------------\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define EACH(i, c)                                                             \\\n  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).end())\n#define SORT(c) sort((c).begin(), (c).end())\n\n\/\/ repetition\n\/\/------------------------------------------\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n\n\/\/ constant\n\/\/--------------------------------------------\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\n\nint main() {\n  cin.tie(0);\n  ios_base::sync_with_stdio(false);\n\n  int N, M;\n  while (cin >> N >> M, N) {\n    VI h(N + 1, 0), w(M + 1, 0);\n    REP(i, N) {\n      int x;\n      cin >> x;\n      h[i + 1] = h[i] + x;\n    }\n    REP(i, M) {\n      int x;\n      cin >> x;\n      w[i + 1] = w[i] + x;\n    }\n    LL ans = 0;\n    map<int, int> szx, szy;\n    for (int i = 0; i <= M; ++i)\n      for (int j = 0; j < i; ++j)\n        szx[w[i] - w[j]]++;\n\n    for (int i = 0; i <= N; ++i)\n      for (int j = 0; j < i; ++j) {\n        ans += szx[h[i] - h[j]];\n      }\n\n    cout << ans << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":75,"i2":109,"j1":75,"j2":86,"error":"TLE","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n#include <map>\nusing namespace std;\n\nint main() {\n  int H, W;\n\n  while (cin >> H >> W, H + W) {\n    int h[1001] = {};\n    int w[1001] = {};\n    map<int, int> setH;\n    map<int, int> setW;\n\n    for (int i = 1; i <= H; i++)\n      cin >> h[i];\n    for (int i = 1; i <= W; i++)\n      cin >> w[i];\n\n    for (int i = 1; i <= H; i++)\n      h[i] += h[i - 1];\n    for (int i = 1; i <= W; i++)\n      w[i] += w[i - 1];\n\n    for (int i = 0; i < H; i++) {\n      for (int j = i + 1; j <= H; j++) {\n        int t = h[j] - h[i];\n        if (setH.count(t))\n          setH[t]++;\n        else\n          setH[t] = 1;\n      }\n    }\n    for (int i = 0; i < W; i++) {\n      for (int j = i + 1; j <= W; j++) {\n        int t = w[j] - w[i];\n        if (setW.count(t))\n          setW[t]++;\n        else\n          setW[t] = 1;\n      }\n    }\n\n    int cnt = 0;\n    for (auto i : setH) {\n      if (setW.count(i.first))\n        cnt += setW[i.first] * i.second;\n    }\n\n    cout << cnt << endl;\n  }\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <map>\nusing namespace std;\n\nint main() {\n  int H, W;\n\n  while (cin >> H >> W, H + W) {\n    int h[1501] = {};\n    int w[1501] = {};\n    map<int, int> setH;\n    map<int, int> setW;\n\n    for (int i = 1; i <= H; i++)\n      cin >> h[i];\n    for (int i = 1; i <= W; i++)\n      cin >> w[i];\n\n    for (int i = 1; i <= H; i++)\n      h[i] += h[i - 1];\n    for (int i = 1; i <= W; i++)\n      w[i] += w[i - 1];\n\n    for (int i = 0; i < H; i++) {\n      for (int j = i + 1; j <= H; j++) {\n        int t = h[j] - h[i];\n        if (setH.count(t))\n          setH[t]++;\n        else\n          setH[t] = 1;\n      }\n    }\n    for (int i = 0; i < W; i++) {\n      for (int j = i + 1; j <= W; j++) {\n        int t = w[j] - w[i];\n        if (setW.count(t))\n          setW[t]++;\n        else\n          setW[t] = 1;\n      }\n    }\n\n    int cnt = 0;\n    for (auto i : setH) {\n      if (setW.count(i.first))\n        cnt += setW[i.first] * i.second;\n    }\n\n    cout << cnt << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":9,"i2":11,"j1":9,"j2":11,"error":"0","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n#include <string.h>\n\nint main(void) {\n  int sw[150001], sum, n, m, i, j, k, count, w[1500], h[1500];\n  while (1) {\n    scanf(\"%d%d\", &n, &m);\n    if (n == 0 && m == 0)\n      break;\n    for (i = 0; i < n; i++)\n      scanf(\"%d\", &h[i]);\n    for (i = 0; i < m; i++)\n      scanf(\"%d\", &w[i]);\n    memset(sw, 0, sizeof(sw));\n    for (i = 0; i < m; i++) {\n      for (j = i; j < m; j++) {\n        sum = 0;\n        for (k = i; k <= j; k++)\n          sum += w[k];\n        sw[sum]++;\n      }\n    }\n    count = 0;\n    for (i = 0; i < n; i++) {\n      for (j = i; j < n; j++) {\n        sum = 0;\n        for (k = i; k <= j; k++)\n          sum += h[k];\n        if (sw[sum])\n          count += sw[sum];\n      }\n    }\n    printf(\"%d\\n\", count);\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\n#include <string.h>\n\nint main(void) {\n  int sw[1500001], sum, n, m, i, j, k, count, w[1500], h[1500];\n  while (1) {\n    scanf(\"%d%d\", &n, &m);\n    if (n == 0 && m == 0)\n      break;\n    for (i = 0; i < n; i++)\n      scanf(\"%d\", &h[i]);\n    for (i = 0; i < m; i++)\n      scanf(\"%d\", &w[i]);\n    memset(sw, 0, sizeof(sw));\n    for (i = 0; i < m; i++) {\n      for (j = i; j < m; j++) {\n        sum = 0;\n        for (k = i; k <= j; k++)\n          sum += w[k];\n        sw[sum]++;\n      }\n    }\n    count = 0;\n    for (i = 0; i < n; i++) {\n      for (j = i; j < n; j++) {\n        sum = 0;\n        for (k = i; k <= j; k++)\n          sum += h[k];\n        if (sw[sum])\n          count += sw[sum];\n      }\n    }\n    printf(\"%d\\n\", count);\n  }\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n\nusing namespace std;\n\nint h[1024 * 1500];\nint w[1024 * 1500];\n\nint getInt() {\n  int c = getchar();\n  int ret = 0;\n  while (!isdigit(c))\n    c = getchar();\n  while (isdigit(c)) {\n    ret += c - '0';\n    c = getchar();\n  }\n  return ret;\n}\n\nint main() {\n  int n, m;\n  while (n = getInt(), m = getInt(), n + m) {\n    int hh[n];\n    int ww[m];\n    int mm = 0;\n\n    for (int i = 0; i < n; i++)\n      hh[i] = getInt();\n    for (int i = 0; i < m; i++)\n      ww[i] = getInt();\n\n    for (int i = 0; i < n; i++) {\n      int sum = 0;\n      for (int j = i; j < n; j++) {\n        sum += hh[j];\n        h[sum]++;\n      }\n      mm = max(mm, sum);\n    }\n    for (int i = 0; i < m; i++) {\n      int sum = 0;\n      for (int j = i; j < m; j++) {\n        sum += ww[j];\n        if (sum > mm)\n          break;\n        w[sum]++;\n      }\n    }\n    long long ans = 0;\n    for (int i = 0; i <= mm; i++) {\n      if (w[i] | h[i]) {\n        ans += (long long)w[i] * h[i];\n        w[i] = h[i] = 0;\n      }\n    }\n\n    cout << ans << endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n\nusing namespace std;\n\nint h[1024 * 1500];\nint w[1024 * 1500];\n\nint getInt() {\n  int c = getchar();\n  int ret = 0;\n  while (!isdigit(c))\n    c = getchar();\n  while (isdigit(c)) {\n    ret *= 10;\n    ret += c - '0';\n    c = getchar();\n  }\n  return ret;\n}\n\nint main() {\n  int n, m;\n  while (n = getInt(), m = getInt(), n + m) {\n    int hh[n];\n    int ww[m];\n    int mm = 0;\n\n    for (int i = 0; i < n; i++)\n      hh[i] = getInt();\n    for (int i = 0; i < m; i++)\n      ww[i] = getInt();\n\n    for (int i = 0; i < n; i++) {\n      int sum = 0;\n      for (int j = i; j < n; j++) {\n        sum += hh[j];\n        h[sum]++;\n      }\n      mm = max(mm, sum);\n    }\n    for (int i = 0; i < m; i++) {\n      int sum = 0;\n      for (int j = i; j < m; j++) {\n        sum += ww[j];\n        if (sum > mm)\n          break;\n        w[sum]++;\n      }\n    }\n    long long ans = 0;\n    for (int i = 0; i <= mm; i++) {\n      if (w[i] | h[i]) {\n        ans += (long long)w[i] * h[i];\n        w[i] = h[i] = 0;\n      }\n    }\n\n    cout << ans << endl;\n  }\n  return 0;\n}","change":"insert","i1":16,"i2":16,"j1":16,"j2":17,"error":"TLE","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nbool solve() {\n  int n, m;\n  cin >> n >> m;\n  if (n == 0 && m == 0)\n    return false;\n  vector<int> h(n + 1), w(m + 1);\n  for (int i = 1; i <= n; i++) {\n    cin >> h[i];\n    h[i] += h[i - 1];\n  }\n  for (int i = 1; i <= m; i++) {\n    cin >> w[i];\n    w[i] += w[i - 1];\n  }\n\n  vector<int> hei(2001);\n  for (int i = 0; i <= n; i++) {\n    for (int j = i + 1; j <= n; j++) {\n      hei[h[j] - h[i]]++;\n    }\n  }\n\n  int cnt = 0;\n  for (int i = 0; i <= m; i++) {\n    for (int j = i + 1; j <= m; j++) {\n      cnt += hei[w[j] - w[i]];\n    }\n  }\n  cout << cnt << endl;\n  return true;\n}\n\nint main(void) {\n  while (solve()) {\n  }\n  return 0;\n}\n\n\/\/????????????","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nbool solve() {\n  int n, m;\n  cin >> n >> m;\n  if (n == 0 && m == 0)\n    return false;\n  vector<int> h(n + 1), w(m + 1);\n  for (int i = 1; i <= n; i++) {\n    cin >> h[i];\n    h[i] += h[i - 1];\n  }\n  for (int i = 1; i <= m; i++) {\n    cin >> w[i];\n    w[i] += w[i - 1];\n  }\n\n  vector<int> hei(1500001);\n  for (int i = 0; i <= n; i++) {\n    for (int j = i + 1; j <= n; j++) {\n      hei[h[j] - h[i]]++;\n    }\n  }\n\n  int cnt = 0;\n  for (int i = 0; i <= m; i++) {\n    for (int j = i + 1; j <= m; j++) {\n      cnt += hei[w[j] - w[i]];\n    }\n  }\n  cout << cnt << endl;\n  return true;\n}\n\nint main(void) {\n  while (solve()) {\n  }\n  return 0;\n}\n\n\/\/????????????","change":"replace","i1":20,"i2":21,"j1":20,"j2":21,"error":"0","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n#define inf 1e9\n#define ll long long\n#define ull unsigned long long\n#define M 1000000007\n#define P pair<int, int>\n#define PLL pair<ll, ll>\n#define FOR(i, m, n) for (int i = m; i < n; i++)\n#define RFOR(i, m, n) for (int i = m; i >= n; i--)\n#define rep(i, n) FOR(i, 0, n)\n#define rrep(i, n) RFOR(i, n, 0)\nconst int vx[4] = {0, 1, 0, -1};\nconst int vy[4] = {1, 0, -1, 0};\n#define PI 3.14159265\n\nvoid search(int n, int m) {\n  int h[2000], w[2000];\n\n  rep(i, n) { cin >> h[i]; }\n  rep(i, m) { cin >> w[i]; }\n\n  map<int, int> a, b;\n\n  rep(i, n) {\n    int sum = 0;\n    FOR(j, i, n) {\n      sum += h[j];\n      a[sum]++;\n    }\n  }\n  rep(i, m) {\n    int sum = 0;\n    FOR(j, i, m) {\n      sum += w[j];\n      b[sum]++;\n    }\n  }\n\n  int ans = 0;\n\n  rep(i, 1e6) { ans += a[i] * b[i]; }\n\n  cout << ans << endl;\n}\n\nint main() {\n  int n, m;\n\n  while (1) {\n    cin >> n >> m;\n    if (n == 0)\n      break;\n\n    search(n, m);\n  }\n\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n#define inf 1e9\n#define ll long long\n#define ull unsigned long long\n#define M 1000000007\n#define P pair<int, int>\n#define PLL pair<ll, ll>\n#define FOR(i, m, n) for (int i = m; i < n; i++)\n#define RFOR(i, m, n) for (int i = m; i >= n; i--)\n#define rep(i, n) FOR(i, 0, n)\n#define rrep(i, n) RFOR(i, n, 0)\nconst int vx[4] = {0, 1, 0, -1};\nconst int vy[4] = {1, 0, -1, 0};\n#define PI 3.14159265\n\nvoid search(int n, int m) {\n  int h[2000], w[2000];\n\n  rep(i, n) { cin >> h[i]; }\n  rep(i, m) { cin >> w[i]; }\n\n  map<int, int> a, b;\n\n  rep(i, n) {\n    int sum = 0;\n    FOR(j, i, n) {\n      sum += h[j];\n      a[sum]++;\n    }\n  }\n  rep(i, m) {\n    int sum = 0;\n    FOR(j, i, m) {\n      sum += w[j];\n      b[sum]++;\n    }\n  }\n\n  int ans = 0;\n\n  for (auto itr = a.begin(); itr != a.end(); itr++) {\n    ans += itr->second * b[itr->first];\n  }\n\n  cout << ans << endl;\n}\n\nint main() {\n  int n, m;\n\n  while (1) {\n    cin >> n >> m;\n    if (n == 0)\n      break;\n\n    search(n, m);\n  }\n\n  return 0;\n}\n","change":"replace","i1":41,"i2":42,"j1":41,"j2":44,"error":"TLE","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))\nusing ll = long long;\n\nint main() {\n\n  int n, m;\n  while (cin >> n >> m and (n or m)) {\n\n    int h[1001], w[1001];\n    vector<int> hh(1500001, 0), ww(1500001, 0);\n\n    rep(i, n) cin >> h[i];\n    rep(i, m) cin >> w[i];\n\n    rep(i, n) {\n      int s = 0;\n      for (int j = i; j < n; ++j) {\n        s += h[j];\n        hh[s]++;\n      }\n    }\n\n    rep(i, m) {\n      int s = 0;\n      for (int j = i; j < m; ++j) {\n        s += w[j];\n        ww[s]++;\n      }\n    }\n\n    int ans = 0;\n    rep(i, 1500001) { ans += hh[i] * ww[i]; }\n\n    cout << ans << endl;\n  }\n\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))\nusing ll = long long;\n\nint main() {\n\n  int n, m;\n  while (cin >> n >> m and (n or m)) {\n\n    int h[1501], w[1501];\n    vector<int> hh(1500001, 0), ww(1500001, 0);\n\n    rep(i, n) cin >> h[i];\n    rep(i, m) cin >> w[i];\n\n    rep(i, n) {\n      int s = 0;\n      for (int j = i; j < n; ++j) {\n        s += h[j];\n        hh[s]++;\n      }\n    }\n\n    rep(i, m) {\n      int s = 0;\n      for (int j = i; j < m; ++j) {\n        s += w[j];\n        ww[s]++;\n      }\n    }\n\n    int ans = 0;\n    rep(i, 1500001) { ans += hh[i] * ww[i]; }\n\n    cout << ans << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":10,"i2":11,"j1":10,"j2":11,"error":"0","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\nconst int INF = 1000000000;\n#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)\n#define rep(i, n) REP(i, 0, n)\nint main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n  int N, M;\n  while (cin >> N >> M && N) {\n    vector<int> h(N + 1), w(M + 1);\n    h[0] = 0, w[0] = 0;\n    rep(i, N) cin >> h[i + 1];\n    rep(i, M) cin >> w[i + 1];\n    rep(i, N) h[i + 1] += h[i];\n    rep(i, M) w[i + 1] += w[i];\n    vector<int> hs(h.back() + 1, 0), ws(w.back() + 1, 0);\n    rep(i, N) REP(j, i + 1, N + 1) hs[h[j] - h[i]]++;\n    rep(i, M) REP(j, i + 1, M + 1) ws[w[j] - w[i]]++;\n    int ans = 0;\n    rep(i, max(h.back(), w.back()) + 1) ans += hs[i] * ws[i];\n    cout << ans << endl;\n  }\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\nconst int INF = 1000000000;\n#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)\n#define rep(i, n) REP(i, 0, n)\nint main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n  int N, M;\n  while (cin >> N >> M && N) {\n    vector<int> h(N + 1), w(M + 1);\n    h[0] = 0, w[0] = 0;\n    rep(i, N) cin >> h[i + 1];\n    rep(i, M) cin >> w[i + 1];\n    rep(i, N) h[i + 1] += h[i];\n    rep(i, M) w[i + 1] += w[i];\n    vector<int> hs(h.back() + 1, 0), ws(w.back() + 1, 0);\n    rep(i, N) REP(j, i + 1, N + 1) hs[h[j] - h[i]]++;\n    rep(i, M) REP(j, i + 1, M + 1) ws[w[j] - w[i]]++;\n    int ans = 0;\n    rep(i, min(h.back(), w.back()) + 1) ans += hs[i] * ws[i];\n    cout << ans << endl;\n  }\n  return 0;\n}","change":"replace","i1":21,"i2":22,"j1":21,"j2":22,"error":"0","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Memory Limit Exceeded","original_src":"#include <iostream>\n#include <map>\n#include <vector>\n\nusing namespace std;\n\nint combi(int n) { return n * (n - 1) \/ 2; }\n\nint main() {\n  int n, m;\n  while (cin >> n >> m, n || m) {\n    vector<int> x, y;\n    x.push_back(0);\n    y.push_back(0);\n\n    for (int i = 0; i < n; i++) {\n      int h;\n      cin >> h;\n      h += y[i];\n      y.push_back(h);\n    }\n\n    for (int i = 0; i < m; i++) {\n      int w;\n      cin >> w;\n      w += x[i];\n      y.push_back(w);\n    }\n    \/\/ y=x+b \u2192 y-x=b\u3068\u306a\u308b\n    map<int, int> cnt;\n    for (int i = 0; i < n + 1; i++) {\n      for (int j = 0; j < m + 1; j++) {\n        int diff = y[i] - x[j];\n        cnt[diff]++;\n      }\n    }\n\n    \/\/ \u5168\u63a2\u7d22\n    int ans = 0;\n    for (int i = -x[m]; i < y[n] + 1; i++) {\n      ans += combi(cnt[i]);\n    }\n\n    cout << ans << endl;\n  }\n}","changed_src":"#include <iostream>\n#include <map>\n#include <vector>\n\nusing namespace std;\n\nint combi(int n) { return n * (n - 1) \/ 2; }\n\nint main() {\n  int n, m;\n  while (cin >> n >> m, n || m) {\n    vector<int> x, y;\n    x.push_back(0);\n    y.push_back(0);\n\n    for (int i = 0; i < n; i++) {\n      int h;\n      cin >> h;\n      h += y[i];\n      y.push_back(h);\n    }\n\n    for (int i = 0; i < m; i++) {\n      int w;\n      cin >> w;\n      w += x[i];\n      x.push_back(w);\n    }\n    \/\/ y=x+b \u2192 y-x=b\u3068\u306a\u308b\n    map<int, int> cnt;\n    for (int i = 0; i < n + 1; i++) {\n      for (int j = 0; j < m + 1; j++) {\n        int diff = y[i] - x[j];\n        cnt[diff]++;\n      }\n    }\n\n    \/\/ \u5168\u63a2\u7d22\n    int ans = 0;\n    for (int i = -x[m]; i < y[n] + 1; i++) {\n      ans += combi(cnt[i]);\n    }\n\n    cout << ans << endl;\n  }\n}","change":"replace","i1":26,"i2":27,"j1":26,"j2":27,"error":"MLE","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <vector>\n#define fi first\n#define se second\n#define fcout(n) cout << fixed << setprecision((n))\n#define cinl(str) getline(cin, (str))\nusing namespace std;\nbool value(int y, int x, int R, int C) {\n  return 0 <= y && y < R && 0 <= x && x < C;\n}\ntypedef pair<int, int> pii;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<long long> vll;\ntypedef vector<vi> vvi;\ndouble pie = acos(-1);\nint INF = 1000000007;\nint dx[4] = {0, -1, 0, 1};\nint dy[4] = {-1, 0, 1, 0};\n\nlong long hsum2[1500005], wsum2[1500005];\n\nint main() {\n  int n, m;\n  long long ans = 0;\n  int h[1505], w[1505];\n  long long hsum1[1505], wsum1[1505];\n  while (true) {\n    cin >> n >> m;\n    if (n + m == 0)\n      return 0;\n    else {\n      for (int i = 0; i < 1505; i++) {\n        hsum1[i] = 0;\n        wsum1[i] = 0;\n      }\n      fill(hsum2, hsum2 + 1500005, 0);\n      fill(wsum2, wsum2 + 1500005, 0);\n\n      for (int i = 0; i < n; i++) {\n        cin >> h[i];\n        if (i == 0) {\n          hsum1[i] += h[i];\n        } else {\n          hsum1[i] = hsum1[i - 1] + h[i];\n        }\n      }\n      for (int i = 0; i < m; i++) {\n        cin >> w[i];\n        if (i == 0) {\n          wsum1[i] += w[i];\n        } else {\n          wsum1[i] += wsum1[i - 1] + w[i];\n        }\n      }\n      for (int i = 0; i < n; i++) {\n        hsum2[hsum1[i]]++;\n        for (int j = i + 1; j < n; j++) {\n          hsum2[hsum1[j] - hsum1[i]]++;\n        }\n      }\n\n      for (int i = 0; i < m; i++) {\n        wsum2[wsum1[i]]++;\n        for (int j = 0; j < m; j++) {\n          wsum2[wsum1[j] - wsum1[i]]++;\n        }\n      }\n    }\n    for (int i = 0; i < 1500005; i++) {\n      ans += hsum2[i] * wsum2[i];\n    }\n    cout << ans << endl;\n    ans = 0;\n  }\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <vector>\n#define fi first\n#define se second\n#define fcout(n) cout << fixed << setprecision((n))\n#define cinl(str) getline(cin, (str))\nusing namespace std;\nbool value(int y, int x, int R, int C) {\n  return 0 <= y && y < R && 0 <= x && x < C;\n}\ntypedef pair<int, int> pii;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<long long> vll;\ntypedef vector<vi> vvi;\ndouble pie = acos(-1);\nint INF = 1000000007;\nint dx[4] = {0, -1, 0, 1};\nint dy[4] = {-1, 0, 1, 0};\n\nlong long hsum2[1500005], wsum2[1500005];\n\nint main() {\n  int n, m;\n  long long ans = 0;\n  int h[1505], w[1505];\n  long long hsum1[1505], wsum1[1505];\n  while (true) {\n    cin >> n >> m;\n    if (n + m == 0)\n      return 0;\n    else {\n      for (int i = 0; i < 1505; i++) {\n        hsum1[i] = 0;\n        wsum1[i] = 0;\n      }\n      fill(hsum2, hsum2 + 1500005, 0);\n      fill(wsum2, wsum2 + 1500005, 0);\n\n      for (int i = 0; i < n; i++) {\n        cin >> h[i];\n        if (i == 0) {\n          hsum1[i] += h[i];\n        } else {\n          hsum1[i] = hsum1[i - 1] + h[i];\n        }\n      }\n      for (int i = 0; i < m; i++) {\n        cin >> w[i];\n        if (i == 0) {\n          wsum1[i] += w[i];\n        } else {\n          wsum1[i] += wsum1[i - 1] + w[i];\n        }\n      }\n      for (int i = 0; i < n; i++) {\n        hsum2[hsum1[i]]++;\n        for (int j = i + 1; j < n; j++) {\n          hsum2[hsum1[j] - hsum1[i]]++;\n        }\n      }\n\n      for (int i = 0; i < m; i++) {\n        wsum2[wsum1[i]]++;\n        for (int j = i + 1; j < m; j++) {\n          wsum2[wsum1[j] - wsum1[i]]++;\n        }\n      }\n    }\n    for (int i = 0; i < 1500005; i++) {\n      ans += hsum2[i] * wsum2[i];\n    }\n    cout << ans << endl;\n    ans = 0;\n  }\n}","change":"replace","i1":75,"i2":76,"j1":75,"j2":76,"error":"0","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\n#define rep(i, n) for (int i = 0; i < n; i++)\nusing namespace std;\n\nint s1[2000], s2[2000];\nint main() {\n  int n, m;\n  while (scanf(\"%d%d\", &n, &m), n) {\n    rep(i, n) scanf(\"%d\", &s1[i + 1]);\n    rep(i, m) scanf(\"%d\", &s2[i + 1]);\n    for (int i = 1; i <= n; i++)\n      s1[i] += s1[i - 1];\n    for (int i = 1; i <= m; i++)\n      s2[i] += s2[i - 1];\n    int cnt = 0;\n    rep(i, n + 1) rep(j, m + 1) rep(k, i) rep(l, j) {\n      if (s1[i] - s1[k] == s2[j] - s2[l])\n        cnt++;\n    }\n    printf(\"%d\\n\", cnt);\n  }\n}","changed_src":"#include <bits\/stdc++.h>\n#define rep(i, n) for (int i = 0; i < n; i++)\nusing namespace std;\n\nint s1[2000], s2[2000];\nint main() {\n  int n, m;\n  while (scanf(\"%d%d\", &n, &m), n) {\n    rep(i, n) scanf(\"%d\", &s1[i + 1]);\n    rep(i, m) scanf(\"%d\", &s2[i + 1]);\n    for (int i = 1; i <= n; i++)\n      s1[i] += s1[i - 1];\n    for (int i = 1; i <= m; i++)\n      s2[i] += s2[i - 1];\n    int cnt = 0;\n    map<int, int> mp1, mp2;\n    rep(i, n + 1) rep(j, i) mp1[s1[i] - s1[j]]++;\n    rep(i, m + 1) rep(j, i) mp2[s2[i] - s2[j]]++;\n    for (auto p : mp1) {\n      cnt += p.second * mp2[p.first];\n    }\n    printf(\"%d\\n\", cnt);\n  }\n}","change":"replace","i1":15,"i2":18,"j1":15,"j2":20,"error":"TLE","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Memory Limit Exceeded","original_src":"#include <map>\n#include <stdio.h>\n#include <vector>\n\nauto solve(int N, int M) -> int {\n  using namespace std;\n  vector<int> h(N);\n  vector<int> w(M);\n\n  for (int i = 0; i < N; i++) {\n    int x;\n    scanf(\"%d\", &x);\n    h[i] = x;\n  }\n  for (int i = 0; i < M; i++) {\n    int x;\n    scanf(\"%d\", &x);\n    w[i] = x;\n  }\n\n  map<int, int> &eh = *(new map<int, int>());\n  map<int, int> &ew = *(new map<int, int>());\n  for (int i = 0; i < N; i++) {\n    int sum = 0;\n    for (int j = i; j < N; j++) {\n      sum += h[j];\n      if (eh.find(sum) != ew.end())\n        eh[sum]++;\n      else\n        eh[sum] = 1;\n    }\n  }\n  for (int i = 0; i < M; i++) {\n    int sum = 0;\n    for (int j = i; j < M; j++) {\n      sum += w[j];\n      if (ew.find(sum) != ew.end())\n        ew[sum]++;\n      else\n        ew[sum] = 1;\n    }\n  }\n\n  int ans = 0;\n  for (auto p : eh) {\n    if (ew.find(p.first) != ew.end())\n      ans += p.second * ew[p.first];\n  }\n\n  return ans;\n}\n\nauto main() -> int {\n  int n, m;\n  while (1) {\n    scanf(\"%d%d\", &n, &m);\n    if (!(n | m))\n      break;\n    printf(\"%d\\n\", solve(n, m));\n  }\n}","changed_src":"#include <map>\n#include <stdio.h>\n#include <vector>\n\nauto solve(int N, int M) -> int {\n  using namespace std;\n  vector<int> h(N);\n  vector<int> w(M);\n\n  for (int i = 0; i < N; i++) {\n    int x;\n    scanf(\"%d\", &x);\n    h[i] = x;\n  }\n  for (int i = 0; i < M; i++) {\n    int x;\n    scanf(\"%d\", &x);\n    w[i] = x;\n  }\n\n  map<int, int> eh;\n  map<int, int> ew;\n  for (int i = 0; i < N; i++) {\n    int sum = 0;\n    for (int j = i; j < N; j++) {\n      sum += h[j];\n      if (eh.find(sum) != ew.end())\n        eh[sum]++;\n      else\n        eh[sum] = 1;\n    }\n  }\n  for (int i = 0; i < M; i++) {\n    int sum = 0;\n    for (int j = i; j < M; j++) {\n      sum += w[j];\n      if (ew.find(sum) != ew.end())\n        ew[sum]++;\n      else\n        ew[sum] = 1;\n    }\n  }\n\n  int ans = 0;\n  for (auto p : eh) {\n    if (ew.find(p.first) != ew.end())\n      ans += p.second * ew[p.first];\n  }\n\n  return ans;\n}\n\nauto main() -> int {\n  int n, m;\n  while (1) {\n    scanf(\"%d%d\", &n, &m);\n    if (!(n | m))\n      break;\n    printf(\"%d\\n\", solve(n, m));\n  }\n}","change":"replace","i1":20,"i2":22,"j1":20,"j2":22,"error":"MLE","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long i64;\ntypedef long double ld;\ntypedef pair<i64, i64> P;\n#define rep(i, s, e) for (int i = (s); i <= (e); i++)\n\nint n;\nint m;\n\nint hmp[1500 * 1000 + 1];\nint wmp[1500 * 1000 + 1];\n\nint main() {\n  while (cin >> n >> m, n) {\n    fill(hmp, hmp + 1 + 1500 * 1000, 0);\n    fill(wmp, wmp + 1 + 1500 * 1000, 0);\n\n    vector<int> h(n + 1, 0), w(n + 1, 0);\n\n    for (int i = 1; i <= n; i++) {\n      cin >> h[i];\n      h[i] += h[i - 1];\n    }\n    for (int i = 1; i <= m; i++) {\n      cin >> w[i];\n      w[i] += w[i - 1];\n    }\n\n    for (int i = 0; i <= n; i++) {\n      for (int j = i + 1; j <= n; j++) {\n        int len = h[j] - h[i];\n        hmp[len]++;\n      }\n    }\n    for (int i = 0; i <= m; i++) {\n      for (int j = i + 1; j <= m; j++) {\n        int len = w[j] - w[i];\n        wmp[len]++;\n      }\n    }\n\n    i64 result = 0;\n\n    for (int i = 1; i <= 1500 * 1000; i++) {\n      result += hmp[i] * wmp[i];\n    }\n    cout << result << endl;\n  }\n}\n","changed_src":"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long i64;\ntypedef long double ld;\ntypedef pair<i64, i64> P;\n#define rep(i, s, e) for (int i = (s); i <= (e); i++)\n\nint n;\nint m;\n\nint hmp[1500 * 1000 + 1];\nint wmp[1500 * 1000 + 1];\n\nint main() {\n  while (cin >> n >> m, n) {\n    fill(hmp, hmp + 1 + 1500 * 1000, 0);\n    fill(wmp, wmp + 1 + 1500 * 1000, 0);\n\n    vector<int> h(n + 1, 0), w(m + 1, 0);\n\n    for (int i = 1; i <= n; i++) {\n      cin >> h[i];\n      h[i] += h[i - 1];\n    }\n    for (int i = 1; i <= m; i++) {\n      cin >> w[i];\n      w[i] += w[i - 1];\n    }\n\n    for (int i = 0; i <= n; i++) {\n      for (int j = i + 1; j <= n; j++) {\n        int len = h[j] - h[i];\n        hmp[len]++;\n      }\n    }\n    for (int i = 0; i <= m; i++) {\n      for (int j = i + 1; j <= m; j++) {\n        int len = w[j] - w[i];\n        wmp[len]++;\n      }\n    }\n\n    i64 result = 0;\n\n    for (int i = 1; i <= 1500 * 1000; i++) {\n      result += hmp[i] * wmp[i];\n    }\n    cout << result << endl;\n  }\n}\n","change":"replace","i1":25,"i2":26,"j1":25,"j2":26,"error":"0","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define out(S) cout << (S) << endl;\n#define ShowAll(collection)                                                    \\\n  for (auto i : collection) {                                                  \\\n    out(i);                                                                    \\\n  }\n#define beginend(v) v.begin(), v.end()\n\nusing pii = pair<int, int>;\nusing ll = long long;\nusing ull = unsigned long long;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvc = vector<vector<char>>;\nusing ti3 = tuple<int, int, int>;\ntemplate <typename T> void removeAt(vector<T> &v, int index) {\n  v.erase(v.begin() + index);\n}\n\nint solve(int n, int m) {\n  vi w(m + 1, 0), h(n + 1, 0);\n  rep(i, n) cin >> h[i + 1];\n  rep(i, m) cin >> w[i + 1];\n\n  rep(i, n) h[i + 1] += h[i];\n  rep(i, m) w[i + 1] += w[i];\n\n  map<int, int> hm, wm;\n  rep(i, n + 1) for (int j = i + 1; j <= n; ++j) hm[h[j] - h[i]]++;\n  rep(i, m + 1) for (int j = i + 1; j <= m; ++j) wm[w[j] - w[i]]++;\n\n  int ans = 0;\n  for (auto hh : hm) {\n    int hk, hv;\n    tie(hk, hv) = hh;\n    for (auto ww : wm) {\n      int wk, wv;\n      tie(wk, wv) = ww;\n      if (hk == wk)\n        ans += wv * hv;\n    }\n  }\n  return ans;\n}\n\nint main() {\n  int N, M;\n  while (cin >> N >> M, N | M) {\n    out(solve(N, M));\n  }\n}\n","changed_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define out(S) cout << (S) << endl;\n#define ShowAll(collection)                                                    \\\n  for (auto i : collection) {                                                  \\\n    out(i);                                                                    \\\n  }\n#define beginend(v) v.begin(), v.end()\n\nusing pii = pair<int, int>;\nusing ll = long long;\nusing ull = unsigned long long;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvc = vector<vector<char>>;\nusing ti3 = tuple<int, int, int>;\ntemplate <typename T> void removeAt(vector<T> &v, int index) {\n  v.erase(v.begin() + index);\n}\n\nint solve(int n, int m) {\n  vi w(m + 1, 0), h(n + 1, 0);\n  rep(i, n) cin >> h[i + 1];\n  rep(i, m) cin >> w[i + 1];\n\n  rep(i, n) h[i + 1] += h[i];\n  rep(i, m) w[i + 1] += w[i];\n\n  map<int, int> hm, wm;\n  rep(i, n + 1) for (int j = i + 1; j <= n; ++j) hm[h[j] - h[i]]++;\n  rep(i, m + 1) for (int j = i + 1; j <= m; ++j) wm[w[j] - w[i]]++;\n\n  int ans = 0;\n  rep(i, max(h[n], w[n]) + 1) ans += (hm[i] * wm[i]);\n  return ans;\n}\n\nint main() {\n  int N, M;\n  while (cin >> N >> M, N | M) {\n    out(solve(N, M));\n  }\n}\n","change":"replace","i1":36,"i2":46,"j1":36,"j2":37,"error":"TLE","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\n#define reps(i, f, n) for (int i = f; i < int(n); i++)\n#define rep(i, n) reps(i, 0, n)\n\nconst int N = 100;\n\nint h, w;\nint A[N];\nint B[N];\n\nvoid init() {}\n\nbool input() {\n  cin >> h >> w;\n  if (h == 0)\n    return 0;\n  rep(i, h) cin >> A[i];\n  rep(i, w) cin >> B[i];\n  return true;\n}\n\nint solve() {\n  int C[N] = {0};\n  int D[N] = {0};\n  rep(i, h) { C[i + 1] = C[i] + A[i]; }\n  rep(i, w) { D[i + 1] = D[i] + B[i]; }\n\n  map<int, int> sum;\n  rep(i, h) {\n    reps(j, i, h) {\n      int s = C[j + 1] - C[i];\n      sum[s]++;\n      \/\/ printf(\"s %d  %d\\n\",s,sum[s]);\n    }\n  }\n\n  int ans = 0;\n  rep(i, w) {\n    reps(j, i, w) {\n      int s = D[j + 1] - D[i];\n      ans += sum[s];\n      \/\/ printf(\"g %d  %d\\n\",s,sum[s]);\n    }\n  }\n\n  return ans;\n}\nint main() {\n  while (init(), input())\n    printf(\"%d\\n\", solve());\n}","changed_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\n#define reps(i, f, n) for (int i = f; i < int(n); i++)\n#define rep(i, n) reps(i, 0, n)\n\nconst int N = 1600;\n\nint h, w;\nint A[N];\nint B[N];\n\nvoid init() {}\n\nbool input() {\n  cin >> h >> w;\n  if (h == 0)\n    return 0;\n  rep(i, h) cin >> A[i];\n  rep(i, w) cin >> B[i];\n  return true;\n}\n\nint solve() {\n  int C[N] = {0};\n  int D[N] = {0};\n  rep(i, h) { C[i + 1] = C[i] + A[i]; }\n  rep(i, w) { D[i + 1] = D[i] + B[i]; }\n\n  map<int, int> sum;\n  rep(i, h) {\n    reps(j, i, h) {\n      int s = C[j + 1] - C[i];\n      sum[s]++;\n      \/\/ printf(\"s %d  %d\\n\",s,sum[s]);\n    }\n  }\n\n  int ans = 0;\n  rep(i, w) {\n    reps(j, i, w) {\n      int s = D[j + 1] - D[i];\n      ans += sum[s];\n      \/\/ printf(\"g %d  %d\\n\",s,sum[s]);\n    }\n  }\n\n  return ans;\n}\nint main() {\n  while (init(), input())\n    printf(\"%d\\n\", solve());\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\ntypedef tuple<int, int> duo;\nconst int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};\nconst int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};\nconst int Mod = 1000000000 + 0;\n\/\/{{{ templates\n#define TT_ template <typename T> inline\n#define TTF_ template <typename T, typename F> inline\nTT_ T sq(T x) { return x * x; }\nTT_ T In() {\n  T x;\n  cin >> x;\n  return x;\n}\nTT_ void Out(T &x) { cout << x; }\nTT_ void sort(T &v) { sort(begin(v), end(v)); }\nTT_ void revs(T &v) { reverse(begin(v), end(v)); }\nTT_ void uniq(T &v) {\n  sort(v);\n  v.erase(unique(begin(v), end(v)), end(v));\n}\nTT_ int ubnd(T &v, typename T::value_type x) {\n  return upper_bound(begin(v), end(v), x) - begin(v);\n}\nTT_ int lbnd(T &v, typename T::value_type x) {\n  return lower_bound(begin(v), end(v), x) - begin(v);\n}\nTTF_ void inpt(T &v, int n, F f) {\n  for (v.reserve(n); n--; v.emplace_back(f()))\n    ;\n}\nTTF_ void show(T &v, F f, string d = \" \", string e = \"\\n\") {\n  int i = 0;\n  for (auto &x : v)\n    i++ && (cout << d), f(x);\n  cout << e;\n}\nTT_ typename T::iterator minel(T &v) { return min_element(begin(v), end(v)); }\nTT_ typename T::iterator maxel(T &v) { return max_element(begin(v), end(v)); }\n\ninline void fast_io() {\n  ios_base::sync_with_stdio(0);\n  cin.tie(0);\n}\ninline int in() {\n  int x;\n  scanf(\"%d\", &x);\n  return x;\n}\ninline ll pow_mod(ll a, ll k, ll m) {\n  ll r = 1;\n  for (; k > 0; a = a * a % m, k >>= 1)\n    if (k & 1)\n      r = r * a % m;\n  return r;\n}\ninline ll mod_inv(ll a, ll p) { return pow_mod(a, p - 2, p); }\n\/\/}}} priority_queue queue deque front stringstream max_element min_element\n\/\/insert count make_tuple\n\nshort B[3000300];\nint H[2048], W[2048];\nint main() {\n  int N, M;\n  short K = 0;\n  while (N = in(), M = in()) {\n    K++;\n    for (int i = 1; i <= N; i++) {\n      H[i] = H[i - 1] + in();\n      B[H[i]] = K;\n    }\n    for (int i = 1; i <= M; i++) {\n      W[i] = W[i - 1] + in();\n    }\n    int ans = 0;\n    for (int y = 0, y_ = N; y < y_; y++) {\n      const int hy = H[y];\n      for (int x = 0, x_ = M; x < x_; x++) {\n        const int wx = W[x];\n        for (int z = x + 1, z_ = M; z <= z_; z++) {\n          int d = W[z] - wx;\n          ans += B[hy + d] == K;\n        }\n      }\n    }\n    printf(\"%d\\n\", ans);\n  }\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\ntypedef tuple<int, int> duo;\nconst int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};\nconst int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};\nconst int Mod = 1000000000 + 0;\n\/\/{{{ templates\n#define TT_ template <typename T> inline\n#define TTF_ template <typename T, typename F> inline\nTT_ T sq(T x) { return x * x; }\nTT_ T In() {\n  T x;\n  cin >> x;\n  return x;\n}\nTT_ void Out(T &x) { cout << x; }\nTT_ void sort(T &v) { sort(begin(v), end(v)); }\nTT_ void revs(T &v) { reverse(begin(v), end(v)); }\nTT_ void uniq(T &v) {\n  sort(v);\n  v.erase(unique(begin(v), end(v)), end(v));\n}\nTT_ int ubnd(T &v, typename T::value_type x) {\n  return upper_bound(begin(v), end(v), x) - begin(v);\n}\nTT_ int lbnd(T &v, typename T::value_type x) {\n  return lower_bound(begin(v), end(v), x) - begin(v);\n}\nTTF_ void inpt(T &v, int n, F f) {\n  for (v.reserve(n); n--; v.emplace_back(f()))\n    ;\n}\nTTF_ void show(T &v, F f, string d = \" \", string e = \"\\n\") {\n  int i = 0;\n  for (auto &x : v)\n    i++ && (cout << d), f(x);\n  cout << e;\n}\nTT_ typename T::iterator minel(T &v) { return min_element(begin(v), end(v)); }\nTT_ typename T::iterator maxel(T &v) { return max_element(begin(v), end(v)); }\n\ninline void fast_io() {\n  ios_base::sync_with_stdio(0);\n  cin.tie(0);\n}\ninline int in() {\n  int x;\n  scanf(\"%d\", &x);\n  return x;\n}\ninline ll pow_mod(ll a, ll k, ll m) {\n  ll r = 1;\n  for (; k > 0; a = a * a % m, k >>= 1)\n    if (k & 1)\n      r = r * a % m;\n  return r;\n}\ninline ll mod_inv(ll a, ll p) { return pow_mod(a, p - 2, p); }\n\/\/}}} priority_queue queue deque front stringstream max_element min_element\n\/\/insert count make_tuple\n\nshort B[3000300];\nint H[2048], W[2048];\nint main() {\n  int N, M;\n  short K = 0;\n  while (N = in(), M = in()) {\n    K++;\n    for (int i = 1; i <= N; i++) {\n      H[i] = H[i - 1] + in();\n      B[H[i]] = K;\n    }\n    for (int i = 1; i <= M; i++) {\n      W[i] = W[i - 1] + in();\n    }\n    int ans = 0;\n    for (int y = 0; y < N; y++) {\n      for (int x = 0; x < M; x++) {\n        for (int z = x + 1; z <= M; z++) {\n          int d = W[z] - W[x];\n          if (H[N] - H[y] < d)\n            break;\n          ans += B[H[y] + d] == K;\n        }\n      }\n    }\n    printf(\"%d\\n\", ans);\n  }\n  return 0;\n}","change":"replace","i1":80,"i2":87,"j1":80,"j2":87,"error":"TLE","stderr":""}
-{"problem_id":"p01140","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <map>\n#include <set>\n\nusing namespace std;\n\nint main() {\n  while (1) {\n    int N, M;\n    cin >> N >> M;\n    if (N == 0 && M == 0)\n      break;\n    int H[N], W[M];\n    for (int i = 0; i < N; i++) {\n      cin >> H[i];\n    }\n    for (int i = 0; i < M; i++) {\n      cin >> W[i];\n    }\n\n    set<int> v1, v2;\n    map<int, int> m1, m2;\n    for (int i = 0; i < N; i++) {\n      int bfr = 0;\n      for (int j = i; j < N; j++) {\n        int temp;\n        temp = bfr + H[j];\n        bfr = temp;\n        v1.insert(temp);\n        m1[temp]++;\n      }\n    }\n    for (int i = 0; i < M; i++) {\n      int bfr = 0;\n      for (int j = i; j < M; j++) {\n        int temp;\n        temp = bfr + W[j];\n        bfr = temp;\n        v2.insert(temp);\n        m2[temp]++;\n      }\n    }\n\n    int cnt = 0;\n    set<int>::iterator it1 = v1.begin();\n    while (it1 != v1.end()) {\n      set<int>::iterator it2 = v2.begin();\n      while (it2 != v2.end()) {\n        if (*it1 == *it2)\n          cnt += m1[*it1] * m2[*it2];\n        it2++;\n      }\n      it1++;\n    }\n    cout << cnt << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\n#include <map>\n#include <set>\n\nusing namespace std;\n\nint main() {\n  while (1) {\n    int N, M;\n    cin >> N >> M;\n    if (N == 0 && M == 0)\n      break;\n    int H[N], W[M];\n    for (int i = 0; i < N; i++) {\n      cin >> H[i];\n    }\n    for (int i = 0; i < M; i++) {\n      cin >> W[i];\n    }\n\n    set<int> v1, v2;\n    map<int, int> m1, m2;\n    for (int i = 0; i < N; i++) {\n      int bfr = 0;\n      for (int j = i; j < N; j++) {\n        int temp;\n        temp = bfr + H[j];\n        bfr = temp;\n        v1.insert(temp);\n        m1[temp]++;\n      }\n    }\n    for (int i = 0; i < M; i++) {\n      int bfr = 0;\n      for (int j = i; j < M; j++) {\n        int temp;\n        temp = bfr + W[j];\n        bfr = temp;\n        v2.insert(temp);\n        m2[temp]++;\n      }\n    }\n\n    int cnt = 0;\n    set<int>::iterator it1 = v1.begin();\n    while (it1 != v1.end()) {\n      set<int>::iterator it2;\n      it2 = v2.find(*it1);\n      if (it2 != v2.end())\n        cnt += m1[*it1] * m2[*it2];\n      it1++;\n    }\n    cout << cnt << endl;\n  }\n  return 0;\n}","change":"replace","i1":46,"i2":52,"j1":46,"j2":50,"error":"TLE","stderr":""}
-{"problem_id":"p01981","language":"Python","original_status":"Runtime Error","original_src":"while True:\n    a = list(map(str, input().split()))\n    if a[0] == \"0\":\n        break\n    elif int(a[1]) <= 30:\n        print(\" \".join(a))\n    elif int(a[1]) == 31 and int(a[2]) <= 4:\n        print(\" \".join(a))\n    else:\n        a[0] = \"?\"\n        s = int(a[1])\n        s -= 30\n        a[1] = str(s)\n        print(\" \".join(a))\n","changed_src":"while True:\n    a = list(map(str, input().split()))\n    if a[0] == \"#\":\n        break\n    elif int(a[1]) <= 30:\n        print(\" \".join(a))\n    elif int(a[1]) == 31 and int(a[2]) <= 4:\n        print(\" \".join(a))\n    else:\n        a[0] = \"?\"\n        s = int(a[1])\n        s -= 30\n        a[1] = str(s)\n        print(\" \".join(a))\n","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"IndexError: list index out of range","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p01981\/Python\/s158524109.py\", line 5, in <module>\n    elif int(a[1]) <= 30:\nIndexError: list index out of range\n"}
-{"problem_id":"p02235","language":"Python","original_status":"Time Limit Exceeded","original_src":"q = int(input())\nfor _ in range(q):\n    x = input()\n    y = input()\n    m = len(x)\n    n = len(y)\n    c = [0] * (n + 1)\n    for i in range(m):\n        tmp = x[i]\n        c_ = c[:]\n        for j in range(n):\n            if tmp == y[j]:\n                c[j + 1] = c_[j] + 1\n            elif c[j + 1] < c[j]:\n                c[j + 1] = c[j]\n    print(c[-1])\n","changed_src":"def lcs(x, y):\n    a = len(x)\n    b = len(y)\n    c1 = [0] * (b + 1)\n    for i in range(a):\n        e1 = x[i]\n        c2 = c1[:]\n        for j in range(b):\n            if e1 == y[j]:\n                c1[j + 1] = c2[j] + 1\n            elif c1[j + 1] < c1[j]:\n                c1[j + 1] = c1[j]\n    return c1[-1]\n\n\nn = int(input().rstrip())\nret = []\nfor i in range(n):\n    s1 = input().rstrip()\n    s2 = input().rstrip()\n    ret.append(lcs(s1, s2))\nprint(*ret, sep=\"\\n\")\n","change":"replace","i1":0,"i2":16,"j1":0,"j2":22,"error":"TLE","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\n#define rep(i, a, n) for (int i = a; i < n; i++)\n#define repr(i, a, n) for (int i = a; i >= n; i--)\n#define INF 999999999\n#define pb(a) push_back(a)\n\nusing namespace std;\ntypedef pair<int, int> pii;\ntypedef long long int ll;\ntypedef vector<pii> VP;\n\nint dy[] = {0, 0, 1, -1};\nint dx[] = {1, -1, 0, 0};\n\nint main() {\n  int num;\n  cin >> num;\n  rep(k, 0, num) {\n    string s1, s2;\n    cin >> s1 >> s2;\n\n    int dp\n        [101]\n        [101]; \/\/ s1???i??????????????\u00a7???s2???j??????????????\u00a7??\u00a7???LCS????\u00b1???????????????????\n    int n = s1.length();\n    int m = s2.length();\n    rep(i, 0, m + 1) dp[0][i] = 0;\n\n    rep(i, 0, n) {\n      rep(j, 0, m) {\n        if (s1[i] == s2[j])\n          dp[i + 1][j + 1] = dp[i][j] + 1;\n        else\n          dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);\n      }\n    }\n    cout << dp[n][m] << endl;\n  }\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\n#define rep(i, a, n) for (int i = a; i < n; i++)\n#define repr(i, a, n) for (int i = a; i >= n; i--)\n#define INF 999999999\n#define pb(a) push_back(a)\n\nusing namespace std;\ntypedef pair<int, int> pii;\ntypedef long long int ll;\ntypedef vector<pii> VP;\n\nint dy[] = {0, 0, 1, -1};\nint dx[] = {1, -1, 0, 0};\n\nint main() {\n  int num;\n  cin >> num;\n  rep(k, 0, num) {\n    string s1, s2;\n    cin >> s1 >> s2;\n\n    int dp\n        [1001]\n        [1001]; \/\/ s1???i??????????????\u00a7???s2???j??????????????\u00a7??\u00a7???LCS????\u00b1???????????????????\n    int n = s1.length();\n    int m = s2.length();\n    rep(i, 0, m + 1) dp[0][i] = 0;\n\n    rep(i, 0, n) {\n      rep(j, 0, m) {\n        if (s1[i] == s2[j])\n          dp[i + 1][j + 1] = dp[i][j] + 1;\n        else\n          dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);\n      }\n    }\n    cout << dp[n][m] << endl;\n  }\n  return 0;\n}","change":"replace","i1":22,"i2":24,"j1":22,"j2":24,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cmath>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\nconstexpr int MOD = 1000000007;\nconstexpr int INF = 2000000000;\nusing namespace std;\n\nint lcs(string x, string y) {\n  int c[10][10];\n  int m = x.size();\n  int n = y.size();\n  x = ' ' + x;\n  y = ' ' + y;\n  for (int i = 1; i <= m; i++)\n    c[i][0] = 0;\n  for (int j = 1; j <= n; j++)\n    c[0][j] = 0;\n  c[0][0] = 0;\n\n  for (int i = 1; i <= m; i++) {\n    for (int j = 1; j <= n; j++) {\n      if (x[i] == y[j]) {\n        c[i][j] = c[i - 1][j - 1] + 1;\n      } else {\n        c[i][j] = max(c[i - 1][j], c[i][j - 1]);\n      }\n    }\n  }\n  return c[m][n];\n}\n\nint main() {\n  int n;\n  cin >> n;\n  string a, b;\n  for (int i = 0; i < n; i++) {\n    cin >> a >> b;\n    cout << lcs(a, b) << endl;\n  }\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\nconstexpr int MOD = 1000000007;\nconstexpr int INF = 2000000000;\nusing namespace std;\n\nint lcs(string x, string y) {\n  int c[1200][1200];\n  int m = x.size();\n  int n = y.size();\n  x = ' ' + x;\n  y = ' ' + y;\n  for (int i = 1; i <= m; i++)\n    c[i][0] = 0;\n  for (int j = 1; j <= n; j++)\n    c[0][j] = 0;\n  c[0][0] = 0;\n\n  for (int i = 1; i <= m; i++) {\n    for (int j = 1; j <= n; j++) {\n      if (x[i] == y[j]) {\n        c[i][j] = c[i - 1][j - 1] + 1;\n      } else {\n        c[i][j] = max(c[i - 1][j], c[i][j - 1]);\n      }\n    }\n  }\n  return c[m][n];\n}\n\nint main() {\n  int n;\n  cin >> n;\n  string a, b;\n  for (int i = 0; i < n; i++) {\n    cin >> a >> b;\n    cout << lcs(a, b) << endl;\n  }\n}","change":"replace","i1":18,"i2":19,"j1":18,"j2":19,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\n#define mp make_pair\n#define pb push_back\n#define all(x) (x).begin(), (x).end()\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define repi(i, a, b) for (int i = (a); i < (b); i++)\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<bool> vb;\ntypedef vector<int> vi;\ntypedef vector<vb> vvb;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n\nconst int INF = 1 << 29;\nconst double EPS = 1e-9;\n\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};\nint dp[1000][1000];\nint main() {\n  int n;\n  cin >> n;\n  while (n--) {\n    memset(dp, 0, sizeof(dp));\n    string str1, str2;\n    cin >> str1 >> str2;\n    \/\/ int l =min(str1.length(),str2.length());\n    for (int i = 0; i < str1.length(); i++) {\n      for (int j = 0; j < str2.length(); j++) {\n        if (str1[i] == str2[j]) {\n          dp[i + 1][j + 1] = dp[i][j] + 1;\n        } else {\n          dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);\n        }\n      }\n    }\n    cout << dp[str1.length()][str2.length()] << endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\n#define mp make_pair\n#define pb push_back\n#define all(x) (x).begin(), (x).end()\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define repi(i, a, b) for (int i = (a); i < (b); i++)\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<bool> vb;\ntypedef vector<int> vi;\ntypedef vector<vb> vvb;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n\nconst int INF = 1 << 29;\nconst double EPS = 1e-9;\n\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};\nint dp[1050][1050];\nint main() {\n  int n;\n  cin >> n;\n  while (n--) {\n    memset(dp, 0, sizeof(dp));\n    string str1, str2;\n    cin >> str1 >> str2;\n    \/\/ int l =min(str1.length(),str2.length());\n    for (int i = 0; i < str1.length(); i++) {\n      for (int j = 0; j < str2.length(); j++) {\n        if (str1[i] == str2[j]) {\n          dp[i + 1][j + 1] = dp[i][j] + 1;\n        } else {\n          dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);\n        }\n      }\n    }\n    cout << dp[str1.length()][str2.length()] << endl;\n  }\n  return 0;\n}","change":"replace","i1":38,"i2":39,"j1":38,"j2":39,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <vector>\n\/\/ #include <chrono> \/\/1e+9\u3067\u5272\u308b auto end= chrono::system_clock::now()-st;\n\/\/ cout<<end.count()%1e+9<<endl;\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> LP;\ntypedef long double db;\n\n#define fr first\n#define sc second\n#define pb push_back\n#define rep(i, x) for (int i = 0; i < x; i++)\n#define rep1(i, x) for (int i = 1; i <= x; i++)\n#define rrep(i, x) for (int i = x - 1; i >= 0; i--)\n#define rrep1(i, x) for (int i = x; i > 0; i--)\n\nint q;\nstring s1, s2;\nint ans;\nint dp[150][150];\nint main() {\n  cin >> q;\n  rep(i, q) {\n    cin >> s1 >> s2;\n    rep(i, s1.size()) {\n      rep(j, s2.size()) { dp[i][j] = 0; }\n    }\n    if (s1[0] == s2[0])\n      dp[0][0] = 1;\n    rep1(i, s1.size() - 1) {\n      if (s1[i] == s2[0])\n        dp[i][0] = 1;\n      dp[i][0] = max(dp[i][0], dp[i - 1][0]);\n    }\n    rep1(i, s2.size() - 1) {\n      if (s1[0] == s2[i])\n        dp[0][i] = 1;\n      dp[0][i] = max(dp[0][i], dp[0][i - 1]);\n    }\n    rep1(i, s1.size() - 1) {\n      rep1(j, s2.size() - 1) {\n        dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);\n        if (s1[i] == s2[j])\n          dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 1);\n      }\n    }\n    cout << dp[s1.size() - 1][s2.size() - 1] << endl;\n  }\n}\n","changed_src":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <vector>\n\/\/ #include <chrono> \/\/1e+9\u3067\u5272\u308b auto end= chrono::system_clock::now()-st;\n\/\/ cout<<end.count()%1e+9<<endl;\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> LP;\ntypedef long double db;\n\n#define fr first\n#define sc second\n#define pb push_back\n#define rep(i, x) for (int i = 0; i < x; i++)\n#define rep1(i, x) for (int i = 1; i <= x; i++)\n#define rrep(i, x) for (int i = x - 1; i >= 0; i--)\n#define rrep1(i, x) for (int i = x; i > 0; i--)\n\nint q;\nstring s1, s2;\nint ans;\nint dp[1510][1501];\nint main() {\n  cin >> q;\n  rep(i, q) {\n    cin >> s1 >> s2;\n    rep(i, s1.size()) {\n      rep(j, s2.size()) { dp[i][j] = 0; }\n    }\n    if (s1[0] == s2[0])\n      dp[0][0] = 1;\n    rep1(i, s1.size() - 1) {\n      if (s1[i] == s2[0])\n        dp[i][0] = 1;\n      dp[i][0] = max(dp[i][0], dp[i - 1][0]);\n    }\n    rep1(i, s2.size() - 1) {\n      if (s1[0] == s2[i])\n        dp[0][i] = 1;\n      dp[0][i] = max(dp[0][i], dp[0][i - 1]);\n    }\n    rep1(i, s1.size() - 1) {\n      rep1(j, s2.size() - 1) {\n        dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);\n        if (s1[i] == s2[j])\n          dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 1);\n      }\n    }\n    cout << dp[s1.size() - 1][s2.size() - 1] << endl;\n  }\n}\n","change":"replace","i1":29,"i2":30,"j1":29,"j2":30,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nvoid fnInput(vector<string> &rvsStrX, vector<string> &rvsStrY) {\n  int nMaxSiz;\n  cin >> nMaxSiz;\n  rvsStrX.resize(nMaxSiz);\n  rvsStrY.resize(nMaxSiz);\n\n  for (int i = 0; i < nMaxSiz; ++i) {\n    cin >> rvsStrX[i] >> rvsStrY[i];\n    rvsStrX[i] = ' ' + rvsStrX[i];\n    rvsStrY[i] = ' ' + rvsStrY[i];\n  }\n}\n\nint fnLngCmnSubseq(const vector<string> &cnrvsStrX,\n                   const vector<string> &cnrvsStrY) {\n  vector<vector<int>> vvnLcsDP;\n  for (int i = 0; i < cnrvsStrX.size(); ++i) {\n    const int nMAXNX = cnrvsStrX[i].size();\n    const int nMAXNY = cnrvsStrY[i].size();\n\n    vvnLcsDP.shrink_to_fit();\n    vvnLcsDP.resize(nMAXNX, vector<int>(nMAXNY, 0));\n\n    for (int nx = 1; nx < nMAXNX; ++nx)\n      for (int ny = 1; ny < nMAXNY; ++ny)\n        if (cnrvsStrX[i][nx] == cnrvsStrY[i][ny])\n          vvnLcsDP[nx][ny] = vvnLcsDP[nx - 1][ny - 1] + 1;\n        else\n          vvnLcsDP[nx][ny] = max(vvnLcsDP[nx - 1][ny], vvnLcsDP[nx][ny - 1]);\n\n    cout << vvnLcsDP[nMAXNX - 1][nMAXNY - 1] << endl;\n  }\n}\n\nint main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n  vector<string> vsStrX, vsStrY;\n\n  fnInput(vsStrX, vsStrY);\n  fnLngCmnSubseq(vsStrX, vsStrY);\n  return 0;\n}","changed_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nvoid fnInput(vector<string> &rvsStrX, vector<string> &rvsStrY) {\n  int nMaxSiz;\n  cin >> nMaxSiz;\n  rvsStrX.resize(nMaxSiz);\n  rvsStrY.resize(nMaxSiz);\n\n  for (int i = 0; i < nMaxSiz; ++i) {\n    cin >> rvsStrX[i] >> rvsStrY[i];\n    rvsStrX[i] = ' ' + rvsStrX[i];\n    rvsStrY[i] = ' ' + rvsStrY[i];\n  }\n}\n\nint fnLngCmnSubseq(const vector<string> &cnrvsStrX,\n                   const vector<string> &cnrvsStrY) {\n  vector<vector<int>> vvnLcsDP;\n  for (int i = 0; i < cnrvsStrX.size(); ++i) {\n    const int nMAXNX = cnrvsStrX[i].size();\n    const int nMAXNY = cnrvsStrY[i].size();\n\n    vvnLcsDP.clear();\n    vvnLcsDP.resize(nMAXNX, vector<int>(nMAXNY, 0));\n\n    for (int nx = 1; nx < nMAXNX; ++nx)\n      for (int ny = 1; ny < nMAXNY; ++ny)\n        if (cnrvsStrX[i][nx] == cnrvsStrY[i][ny])\n          vvnLcsDP[nx][ny] = vvnLcsDP[nx - 1][ny - 1] + 1;\n        else\n          vvnLcsDP[nx][ny] = max(vvnLcsDP[nx - 1][ny], vvnLcsDP[nx][ny - 1]);\n\n    cout << vvnLcsDP[nMAXNX - 1][nMAXNY - 1] << endl;\n  }\n}\n\nint main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n  vector<string> vsStrX, vsStrY;\n\n  fnInput(vsStrX, vsStrY);\n  fnLngCmnSubseq(vsStrX, vsStrY);\n  return 0;\n}","change":"replace","i1":24,"i2":25,"j1":24,"j2":25,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <cstring>\n#include <iostream>\n#include <string>\n#define repi(i, a, b) for (int i = (a); i < (b); ++i)\n#define rep(i, a) repi(i, 0, a)\n#define clr(a, v) memset((a), (v), sizeof(a))\n\nint q;\nint dp[1000][1000];\nstd::string s, t;\n\nint rec(int i, int j) {\n  int &ret = dp[i][j];\n\n  if (~ret)\n    return ret;\n\n  if (i == s.size() || j == t.size())\n    return 0;\n\n  ret = 0;\n\n  if (s[i] == t[j])\n    ret = std::max(ret, rec(i + 1, j + 1) + 1);\n\n  ret = std::max(ret, std::max(rec(i + 1, j), rec(i, j + 1)));\n\n  return ret;\n}\n\nint main() {\n  std::cin >> q;\n  while (q--) {\n    std::cin >> s >> t;\n\n    clr(dp, -1);\n\n    std::cout << rec(0, 0) << std::endl;\n  }\n\n  return 0;\n}","changed_src":"#include <cstring>\n#include <iostream>\n#include <string>\n#define repi(i, a, b) for (int i = (a); i < (b); ++i)\n#define rep(i, a) repi(i, 0, a)\n#define clr(a, v) memset((a), (v), sizeof(a))\n\nint q;\nint dp[1001][1001];\nstd::string s, t;\n\nint rec(int i, int j) {\n  int &ret = dp[i][j];\n\n  if (~ret)\n    return ret;\n\n  if (i == s.size() || j == t.size())\n    return 0;\n\n  ret = 0;\n\n  if (s[i] == t[j])\n    ret = std::max(ret, rec(i + 1, j + 1) + 1);\n\n  ret = std::max(ret, std::max(rec(i + 1, j), rec(i, j + 1)));\n\n  return ret;\n}\n\nint main() {\n  std::cin >> q;\n  while (q--) {\n    std::cin >> s >> t;\n\n    clr(dp, -1);\n\n    std::cout << rec(0, 0) << std::endl;\n  }\n\n  return 0;\n}","change":"replace","i1":8,"i2":9,"j1":8,"j2":9,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <string>\n\nusing namespace std;\n\n\/\/ L[i][j] X[0]..X[i]??\u00a8X[0]..Y[j]???LCS\nint L[1000][1000] = {};\nint main() {\n  int testnum;\n  cin >> testnum;\n  for (int t = 0; t < testnum; ++t) {\n    string X, Y;\n    cin >> X >> Y;\n\n    for (int i = 1; i <= X.length(); ++i) {\n      for (int j = 1; j <= Y.length(); ++j) {\n        if (X[i - 1] == Y[j - 1])\n          L[i][j] = 1 + L[i - 1][j - 1];\n        else\n          L[i][j] = max(L[i][j - 1], L[i - 1][j]);\n      }\n    }\n\n    cout << L[X.length()][Y.length()] << endl;\n  }\n\n  return 0;\n}","changed_src":"#include <iostream>\n#include <string>\n\nusing namespace std;\n\n\/\/ L[i][j] X[0]..X[i]??\u00a8X[0]..Y[j]???LCS\nint L[1001][1001] = {};\nint main() {\n  int testnum;\n  cin >> testnum;\n  for (int t = 0; t < testnum; ++t) {\n    string X, Y;\n    cin >> X >> Y;\n\n    for (int i = 1; i <= X.length(); ++i) {\n      for (int j = 1; j <= Y.length(); ++j) {\n        if (X[i - 1] == Y[j - 1])\n          L[i][j] = 1 + L[i - 1][j - 1];\n        else\n          L[i][j] = max(L[i][j - 1], L[i - 1][j]);\n      }\n    }\n\n    cout << L[X.length()][Y.length()] << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\n#define REP(i, n) for (long long i = 0; i < n; ++i)\n#define FOR(i, a, b) for (long long i = a; i < b; ++i)\nusing namespace std;\nint main() {\n  int q;\n  scanf(\"%d\", &q);\n  string x, y;\n  REP(i, q) {\n    cin >> x >> y;\n    int dp[x.size() + 1][y.size() + 1];\n    fill(dp[0], dp[y.size()], -1);\n    REP(j, x.size() + 1) {\n      REP(k, y.size() + 1) {\n        if (j == 0 || k == 0)\n          dp[j][k] = 0;\n        else if (x[j] == y[k])\n          dp[j][k] = dp[j - 1][k - 1] + 1;\n        else\n          dp[j][k] = max(dp[j][k - 1], dp[j - 1][k]);\n      }\n    }\n    printf(\"%d\\n\", dp[x.size()][y.size()]);\n  }\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\n#define REP(i, n) for (long long i = 0; i < n; ++i)\n#define FOR(i, a, b) for (long long i = a; i < b; ++i)\nusing namespace std;\nint main() {\n  int q;\n  scanf(\"%d\", &q);\n  string x, y;\n  REP(i, q) {\n    cin >> x >> y;\n    int dp[x.size() + 1][y.size() + 1];\n    fill(dp[0], dp[x.size()], -1);\n    REP(j, x.size() + 1) dp[j][0] = 0;\n    REP(j, y.size() + 1) dp[0][j] = 0;\n    FOR(j, 1, x.size() + 1) {\n      FOR(k, 1, y.size() + 1) {\n        if (x[j - 1] == y[k - 1])\n          dp[j][k] = dp[j - 1][k - 1] + 1;\n        else\n          dp[j][k] = max(dp[j][k - 1], dp[j - 1][k]);\n      }\n    }\n    printf(\"%d\\n\", dp[x.size()][y.size()]);\n  }\n  return 0;\n}\n","change":"replace","i1":11,"i2":17,"j1":11,"j2":17,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nstring s, t;\nint dp[100][100];\n\nvoid solve() {\n  cin >> s >> t;\n  for (int i = 0; i < s.size(); i++) {\n    for (int j = 0; j < t.size(); j++) {\n      dp[i][j] =\n          (i < 1 || j < 1 ? 0 : dp[i - 1][j - 1]) + (s[i] == t[j] ? 1 : 0);\n      int a = (i < 1 ? 0 : dp[i - 1][j]);\n      int b = (j < 1 ? 0 : dp[i][j - 1]);\n      dp[i][j] = max(dp[i][j], max(a, b));\n    }\n  }\n\n  cout << dp[s.size() - 1][t.size() - 1] << endl;\n}\n\nint main() {\n  int n;\n  cin >> n;\n  while (n--)\n    solve();\n\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nstring s, t;\nint dp[1000][1000];\n\nvoid solve() {\n  cin >> s >> t;\n  for (int i = 0; i < s.size(); i++) {\n    for (int j = 0; j < t.size(); j++) {\n      dp[i][j] =\n          (i < 1 || j < 1 ? 0 : dp[i - 1][j - 1]) + (s[i] == t[j] ? 1 : 0);\n      int a = (i < 1 ? 0 : dp[i - 1][j]);\n      int b = (j < 1 ? 0 : dp[i][j - 1]);\n      dp[i][j] = max(dp[i][j], max(a, b));\n    }\n  }\n\n  cout << dp[s.size() - 1][t.size() - 1] << endl;\n}\n\nint main() {\n  int n;\n  cin >> n;\n  while (n--)\n    solve();\n\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n#include <string.h>\n\n#define MAX 10000\n\nusing namespace std;\n\nint lcs(string s1, string s2) {\n  int C[MAX + 1][MAX + 1];\n  int m = s1.size();\n  int n = s2.size();\n  for (int i = 0; i <= m; ++i) {\n    C[i][0] = 0;\n  }\n  for (int j = 0; j <= n; ++j) {\n    C[0][j] = 0;\n  }\n\n  for (int i = 1; i <= m; ++i) {\n    for (int j = 1; j <= n; ++j) {\n      if (s1[i - 1] == s2[j - 1]) {\n        C[i][j] = C[i - 1][j - 1] + 1;\n      } else {\n        C[i][j] = max(C[i][j - 1], C[i - 1][j]);\n      }\n    }\n  }\n\n  return C[m][n];\n}\n\nint main() {\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; ++i) {\n    string s1, s2;\n    cin >> s1 >> s2;\n    cout << lcs(s1, s2) << endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <string.h>\n\n#define MAX 1000\n\nusing namespace std;\n\nint lcs(string s1, string s2) {\n  int C[MAX + 1][MAX + 1];\n  int m = s1.size();\n  int n = s2.size();\n  for (int i = 0; i <= m; ++i) {\n    C[i][0] = 0;\n  }\n  for (int j = 0; j <= n; ++j) {\n    C[0][j] = 0;\n  }\n\n  for (int i = 1; i <= m; ++i) {\n    for (int j = 1; j <= n; ++j) {\n      if (s1[i - 1] == s2[j - 1]) {\n        C[i][j] = C[i - 1][j - 1] + 1;\n      } else {\n        C[i][j] = max(C[i][j - 1], C[i - 1][j]);\n      }\n    }\n  }\n\n  return C[m][n];\n}\n\nint main() {\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; ++i) {\n    string s1, s2;\n    cin >> s1 >> s2;\n    cout << lcs(s1, s2) << endl;\n  }\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"-11","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int q;\n  cin >> q;\n  for (int m = 0; m < q; m++) {\n    string wordx, wordy;\n    cin >> wordx >> wordy;\n    int L[1000][1000] = {0};\n\n    for (int j = 0; j < wordy.size(); j++) {\n      for (int i = 0; i < wordx.size(); i++) {\n        if (wordx[i] == wordy[j]) {\n          L[i + 1][j + 1] = 1 + L[i][j];\n        } else {\n          L[i + 1][j + 1] = max(L[i + 1][j], L[i][j + 1]);\n        }\n      }\n    }\n    cout << L[wordx.size()][wordy.size()] << endl;\n  }\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int q;\n  cin >> q;\n  for (int m = 0; m < q; m++) {\n    string wordx, wordy;\n    cin >> wordx >> wordy;\n    int L[1010][1010] = {0};\n\n    for (int j = 0; j < wordy.size(); j++) {\n      for (int i = 0; i < wordx.size(); i++) {\n        if (wordx[i] == wordy[j]) {\n          L[i + 1][j + 1] = 1 + L[i][j];\n        } else {\n          L[i + 1][j + 1] = max(L[i + 1][j], L[i][j + 1]);\n        }\n      }\n    }\n    cout << L[wordx.size()][wordy.size()] << endl;\n  }\n}","change":"replace","i1":12,"i2":13,"j1":12,"j2":13,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n#include <stdio.h>\n#include <string.h>\nusing namespace std;\nint p[1001][1001] = {0};\nint main() {\n  int i, j, q, e, l, z, m, u, n;\n  char s[2001], c[2001];\n  cin >> q;\n  for (e = 0; e < q; e++) {\n    scanf(\"%s %s\", s, c);\n    l = strlen(s);\n    z = strlen(c);\n\n    for (i = 0; i <= l; i++) {\n      for (j = 0; j <= z; j++) {\n        p[i][j] = 0;\n      }\n    }\n    for (i = 1; i <= z; i++) {\n      for (j = 1; j <= l; j++) {\n        if (c[i - 1] == s[j - 1]) {\n          m = 0;\n          for (u = 0; u < i; u++) {\n            for (n = 0; n < j; n++) {\n              if (m < p[n][u])\n                m = p[n][u];\n            }\n          }\n          p[j][i] = m + 1;\n        }\n        p[j][i] = max(p[j][i], p[j - 1][i]);\n      }\n    }\n    for (i = 1; i <= z; i++) {\n      for (j = i + 1; j <= z; j++) {\n        if (p[l][i] > p[l][j]) {\n          m = p[l][i];\n          p[l][i] = p[l][j];\n          p[l][j] = m;\n        }\n      }\n    }\n    cout << p[l][z] << endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <stdio.h>\n#include <string.h>\nusing namespace std;\nint p[1001][1001] = {0};\nint main() {\n  int i, j, q, e, l, z, m, u, n;\n  char s[2001], c[2001];\n  cin >> q;\n  for (e = 0; e < q; e++) {\n    scanf(\"%s %s\", s, c);\n    l = strlen(s);\n    z = strlen(c);\n\n    for (i = 0; i <= l; i++) {\n      for (j = 0; j <= z; j++) {\n        p[i][j] = 0;\n      }\n    }\n    for (i = 1; i <= z; i++) {\n      for (j = 1; j <= l; j++) {\n        if (c[i - 1] == s[j - 1])\n          p[j][i] = p[j - 1][i - 1] + 1;\n        else\n          p[j][i] = max(p[j - 1][i], p[j][i - 1]);\n      }\n    }\n    cout << p[l][z] << endl;\n  }\n  return 0;\n}","change":"replace","i1":22,"i2":42,"j1":22,"j2":26,"error":"TLE","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nvoid fnInput(vector<string> &rvsStrX, vector<string> &rvsStrY) {\n  int nMaxSiz;\n  cin >> nMaxSiz;\n  rvsStrX.resize(nMaxSiz);\n  rvsStrY.resize(nMaxSiz);\n\n  for (int i = 0; i < nMaxSiz; ++i) {\n    cin >> rvsStrX[i] >> rvsStrY[i];\n    rvsStrX[i] = ' ' + rvsStrX[i];\n    rvsStrY[i] = ' ' + rvsStrY[i];\n  }\n}\n\nint fnLngCmnSubseq(const vector<string> &cnrvsStrX,\n                   const vector<string> &cnrvsStrY) {\n  vector<vector<int>> vvnLcsDP;\n  for (int i = 0; i < cnrvsStrX.size(); ++i) {\n    const int nMAXNX = cnrvsStrX[i].size();\n    const int nMAXNY = cnrvsStrY[i].size();\n\n    \/\/    vvnLcsDP.clear();\n    vvnLcsDP.resize(nMAXNX, vector<int>(nMAXNY, 0));\n\n    for (int nx = 1; nx < nMAXNX; ++nx)\n      for (int ny = 1; ny < nMAXNY; ++ny)\n        if (cnrvsStrX[i][nx] == cnrvsStrY[i][ny])\n          vvnLcsDP[nx][ny] = vvnLcsDP[nx - 1][ny - 1] + 1;\n        else\n          vvnLcsDP[nx][ny] = max(vvnLcsDP[nx - 1][ny], vvnLcsDP[nx][ny - 1]);\n\n    cout << vvnLcsDP[nMAXNX - 1][nMAXNY - 1] << endl;\n  }\n}\n\nint main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n  vector<string> vsStrX, vsStrY;\n\n  fnInput(vsStrX, vsStrY);\n  fnLngCmnSubseq(vsStrX, vsStrY);\n  return 0;\n}","changed_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nvoid fnInput(vector<string> &rvsStrX, vector<string> &rvsStrY) {\n  int nMaxSiz;\n  cin >> nMaxSiz;\n  rvsStrX.resize(nMaxSiz);\n  rvsStrY.resize(nMaxSiz);\n\n  for (int i = 0; i < nMaxSiz; ++i) {\n    cin >> rvsStrX[i] >> rvsStrY[i];\n    rvsStrX[i] = ' ' + rvsStrX[i];\n    rvsStrY[i] = ' ' + rvsStrY[i];\n  }\n}\n\nint fnLngCmnSubseq(const vector<string> &cnrvsStrX,\n                   const vector<string> &cnrvsStrY) {\n  vector<vector<int>> vvnLcsDP;\n  for (int i = 0; i < cnrvsStrX.size(); ++i) {\n    const int nMAXNX = cnrvsStrX[i].size();\n    const int nMAXNY = cnrvsStrY[i].size();\n\n    vvnLcsDP.clear();\n    vvnLcsDP.resize(nMAXNX, vector<int>(nMAXNY, 0));\n\n    for (int nx = 1; nx < nMAXNX; ++nx)\n      for (int ny = 1; ny < nMAXNY; ++ny)\n        if (cnrvsStrX[i][nx] == cnrvsStrY[i][ny])\n          vvnLcsDP[nx][ny] = vvnLcsDP[nx - 1][ny - 1] + 1;\n        else\n          vvnLcsDP[nx][ny] = max(vvnLcsDP[nx - 1][ny], vvnLcsDP[nx][ny - 1]);\n\n    cout << vvnLcsDP[nMAXNX - 1][nMAXNY - 1] << endl;\n  }\n}\n\nint main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n  vector<string> vsStrX, vsStrY;\n\n  fnInput(vsStrX, vsStrY);\n  fnLngCmnSubseq(vsStrX, vsStrY);\n  return 0;\n}","change":"replace","i1":24,"i2":25,"j1":24,"j2":25,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nvoid fnInput(vector<string> &rvsStrX, vector<string> &rvsStrY) {\n  int nMaxSiz;\n  cin >> nMaxSiz;\n  rvsStrX.resize(nMaxSiz);\n  rvsStrY.resize(nMaxSiz);\n\n  for (int i = 0; i < nMaxSiz; ++i) {\n    cin >> rvsStrX[i] >> rvsStrY[i];\n    rvsStrX[i] = ' ' + rvsStrX[i];\n    rvsStrY[i] = ' ' + rvsStrY[i];\n  }\n}\n\nint fnLngCmnSubseq(const vector<string> &cnrvsStrX,\n                   const vector<string> &cnrvsStrY) {\n  vector<vector<int>> vvnLcsDP;\n  for (int i = 0; i < cnrvsStrX.size(); ++i) {\n    const int nMAXNX = cnrvsStrX[i].size();\n    const int nMAXNY = cnrvsStrY[i].size();\n\n    vvnLcsDP.shrink_to_fit();\n    vvnLcsDP.resize(nMAXNX, vector<int>(nMAXNY, 0));\n\n    for (int nx = 1; nx < nMAXNX; ++nx)\n      for (int ny = 1; ny < nMAXNY; ++ny)\n        if (cnrvsStrX[i][nx] == cnrvsStrY[i][ny])\n          vvnLcsDP[nx][ny] = vvnLcsDP[nx - 1][ny - 1] + 1;\n        else\n          vvnLcsDP[nx][ny] = max(vvnLcsDP[nx - 1][ny], vvnLcsDP[nx][ny - 1]);\n\n    cout << vvnLcsDP[nMAXNX - 1][nMAXNY - 1] << endl;\n  }\n}\n\nint main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n  vector<string> vsStrX, vsStrY;\n\n  fnInput(vsStrX, vsStrY);\n  fnLngCmnSubseq(vsStrX, vsStrY);\n  return 0;\n}","changed_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nvoid fnInput(vector<string> &rvsStrX, vector<string> &rvsStrY) {\n  int nMaxSiz;\n  cin >> nMaxSiz;\n  rvsStrX.resize(nMaxSiz);\n  rvsStrY.resize(nMaxSiz);\n\n  for (int i = 0; i < nMaxSiz; ++i) {\n    cin >> rvsStrX[i] >> rvsStrY[i];\n    rvsStrX[i] = ' ' + rvsStrX[i];\n    rvsStrY[i] = ' ' + rvsStrY[i];\n  }\n}\n\nint fnLngCmnSubseq(const vector<string> &cnrvsStrX,\n                   const vector<string> &cnrvsStrY) {\n  vector<vector<int>> vvnLcsDP;\n  for (int i = 0; i < cnrvsStrX.size(); ++i) {\n    const int nMAXNX = cnrvsStrX[i].size();\n    const int nMAXNY = cnrvsStrY[i].size();\n\n    vvnLcsDP.clear();\n    vvnLcsDP.resize(nMAXNX, vector<int>(nMAXNY, 0));\n\n    for (int nx = 1; nx < nMAXNX; ++nx)\n      for (int ny = 1; ny < nMAXNY; ++ny)\n        if (cnrvsStrX[i][nx] == cnrvsStrY[i][ny])\n          vvnLcsDP[nx][ny] = vvnLcsDP[nx - 1][ny - 1] + 1;\n        else\n          vvnLcsDP[nx][ny] = max(vvnLcsDP[nx - 1][ny], vvnLcsDP[nx][ny - 1]);\n\n    cout << vvnLcsDP[nMAXNX - 1][nMAXNY - 1] << endl;\n  }\n}\n\nint main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n  vector<string> vsStrX, vsStrY;\n\n  fnInput(vsStrX, vsStrY);\n  fnLngCmnSubseq(vsStrX, vsStrY);\n  return 0;\n}","change":"replace","i1":24,"i2":25,"j1":24,"j2":25,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"\/\/ ALDS1_10C\n#include <algorithm>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nstatic const int N = 1000;\n\nint lcs(string X, string Y) {\n  vector<vector<int>> c(N, vector<int>(N));\n  int m = X.size();\n  int n = Y.size();\n  int maxl = 0;\n  X = ' ' + X;\n  Y = ' ' + Y;\n  for (int i = 1; i <= m; i++) {\n    for (int j = 1; j <= n; j++) {\n      if (X[i] == Y[j]) {\n        c[i][j] = c[i - 1][j - 1] + 1;\n      } else {\n        c[i][j] = max(c[i - 1][j], c[i][j - 1]);\n      }\n      maxl = max(maxl, c[i][j]);\n    }\n  }\n  return maxl;\n}\n\nint main() {\n  string s1, s2;\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> s1 >> s2;\n    cout << lcs(s1, s2) << endl;\n  }\n  return 0;\n}","changed_src":"\/\/ ALDS1_10C\n#include <algorithm>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nstatic const int N = 1001;\n\nint lcs(string X, string Y) {\n  vector<vector<int>> c(N, vector<int>(N));\n  int m = X.size();\n  int n = Y.size();\n  int maxl = 0;\n  X = ' ' + X;\n  Y = ' ' + Y;\n  for (int i = 1; i <= m; i++) {\n    for (int j = 1; j <= n; j++) {\n      if (X[i] == Y[j]) {\n        c[i][j] = c[i - 1][j - 1] + 1;\n      } else {\n        c[i][j] = max(c[i - 1][j], c[i][j - 1]);\n      }\n      maxl = max(maxl, c[i][j]);\n    }\n  }\n  return maxl;\n}\n\nint main() {\n  string s1, s2;\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> s1 >> s2;\n    cout << lcs(s1, s2) << endl;\n  }\n  return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Memory Limit Exceeded","original_src":"#include <algorithm>\n#include <cstdlib>\n#include <iostream>\n#include <string>\nusing namespace std;\nstatic const int N = 1000;\n\nint lcs(string X, string Y) {\n  int **c = (int **)malloc(sizeof(int *) * 1001);\n  for (int i = 0; i < 1001; i++) {\n    c[i] = (int *)malloc(sizeof(int) * 1001);\n  }\n  int m = X.size();\n  int n = Y.size();\n  int maxl = 0;\n  X = ' ' + X;\n  Y = ' ' + Y;\n  c[0][0] = 0;\n  for (int i = 1; i <= m; i++)\n    c[i][0] = 0;\n  for (int j = 1; j <= n; j++)\n    c[0][j] = 0;\n\n  for (int i = 1; i <= m; i++) {\n    for (int j = 1; j <= n; j++) {\n      if (X[i] == Y[j]) {\n        c[i][j] = c[i - 1][j - 1] + 1;\n      } else {\n        c[i][j] = max(c[i - 1][j], c[i][j - 1]);\n      }\n      maxl = max(maxl, c[i][j]);\n    }\n  }\n  return maxl;\n}\n\nint main() {\n  string s1, s2;\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> s1 >> s2;\n    cout << lcs(s1, s2) << endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cstdlib>\n#include <iostream>\n#include <string>\nusing namespace std;\nstatic const int N = 1000;\n\nint lcs(string X, string Y) {\n  int **c = (int **)malloc(sizeof(int *) * 1001);\n  for (int i = 0; i < 1001; i++) {\n    c[i] = (int *)malloc(sizeof(int) * 1001);\n  }\n  int m = X.size();\n  int n = Y.size();\n  int maxl = 0;\n  X = ' ' + X;\n  Y = ' ' + Y;\n  c[0][0] = 0;\n  for (int i = 1; i <= m; i++)\n    c[i][0] = 0;\n  for (int j = 1; j <= n; j++)\n    c[0][j] = 0;\n\n  for (int i = 1; i <= m; i++) {\n    for (int j = 1; j <= n; j++) {\n      if (X[i] == Y[j]) {\n        c[i][j] = c[i - 1][j - 1] + 1;\n      } else {\n        c[i][j] = max(c[i - 1][j], c[i][j - 1]);\n      }\n      maxl = max(maxl, c[i][j]);\n    }\n  }\n  for (int i = 0; i < 1001; i++) {\n    free(c[i]);\n  }\n  free(c);\n  return maxl;\n}\n\nint main() {\n  string s1, s2;\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> s1 >> s2;\n    cout << lcs(s1, s2) << endl;\n  }\n  return 0;\n}","change":"insert","i1":33,"i2":33,"j1":33,"j2":37,"error":"MLE","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int setN;\n  cin >> setN;\n  string A, B;\n\n  for (int i = 0; i < setN; i++) {\n    cin >> A;\n    cin >> B;\n    int L[1000][1000] = {};\n\n    for (int j = 1; j < A.length() + 1; j++) {\n      for (int l = 1; l < B.length() + 1; l++) {\n        if (A[j - 1] == B[l - 1]) {\n          L[j][l] = 1 + L[j - 1][l - 1];\n\n        } else {\n          L[j][l] = max(L[j - 1][l], L[j][l - 1]);\n        }\n      }\n    }\n    \/*\n    for(int j=0;j<A.length()+1;j++) {\n            cout << endl;\n            for(int l=0;l<B.length()+1;l++) {\n                    cout << L[j][l] << \" \";\n\n            }\n    }\n    *\/\n\n    cout << L[A.length()][B.length()] << endl;\n  }\n}","changed_src":"#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int setN;\n  cin >> setN;\n  string A, B;\n\n  for (int i = 0; i < setN; i++) {\n    cin >> A;\n    cin >> B;\n    int L[2000][2000] = {};\n\n    for (int j = 1; j < A.length() + 1; j++) {\n      for (int l = 1; l < B.length() + 1; l++) {\n        if (A[j - 1] == B[l - 1]) {\n          L[j][l] = 1 + L[j - 1][l - 1];\n\n        } else {\n          L[j][l] = max(L[j - 1][l], L[j][l - 1]);\n        }\n      }\n    }\n    \/*\n    for(int j=0;j<A.length()+1;j++) {\n            cout << endl;\n            for(int l=0;l<B.length()+1;l++) {\n                    cout << L[j][l] << \" \";\n\n            }\n    }\n    *\/\n\n    cout << L[A.length()][B.length()] << endl;\n  }\n}","change":"replace","i1":12,"i2":13,"j1":12,"j2":13,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <string>\n#define int long long\n\/\/ #define _DEBUG\nusing namespace std;\nstring sa, sb;\nint T[1000][1000];\nint solve() {\n  int sal = sa.length(), sbl = sb.length();\n  for (int a = 0; a <= sal; a++) {\n    for (int b = 0; b <= sbl; b++) {\n      if (a == 0 || b == 0) {\n        T[a][b] = 0;\n      } else if (sa[a - 1] == sb[b - 1]) {\n        T[a][b] = 1 + T[a - 1][b - 1];\n      } else {\n        T[a][b] = max(T[a][b - 1], T[a - 1][b]);\n      }\n    }\n  }\n  return T[sal][sbl];\n}\nsigned main() {\n  int N;\n  cin >> N;\n  for (int i = 0; i < N; i++) {\n    cin >> sa >> sb;\n    cout << solve() << endl;\n  }\n}\n","changed_src":"#include <iostream>\n#include <string>\n#define int long long\n\/\/ #define _DEBUG\nusing namespace std;\nstring sa, sb;\nint T[1009][1009];\nint solve() {\n  int sal = sa.length(), sbl = sb.length();\n  for (int a = 0; a <= sal; a++) {\n    for (int b = 0; b <= sbl; b++) {\n      if (a == 0 || b == 0) {\n        T[a][b] = 0;\n      } else if (sa[a - 1] == sb[b - 1]) {\n        T[a][b] = 1 + T[a - 1][b - 1];\n      } else {\n        T[a][b] = max(T[a][b - 1], T[a - 1][b]);\n      }\n    }\n  }\n  return T[sal][sbl];\n}\nsigned main() {\n  int N;\n  cin >> N;\n  for (int i = 0; i < N; i++) {\n    cin >> sa >> sb;\n    cout << solve() << endl;\n  }\n}\n","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cstdlib>\n#include <iostream>\n#include <list>\n#include <stack>\n#include <stdio.h>\n#include <string>\n#define MAX 101\nusing namespace std;\nint main() {\n  int n;\n  cin >> n;\n  string x, y;\n  int data[MAX][MAX] = {0, 0};\n  for (int d = 0; d < n; d++) {\n    cin >> x >> y;\n    for (int i = 0; i < y.size(); i++) {\n      for (int j = 0; j < x.size(); j++) {\n        if (y[i] == x[j]) {\n          data[j + 1][i + 1] = data[j][i] + 1;\n        } else {\n          data[j + 1][i + 1] = max(data[j + 1][i], data[j][i + 1]);\n        }\n      }\n    }\n    cout << data[x.size()][y.size()] << endl;\n  }\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cstdlib>\n#include <iostream>\n#include <list>\n#include <stack>\n#include <stdio.h>\n#include <string>\n#define MAX 1001\nusing namespace std;\nint main() {\n  int n;\n  cin >> n;\n  string x, y;\n  int data[MAX][MAX] = {0, 0};\n  for (int d = 0; d < n; d++) {\n    cin >> x >> y;\n    for (int i = 0; i < y.size(); i++) {\n      for (int j = 0; j < x.size(); j++) {\n        if (y[i] == x[j]) {\n          data[j + 1][i + 1] = data[j][i] + 1;\n        } else {\n          data[j + 1][i + 1] = max(data[j + 1][i], data[j][i + 1]);\n        }\n      }\n    }\n    cout << data[x.size()][y.size()] << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint hantei(char x[], char y[]) {\n  int xn = 0, yn = 0, flag = 0, i, j, max = 0;\n  int c[101][101];\n\n  while (flag == 0) {\n    if (x[xn] != '\\0') {\n      xn++;\n    } else {\n      flag = 1;\n    }\n  }\n\n  flag = 0;\n\n  while (flag == 0) {\n    if (y[yn] != '\\0') {\n      yn++;\n    } else {\n      flag = 1;\n    }\n  }\n  for (i = 1; i < xn + 1; i++)\n    c[i][0] = 0;\n  for (j = 1; j < yn + 1; j++)\n    c[0][j] = 0;\n\n  for (i = 1; i < xn + 1; i++) {\n    for (j = 1; j < yn + 1; j++) {\n      if (x[i - 1] == y[j - 1]) {\n        c[i][j] = c[i - 1][j - 1] + 1;\n      } else if (c[i - 1][j] >= c[i][j - 1]) {\n        c[i][j] = c[i - 1][j];\n      } else {\n        c[i][j] = c[i][j - 1];\n      }\n      if (max < c[i][j])\n        max = c[i][j];\n    }\n  }\n\n  return max;\n}\n\nint main(void) {\n  char x[1000], y[1000];\n  int q, i;\n\n  scanf(\"%d\", &q);\n\n  for (i = 0; i < q; i++) {\n    scanf(\"%s\", x);\n    scanf(\"%s\", y);\n    printf(\"%d\\n\", hantei(x, y));\n  }\n\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint hantei(char x[], char y[]) {\n  int xn = 0, yn = 0, flag = 0, i, j, max = 0;\n  int c[1001][1001];\n\n  while (flag == 0) {\n    if (x[xn] != '\\0') {\n      xn++;\n    } else {\n      flag = 1;\n    }\n  }\n\n  flag = 0;\n\n  while (flag == 0) {\n    if (y[yn] != '\\0') {\n      yn++;\n    } else {\n      flag = 1;\n    }\n  }\n  for (i = 1; i < xn + 1; i++)\n    c[i][0] = 0;\n  for (j = 1; j < yn + 1; j++)\n    c[0][j] = 0;\n\n  for (i = 1; i < xn + 1; i++) {\n    for (j = 1; j < yn + 1; j++) {\n      if (x[i - 1] == y[j - 1]) {\n        c[i][j] = c[i - 1][j - 1] + 1;\n      } else if (c[i - 1][j] >= c[i][j - 1]) {\n        c[i][j] = c[i - 1][j];\n      } else {\n        c[i][j] = c[i][j - 1];\n      }\n      if (max < c[i][j])\n        max = c[i][j];\n    }\n  }\n\n  return max;\n}\n\nint main(void) {\n  char x[1000], y[1000];\n  int q, i;\n\n  scanf(\"%d\", &q);\n\n  for (i = 0; i < q; i++) {\n    scanf(\"%s\", x);\n    scanf(\"%s\", y);\n    printf(\"%d\\n\", hantei(x, y));\n  }\n\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <array>\n#include <cstdio>\n#include <iostream>\n#include <list>\n#include <numeric>\n#include <queue>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n#define _USE_MATH_DEFINES\n\n#include <map>\n#include <math.h>\n\n#define SENTINEL 1000000001\n\n#define min(a, b) (a) > (b) ? (b) : (a)\n#define max(a, b) (a) > (b) ? (a) : (b)\n\nusing namespace std;\n\nint LCS[1000][1000];\n\nvoid solve(string x, string y) {\n  for (int i = 0; i != x.size(); i++) {\n    for (int j = 0; j != y.size(); j++) {\n      if (x[i] == y[j]) {\n        LCS[i + 1][j + 1] = LCS[i][j] + 1;\n      } else {\n        LCS[i + 1][j + 1] = max(LCS[i][j + 1], LCS[i + 1][j]);\n      }\n    }\n  }\n\n  cout << LCS[x.size()][y.size()] << endl;\n}\n\nint main() {\n  int q;\n  cin >> q;\n\n  for (int i = 0; i < 1000; i++) {\n    LCS[0][i] = 0;\n    LCS[i][0] = 0;\n  }\n\n  for (int i = 0; i < q; i++) {\n    string x, y;\n    cin >> x >> y;\n    solve(x, y);\n  }\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <array>\n#include <cstdio>\n#include <iostream>\n#include <list>\n#include <numeric>\n#include <queue>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n#define _USE_MATH_DEFINES\n\n#include <map>\n#include <math.h>\n\n#define SENTINEL 1000000001\n\n#define min(a, b) (a) > (b) ? (b) : (a)\n#define max(a, b) (a) > (b) ? (a) : (b)\n\nusing namespace std;\n\nint LCS[1010][1010];\n\nvoid solve(string x, string y) {\n  for (int i = 0; i != x.size(); i++) {\n    for (int j = 0; j != y.size(); j++) {\n      if (x[i] == y[j]) {\n        LCS[i + 1][j + 1] = LCS[i][j] + 1;\n      } else {\n        LCS[i + 1][j + 1] = max(LCS[i][j + 1], LCS[i + 1][j]);\n      }\n    }\n  }\n\n  cout << LCS[x.size()][y.size()] << endl;\n}\n\nint main() {\n  int q;\n  cin >> q;\n\n  for (int i = 0; i < 1000; i++) {\n    LCS[0][i] = 0;\n    LCS[i][0] = 0;\n  }\n\n  for (int i = 0; i < q; i++) {\n    string x, y;\n    cin >> x >> y;\n    solve(x, y);\n  }\n  return 0;\n}\n","change":"replace","i1":24,"i2":25,"j1":24,"j2":25,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n#include <string>\nusing namespace std;\n\n#define MAX 1000\n\nint c[MAX][MAX];\n\nint lcs(string A, string B) {\n  int a = A.length();\n  int b = B.length();\n  int maxl = 0;\n\n  A = ' ' + A;\n  B = ' ' + B;\n  \/\/ \u914d\u5217\u3092\u4f5c\u308b\n  for (int i = 0; i < a; i++) {\n    c[i][0] = 0;\n  }\n  for (int j = 0; j < b; j++) {\n    c[0][j] = 0;\n  }\n  for (int i = 1; i <= a; i++) {\n    for (int j = 1; j <= b; j++) {\n      if (A[i] == B[j]) {\n        c[i][j] = c[i - 1][j - 1] + 1;\n      } else {\n        c[i][j] = max(c[i - 1][j], c[i][j - 1]);\n      }\n      maxl = max(maxl, c[i][j]);\n    }\n  }\n\n  return maxl;\n}\n\nint main() {\n  string s1, s2;\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> s1 >> s2;\n    cout << lcs(s1, s2) << endl;\n  }\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <iostream>\n#include <string>\nusing namespace std;\n\n#define MAX 1000\n\nint c[MAX + 1][MAX + 1];\n\nint lcs(string A, string B) {\n  int a = A.length();\n  int b = B.length();\n  int maxl = 0;\n\n  A = ' ' + A;\n  B = ' ' + B;\n  \/\/ \u914d\u5217\u3092\u4f5c\u308b\n  for (int i = 0; i < a; i++) {\n    c[i][0] = 0;\n  }\n  for (int j = 0; j < b; j++) {\n    c[0][j] = 0;\n  }\n  for (int i = 1; i <= a; i++) {\n    for (int j = 1; j <= b; j++) {\n      if (A[i] == B[j]) {\n        c[i][j] = c[i - 1][j - 1] + 1;\n      } else {\n        c[i][j] = max(c[i - 1][j], c[i][j - 1]);\n      }\n      maxl = max(maxl, c[i][j]);\n    }\n  }\n\n  return maxl;\n}\n\nint main() {\n  string s1, s2;\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> s1 >> s2;\n    cout << lcs(s1, s2) << endl;\n  }\n  return 0;\n}\n","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  for (int k = 0; k < n; k++) {\n    string x, y;\n    cin >> x >> y;\n    int p = x.size();\n    int q = y.size();\n    int l[1000][1000] = {};\n    for (int i = 1; i < p + 1; i++) {\n      for (int j = 1; j < q + 1; j++) {\n        if (x[i - 1] == y[j - 1]) {\n          l[i][j] = 1 + l[i - 1][j - 1];\n        } else {\n          l[i][j] = max(l[i - 1][j], l[i][j - 1]);\n        }\n      }\n    }\n    cout << l[p][q] << endl;\n  }\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  for (int k = 0; k < n; k++) {\n    string x, y;\n    cin >> x >> y;\n    int p = x.size();\n    int q = y.size();\n    int l[1001][1001] = {};\n    for (int i = 1; i < p + 1; i++) {\n      for (int j = 1; j < q + 1; j++) {\n        if (x[i - 1] == y[j - 1]) {\n          l[i][j] = 1 + l[i - 1][j - 1];\n        } else {\n          l[i][j] = max(l[i - 1][j], l[i][j - 1]);\n        }\n      }\n    }\n    cout << l[p][q] << endl;\n  }\n}","change":"replace","i1":13,"i2":14,"j1":13,"j2":14,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n#include <string>\n\nconstexpr int MAX_XY = 1000;\n\nint lx, ly, q, dp[MAX_XY][MAX_XY];\nstd::string sx, sy;\n\nvoid fill_dp() {\n  for (int i = 1; i <= lx; ++i) {\n    for (int j = 1; j <= ly; ++j) {\n      if (sx[i - 1] == sy[j - 1])\n        dp[i][j] = dp[i - 1][j - 1] + 1;\n      else\n        dp[i][j] = std::max(dp[i - 1][j], dp[i][j - 1]);\n    }\n  }\n}\n\nvoid solve() {\n  fill_dp();\n  std::cout << dp[lx][ly] << std::endl;\n  return;\n}\n\nint main() {\n  std::cin >> q;\n\n  for (int i = 0; i < q; ++i) {\n    std::cin >> sx >> sy;\n    lx = sx.size(), ly = sy.size();\n    solve();\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <string>\n\nconstexpr int MAX_XY = 1010;\n\nint lx, ly, q, dp[MAX_XY][MAX_XY];\nstd::string sx, sy;\n\nvoid fill_dp() {\n  for (int i = 1; i <= lx; ++i) {\n    for (int j = 1; j <= ly; ++j) {\n      if (sx[i - 1] == sy[j - 1])\n        dp[i][j] = dp[i - 1][j - 1] + 1;\n      else\n        dp[i][j] = std::max(dp[i - 1][j], dp[i][j - 1]);\n    }\n  }\n}\n\nvoid solve() {\n  fill_dp();\n  std::cout << dp[lx][ly] << std::endl;\n  return;\n}\n\nint main() {\n  std::cin >> q;\n\n  for (int i = 0; i < q; ++i) {\n    std::cin >> sx >> sy;\n    lx = sx.size(), ly = sy.size();\n    solve();\n  }\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"\/\/ #define\t\tFILE_INPUT_DEFINE\n#ifdef FILE_INPUT_DEFINE\n#include <fstream>\n#endif \/\/ FILE_INPUT_DEFINE\n\n#include <algorithm>\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\n#define MAX 1000\n#define ind(x) ((x)-1)\n\nint C[MAX][MAX];\n\nint LCS(string &X, string &Y) {\n  int Xlen = X.length();\n  int Ylen = Y.length();\n\n  for (int i = 0; i <= Xlen; ++i) {\n    C[i][0] = 0;\n  }\n\n  for (int i = 0; i <= Ylen; ++i) {\n    C[0][i] = 0;\n  }\n\n  for (int i = 1; i <= Xlen; ++i) {\n    for (int j = 1; j <= Ylen; ++j) {\n      if (X[ind(i)] == Y[ind(j)]) {\n        C[i][j] = C[i - 1][j - 1] + 1;\n      } else {\n        C[i][j] = max(C[i - 1][j], C[i][j - 1]);\n      }\n    }\n  }\n\n  return (C[Xlen][Ylen]);\n}\n\nint main() {\n#ifdef FILE_INPUT_DEFINE\n  \/\/ input from txt\n  std::ifstream in(R\"(C:\\Temp\\input.txt)\");\n  std::cin.rdbuf(in.rdbuf());\n#endif \/\/ FILE_INPUT_DEFINE\n\n  string X, Y;\n  int n;\n\n  cin >> n;\n  cin.clear();\n  cin.ignore();\n\n  for (int i = 0; i < n; ++i) {\n    getline(cin, X);\n    getline(cin, Y);\n\n    cout << LCS(X, Y) << endl;\n  }\n\n  return 0;\n}","changed_src":"\/\/ #define\t\tFILE_INPUT_DEFINE\n#ifdef FILE_INPUT_DEFINE\n#include <fstream>\n#endif \/\/ FILE_INPUT_DEFINE\n\n#include <algorithm>\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\n#define MAX 1000\n#define ind(x) ((x)-1)\n\nint C[MAX + 1][MAX + 1];\n\nint LCS(string &X, string &Y) {\n  int Xlen = X.length();\n  int Ylen = Y.length();\n\n  for (int i = 0; i <= Xlen; ++i) {\n    C[i][0] = 0;\n  }\n\n  for (int i = 0; i <= Ylen; ++i) {\n    C[0][i] = 0;\n  }\n\n  for (int i = 1; i <= Xlen; ++i) {\n    for (int j = 1; j <= Ylen; ++j) {\n      if (X[ind(i)] == Y[ind(j)]) {\n        C[i][j] = C[i - 1][j - 1] + 1;\n      } else {\n        C[i][j] = max(C[i - 1][j], C[i][j - 1]);\n      }\n    }\n  }\n\n  return (C[Xlen][Ylen]);\n}\n\nint main() {\n#ifdef FILE_INPUT_DEFINE\n  \/\/ input from txt\n  std::ifstream in(R\"(C:\\Temp\\input.txt)\");\n  std::cin.rdbuf(in.rdbuf());\n#endif \/\/ FILE_INPUT_DEFINE\n\n  string X, Y;\n  int n;\n\n  cin >> n;\n  cin.clear();\n  cin.ignore();\n\n  for (int i = 0; i < n; ++i) {\n    getline(cin, X);\n    getline(cin, Y);\n\n    cout << LCS(X, Y) << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":14,"i2":15,"j1":14,"j2":15,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cstring>\n#include <iostream>\n#include <string>\n#define MAX_N 1000\n\nint solve(std::string s, std::string t) {\n  int dp[MAX_N][MAX_N] = {0};\n  int n, m;\n  n = s.size();\n  m = t.size();\n  for (int i = 0; i < n; i++) {\n    for (int j = 0; j < m; j++) {\n      if (s[i] == t[j])\n        dp[i + 1][j + 1] = dp[i][j] + 1;\n      else\n        dp[i + 1][j + 1] = std::max(dp[i][j + 1], dp[i + 1][j]);\n    }\n  }\n  return dp[n][m];\n}\n\nint main() {\n  int q;\n  std::cin >> q;\n  for (int i = 0; i < q; i++) {\n    std::string s, t;\n    std::cin >> s >> t;\n    std::cout << solve(s, t) << std::endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cstring>\n#include <iostream>\n#include <string>\n#define MAX_N 1001\n\nint solve(std::string s, std::string t) {\n  int dp[MAX_N][MAX_N] = {0};\n  int n, m;\n  n = s.size();\n  m = t.size();\n  for (int i = 0; i < n; i++) {\n    for (int j = 0; j < m; j++) {\n      if (s[i] == t[j])\n        dp[i + 1][j + 1] = dp[i][j] + 1;\n      else\n        dp[i + 1][j + 1] = std::max(dp[i][j + 1], dp[i + 1][j]);\n    }\n  }\n  return dp[n][m];\n}\n\nint main() {\n  int q;\n  std::cin >> q;\n  for (int i = 0; i < q; i++) {\n    std::string s, t;\n    std::cin >> s >> t;\n    std::cout << solve(s, t) << std::endl;\n  }\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint Max(int &a, int b) { return a = max(a, b); }\n\nint LCS(string &a, string &b) {\n  int n = a.size();\n  int m = b.size();\n  vector<vector<int>> dp(n + 1, vector<int>(m + 1));\n\n  for (int i = 0; i <= n; i++)\n    for (int j = 0; j <= m; j++) {\n      if (i < n && j < m && a[i] == b[j])\n        Max(dp[i + 1][j + 1], dp[i][j] + 1);\n      Max(dp[i + 1][j], dp[i][j]);\n      Max(dp[i][j + 1], dp[i][j]);\n    }\n  return dp[n][m];\n}\n\nint main() {\n  int q;\n  cin >> q;\n  while (q--) {\n    string a, b;\n    cin >> a >> b;\n    cout << LCS(a, b) << endl;\n  }\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint Max(int &a, int b) { return a = max(a, b); }\n\nint LCS(string &a, string &b) {\n  int n = a.size();\n  int m = b.size();\n  vector<vector<int>> dp(n + 1, vector<int>(m + 1));\n\n  for (int i = 0; i <= n; i++)\n    for (int j = 0; j <= m; j++) {\n      if (i < n && j < m && a[i] == b[j])\n        Max(dp[i + 1][j + 1], dp[i][j] + 1);\n      if (i < n)\n        Max(dp[i + 1][j], dp[i][j]);\n      if (j < m)\n        Max(dp[i][j + 1], dp[i][j]);\n    }\n  return dp[n][m];\n}\n\nint main() {\n  int q;\n  cin >> q;\n  while (q--) {\n    string a, b;\n    cin >> a >> b;\n    cout << LCS(a, b) << endl;\n  }\n  return 0;\n}","change":"replace","i1":14,"i2":16,"j1":14,"j2":18,"error":"-11","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint LCS(string p, string q) {\n  vector<vector<int>> f(p.size() + 1, vector<int>(q.size() + 1, 0));\n  int t;\n  for (int i = 1; i <= p.size(); i++) {\n    for (int j = 1; j <= q.size(); j++) {\n      if (p[i - 1] == q[j - 1])\n        f[i][j] = f[i - 1][j - 1] + 1;\n      else if (f[i][j - 1] > f[i - 1][j])\n        f[i][j] = f[i][j - 1];\n      else\n        f[i][j] = f[i - 1][j];\n    }\n  }\n  return f[p.size()][q.size()];\n}\n\nint main() {\n  int n;\n  string p[150];\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> p[2 * i] >> p[2 * i + 1];\n  }\n  for (int i = 0; i < n; i++) {\n    cout << LCS(p[2 * i], p[2 * i + 1]) << endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint LCS(string p, string q) {\n  vector<vector<int>> f(p.size() + 1, vector<int>(q.size() + 1, 0));\n  int t;\n  for (int i = 1; i <= p.size(); i++) {\n    for (int j = 1; j <= q.size(); j++) {\n      if (p[i - 1] == q[j - 1])\n        f[i][j] = f[i - 1][j - 1] + 1;\n      else if (f[i][j - 1] > f[i - 1][j])\n        f[i][j] = f[i][j - 1];\n      else\n        f[i][j] = f[i - 1][j];\n    }\n  }\n  return f[p.size()][q.size()];\n}\n\nint main() {\n  int n;\n  string p[300];\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> p[2 * i] >> p[2 * i + 1];\n  }\n  for (int i = 0; i < n; i++) {\n    cout << LCS(p[2 * i], p[2 * i + 1]) << endl;\n  }\n  return 0;\n}","change":"replace","i1":24,"i2":25,"j1":24,"j2":25,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include \"bits\/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define all(a) (a).begin(), (a).end()\n#define pb push_back\n#define INF 99999999\n\n#define MAX_S 200\n#define MAX_T 200\n\ntemplate <typename T> int lcs(T s, T t) {\n  int lens = s.size();\n  int lent = t.size();\n  int dp[MAX_S + 1][MAX_T + 1] = {};\n\n  rep(i, lens) {\n    rep(j, lent) {\n      if (s[i] == t[j])\n        dp[i + 1][j + 1] = dp[i][j] + 1;\n      else\n        dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);\n    }\n  }\n  return dp[lens][lent];\n}\n\nint main() {\n  int n;\n  cin >> n;\n  rep(i, n) {\n    string s, t;\n    cin >> s >> t;\n    cout << lcs(s, t) << endl;\n  }\n}","changed_src":"#include \"bits\/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define all(a) (a).begin(), (a).end()\n#define pb push_back\n#define INF 99999999\n\n#define MAX_S 2000\n#define MAX_T 2000\n\ntemplate <typename T> int lcs(T s, T t) {\n  int lens = s.size();\n  int lent = t.size();\n  int dp[MAX_S + 1][MAX_T + 1] = {};\n\n  rep(i, lens) {\n    rep(j, lent) {\n      if (s[i] == t[j])\n        dp[i + 1][j + 1] = dp[i][j] + 1;\n      else\n        dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);\n    }\n  }\n  return dp[lens][lent];\n}\n\nint main() {\n  int n;\n  cin >> n;\n  rep(i, n) {\n    string s, t;\n    cin >> s >> t;\n    cout << lcs(s, t) << endl;\n  }\n}","change":"replace","i1":9,"i2":11,"j1":9,"j2":11,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\nusing namespace std;\n#define MAX 100000\n\nstatic const int N = 100;\n\nint lcs(string X, string Y) {\n  int c[N + 1][N + 1];\n  int m = X.size();\n  int n = Y.size();\n  int ans = 0;\n  X = ' ' + X;\n  Y = ' ' + Y;\n  for (int i; i <= m; i++)\n    c[i][0] = 0;\n  for (int j; j <= n; j++)\n    c[0][j] = 0;\n\n  for (int i = 1; i <= m; i++) {\n    for (int j = 1; j <= n; j++) {\n      if (X[i] == Y[j]) {\n        c[i][j] = c[i - 1][j - 1] + 1;\n      } else {\n        c[i][j] = max(c[i - 1][j], c[i][j - 1]);\n      }\n      ans = max(ans, c[i][j]);\n    }\n  }\n  return ans;\n}\n\nint main() {\n  string s1, s2;\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> s1 >> s2;\n    cout << lcs(s1, s2) << endl;\n  }\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\nusing namespace std;\n#define MAX 100000\n\nstatic const int N = 1000;\n\nint lcs(string X, string Y) {\n  int c[N + 1][N + 1];\n  int m = X.size();\n  int n = Y.size();\n  int ans = 0;\n  X = ' ' + X;\n  Y = ' ' + Y;\n  for (int i; i <= m; i++)\n    c[i][0] = 0;\n  for (int j; j <= n; j++)\n    c[0][j] = 0;\n\n  for (int i = 1; i <= m; i++) {\n    for (int j = 1; j <= n; j++) {\n      if (X[i] == Y[j]) {\n        c[i][j] = c[i - 1][j - 1] + 1;\n      } else {\n        c[i][j] = max(c[i - 1][j], c[i][j - 1]);\n      }\n      ans = max(ans, c[i][j]);\n    }\n  }\n  return ans;\n}\n\nint main() {\n  string s1, s2;\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> s1 >> s2;\n    cout << lcs(s1, s2) << endl;\n  }\n  return 0;\n}\n","change":"replace","i1":8,"i2":9,"j1":8,"j2":9,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main(void) {\n  string st1, st2;\n  int q, val[151][151];\n\n  cin >> q;\n\n  for (int i = 0; i < q; i++) {\n    cin >> st1;\n    cin >> st2;\n\n    for (int j = 0; j <= st1.length(); j++) {\n      for (int k = 0; k <= st2.length(); k++) {\n\n        if (j == 0 || k == 0)\n          val[j][k] = 0;\n        else {\n          if (val[j - 1][k] == min(st1.length(), st2.length())) {\n            val[j][k] = st1.length();\n          } else {\n\n            if (st1[j - 1] == st2[k - 1]) {\n              val[j][k] = val[j - 1][k - 1] + 1;\n            } else {\n              val[j][k] = max(val[j - 1][k], val[j][k - 1]);\n            }\n          }\n        }\n      }\n    }\n\n    \/*\n      for(int j=0; j<=st1.length(); j++){\n      for(int k=0; k<=st2.length(); k++){\n      cout << val[j][k] << \" \";\n      }\n      cout << \"\\n\";\n      }\n    *\/\n\n    cout << val[st1.length()][st2.length()] << \"\\n\";\n  }\n\n  return 0;\n}\n","changed_src":"#include <cmath>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main(void) {\n  string st1, st2;\n  int q, val[1001][1001];\n\n  cin >> q;\n\n  for (int i = 0; i < q; i++) {\n    cin >> st1;\n    cin >> st2;\n\n    for (int j = 0; j <= st1.length(); j++) {\n      for (int k = 0; k <= st2.length(); k++) {\n\n        if (j == 0 || k == 0)\n          val[j][k] = 0;\n        else {\n          if (val[j - 1][k] == min(st1.length(), st2.length())) {\n            val[j][k] = st1.length();\n          } else {\n\n            if (st1[j - 1] == st2[k - 1]) {\n              val[j][k] = val[j - 1][k - 1] + 1;\n            } else {\n              val[j][k] = max(val[j - 1][k], val[j][k - 1]);\n            }\n          }\n        }\n      }\n    }\n\n    \/*\n      for(int j=0; j<=st1.length(); j++){\n      for(int k=0; k<=st2.length(); k++){\n      cout << val[j][k] << \" \";\n      }\n      cout << \"\\n\";\n      }\n    *\/\n\n    cout << val[st1.length()][st2.length()] << \"\\n\";\n  }\n\n  return 0;\n}\n","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"\/\/\/\n\/\/ File:  alds1_10_c.cpp\n\/\/ Author: ymiyamoto\n\/\/\n\/\/ Created on Tue Oct 17 01:36:16 2017\n\/\/\n\n#include <cstdint>\n#include <iostream>\n#include <string>\n\nusing namespace std;\nstatic uint32_t dp[1000][1000];\n\nstatic void init_dp(uint32_t len1, uint32_t len2) {\n  for (uint32_t i = 0; i < len1; i++) {\n    dp[i][0] = 0;\n  }\n  for (uint32_t i = 0; i < len2; i++) {\n    dp[0][i] = 0;\n  }\n}\n\nint32_t main() {\n  uint32_t n;\n  cin >> n;\n\n  for (uint32_t i = 0; i < n; i++) {\n    string str1, str2;\n    cin >> str1;\n    cin >> str2;\n    init_dp(str1.size(), str2.size());\n    for (uint32_t i = 1; i <= str1.size(); i++) {\n      for (uint32_t j = 1; j <= str2.size(); j++) {\n        if (str1[i - 1] == str2[j - 1]) {\n          dp[i][j] = dp[i - 1][j - 1] + 1;\n        } else {\n          dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);\n        }\n      }\n    }\n    cout << dp[str1.size()][str2.size()] << endl;\n  }\n\n  return 0;\n}","changed_src":"\/\/\/\n\/\/ File:  alds1_10_c.cpp\n\/\/ Author: ymiyamoto\n\/\/\n\/\/ Created on Tue Oct 17 01:36:16 2017\n\/\/\n\n#include <cstdint>\n#include <iostream>\n#include <string>\n\nusing namespace std;\nstatic uint32_t dp[1001][1001];\n\nstatic void init_dp(uint32_t len1, uint32_t len2) {\n  for (uint32_t i = 0; i < len1; i++) {\n    dp[i][0] = 0;\n  }\n  for (uint32_t i = 0; i < len2; i++) {\n    dp[0][i] = 0;\n  }\n}\n\nint32_t main() {\n  uint32_t n;\n  cin >> n;\n\n  for (uint32_t i = 0; i < n; i++) {\n    string str1, str2;\n    cin >> str1;\n    cin >> str2;\n    init_dp(str1.size(), str2.size());\n    for (uint32_t i = 1; i <= str1.size(); i++) {\n      for (uint32_t j = 1; j <= str2.size(); j++) {\n        if (str1[i - 1] == str2[j - 1]) {\n          dp[i][j] = dp[i - 1][j - 1] + 1;\n        } else {\n          dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);\n        }\n      }\n    }\n    cout << dp[str1.size()][str2.size()] << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":12,"i2":13,"j1":12,"j2":13,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <iostream>\n#include <string>\n#include <vector>\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) FOR(i, 0, n)\n#define rep(i, n) FOR(i, 0, n)\n#define DEBUG(x) cout << #x << \": \" << x << endl\n#define vint vector<int>\n#define vdouble vector<double>\n#define vstring vector<string>\nusing namespace std;\n\n#include <map>\n#include <queue>\n#include <set>\n\ntypedef long long ll;\ntypedef unsigned long long ull;\n\nconst int MAX_N = 1000000;\nconst int MAX_L = 10000;\nint q;\n\nstring data[MAX_N][2];\nll mem[MAX_L][MAX_L];\n\nll eval(string s1, string s2, int i, int j) {\n  int ii = i - 1;\n  int jj = j - 1;\n  if (ii == -1 || jj == -1)\n    return 0;\n  if (s1[ii] == s2[jj])\n    return mem[i - 1][j - 1] + 1;\n  if (s1[ii] != s2[jj])\n    return max(mem[i - 1][j], mem[i][j - 1]);\n  throw \"exception\";\n}\n\nll solve(string s1, string s2) {\n\n  int L1 = s1.size();\n  int L2 = s2.size();\n  rep(i, L1 + 1) {\n    rep(j, L2 + 1) { mem[i][j] = eval(s1, s2, i, j); }\n  }\n\n  return mem[L1][L2];\n}\n\nint main() {\n\n  cin >> q;\n  rep(i, q) {\n    cin >> data[i][0];\n    cin >> data[i][1];\n  }\n\n  rep(i, q) { cout << solve(data[i][0], data[i][1]) << endl; }\n}","changed_src":"#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <iostream>\n#include <string>\n#include <vector>\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) FOR(i, 0, n)\n#define rep(i, n) FOR(i, 0, n)\n#define DEBUG(x) cout << #x << \": \" << x << endl\n#define vint vector<int>\n#define vdouble vector<double>\n#define vstring vector<string>\nusing namespace std;\n\n#include <map>\n#include <queue>\n#include <set>\n\ntypedef long long ll;\ntypedef unsigned long long ull;\n\nconst int MAX_N = 1000000;\nconst int MAX_L = 10000;\nint q;\n\nstring data[MAX_N][2];\nll mem[MAX_L][MAX_L];\n\nll eval(string &s1, string &s2, int i, int j) {\n  int ii = i - 1;\n  int jj = j - 1;\n  if (ii == -1 || jj == -1)\n    return 0;\n  if (s1[ii] == s2[jj])\n    return mem[i - 1][j - 1] + 1;\n  if (s1[ii] != s2[jj])\n    return max(mem[i - 1][j], mem[i][j - 1]);\n  throw \"exception\";\n}\n\nll solve(string s1, string s2) {\n\n  int L1 = s1.size();\n  int L2 = s2.size();\n  rep(i, L1 + 1) {\n    rep(j, L2 + 1) { mem[i][j] = eval(s1, s2, i, j); }\n  }\n\n  return mem[L1][L2];\n}\n\nint main() {\n\n  cin >> q;\n  rep(i, q) {\n    cin >> data[i][0];\n    cin >> data[i][1];\n  }\n\n  rep(i, q) { cout << solve(data[i][0], data[i][1]) << endl; }\n}","change":"replace","i1":29,"i2":30,"j1":29,"j2":30,"error":"TLE","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <ccomplex>\n#include <cmath>\n#include <complex>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <queue>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n\nvoid solve() {\n  string x, y;\n  cin >> x >> y;\n  int xlen = x.length();\n  int ylen = y.length();\n  int dp[155][155];\n  dp[0][0] = 0;\n\n  for (int i = 0; i <= xlen; i++) {\n    for (int j = 0; j <= ylen; j++) {\n      if (i == 0 || j == 0) {\n        dp[i + 1][j + 1] = 0;\n      } else if (x[i - 1] == y[j - 1]) {\n        dp[i + 1][j + 1] = dp[i][j] + 1;\n      } else {\n        dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);\n      }\n    }\n  }\n  cout << dp[xlen + 1][ylen + 1] << endl;\n}\nint main() {\n  int q;\n  cin >> q;\n  for (int i = 0; i < q; i++)\n    solve();\n}","changed_src":"#include <algorithm>\n#include <ccomplex>\n#include <cmath>\n#include <complex>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <queue>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n\nvoid solve() {\n  string x, y;\n  cin >> x >> y;\n  int xlen = x.length();\n  int ylen = y.length();\n  int dp[1010][1010];\n  dp[0][0] = 0;\n\n  for (int i = 0; i <= xlen; i++) {\n    for (int j = 0; j <= ylen; j++) {\n      if (i == 0 || j == 0) {\n        dp[i + 1][j + 1] = 0;\n      } else if (x[i - 1] == y[j - 1]) {\n        dp[i + 1][j + 1] = dp[i][j] + 1;\n      } else {\n        dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);\n      }\n    }\n  }\n  cout << dp[xlen + 1][ylen + 1] << endl;\n}\nint main() {\n  int q;\n  cin >> q;\n  for (int i = 0; i < q; i++)\n    solve();\n}","change":"replace","i1":18,"i2":19,"j1":18,"j2":19,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int n, m, q;\n  string a, b;               \/\/ two sequences\n  int M[1001][1001] = {{0}}; \/\/ Memory matrix\n\n  cin >> q;\n  for (int l = 0; l < q; l++) {\n    cin >> a >> b;\n    n = a.length();\n    m = b.length();\n    for (int i = 0; i <= n; i++) {\n      for (int j = 0; j <= m; j++) {\n        if (a[i] == b[j]) {\n          M[i + 1][j + 1] = M[i][j] + 1;\n        } else {\n          M[i + 1][j + 1] = max(M[i][j + 1], M[i + 1][j]);\n        }\n      }\n    }\n\n    cout << M[n][m] << endl; \/\/ The time complexity equals to O (n * m)\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int n, m, q;\n  string a, b;               \/\/ two sequences\n  int M[1010][1010] = {{0}}; \/\/ Memory matrix\n\n  cin >> q;\n  for (int l = 0; l < q; l++) {\n    cin >> a >> b;\n    n = a.length();\n    m = b.length();\n    for (int i = 0; i <= n; i++) {\n      for (int j = 0; j <= m; j++) {\n        if (a[i] == b[j]) {\n          M[i + 1][j + 1] = M[i][j] + 1;\n        } else {\n          M[i + 1][j + 1] = max(M[i][j + 1], M[i + 1][j]);\n        }\n      }\n    }\n\n    cout << M[n][m] << endl; \/\/ The time complexity equals to O (n * m)\n  }\n  return 0;\n}","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int q, t1, t2;\n  string s1, s2;\n  const int maxS = 10;\n  int m[maxS][maxS];\n\n  cin >> q;\n\n  for (int i = 0; i < q; i++) {\n\n    for (int i = 0; i < maxS; i++)\n      for (int j = 0; j < maxS; j++)\n        m[i][j] = 0;\n\n    cin >> s1 >> s2;\n\n    t1 = s1.size() - 1;\n    t2 = s2.size() - 1;\n\n    if (s1[0] == s2[0])\n      m[0][0] = 1;\n\n    for (int i = 0; i < t1; i++) {\n      int f = 0;\n      if (s1[i + 1] == s2[0])\n        f = 1;\n      m[i + 1][0] = max(m[i][0], f);\n    }\n\n    for (int j = 0; j < t2; j++) {\n      int f = 0;\n      if (s2[j + 1] == s1[0])\n        f = 1;\n      m[0][j + 1] = max(m[0][j], f);\n    }\n\n    for (int i = 0; i < t1; i++) {\n      for (int j = 0; j < t2; j++) {\n        if (s1[i + 1] == s2[j + 1])\n          m[i + 1][j + 1] = m[i][j] + 1;\n        else\n          m[i + 1][j + 1] = max(m[i][j + 1], m[i + 1][j]);\n      }\n    }\n\n    cout << m[t1][t2] << endl;\n  }\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int q, t1, t2;\n  string s1, s2;\n  const int maxS = 1000;\n  int m[maxS][maxS];\n\n  cin >> q;\n\n  for (int i = 0; i < q; i++) {\n\n    for (int i = 0; i < maxS; i++)\n      for (int j = 0; j < maxS; j++)\n        m[i][j] = 0;\n\n    cin >> s1 >> s2;\n\n    t1 = s1.size() - 1;\n    t2 = s2.size() - 1;\n\n    if (s1[0] == s2[0])\n      m[0][0] = 1;\n\n    for (int i = 0; i < t1; i++) {\n      int f = 0;\n      if (s1[i + 1] == s2[0])\n        f = 1;\n      m[i + 1][0] = max(m[i][0], f);\n    }\n\n    for (int j = 0; j < t2; j++) {\n      int f = 0;\n      if (s2[j + 1] == s1[0])\n        f = 1;\n      m[0][j + 1] = max(m[0][j], f);\n    }\n\n    for (int i = 0; i < t1; i++) {\n      for (int j = 0; j < t2; j++) {\n        if (s1[i + 1] == s2[j + 1])\n          m[i + 1][j + 1] = m[i][j] + 1;\n        else\n          m[i + 1][j + 1] = max(m[i][j + 1], m[i + 1][j]);\n      }\n    }\n\n    cout << m[t1][t2] << endl;\n  }\n  return 0;\n}\n","change":"replace","i1":8,"i2":9,"j1":8,"j2":9,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <cstdio>\n#include <cstring>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n  char x[10000], y[10000];\n  int dp[10010][10010];\n  \/\/ load n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    \/\/ load string\n    scanf(\"%s\", x);\n    scanf(\"%s\", y);\n    \/\/ dp\n    for (int j = 0; j < strlen(x); j++) {\n      for (int k = 0; k < strlen(y); k++) {\n        if (x[j] == y[k]) {\n          dp[j + 1][k + 1] = dp[j][k] + 1;\n        }\n\n        else {\n          if (dp[j][k + 1] > dp[j + 1][k]) {\n            dp[j + 1][k + 1] = dp[j][k + 1];\n          }\n\n          else {\n            dp[j + 1][k + 1] = dp[j + 1][k];\n          }\n        }\n      }\n    }\n    cout << dp[strlen(x)][strlen(y)] << endl;\n  }\n\n  return 0;\n}","changed_src":"#include <cstdio>\n#include <cstring>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n  char x[1001], y[1001];\n  int dp[1010][1010];\n  \/\/ load n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    \/\/ load string\n    scanf(\"%s\", x);\n    scanf(\"%s\", y);\n    \/\/ dp\n    for (int j = 0; j < strlen(x); j++) {\n      for (int k = 0; k < strlen(y); k++) {\n        if (x[j] == y[k]) {\n          dp[j + 1][k + 1] = dp[j][k] + 1;\n        }\n\n        else {\n          if (dp[j][k + 1] > dp[j + 1][k]) {\n            dp[j + 1][k + 1] = dp[j][k + 1];\n          }\n\n          else {\n            dp[j + 1][k + 1] = dp[j + 1][k];\n          }\n        }\n      }\n    }\n    cout << dp[strlen(x)][strlen(y)] << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":7,"i2":9,"j1":7,"j2":9,"error":"-11","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <math.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#define MAX 1000\nvoid solve(void);\nint q, count[MAX][MAX] = {}, xlength, ylength;\nchar X[MAX], Y[MAX];\n\nvoid solve(void) {\n  int i, j;\n\n  xlength = strlen(X);\n  ylength = strlen(Y);\n\n  for (i = 1; i <= xlength; i++) {\n    for (j = 1; j <= ylength; j++) {\n      if (X[i - 1] == Y[j - 1])\n        count[i][j] = count[i - 1][j - 1] + 1;\n      else if (count[i - 1][j] >= count[i][j - 1])\n        count[i][j] = count[i - 1][j];\n      else\n        count[i][j] = count[i][j - 1];\n    }\n  }\n}\n\nint main() {\n  int i;\n\n  scanf(\"%d\", &q);\n\n  for (i = 1; i <= q; i++) {\n    scanf(\"%s\", X);\n    scanf(\"%s\", Y);\n    solve();\n    printf(\"%d\\n\", count[xlength][ylength]);\n  }\n\n  \/*for(i=0;i<q;i++){\n    printf(\"%d\\n\",count[][]);\n    }*\/\n\n  return 0;\n}","changed_src":"#include <math.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#define MAX 1001\nvoid solve(void);\nint q, count[MAX][MAX] = {}, xlength, ylength;\nchar X[MAX], Y[MAX];\n\nvoid solve(void) {\n  int i, j;\n\n  xlength = strlen(X);\n  ylength = strlen(Y);\n\n  for (i = 1; i <= xlength; i++) {\n    for (j = 1; j <= ylength; j++) {\n      if (X[i - 1] == Y[j - 1])\n        count[i][j] = count[i - 1][j - 1] + 1;\n      else if (count[i - 1][j] >= count[i][j - 1])\n        count[i][j] = count[i - 1][j];\n      else\n        count[i][j] = count[i][j - 1];\n    }\n  }\n}\n\nint main() {\n  int i;\n\n  scanf(\"%d\", &q);\n\n  for (i = 1; i <= q; i++) {\n    scanf(\"%s\", X);\n    scanf(\"%s\", Y);\n    solve();\n    printf(\"%d\\n\", count[xlength][ylength]);\n  }\n\n  \/*for(i=0;i<q;i++){\n    printf(\"%d\\n\",count[][]);\n    }*\/\n\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cassert>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\n\/\/ ---------------------\n\/\/ repetition\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n\n\/\/ debug\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x)                                                               \\\n  cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\"                       \\\n       << \" \" << __FILE__ << endl;\n\n\/\/ ---------------------\n#define INF 922337203685477580\ntypedef long long ll;\n\nint dp[1000][1000];\n\nint main() {\n  int q;\n  cin >> q;\n  REP(loop, q) {\n    char S[1000], T[1000];\n    cin >> S >> T;\n\n    REP(i, strlen(S)) {\n      REP(j, strlen(T)) { dp[i][j] = 0; }\n    }\n    for (int i = 0; i < strlen(S); i++) {\n      for (int j = 0; j < strlen(T); j++) {\n        if (S[i] == T[j]) {\n          dp[i + 1][j + 1] = dp[i][j] + 1;\n        } else {\n          dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1]);\n        }\n      }\n    }\n    cout << dp[strlen(S)][strlen(T)] << endl;\n  }\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cassert>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\n\/\/ ---------------------\n\/\/ repetition\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n\n\/\/ debug\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x)                                                               \\\n  cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\"                       \\\n       << \" \" << __FILE__ << endl;\n\n\/\/ ---------------------\n#define INF 922337203685477580\ntypedef long long ll;\n\nint dp[1010][1010];\n\nint main() {\n  int q;\n  cin >> q;\n  REP(loop, q) {\n    char S[1000], T[1000];\n    cin >> S >> T;\n\n    REP(i, strlen(S)) {\n      REP(j, strlen(T)) { dp[i][j] = 0; }\n    }\n    for (int i = 0; i < strlen(S); i++) {\n      for (int j = 0; j < strlen(T); j++) {\n        if (S[i] == T[j]) {\n          dp[i + 1][j + 1] = dp[i][j] + 1;\n        } else {\n          dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1]);\n        }\n      }\n    }\n    cout << dp[strlen(S)][strlen(T)] << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":31,"i2":32,"j1":31,"j2":32,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint N, len1, len2;\nstring seq1, seq2;\nint dp[1000][1000];\n\nint main() {\n  cin >> N;\n  for (int M = 0; M < N; M++) {\n    cin >> seq1 >> seq2;\n    len1 = seq1.length();\n    len2 = seq2.length();\n    for (int i = 1; i <= len1; i++) {\n      for (int j = 1; j <= len2; j++) {\n        if (seq1[i - 1] == seq2[j - 1]) {\n          dp[i][j] = dp[i - 1][j - 1] + 1;\n        } else if (dp[i][j - 1] > dp[i - 1][j]) {\n          dp[i][j] = dp[i][j - 1];\n        } else {\n          dp[i][j] = dp[i - 1][j];\n        }\n      }\n    }\n    cout << dp[len1][len2] << endl;\n  }\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint N, len1, len2;\nstring seq1, seq2;\nint dp[1000 + 10][1000 + 10];\n\nint main() {\n  cin >> N;\n  for (int M = 0; M < N; M++) {\n    cin >> seq1 >> seq2;\n    len1 = seq1.length();\n    len2 = seq2.length();\n    for (int i = 1; i <= len1; i++) {\n      for (int j = 1; j <= len2; j++) {\n        if (seq1[i - 1] == seq2[j - 1]) {\n          dp[i][j] = dp[i - 1][j - 1] + 1;\n        } else if (dp[i][j - 1] > dp[i - 1][j]) {\n          dp[i][j] = dp[i][j - 1];\n        } else {\n          dp[i][j] = dp[i - 1][j];\n        }\n      }\n    }\n    cout << dp[len1][len2] << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <bitset>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\n#define VARIABLE(x) cerr << #x << \"=\" << x << endl\n#define BINARY(x) static_cast<bitset<16>>(x);\n#define if_range(x, w, h) if (w <= x && x <= h)\n#define BitCheck(a, b) (a >> b) & 1\n#define BitSet(a, b) a |= (1 << b)\n#define BitunSet(a, b) a &= ~(1 << b)\n#define max(a, b) (((a) > (b)) ? (a) : (b))\n#define min(a, b) (((a) < (b)) ? (a) : (b))\n\nint compare_int(const void *a, const void *b) { return *(int *)a - *(int *)b; }\n\nint main() {\n  int n, m, a, dp[102][102] = {0};\n  char s[1001], t[1001];\n  scanf(\"%d\", &a);\n  for (int k = 0; a > k; k++) {\n    scanf(\"%s %s\", s, t);\n    n = strlen(s);\n    m = strlen(t);\n    for (int i = 1; n >= i; i++) {\n      for (int j = 1; m >= j; j++) {\n        if (s[i - 1] == t[j - 1])\n          dp[i][j] = dp[i - 1][j - 1] + 1;\n        else\n          dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);\n      }\n    }\n    printf(\"%d\\n\", dp[n][m]);\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <bitset>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\n#define VARIABLE(x) cerr << #x << \"=\" << x << endl\n#define BINARY(x) static_cast<bitset<16>>(x);\n#define if_range(x, w, h) if (w <= x && x <= h)\n#define BitCheck(a, b) (a >> b) & 1\n#define BitSet(a, b) a |= (1 << b)\n#define BitunSet(a, b) a &= ~(1 << b)\n#define max(a, b) (((a) > (b)) ? (a) : (b))\n#define min(a, b) (((a) < (b)) ? (a) : (b))\n\nint compare_int(const void *a, const void *b) { return *(int *)a - *(int *)b; }\n\nint main() {\n  int n, m, a, dp[1002][1002] = {0};\n  char s[1001], t[1001];\n  scanf(\"%d\", &a);\n  for (int k = 0; a > k; k++) {\n    scanf(\"%s %s\", s, t);\n    n = strlen(s);\n    m = strlen(t);\n    for (int i = 1; n >= i; i++) {\n      for (int j = 1; m >= j; j++) {\n        if (s[i - 1] == t[j - 1])\n          dp[i][j] = dp[i - 1][j - 1] + 1;\n        else\n          dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);\n      }\n    }\n    printf(\"%d\\n\", dp[n][m]);\n  }\n  return 0;\n}","change":"replace","i1":29,"i2":30,"j1":29,"j2":30,"error":"0","stderr":""}
-{"problem_id":"p02235","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cstring>\n#include <iostream>\nusing namespace std;\n\nconst int MAX_LENGTH = 256;\n\nchar A[MAX_LENGTH + 1];\nchar B[MAX_LENGTH + 1];\n\nint tu[MAX_LENGTH][MAX_LENGTH];\n\nvoid lcs(int, int);\n\nint main() {\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; ++i) {\n    cin >> A >> B;\n    int lA = strlen(A), lB = strlen(B);\n    lcs(lA, lB);\n    cout << tu[lA][lB] << endl;\n  }\n}\n\nvoid lcs(int lA, int lB) {\n  for (int i = 0; i < lA; ++i)\n    tu[0][i] = 0;\n  for (int i = 0; i < lB; ++i)\n    tu[i][0] = 0;\n\n  for (int i = 1; i <= lA; i++) {\n    for (int j = 1; j <= lB; j++) {\n      if (A[i - 1] == B[j - 1])\n        tu[i][j] = tu[i - 1][j - 1] + 1;\n      else\n        tu[i][j] = max(tu[i][j - 1], tu[i - 1][j]);\n    }\n  }\n}","changed_src":"#include <algorithm>\n#include <cstring>\n#include <iostream>\nusing namespace std;\n\nconst int MAX_LENGTH = 1024;\n\nchar A[MAX_LENGTH + 1];\nchar B[MAX_LENGTH + 1];\n\nint tu[MAX_LENGTH][MAX_LENGTH];\n\nvoid lcs(int, int);\n\nint main() {\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; ++i) {\n    cin >> A >> B;\n    int lA = strlen(A), lB = strlen(B);\n    lcs(lA, lB);\n    cout << tu[lA][lB] << endl;\n  }\n}\n\nvoid lcs(int lA, int lB) {\n  for (int i = 0; i < lA; ++i)\n    tu[0][i] = 0;\n  for (int i = 0; i < lB; ++i)\n    tu[i][0] = 0;\n\n  for (int i = 1; i <= lA; i++) {\n    for (int j = 1; j <= lB; j++) {\n      if (A[i - 1] == B[j - 1])\n        tu[i][j] = tu[i - 1][j - 1] + 1;\n      else\n        tu[i][j] = max(tu[i][j - 1], tu[i - 1][j]);\n    }\n  }\n}","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"0","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\n#include <math.h>\nusing namespace std;\nint main() {\n  int x, y, n, b = 0, o;\n  cin >> n;\n  for (o = 0; o < n; o++) {\n    cin >> x;\n    for (y = 2; y < x; y++) {\n      if (x % y == 0) {\n        goto loop;\n      }\n    }\n    b++;\n  loop:;\n  }\n  cout << b << endl;\n}\n","changed_src":"#include <bits\/stdc++.h>\n#include <math.h>\nusing namespace std;\nint main() {\n  int x, y, n, b = 0, o;\n  cin >> n;\n  for (o = 0; o < n; o++) {\n    cin >> x;\n    for (y = 2; y * y <= x; y++) {\n      if (x % y == 0) {\n        goto loop;\n      }\n    }\n    b++;\n  loop:;\n  }\n  cout << b << endl;\n}\n","change":"replace","i1":8,"i2":9,"j1":8,"j2":9,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cmath>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int A[n], count = 0;\n  for (int i = 0; i < n; i++) {\n    cin >> A[i];\n  }\n  for (int i = 0; i < n; i++) {\n    int L = A[i];\n    int M = sqrt(L);\n    for (int x = 2; x < L; x++) {\n      if (L % x == 0) {\n        count--;\n        break;\n      }\n    }\n    count++;\n  }\n  cout << count << endl;\n  return 0;\n}\n","changed_src":"#include <cmath>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int A[n], count = 0;\n  for (int i = 0; i < n; i++) {\n    cin >> A[i];\n  }\n  for (int i = 0; i < n; i++) {\n    int L = A[i];\n    int M = sqrt(L);\n    for (int x = 2; x <= M; x++) {\n      if (L % x == 0) {\n        count--;\n        break;\n      }\n    }\n    count++;\n  }\n  cout << count << endl;\n  return 0;\n}","change":"replace","i1":14,"i2":15,"j1":14,"j2":15,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nbool is_prime[50000000];\nint main() {\n\n  for (int i = 0; i < 50000000; i++) {\n    is_prime[i] = true;\n  }\n\n  is_prime[0] = false;\n  for (int i = 1; i < 50000000; i++) {\n    if (is_prime[i]) {\n      for (int j = i * 3 + 1; j < 50000000; j += 2 * i + 1) {\n        is_prime[j] = false;\n      }\n    }\n  }\n\n  int n, tag;\n  cin >> n;\n  int cnt = 0;\n  for (int i = 0; i < n; i++) {\n    cin >> tag;\n    if (tag % 2 == 0) {\n      if (tag == 2) {\n        cnt++;\n      }\n    } else {\n      if (is_prime[tag \/ 2]) {\n        cnt++;\n      }\n    }\n  }\n\n  cout << cnt << endl;\n  int xxx;\n  cin >> xxx;\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nbool is_prime[50000000];\nint main() {\n\n  for (int i = 0; i < 50000000; i++) {\n    is_prime[i] = true;\n  }\n\n  is_prime[0] = false;\n  for (int i = 1; i * i + i < 25000000; i++) {\n    if (is_prime[i]) {\n      for (int j = i * 3 + 1; j < 50000000; j += 2 * i + 1) {\n        is_prime[j] = false;\n      }\n    }\n  }\n\n  int n, tag;\n  cin >> n;\n  int cnt = 0;\n  for (int i = 0; i < n; i++) {\n    cin >> tag;\n    if (tag % 2 == 0) {\n      if (tag == 2) {\n        cnt++;\n      }\n    } else {\n      if (is_prime[tag \/ 2]) {\n        cnt++;\n      }\n    }\n  }\n\n  cout << cnt << endl;\n  int xxx;\n  cin >> xxx;\n  return 0;\n}","change":"replace","i1":11,"i2":12,"j1":11,"j2":12,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"Python","original_status":"Time Limit Exceeded","original_src":"prime = set([2])\nfor i in range(3, 100000000, 2):\n    for j in prime:\n        if i % j == 0:\n            break\n    else:\n        prime.add(i)\nn = int(input())\ncnt = 0\nfor i in (int(input()) for _ in range(n)):\n    if i in prime:\n        cnt += 1\nprint(cnt)\n","changed_src":"import sys\nfrom math import *\n\nreadline = sys.stdin.readline\n\n\ndef isPrime(x):\n    if x == 2 or x == 3:\n        return True\n    elif x % 2 == 0 or x % 3 == 0:\n        return False\n    s = ceil(sqrt(x))\n    for i in range(5, s + 1, 2):\n        if x % i == 0:\n            return False\n    return True\n\n\nprint(sum(isPrime(int(readline())) for _ in range(int(input()))))\n","change":"replace","i1":0,"i2":13,"j1":0,"j2":19,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nusing ll = long long;\n#define debug(x) cerr << #x << \": \" << x << endl;\n#define line() cerr << \"---------------\" << endl;\n\nbool isPrime(int x) {\n  if (x == 1)\n    return false;\n  for (int i = 2; i < x; i++) {\n    if (x % i == 0) {\n      return false;\n    }\n  }\n  return true;\n}\n\nint main() {\n  int n;\n  cin >> n;\n  int cnt = 0;\n  for (int i = 0; i < n; i++) {\n    int x;\n    cin >> x;\n    if (isPrime(x)) {\n      cnt++;\n    }\n  }\n\n  cout << cnt << endl;\n\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nusing ll = long long;\n#define debug(x) cerr << #x << \": \" << x << endl;\n#define line() cerr << \"---------------\" << endl;\n\nbool isPrime(int x) {\n  if (x == 1)\n    return false;\n  for (int i = 2; i * i <= x; i++) {\n    if (x % i == 0) {\n      return false;\n    }\n  }\n  return true;\n}\n\nint main() {\n  int n;\n  cin >> n;\n  int cnt = 0;\n  for (int i = 0; i < n; i++) {\n    int x;\n    cin >> x;\n    if (isPrime(x)) {\n      cnt++;\n    }\n  }\n\n  cout << cnt << endl;\n\n  return 0;\n}","change":"replace","i1":10,"i2":11,"j1":10,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n\nusing namespace std;\n\n#define CALC_PRIME_MAX 10000   \/\/ _\/10 ^ 8\n#define PRIME_ELEMENT_MAX 1229 \/\/ prime( _\/10 ^ 8 )\n\nint prime_number[PRIME_ELEMENT_MAX];\n\nbool isPrime(int element) {\n  for (int i = 0; prime_number[i] * prime_number[i] <= element; i++) {\n    if (element % prime_number[i] == 0)\n      return false;\n  }\n  return true;\n}\n\nvoid calcPrime() {\n  \/\/ add 2, 3 (prime)\n  int prime_index = 2;\n  prime_number[0] = 2;\n  prime_number[1] = 3;\n  \/\/ next prime is 5\n  for (int element = 5; element <= CALC_PRIME_MAX; element += 2) {\n    bool is_prime = true;\n    \/\/ judge prime\n    for (int i = 1; prime_number[i] * prime_number[i] <= element; i++) {\n      if (element % prime_number[i] == 0) {\n        is_prime = false;\n        break;\n      }\n    }\n    \/\/ add prime\n    if (is_prime)\n      prime_number[prime_index++] = element;\n  }\n  \/\/\tcout << \"prime_element_num = \" << prime_index << endl;\n  return;\n}\n\nint main() {\n  int n, element, count = 0;\n  calcPrime();\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> element;\n    if (isPrime(element))\n      count++;\n  }\n  cout << count << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n\nusing namespace std;\n\n#define CALC_PRIME_MAX 10007   \/\/ _\/10 ^ 8 + next prime\n#define PRIME_ELEMENT_MAX 1230 \/\/ prime( _\/10 ^ 8 ) + 1(10007)\n\nint prime_number[PRIME_ELEMENT_MAX];\n\nbool isPrime(int element) {\n  for (int i = 0; prime_number[i] * prime_number[i] <= element; i++) {\n    if (element % prime_number[i] == 0)\n      return false;\n  }\n  return true;\n}\n\nvoid calcPrime() {\n  \/\/ add 2, 3 (prime)\n  int prime_index = 2;\n  prime_number[0] = 2;\n  prime_number[1] = 3;\n  \/\/ next prime is 5\n  for (int element = 5; element <= CALC_PRIME_MAX; element += 2) {\n    bool is_prime = true;\n    \/\/ judge prime\n    for (int i = 1; prime_number[i] * prime_number[i] <= element; i++) {\n      if (element % prime_number[i] == 0) {\n        is_prime = false;\n        break;\n      }\n    }\n    \/\/ add prime\n    if (is_prime)\n      prime_number[prime_index++] = element;\n  }\n  \/\/\tcout << \"prime_element_num = \" << prime_index << endl;\n  return;\n}\n\nint main() {\n  int n, element, count = 0;\n  calcPrime();\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> element;\n    if (isPrime(element))\n      count++;\n  }\n  cout << count << endl;\n  return 0;\n}","change":"replace","i1":4,"i2":6,"j1":4,"j2":6,"error":"0","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nbool isPrime(int val);\nint countPrime(vector<int> &array);\n\nint main() {\n  int size;\n  vector<int> array;\n  cin >> size;\n  for (int i = 0; i < size; i++) {\n    int tmp;\n    cin >> tmp;\n    array.push_back(tmp);\n  }\n  cout << countPrime(array) << endl;\n  return 0;\n}\n\nint countPrime(vector<int> &array) {\n  int num = 0;\n  for (int i = 0; i < array.size(); i++) {\n    if (isPrime(array[i])) {\n      num++;\n    }\n  }\n  return num;\n}\n\nbool isPrime(int val) {\n  if (val <= 1) {\n    return false;\n  }\n  for (int i = 2; i <= val \/ 2; i++) {\n    if (val % i == 0) {\n      return false;\n    }\n  }\n  return true;\n}","changed_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nbool isPrime(int val);\nint countPrime(vector<int> &array);\n\nint main() {\n  int size;\n  vector<int> array;\n  cin >> size;\n  for (int i = 0; i < size; i++) {\n    int tmp;\n    cin >> tmp;\n    array.push_back(tmp);\n  }\n  cout << countPrime(array) << endl;\n  return 0;\n}\n\nint countPrime(vector<int> &array) {\n  int num = 0;\n  for (int i = 0; i < array.size(); i++) {\n    if (isPrime(array[i])) {\n      num++;\n    }\n  }\n  return num;\n}\n\nbool isPrime(int val) {\n  if (val <= 1) {\n    return false;\n  }\n  for (int i = 2; i * i <= val; i++) {\n    if (val % i == 0) {\n      return false;\n    }\n  }\n  return true;\n}","change":"replace","i1":34,"i2":35,"j1":34,"j2":35,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nint main(void) {\n  std::ios::sync_with_stdio(false);\n  int n, COUNT = 0;\n  std::cin >> n;\n  int x;\n  for (int i = 0; i < n; ++i) {\n    std::cin >> x;\n    if (x == 2) {\n      ++COUNT;\n    } else if (x % 2 != 0) {\n      bool FLUG = false;\n      int Max = static_cast<int>(x \/ 2) + 1;\n      for (int i = 3; i < Max; i += 2) {\n        if (x % i == 0) {\n          FLUG = true;\n          break;\n        }\n      }\n      if (FLUG == false) {\n        ++COUNT;\n      }\n    }\n  }\n  std::cout << COUNT << std::endl;\n  \/\/ system(\"pause\");\n  return 0;\n}","changed_src":"#include <iostream>\nint main(void) {\n  std::ios::sync_with_stdio(false);\n  int n, COUNT = 0;\n  std::cin >> n;\n  int x;\n  for (int i = 0; i < n; ++i) {\n    std::cin >> x;\n    if (x == 2) {\n      ++COUNT;\n    } else if (x % 2 != 0) {\n      bool FLUG = false;\n      for (int i = 3; i * i <= x; i += 2) {\n        if (x % i == 0) {\n          FLUG = true;\n          break;\n        }\n      }\n      if (FLUG == false) {\n        ++COUNT;\n      }\n    }\n  }\n  std::cout << COUNT << std::endl;\n  \/\/ system(\"pause\");\n  return 0;\n}","change":"replace","i1":12,"i2":14,"j1":12,"j2":13,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cmath>\n#include <iostream>\n\nusing namespace std;\n\nvoid PrimeNumSum(int &sum, unsigned int &num) {\n  unsigned int divisor = num \/ 2 + 1;\n\n  if (divisor == 2) {\n    sum++;\n    return;\n  }\n  while (divisor >= 2) {\n    if (num % divisor == 0) {\n      return;\n    }\n    divisor--;\n  }\n\n  sum++;\n}\n\nint main() {\n  int count;\n  cin >> count;\n\n  unsigned int *list = new unsigned int[count];\n\n  for (int i = 0; i < count; i++) {\n    cin >> list[i];\n  }\n\n  int sum = 0;\n\n  for (int i = 0; i < count; i++) {\n    PrimeNumSum(sum, list[i]);\n  }\n\n  cout << sum << endl;\n\n  delete[] list;\n  return 0;\n}","changed_src":"#include <cmath>\n#include <iostream>\n\nusing namespace std;\n\nvoid PrimeNumSum(int &sum, unsigned int &num) {\n  unsigned int divisor = sqrt(num) + 1;\n\n  if (divisor == 2) {\n    sum++;\n    return;\n  }\n  while (divisor >= 2) {\n    if (num % divisor == 0) {\n      return;\n    }\n    divisor--;\n  }\n\n  sum++;\n}\n\nint main() {\n  int count;\n  cin >> count;\n\n  unsigned int *list = new unsigned int[count];\n\n  for (int i = 0; i < count; i++) {\n    cin >> list[i];\n  }\n\n  int sum = 0;\n\n  for (int i = 0; i < count; i++) {\n    PrimeNumSum(sum, list[i]);\n  }\n\n  cout << sum << endl;\n\n  delete[] list;\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <iostream>\n#include <vector>\n\nbool is_prime(int a);\n\nint main() {\n  int n;\n  int cnt = 0;\n  std::cin >> n;\n  std::vector<int> a(n);\n  for (int i = 0; i < n; i++) {\n    std::cin >> a[i];\n  }\n  for (int i = 0; i < n; i++) {\n    bool flag = is_prime(a[i]);\n    if (flag)\n      cnt++;\n  }\n  std::cout << cnt << '\\n';\n  return 0;\n}\n\nbool is_prime(int a) {\n  for (int i = 0; i < std::sqrt(a); i++) {\n    if (a % i == 0)\n      return false;\n  }\n  return true;\n}\n","changed_src":"#include <cmath>\n#include <iostream>\n#include <vector>\n\nbool is_prime(int a);\n\nint main() {\n  int n;\n  int cnt = 0;\n  std::cin >> n;\n  std::vector<int> a(n);\n  for (int i = 0; i < n; i++) {\n    std::cin >> a[i];\n  }\n  for (int i = 0; i < n; i++) {\n    bool flag = is_prime(a[i]);\n    if (flag)\n      cnt++;\n  }\n  std::cout << cnt << '\\n';\n  return 0;\n}\n\nbool is_prime(int a) {\n  if (a == 2) {\n    return true;\n  } else if (a == 0 || a == 1) {\n    return false;\n  }\n  for (int i = 2; i <= std::sqrt(a); i++) {\n    if (a % i == 0)\n      return false;\n  }\n  return true;\n}\n","change":"replace","i1":24,"i2":25,"j1":24,"j2":30,"error":"-8","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nvoid Makepn(vector<int> &v, int n) {\n  int count = 1;\n  int i, j;\n  vector<bool> pn(n + 1, true);\n  pn[0] = false;\n  pn[1] = false;\n  for (i = 2; i < sqrt(n); i++) {\n    if (pn[i]) {\n      for (j = 0; i * (j + 2) < n; j++) {\n        pn[i * (j + 2)] = false;\n      }\n    }\n  }\n  for (i = 2; i < n; i++) {\n    if (pn[i]) {\n      count++;\n    }\n  }\n  v.resize(count);\n\n  v[0] = 2;\n  j = 1;\n  for (i = 3; i <= n; i += 2) {\n    if (pn[i]) {\n      v[j++] = i;\n    }\n  }\n  return;\n}\n\nint main() {\n  ios::sync_with_stdio(false);\n  vector<int> pn;\n  Makepn(pn, 10000);\n  int n, num, ans;\n  cin >> n;\n  ans = n;\n  for (int i = 0; i < n; i++) {\n    cin >> num;\n    for (int j = 0; j < pn.size(); j++) {\n      if (pn[j] * pn[j] > num)\n        break;\n      if (num % pn[j] == 0) {\n        ans--;\n        break;\n      }\n    }\n  }\n  cout << ans << endl;\n  return 0;\n}","changed_src":"#include <cmath>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nvoid Makepn(vector<int> &v, int n) {\n  int count = 0;\n  int i, j;\n  vector<bool> pn(n + 1, true);\n  pn[0] = false;\n  pn[1] = false;\n  for (i = 2; i < sqrt(n); i++) {\n    if (pn[i]) {\n      for (j = 0; i * (j + 2) < n; j++) {\n        pn[i * (j + 2)] = false;\n      }\n    }\n  }\n  for (i = 2; i < n; i++) {\n    if (pn[i]) {\n      count++;\n    }\n  }\n  v.resize(count);\n\n  v[0] = 2;\n  j = 1;\n  for (i = 3; i <= n; i += 2) {\n    if (pn[i]) {\n      v[j++] = i;\n    }\n  }\n  return;\n}\n\nint main() {\n  ios::sync_with_stdio(false);\n  vector<int> pn;\n  Makepn(pn, 10000);\n  int n, num, ans;\n  cin >> n;\n  ans = n;\n  for (int i = 0; i < n; i++) {\n    cin >> num;\n    for (int j = 0; j < pn.size(); j++) {\n      if (pn[j] * pn[j] > num)\n        break;\n      if (num % pn[j] == 0) {\n        ans--;\n        break;\n      }\n    }\n  }\n  cout << ans << endl;\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"0","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\nusing namespace std;\nbool Prime(int x) {\n  for (int i = 2; i < (x \/ 2 + 1); i++) {\n    if (x % i == 0) {\n      return false;\n    }\n  }\n  return true;\n}\nint main() {\n  int n;\n  scanf(\"%d\", &n);\n  int N[n];\n  for (int i = 0; i < n; i++) {\n    scanf(\" %d\", &N[i]);\n  }\n  int cnt;\n  for (int i = 0; i < n; i++) {\n    if (Prime(N[i]) == true) {\n      cnt++;\n    }\n  }\n  printf(\"%d\\n\", cnt);\n  return 0;\n}\n","changed_src":"#include <cstdio>\nusing namespace std;\nbool Prime(int x) {\n  for (int i = 2; i * i <= x; i++) {\n    if (x % i == 0) {\n      return false;\n    }\n  }\n  return true;\n}\nint main() {\n  int n;\n  scanf(\"%d\", &n);\n  int N[n];\n  for (int i = 0; i < n; i++) {\n    scanf(\" %d\", &N[i]);\n  }\n  int cnt;\n  for (int i = 0; i < n; i++) {\n    if (Prime(N[i]) == true) {\n      cnt++;\n    }\n  }\n  printf(\"%d\\n\", cnt);\n  return 0;\n}\n","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <math.h>\n#include <stdio.h>\n#include <string.h>\nusing namespace std;\n\n#define MAX 256\n\nint f(int x) {\n  if (x == 2)\n    return 1;\n  if (x % 2 == 0)\n    return 0;\n  for (int i = 3; i <= x \/ 2; i += 2) {\n    if (x % i == 0)\n      return 0;\n  }\n  return 1;\n}\n\nint main(void) {\n\n  int a;\n  scanf(\"%d\", &a);\n  int count = 0, b;\n\n  for (int i = 0; i < a; i++) {\n    scanf(\"%d\", &b);\n    count += f(b);\n  }\n\n  printf(\"%d\\n\", count);\n\n  return 0;\n}","changed_src":"#include <iostream>\n#include <math.h>\n#include <stdio.h>\n#include <string.h>\nusing namespace std;\n\n#define MAX 256\n\nint f(int x) {\n  if (x == 2)\n    return 1;\n  if (x % 2 == 0)\n    return 0;\n  for (int i = 3; i <= (int)sqrt(x); i += 2) {\n    if (x % i == 0)\n      return 0;\n  }\n  return 1;\n}\n\nint main(void) {\n\n  int a;\n  scanf(\"%d\", &a);\n  int count = 0, b;\n\n  for (int i = 0; i < a; i++) {\n    scanf(\"%d\", &b);\n    count += f(b);\n  }\n\n  printf(\"%d\\n\", count);\n\n  return 0;\n}","change":"replace","i1":13,"i2":14,"j1":13,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define reps(i, f, n) for (int i = (f); i <= (n); ++i)\n#define outl(x) cout << (x) << '\\n'\n#define FAST() cin.tie(0), ios::sync_with_stdio(false)\ntemplate <class A, class B> inline bool chmax(A &a, B b) {\n  return b > a ? a = b, 1 : 0;\n}\ntemplate <class A, class B> inline bool chmin(A &a, B b) {\n  return b < a ? a = b, 1 : 0;\n}\ninline int updiv(int a, int b) { return ((a + b - 1) \/ b); }\n\nbool prime(int n) {\n  if ((n & 1) == 0)\n    return (n == 2);\n  for (int i = 3; i < n; i += 2) {\n    if (n % i == 0)\n      return (false);\n  }\n  return (true);\n}\n\nint main() {\n  FAST();\n  int n, a, cnt = 0;\n  cin >> n;\n  while (n--) {\n    cin >> a;\n    cnt += prime(a);\n  }\n  outl(cnt);\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define reps(i, f, n) for (int i = (f); i <= (n); ++i)\n#define outl(x) cout << (x) << '\\n'\n#define FAST() cin.tie(0), ios::sync_with_stdio(false)\ntemplate <class A, class B> inline bool chmax(A &a, B b) {\n  return b > a ? a = b, 1 : 0;\n}\ntemplate <class A, class B> inline bool chmin(A &a, B b) {\n  return b < a ? a = b, 1 : 0;\n}\ninline int updiv(int a, int b) { return ((a + b - 1) \/ b); }\n\nbool prime(int n) {\n  if ((n & 1) == 0)\n    return (n == 2);\n  for (int i = 3; i * i <= n; i += 2) {\n    if (n % i == 0)\n      return (false);\n  }\n  return (true);\n}\n\nint main() {\n  FAST();\n  int n, a, cnt = 0;\n  cin >> n;\n  while (n--) {\n    cin >> a;\n    cnt += prime(a);\n  }\n  outl(cnt);\n}","change":"replace","i1":17,"i2":18,"j1":17,"j2":18,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n\n  int cnt = 0;\n  for (int i = 0; i < n; i++) {\n    int a;\n    cin >> a;\n\n    for (int j = 2; j < a; j++) {\n      if (a % j == 0) {\n        cnt++;\n        break;\n      }\n    }\n  }\n\n  cout << n - cnt << endl;\n\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n\n  int cnt = 0;\n  for (int i = 0; i < n; i++) {\n    int a;\n    cin >> a;\n\n    int t = sqrt(a);\n    for (int j = 2; j <= t; j++) {\n      if (a % j == 0) {\n        cnt++;\n        break;\n      }\n    }\n  }\n\n  cout << n - cnt << endl;\n\n  return 0;\n}\n","change":"replace","i1":12,"i2":13,"j1":12,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <iostream>\nusing namespace std;\n\nint prs[5000];\nint pri = 1;\n\nint isPrime(int a) {\n  int flg;\n  if (sqrt(a) > prs[pri]) {\n    for (int i = prs[pri] + 2; i <= sqrt(a); i += 2) {\n      flg = 1;\n      for (int j = 0; j <= pri; j++) {\n        if (sqrt(i) < prs[i])\n          break;\n        if (i % prs[j] == 0) {\n          flg = 0;\n          break;\n        }\n      }\n      if (flg)\n        prs[++pri] = i;\n    }\n    \/\/ for (int i=0;i<=pri;i++)cout << prs[i] << \" \";\n  }\n  for (int i = 0; i <= pri; i++) {\n    if (sqrt(a) < prs[i])\n      break;\n    if (a % prs[i] == 0)\n      return 0;\n  }\n  return 1;\n}\n\nint main() {\n  prs[0] = 2;\n  prs[1] = 3;\n\n  int n, a, cnt = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> a;\n    cnt += isPrime(a);\n  }\n  cout << cnt << endl;\n  return 0;\n}","changed_src":"#include <cmath>\n#include <iostream>\nusing namespace std;\n\nint prs[10000];\nint pri = 1;\n\nint isPrime(int a) {\n  int flg;\n  if (sqrt(a) > prs[pri]) {\n    for (int i = prs[pri] + 2; i <= sqrt(a); i += 2) {\n      flg = 1;\n      for (int j = 0; j <= pri; j++) {\n        if (sqrt(i) < prs[i])\n          break;\n        if (i % prs[j] == 0) {\n          flg = 0;\n          break;\n        }\n      }\n      if (flg)\n        prs[++pri] = i;\n    }\n    \/\/ for (int i=0;i<=pri;i++)cout << prs[i] << \" \";\n  }\n  for (int i = 0; i <= pri; i++) {\n    if (sqrt(a) < prs[i])\n      break;\n    if (a % prs[i] == 0)\n      return 0;\n  }\n  return 1;\n}\n\nint main() {\n  prs[0] = 2;\n  prs[1] = 3;\n\n  int n, a, cnt = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> a;\n    cnt += isPrime(a);\n  }\n  cout << cnt << endl;\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\ntypedef long long ll;\nbool isPrime(ll a);\n\nint main() {\n  using namespace std;\n  ll A[10001];\n  int n, prime = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> A[i];\n    if (isPrime(A[i])) {\n      prime++;\n    }\n  }\n  cout << prime << endl;\n  return 0;\n}\n\nbool isPrime(ll a) {\n  for (ll i = 2; i < a; i++) {\n    if (a % i == 0) {\n      return false;\n    }\n  }\n  return true;\n}\n","changed_src":"#include <iostream>\ntypedef long long ll;\nbool isPrime(ll a);\n\nint main() {\n  using namespace std;\n  ll A[10001];\n  int n, prime = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> A[i];\n    if (isPrime(A[i])) {\n      prime++;\n    }\n  }\n  cout << prime << endl;\n  return 0;\n}\n\nbool isPrime(ll a) {\n  for (ll i = 2; i * i <= a; i++) {\n    if (a % i == 0) {\n      return false;\n    }\n  }\n  return true;\n}\n","change":"replace","i1":20,"i2":21,"j1":20,"j2":21,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cmath>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n, m, i, count;\n  cin >> n;\n  count = 0;\n\n  for (int j = 0; j < n; ++j) {\n    cin >> m;\n    if (m == 2)\n      ++count;\n    else if (m < 2 || m % 2 == 0) {\n      continue;\n    } else {\n      i = 3;\n      while (i <= sqrt(m)) {\n        if (m % i == 0)\n          continue;\n        i = i + 2;\n      }\n      if (i > sqrt(m)) {\n        ++count;\n      }\n    }\n  }\n  cout << count << endl;\n  return 0;\n}","changed_src":"#include <cmath>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n, m, i, count;\n  cin >> n;\n  count = 0;\n\n  for (int j = 0; j < n; ++j) {\n    cin >> m;\n    if (m == 2)\n      ++count;\n    else if (m < 2 || m % 2 == 0) {\n      continue;\n    } else {\n      i = 3;\n      while (i <= sqrt(m)) {\n        if (m % i == 0)\n          break;\n        i = i + 2;\n      }\n      if (i > sqrt(m)) {\n        ++count;\n      }\n    }\n  }\n  cout << count << endl;\n  return 0;\n}","change":"replace","i1":19,"i2":20,"j1":19,"j2":20,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\n#define REP(i, n) for (int i = 0; i < (int)n; ++i)\n\nbool isPrime(int num) {\n  \/\/ if(num < 2) return false;\n  if (num == 2)\n    return true;\n  if (num % 2 == 0)\n    return false;\n\n  for (int i = 3; i < num; i += 2) {\n    if (num % i == 0)\n      return false;\n  }\n  return true;\n}\n\nint main() {\n  int N;\n  int count = 0;\n  int num;\n\n  cin >> N;\n\n  REP(i, N) {\n    cin >> num;\n    if (isPrime(num))\n      ++count;\n  }\n\n  cout << count << endl;\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\n#define REP(i, n) for (int i = 0; i < (int)n; ++i)\n\nbool isPrime(int num) {\n  \/\/ if(num < 2) return false;\n  if (num == 2)\n    return true;\n  if (num % 2 == 0)\n    return false;\n\n  \/\/ +1 \u91cd\u8981\n  for (int i = 3; i < sqrt(num) + 1; i += 2) {\n    if (num % i == 0)\n      return false;\n  }\n  return true;\n}\n\nint main() {\n  int N;\n  int count = 0;\n  int num;\n\n  cin >> N;\n\n  REP(i, N) {\n    cin >> num;\n    if (isPrime(num))\n      ++count;\n  }\n\n  cout << count << endl;\n\n  return 0;\n}","change":"replace","i1":32,"i2":33,"j1":32,"j2":34,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Runtime Error","original_src":"\n#include <bits\/stdc++.h>\n\nusing namespace std;\n\nconst int maxn = 50001;\n\nint prime[maxn], cnt, res;\nbool isprime[maxn];\n\nvoid maketable() {\n  int base = (int)sqrt((double)maxn);\n  isprime[0] = isprime[1] = 1;\n  for (int i = 2; i < base; i++) {\n    if (!isprime[i]) {\n      prime[cnt++] = i;\n      for (int j = i + i; j < maxn; j += i) {\n        isprime[j] = 1;\n      }\n    }\n  }\n}\n\nvoid solve(int n) {\n  int k = (int)sqrt((double)n);\n  for (int i = 0; prime[i] <= k; i++) {\n    if (n % prime[i] == 0) {\n      return;\n    }\n  }\n  res++;\n}\n\nint main() {\n  maketable();\n  int n, s;\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &s);\n    solve(s);\n  }\n  printf(\"%d\\n\", res);\n  return 0;\n}\n","changed_src":"\n#include <bits\/stdc++.h>\n\nusing namespace std;\n\nconst int maxn = 50001;\n\nint prime[maxn], cnt, res;\nbool isprime[maxn];\n\nvoid maketable() {\n  int base = (int)sqrt((double)maxn);\n  isprime[0] = isprime[1] = 1;\n  for (int i = 2; i < maxn; i++) { \/\/ \u6b64\u5904i<maxn\u4e0e\u4ee5\u524d\u7684\u4e0d\u540c\n    if (!isprime[i]) {\n      prime[cnt++] = i;\n      for (int j = i + i; j < maxn; j += i) {\n        isprime[j] = 1;\n      }\n    }\n  }\n}\n\nvoid solve(int n) {\n  int k = (int)sqrt((double)n);\n  for (int i = 0; prime[i] <= k; i++) {\n    if (n % prime[i] == 0) {\n      return;\n    }\n  }\n  res++;\n}\n\nint main() {\n  maketable();\n  int n, s;\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &s);\n    solve(s);\n  }\n  printf(\"%d\\n\", res);\n  return 0;\n}\n","change":"replace","i1":13,"i2":14,"j1":13,"j2":14,"error":"0","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nbool primenum(int x);\n\nint main() {\n  int n;\n  int i;\n  int num[10000];\n  int ans = 0;\n\n  cin >> n;\n\n  for (i = 0; i < n; i++) {\n    cin >> num[i];\n  }\n\n  for (i = 0; i < n; i++) {\n    if (primenum(num[i]) == true)\n      ans++;\n  }\n\n  cout << ans << \"\\n\";\n}\n\nbool primenum(int x) {\n  int j = 3;\n\n  if (x == 2)\n    return (true);\n  if (x % 2 == 0 || x < 2)\n    return (false);\n\n  while (j * j <= x) {\n    if (x % j == 0) {\n      return (false);\n    }\n  }\n\n  return (true);\n}\n","changed_src":"#include <iostream>\n\nusing namespace std;\n\nbool primenum(int x);\n\nint main() {\n  int n;\n  int i;\n  int num[10000];\n  int ans = 0;\n\n  cin >> n;\n\n  for (i = 0; i < n; i++) {\n    cin >> num[i];\n  }\n\n  for (i = 0; i < n; i++) {\n    if (primenum(num[i]) == true)\n      ans++;\n  }\n\n  cout << ans << \"\\n\";\n}\n\nbool primenum(int x) {\n  int j = 3;\n\n  if (x == 2)\n    return (true);\n  if (x % 2 == 0 || x < 2)\n    return (false);\n\n  while (j * j <= x) {\n    if (x % j == 0) {\n      return (false);\n    }\n    j += 2;\n  }\n\n  return (true);\n}\n","change":"insert","i1":38,"i2":38,"j1":38,"j2":39,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int n, a[11000], cnt = 0;\n  cin >> n;\n  for (int i = 0; i < n; ++i)\n    cin >> a[i];\n\n  for (int i = 0; i < n; ++i) {\n    bool sosu = true;\n    for (int j = 2; j < a[i]; ++j) {\n      if (a[i] % j == 0) {\n        sosu = false;\n        break;\n      }\n    }\n    if (sosu)\n      ++cnt;\n  }\n\n  cout << cnt << endl;\n\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int n, a[11000], cnt = 0;\n  cin >> n;\n  for (int i = 0; i < n; ++i)\n    cin >> a[i];\n\n  for (int i = 0; i < n; ++i) {\n    bool sosu = true;\n    for (int j = 2; j * j <= a[i]; ++j) {\n      if (a[i] % j == 0) {\n        sosu = false;\n        break;\n      }\n    }\n    if (sosu)\n      ++cnt;\n  }\n\n  cout << cnt << endl;\n\n  return 0;\n}\n","change":"replace","i1":11,"i2":12,"j1":11,"j2":12,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int N;\n  int x;\n  int count = 0;\n  cin >> N;\n  for (int i = 0; i < N; i++) {\n    cin >> x;\n    for (int j = 2; j < x \/ 2 + 1; j++) {\n      if (x != 2) {\n        if (x % j == 0) {\n          count++;\n          break;\n        }\n      }\n    }\n  }\n  cout << N - count << endl;\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int N;\n  int x;\n  int count = 0;\n  cin >> N;\n  for (int i = 0; i < N; i++) {\n    cin >> x;\n    for (int j = 2; j * j <= x; j++) {\n      if (x % j == 0) {\n        count++;\n        break;\n      }\n    }\n  }\n  cout << N - count << endl;\n  return 0;\n}\n","change":"replace","i1":10,"i2":16,"j1":10,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\n#define MAX_N 1e6\n\nint main(void) {\n  vector<bool> eratos(MAX_N, true);\n  eratos[0] = eratos[1] = false;\n  for (int i = 2; i * i < MAX_N; i++) {\n    if (eratos[i]) {\n      for (int j = 2; i * j < MAX_N; j++) {\n        eratos[i * j] = false;\n      }\n    }\n  }\n\n  int n, input, ans = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> input;\n    if (eratos[input]) {\n      ++ans;\n    }\n  }\n\n  cout << ans << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\n#define MAX_N (1e8) + 1\n\nint main(void) {\n  vector<bool> eratos(MAX_N, true);\n  eratos[0] = eratos[1] = false;\n  for (int i = 2; i * i < MAX_N; i++) {\n    if (eratos[i]) {\n      for (int j = 2; i * j < MAX_N; j++) {\n        eratos[i * j] = false;\n      }\n    }\n  }\n\n  int n, input, ans = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> input;\n    if (eratos[input]) {\n      ++ans;\n    }\n  }\n\n  cout << ans << endl;\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\n\nconst int MAX_NUM = 100000000;\nvector<bool> ps(MAX_NUM + 1, true);\n\nint main() {\n  ps[0] = ps[1] = false;\n  for (int i = 2; i <= MAX_NUM; i++) {\n    if (!ps[i]) {\n      continue;\n    }\n    for (int j = i + i; j <= MAX_NUM; j += i) {\n      ps[j] = false;\n    }\n  }\n\n  int n;\n  cin >> n;\n  int ans = 0;\n  for (int i = 0; i < n; i++) {\n    int k;\n    cin >> k;\n    if (ps[k]) {\n      ans++;\n    }\n  }\n  cout << ans << endl;\n}","changed_src":"#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\n\nconst int MAX_NUM = 100000000;\nvector<bool> ps(MAX_NUM + 1, true);\n\nint main() {\n  ps[0] = ps[1] = false;\n  for (int i = 4; i <= MAX_NUM; i += 2) {\n    ps[i] = false;\n  }\n  for (int i = 3; i <= MAX_NUM; i += 2) {\n    if (!ps[i]) {\n      continue;\n    }\n    for (int j = i + i; j <= MAX_NUM; j += i) {\n      ps[j] = false;\n    }\n  }\n\n  int n;\n  cin >> n;\n  int ans = 0;\n  for (int i = 0; i < n; i++) {\n    int k;\n    cin >> k;\n    if (ps[k]) {\n      ans++;\n    }\n  }\n  cout << ans << endl;\n}","change":"replace","i1":30,"i2":31,"j1":30,"j2":34,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Memory Limit Exceeded","original_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\n#define MAX_N (1e9) + 1\n\nint main(void) {\n  \/\/?????????????????????\n  vector<bool> eratos(MAX_N, true);\n  eratos[0] = eratos[1] = false;\n  for (int i = 2; i * i < MAX_N; i++)\n    if (eratos[i])\n      for (int j = 2; i * j < MAX_N; j++)\n        eratos[i * j] = false;\n\n  \/\/?????\u00a8?????????\n  int n, input, ans = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> input;\n    if (eratos[input])\n      ++ans;\n  }\n\n  \/\/??????\n  cout << ans << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\n#define MAX_N (1e8) + 1\n\nint main(void) {\n  \/\/?????????????????????\n  vector<bool> eratos(MAX_N, true);\n  eratos[0] = eratos[1] = false;\n  for (int i = 2; i * i < MAX_N; i++)\n    if (eratos[i])\n      for (int j = 2; i * j < MAX_N; j++)\n        eratos[i * j] = false;\n\n  \/\/?????\u00a8?????????\n  int n, input, ans = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> input;\n    if (eratos[input])\n      ++ans;\n  }\n\n  \/\/??????\n  cout << ans << endl;\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"MLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cmath>\n#include <iomanip>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nbool is_prime(int num) {\n  for (int i = 2; i < num; i++) {\n\n    if (num % i == 0) {\n      return false;\n    }\n  }\n  return true;\n}\nint main(void) {\n  int n;\n  cin >> n;\n\n  int num;\n  int prime_count = 0;\n  for (int i = 0; i < n; i++) {\n    cin >> num;\n\n    if (is_prime(num) == true) {\n      prime_count++;\n    }\n  }\n  cout << prime_count << endl;\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <iomanip>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nbool is_prime(int num) {\n  int a = sqrt(num);\n\n  for (int i = 2; i <= a; i++) {\n\n    if (num % i == 0) {\n      return false;\n    }\n  }\n  return true;\n}\nint main(void) {\n  int n;\n  cin >> n;\n\n  int num;\n  int prime_count = 0;\n  for (int i = 0; i < n; i++) {\n    cin >> num;\n\n    if (is_prime(num) == true) {\n      prime_count++;\n    }\n  }\n  cout << prime_count << endl;\n  return 0;\n}","change":"replace","i1":8,"i2":9,"j1":8,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\nbool isprime(int x);\n\nint main() {\n  int i, j;\n  int a, n;\n  int ans = 0;\n\n  cin >> n;\n\n  for (i = 0; i < n; i++) {\n    cin >> a;\n    if (isprime(a) == true)\n      ans++;\n  }\n\n  cout << ans << \"\\n\";\n\n  return (0);\n}\n\nbool isprime(int x) {\n  int i = 3;\n\n  if (x == 2)\n    return (true);\n  if (x < 2 || x % 2 == 0)\n    return (false);\n\n  while (x >= i * i) {\n    if (x % i == 0)\n      return (false);\n  }\n\n  return (true);\n}\n","changed_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\nbool isprime(int x);\n\nint main() {\n  int i, j;\n  int a, n;\n  int ans = 0;\n\n  cin >> n;\n\n  for (i = 0; i < n; i++) {\n    cin >> a;\n    if (isprime(a) == true)\n      ans++;\n  }\n\n  cout << ans << \"\\n\";\n\n  return (0);\n}\n\nbool isprime(int x) {\n  int i = 3;\n\n  if (x == 2)\n    return (true);\n  if (x < 2 || x % 2 == 0)\n    return (false);\n\n  while (x >= i * i) {\n    if (x % i == 0)\n      return (false);\n    i += 2;\n  }\n\n  return (true);\n}\n","change":"insert","i1":35,"i2":35,"j1":35,"j2":36,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <sstream>\n#include <stdio.h>\n#include <string>\nusing namespace std;\n\nint GCD(int x, int y) {\n  if (y == 0) {\n    return x;\n  }\n  return GCD(y, x % y);\n}\n\nbool isPrime(int N) {\n  for (int i = 2; i < N; i++) {\n    if (GCD(N, i) != 1)\n      return false;\n  }\n  return true;\n}\n\nint main() {\n  int n;\n  cin >> n;\n  int primeNumberCount = 0;\n  for (int i = 0; i < n; i++) {\n    int num;\n    cin >> num;\n    if (isPrime(num) == true)\n      primeNumberCount++;\n  }\n  cout << primeNumberCount << endl;\n  return 0;\n}\n","changed_src":"\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <sstream>\n#include <stdio.h>\n#include <string>\nusing namespace std;\n\nint GCD(int x, int y) {\n  if (y == 0) {\n    return x;\n  }\n  return GCD(y, x % y);\n}\n\nbool isPrime(int N) {\n  if (N == 2)\n    true;\n  if (N % 2 == 0)\n    false;\n  for (int i = 2; i * i <= N; i++) {\n    if (GCD(N, i) != 1)\n      return false;\n  }\n  return true;\n}\n\nint main() {\n  int n;\n  cin >> n;\n  int primeNumberCount = 0;\n  for (int i = 0; i < n; i++) {\n    int num;\n    cin >> num;\n    if (isPrime(num) == true)\n      primeNumberCount++;\n  }\n  cout << primeNumberCount << endl;\n  return 0;\n}\n","change":"replace","i1":17,"i2":18,"j1":17,"j2":22,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <math.h>\n#include <string>\nusing namespace std;\n\nbool prime(int);\n\nint main() {\n  int n, k, c = 0;\n  cin >> n;\n  while (n--) {\n    cin >> k;\n    if (prime(k))\n      c++;\n  }\n  cout << c << endl;\n  return 0;\n}\n\nbool prime(int a) {\n  for (int i = 2; i < a; i++) {\n    if (a % i == 0)\n      return false;\n  }\n  return true;\n}","changed_src":"#include <iostream>\n#include <math.h>\n#include <string>\nusing namespace std;\n\nbool prime(int);\n\nint main() {\n  int n, k, c = 0;\n  cin >> n;\n  while (n--) {\n    cin >> k;\n    if (prime(k))\n      c++;\n  }\n  cout << c << endl;\n  return 0;\n}\n\nbool prime(int a) {\n  for (int i = 2; i < (int)(sqrt((double)a)) + 1; i++) {\n    if (a % i == 0)\n      return false;\n  }\n  return true;\n}","change":"replace","i1":20,"i2":21,"j1":20,"j2":21,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int N, a, ans = 0;\n  cin >> N;\n  for (int i = 0; i < N; i++) {\n    cin >> a;\n    bool flag = true;\n    if (a != 2 && a % 2 == 0 || a == 1) {\n      flag = false;\n    } else if (a != 2) {\n      for (int j = 3; j < a; j += 2) {\n        if (a % j == 0) {\n          flag = false;\n          break;\n        }\n      }\n    }\n    if (flag) {\n      ans += 1;\n    }\n  }\n  cout << ans << endl;\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int N, a, ans = 0;\n  cin >> N;\n  for (int i = 0; i < N; i++) {\n    cin >> a;\n    bool flag = true;\n    if (a != 2 && a % 2 == 0 || a == 1) {\n      flag = false;\n    } else if (a > 2) {\n      for (int j = 3; j * j <= a; j += 2) {\n        if (a % j == 0) {\n          flag = false;\n          break;\n        }\n      }\n    }\n    if (flag) {\n      ans += 1;\n    }\n  }\n  cout << ans << endl;\n  return 0;\n}\n","change":"replace","i1":11,"i2":13,"j1":11,"j2":13,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cstdlib>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <string>\n#include <typeinfo>\n#include <vector>\n#define _USE_MATH_DEFINES\n#include <cmath>\n\nusing namespace std;\n\n\/\/ prime=>true, not prime=>false\n\/\/ bool isPrime(int i){\n\/\/     for(int j=2; j<=i\/2; j++){\n\/\/         if(i%j==0){\n\/\/             return false;\n\/\/         }\n\/\/     }\n\/\/     return true;\n\/\/ }\n\nbool isPrime(int n) {\n  if (n < 2) {\n    return false;\n  } else if (n == 2) {\n    return true;\n  }\n  if (n % 2 == 0) {\n    return false;\n  }\n  for (int i = 3; i <= n \/ 2; i += 2) {\n    if (n % i == 0) {\n      return false;\n    }\n  }\n  return true;\n}\n\nint main() {\n\n  int n;\n  cin >> n;\n\n  vector<long> n_nums(n);\n  for (int i = 0; i < n; i++) {\n    cin >> n_nums[i];\n  }\n\n  int prime_count = 0;\n  for (int i = 0; i < n; i++) {\n    if (isPrime(n_nums[i])) {\n      prime_count += 1;\n    }\n  }\n\n  cout << prime_count << endl;\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <cstdlib>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <string>\n#include <typeinfo>\n#include <vector>\n#define _USE_MATH_DEFINES\n#include <cmath>\n\nusing namespace std;\n\n\/\/ prime=>true, not prime=>false\n\/\/ bool isPrime(int i){\n\/\/     for(int j=2; j<=i\/2; j++){\n\/\/         if(i%j==0){\n\/\/             return false;\n\/\/         }\n\/\/     }\n\/\/     return true;\n\/\/ }\n\nbool isPrime(int n) {\n  if (n < 2) {\n    return false;\n  } else if (n == 2) {\n    return true;\n  }\n  if (n % 2 == 0) {\n    return false;\n  }\n  for (int i = 3; i <= n \/ i; i += 2) {\n    if (n % i == 0) {\n      return false;\n    }\n  }\n  return true;\n}\n\nint main() {\n\n  int n;\n  cin >> n;\n\n  vector<long> n_nums(n);\n  for (int i = 0; i < n; i++) {\n    cin >> n_nums[i];\n  }\n\n  int prime_count = 0;\n  for (int i = 0; i < n; i++) {\n    if (isPrime(n_nums[i])) {\n      prime_count += 1;\n    }\n  }\n\n  cout << prime_count << endl;\n  return 0;\n}\n","change":"replace","i1":33,"i2":34,"j1":33,"j2":34,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <math.h>\n#include <string>\nusing namespace std;\n\nint main() {\n  int n, m;\n  ;\n  cin >> m;\n  int count = m;\n  for (int s = 0; s < m; s++) {\n    cin >> n;\n    if (n == 2)\n      continue;\n    else if (n % 2 == 0)\n      count--;\n    else {\n      for (int i = 3; i < n; i += 2) {\n        if (n % i == 0) {\n          count--;\n          break;\n        }\n      }\n    }\n  }\n  cout << count << endl;\n\n  return 0;\n}","changed_src":"#include <iostream>\n#include <math.h>\n#include <string>\nusing namespace std;\n\nint main() {\n  int n, m;\n  ;\n  cin >> m;\n  int count = m;\n  for (int s = 0; s < m; s++) {\n    cin >> n;\n    if (n == 2)\n      continue;\n    else if (n % 2 == 0)\n      count--;\n    else {\n      for (int i = 3; i <= sqrt(n); i += 2) {\n        if (n % i == 0) {\n          count--;\n          break;\n        }\n      }\n    }\n  }\n  cout << count << endl;\n\n  return 0;\n}","change":"replace","i1":17,"i2":18,"j1":17,"j2":18,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nbool heheda(int a);\n\nbool heheda(int a) {\n  for (int i = 2; i * 2 <= a; i++)\n    if (!(a % i))\n      return false;\n  return true;\n}\n\nint main() {\n  int n;\n  cin >> n;\n  int tmp2 = 0;\n  int c;\n  for (int i = 0; i < n; i++) {\n    cin >> c;\n    if (heheda(c))\n      tmp2 += 1;\n  }\n  cout << tmp2 << endl;\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nbool heheda(int a);\n\nbool heheda(int a) {\n  for (int i = 2; i * i <= a; i++)\n    if (!(a % i))\n      return false;\n  return true;\n}\n\nint main() {\n  int n;\n  cin >> n;\n  int tmp2 = 0;\n  int c;\n  for (int i = 0; i < n; i++) {\n    cin >> c;\n    if (heheda(c))\n      tmp2 += 1;\n  }\n  cout << tmp2 << endl;\n  return 0;\n}\n","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <math.h>\nusing namespace std;\nint main() {\n  int n, i, x, j, flag = 0, cut = 0, a;\n  cin >> n;\n  for (i = 0; i < n; i++) {\n    cin >> x;\n    a = sqrt(x);\n    flag = 0;\n    for (j = x - 1; j > 1; j--) {\n      if (x % j == 0) {\n        flag = 1;\n        break;\n      }\n    }\n    if (flag == 0)\n      cut++;\n  }\n  cout << cut << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n#include <math.h>\nusing namespace std;\nint main() {\n  int n, i, x, j, flag = 0, cut = 0, a;\n  cin >> n;\n  for (i = 0; i < n; i++) {\n    cin >> x;\n    a = sqrt(x);\n    flag = 0;\n    for (j = a; j > 1; j--) {\n      if (x % j == 0) {\n        flag = 1;\n        break;\n      }\n    }\n    if (flag == 0)\n      cut++;\n  }\n  cout << cut << endl;\n  return 0;\n}","change":"replace","i1":10,"i2":11,"j1":10,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <array>\n#include <cmath>\n#include <cstdio>\n#include <iomanip>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nint main(void) {\n  int n;\n  cin >> n;\n\n  int a[n];\n  for (int i = 0; i < n; i++) {\n    cin >> a[i];\n  }\n\n  int cnt = 0;\n  for (int i = 0; i < n; i++) {\n\n    \/\/        cout << a[i] << \" : \";\n\n    int numOfDivisor = 0;\n\n    if (a[i] == 1 ||\n        (a[i] != 2 &&\n         a[i] % 2 == 0)) { \/\/ 1????????????2??\\????????\u00b6??\u00b0?????????\n      \/\/            cout << \"even\\n\";\n      continue;\n    }\n\n    for (int j = 3; j < a[i] \/ 2; j += 2) {\n      if (a[i] % j == 0) {\n        numOfDivisor++;\n        \/\/                cout << j << \" \";\n      }\n    }\n\n    if (numOfDivisor == 0) {\n      cnt++;\n\n      \/\/            cout << \"***\";\n    }\n\n    \/\/        cout << endl;\n  }\n\n  cout << cnt << endl;\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <array>\n#include <cmath>\n#include <cstdio>\n#include <iomanip>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nint main(void) {\n  int n;\n  cin >> n;\n\n  int a[n];\n  for (int i = 0; i < n; i++) {\n    cin >> a[i];\n  }\n\n  int cnt = 0;\n  for (int i = 0; i < n; i++) {\n\n    \/\/        cout << a[i] << \" : \";\n\n    int numOfDivisor = 0;\n\n    if (a[i] == 1 ||\n        (a[i] != 2 &&\n         a[i] % 2 == 0)) { \/\/ 1????????????2??\\????????\u00b6??\u00b0?????????\n      \/\/            cout << \"even\\n\";\n      continue;\n    }\n\n    for (int j = 3; j <= sqrt(a[i]); j += 2) {\n      if (a[i] % j == 0) {\n        numOfDivisor++;\n        \/\/                cout << j << \" \";\n      }\n    }\n\n    if (numOfDivisor == 0) {\n      cnt++;\n\n      \/\/            cout << \"***\";\n    }\n\n    \/\/        cout << endl;\n  }\n\n  cout << cnt << endl;\n\n  return 0;\n}","change":"replace","i1":35,"i2":36,"j1":35,"j2":36,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cmath>\n#include <iostream>\nusing namespace std;\n\nbool isPrime(int a) {\n  for (int i = 2; i < a; i++) {\n    if (a % i == 0) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\nint main() {\n\n  int n;\n  cin >> n;\n\n  int sum = 0;\n  int x;\n  for (int i = 0; i < n; i++) {\n    cin >> x;\n    if (isPrime(x))\n      sum += 1;\n  }\n\n  cout << sum << endl;\n\n  return 0;\n}\n","changed_src":"#include <cmath>\n#include <iostream>\nusing namespace std;\n\nbool isPrime(int a) {\n  for (int i = 2; i <= sqrt(a); i++) {\n    if (a % i == 0) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\nint main() {\n\n  int n;\n  cin >> n;\n\n  int sum = 0;\n  int x;\n  for (int i = 0; i < n; i++) {\n    cin >> x;\n    if (isPrime(x))\n      sum += 1;\n  }\n\n  cout << sum << endl;\n\n  return 0;\n}\n","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main(void) {\n  bool flag;\n  int n, k = 0, a;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> a;\n    flag = false;\n    for (int j = a - 1; 1 < j; j--) {\n      if (a % j == 0) {\n        flag = true;\n        break;\n      }\n    }\n    if (flag == false)\n      k += 1;\n  }\n  cout << k << endl;\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main(void) {\n  bool flag;\n  int n, k = 0, a;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> a;\n    flag = false;\n    for (int j = 2; j * j <= a; j++) {\n      if (a % j == 0) {\n        flag = true;\n        break;\n      }\n    }\n    if (flag == false)\n      k += 1;\n  }\n  cout << k << endl;\n  return 0;\n}","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <cstring>\n#include <ctime>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <set>\n#include <sstream>\n#include <string>\n#include <tuple>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n\nint const SIZ = 100000001;\nbitset<SIZ> chk;\n\nvoid sieve() {\n  chk.set();\n  chk.set(0, 0);\n  chk.set(1, 0);\n  for (int i = 4; i < SIZ; i += 2) {\n    chk.set(i, 0);\n  }\n  for (int i = 3; i < SIZ; i += 2) {\n    if (!chk[i])\n      continue;\n    for (int j = 2; i * j < SIZ; ++j) {\n      chk.set(i * j, 0);\n    }\n  }\n}\n\nint main() {\n  ios::sync_with_stdio(false);\n\n  sieve();\n\n  int n;\n  cin >> n;\n  int m, ans = 0;\n  for (int i = 0; i < n; ++i) {\n    cin >> m;\n    if (chk[m]) {\n      ++ans;\n      chk[m] = 0;\n    }\n  }\n  cout << ans << endl;\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <cstring>\n#include <ctime>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <set>\n#include <sstream>\n#include <string>\n#include <tuple>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n\nint const SIZ = 100000001;\nbitset<SIZ> chk;\n\nvoid sieve() {\n  chk.set();\n  chk.set(0, 0);\n  chk.set(1, 0);\n  for (int i = 4; i < SIZ; i += 2) {\n    chk.set(i, 0);\n  }\n  for (int i = 3; i * i < SIZ; i += 2) {\n    if (!chk[i])\n      continue;\n    for (int j = 2; i * j < SIZ; ++j) {\n      chk.set(i * j, 0);\n    }\n  }\n}\n\nint main() {\n  ios::sync_with_stdio(false);\n\n  sieve();\n\n  int n;\n  cin >> n;\n  int m, ans = 0;\n  for (int i = 0; i < n; ++i) {\n    cin >> m;\n    if (chk[m]) {\n      ++ans;\n      chk[m] = 0;\n    }\n  }\n  cout << ans << endl;\n\n  return 0;\n}","change":"replace","i1":28,"i2":29,"j1":28,"j2":29,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <queue>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n\n#define rep(n) for (int i = 0; i < (n); i++)\n#define pb(n) push_back((n))\n\n\/\/ typedef long long ll;\n\nusing namespace std;\n\n\/\/ vector<bool> p(100000100,true);\n\n\/\/ void makep(){\n\/\/ \tfor(int i=0; i<100000100; i++){\n\/\/ \t\tif(i<2)p[i]=false;\n\/\/ \t\tfor(int j=2; j<=sqrt(i); j++){\n\/\/ \t\t\tif(i%j==0){\n\/\/ \t\t\t\tp[i]=false;\n\/\/ \t\t\t\tbreak;\n\/\/ \t\t\t}\n\/\/ \t\t}\n\/\/ \t}\n\/\/ }\n\nbool is_p(int n) {\n  if (n < 2)\n    return false;\n  for (int i = 0; i <= sqrt(n); i++) {\n    if (n % i == 0)\n      return false;\n  }\n  return true;\n}\n\nint main() {\n  int n, cnt = 0, a;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> a;\n    if (is_p(a))\n      cnt++;\n  }\n  cout << cnt << endl;\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <queue>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n\n#define rep(n) for (int i = 0; i < (n); i++)\n#define pb(n) push_back((n))\n\n\/\/ typedef long long ll;\n\nusing namespace std;\n\n\/\/ vector<bool> p(100000100,true);\n\n\/\/ void makep(){\n\/\/ \tfor(int i=0; i<100000100; i++){\n\/\/ \t\tif(i<2)p[i]=false;\n\/\/ \t\tfor(int j=2; j<=sqrt(i); j++){\n\/\/ \t\t\tif(i%j==0){\n\/\/ \t\t\t\tp[i]=false;\n\/\/ \t\t\t\tbreak;\n\/\/ \t\t\t}\n\/\/ \t\t}\n\/\/ \t}\n\/\/ }\n\nbool is_p(int n) {\n  if (n < 2)\n    return false;\n  for (int i = 2; i <= sqrt(n); i++) {\n    if (n % i == 0)\n      return false;\n  }\n  return true;\n}\n\nint main() {\n  int n, cnt = 0, a;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> a;\n    if (is_p(a))\n      cnt++;\n  }\n  cout << cnt << endl;\n}","change":"replace","i1":36,"i2":37,"j1":36,"j2":37,"error":"-8","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int a, d = 0;\n  cin >> a;\n  for (int i = 0; i < a; i++) {\n    int b;\n    cin >> b;\n    d++;\n    for (int j = 2; j < b \/ 2 + 1; j++) {\n      if (b % j == 0) {\n        d--;\n        break;\n      }\n    }\n  }\n  cout << d << endl;\n}\n","changed_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int a, d = 0;\n  cin >> a;\n  for (int i = 0; i < a; i++) {\n    int b;\n    cin >> b;\n    d++;\n    for (int j = 2; j * j <= b; j++) {\n      if (b % j == 0) {\n        d--;\n        break;\n      }\n    }\n  }\n  cout << d << endl;\n}\n","change":"replace","i1":11,"i2":12,"j1":11,"j2":12,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint n;\nint a;\nint p = 0;\n\nvoid is_prime() {\n  for (int i = 2; i <= a \/ 2; i++) {\n    if (a % i == 0) {\n      return;\n    }\n  }\n\n  p++;\n}\n\nint main() {\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> a;\n    is_prime();\n  }\n\n  cout << p << endl;\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint n;\nint a;\nint p = 0;\n\nvoid is_prime() {\n  for (int i = 2; i * i <= a; i++) {\n    if (a % i == 0) {\n      return;\n    }\n  }\n\n  p++;\n}\n\nint main() {\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> a;\n    is_prime();\n  }\n\n  cout << p << endl;\n  return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cmath>\n#include <iomanip>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\nbool IsPrime(int a) {\n  if (a == 2)\n    return true;\n  if (a % 2 == 0) {\n    return false;\n  }\n  for (int i = 3; i < a; i += 2) {\n    if (a % i == 0) {\n      return false;\n    }\n  }\n  return true;\n}\nint main() {\n  int n;\n  cin >> n;\n  int a = 0;\n  int cnt = 0;\n  for (int i = 0; i < n; i++) {\n    cin >> a;\n    if (IsPrime(a))\n      cnt++;\n  }\n  cout << cnt << endl;\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <cmath>\n#include <iomanip>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\nbool IsPrime(int a) {\n  if (a == 2)\n    return true;\n  if (a % 2 == 0) {\n    return false;\n  }\n  for (int i = 3; i <= sqrt(a); i += 2) {\n    if (a % i == 0) {\n      return false;\n    }\n  }\n  return true;\n}\nint main() {\n  int n;\n  cin >> n;\n  int a = 0;\n  int cnt = 0;\n  for (int i = 0; i < n; i++) {\n    cin >> a;\n    if (IsPrime(a))\n      cnt++;\n  }\n  cout << cnt << endl;\n  return 0;\n}\n","change":"replace","i1":13,"i2":14,"j1":13,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\n\nusing namespace std;\n\nbool isPrime(int x) {\n  if (x == 2)\n    return true;\n  if (x % 2 == 0)\n    return false;\n  int i = 3;\n  while (i <= sqrt(x)) {\n    if (x % i == 0)\n      return false;\n  }\n  return true;\n}\n\nint main() {\n\n  int n;\n  scanf(\"%d\", &n);\n  int x[n];\n  for (int i = 0; i < n; ++i) {\n    scanf(\"%d\", &x[i]);\n  }\n\n  int cnt = 0;\n  for (int i = 0; i < n; ++i) {\n    if (isPrime(x[i])) {\n      ++cnt;\n    }\n  }\n  cout << cnt << endl;\n\n  return 0;\n}","changed_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\n\nusing namespace std;\n\nbool isPrime(int x) {\n  if (x == 2)\n    return true;\n  if (x % 2 == 0)\n    return false;\n  int i = 3;\n  while (i <= sqrt(x)) {\n    if (x % i == 0)\n      return false;\n    ++i;\n  }\n  return true;\n}\n\nint main() {\n\n  int n;\n  scanf(\"%d\", &n);\n  int x[n];\n  for (int i = 0; i < n; ++i) {\n    scanf(\"%d\", &x[i]);\n  }\n\n  int cnt = 0;\n  for (int i = 0; i < n; ++i) {\n    if (isPrime(x[i])) {\n      ++cnt;\n    }\n  }\n  cout << cnt << endl;\n\n  return 0;\n}","change":"insert","i1":15,"i2":15,"j1":15,"j2":16,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <math.h>\nusing namespace std;\nint gcd(int a1, int b1) {\n  if (a1 == 0 || b1 == 0) {\n    return 0;\n  }\n  if (a1 >= b1) {\n    if (a1 % b1 == 0) {\n      return b1;\n    } else {\n      return gcd(b1, a1 % b1);\n    }\n  } else {\n    if (b1 % a1 == 0) {\n      return a1;\n    } else {\n      return gcd(a1, b1 % a1);\n    }\n  }\n}\n\nint main(void) {\n  \/\/ Here your code !\n  int n, k, p = 0;\n  cin >> n;\n  int a[n];\n  for (int i = 0; i < n; i++) {\n    k = 0;\n    cin >> a[i];\n    if (a[i] == 2) {\n      p++;\n      continue;\n    } else if (a[i] % 2 == 0) {\n      continue;\n    }\n    for (int j = 0; j < floor(sqrt(a[i])); j++) {\n      if (gcd(a[i], j + 1) == j + 1) {\n        k++;\n      }\n    }\n    if (k == 1) {\n      p++;\n    }\n  }\n  cout << p << endl;\n}","changed_src":"#include <iostream>\n#include <math.h>\nusing namespace std;\nint gcd(int a1, int b1) {\n  if (a1 == 0 || b1 == 0) {\n    return 0;\n  }\n  if (a1 >= b1) {\n    if (a1 % b1 == 0) {\n      return b1;\n    } else {\n      return gcd(b1, a1 % b1);\n    }\n  } else {\n    if (b1 % a1 == 0) {\n      return a1;\n    } else {\n      return gcd(a1, b1 % a1);\n    }\n  }\n}\n\nint main(void) {\n  \/\/ Here your code !\n  int n, k, p = 0;\n  cin >> n;\n  int a[n];\n  for (int i = 0; i < n; i++) {\n    k = 0;\n    cin >> a[i];\n    if (a[i] == 2) {\n      p++;\n      continue;\n    } else if (a[i] % 2 == 0) {\n      continue;\n    }\n    for (int j = 0; j < floor(sqrt(a[i])); j++) {\n      if (a[i] % (j + 1) == 0) {\n        k++;\n      }\n    }\n    if (k == 1) {\n      p++;\n    }\n  }\n  cout << p << endl;\n}","change":"replace","i1":37,"i2":38,"j1":37,"j2":38,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cmath>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nbool Sieve(int x) {\n  for (int i = 2; i <= sqrt(x); i++)\n    if (x % i == 0)\n      return false;\n  return true;\n}\nint main() {\n  int n;\n  vector<int> items;\n  \/\/ input\n  cin >> n;\n  items.resize(n);\n  for (int i = 0; i < n; i++)\n    cin >> items[i];\n\n  \/\/ process\n  int count = 0;\n  for (int y : items)\n    if (Sieve(y))\n      count++;\n  cout << count << endl;\n  return 0;\n}\n","changed_src":"#include <cmath>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nbool Sieve(int x) {\n  for (int i = 2; i <= sqrt(x); i++)\n    if (x % i == 0)\n      return false;\n  return true;\n}\nint main() {\n  int n;\n  vector<int> items;\n  \/\/ input\n  cin >> n;\n  items.resize(n);\n  for (int i = 0; i < n; i++)\n    cin >> items[i];\n\n  \/\/ process\n  int count = 0;\n  for (int i = 0; i < n; i++)\n    if (Sieve(items[i]))\n      count++;\n  cout << count << endl;\n  return 0;\n}\n","change":"replace","i1":23,"i2":25,"j1":23,"j2":25,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cmath>\n#include <cstdint>\n#include <iomanip>\n#include <iostream>\n#include <numeric>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nbool isPrime(int x) {\n  for (int i = 2; i < x; ++i) {\n    if (x % i == 0) {\n      return false;\n    }\n  }\n  return true;\n}\n\nint main() {\n  int n, x, c = 0;\n  cin >> n;\n  for (int i = 0; i < n; ++i) {\n    cin >> x;\n    if (isPrime(x)) {\n      ++c;\n    }\n  }\n  cout << c << endl;\n}\n","changed_src":"#include <algorithm>\n#include <cmath>\n#include <cstdint>\n#include <iomanip>\n#include <iostream>\n#include <numeric>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nbool isPrime(int x) {\n  int max = sqrt(x);\n  for (int i = 2; i <= max; ++i) {\n    if (x % i == 0) {\n      return false;\n    }\n  }\n  return true;\n}\n\nint main() {\n  int n, x, c = 0;\n  cin >> n;\n  for (int i = 0; i < n; ++i) {\n    cin >> x;\n    if (isPrime(x)) {\n      ++c;\n    }\n  }\n  cout << c << endl;\n}\n","change":"replace","i1":12,"i2":13,"j1":12,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cmath>\n#include <iomanip>\n#include <iostream>\n#include <vector>\n\nbool isPrime(std::size_t a) {\n  if (a == 2) {\n    return true;\n  } else if (a % 2 == 0) {\n    return false;\n  }\n\n  for (std::size_t i = 3; i < a \/ 2; i = i + 2) {\n    if (a % i == 0) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\nint main() {\n  std::size_t n;\n  std::cin >> n;\n\n  std::size_t count = 0;\n  for (std::size_t i = 0; i < n; ++i) {\n    std::size_t a;\n    std::cin >> a;\n    if (isPrime(a)) {\n      count++;\n    }\n  }\n\n  std::cout << count << std::endl;\n\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <cmath>\n#include <iomanip>\n#include <iostream>\n#include <vector>\n\nbool isPrime(std::size_t a) {\n  if (a == 2) {\n    return true;\n  } else if (a % 2 == 0) {\n    return false;\n  }\n\n  for (std::size_t i = 3; i <= (std::size_t)(sqrt(a)); i = i + 2) {\n    if (a % i == 0) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\nint main() {\n  std::size_t n;\n  std::cin >> n;\n\n  std::size_t count = 0;\n  for (std::size_t i = 0; i < n; ++i) {\n    std::size_t a;\n    std::cin >> a;\n    if (isPrime(a)) {\n      count++;\n    }\n  }\n\n  std::cout << count << std::endl;\n\n  return 0;\n}\n","change":"replace","i1":13,"i2":14,"j1":13,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int N;\n  cin >> N;\n\n  int cnt = 0;\n  int num = 0;\n  for (int i = 0; i < N; i++) {\n    cin >> num;\n    for (int j = 1; j < num; j++) {\n      if (j == 1) {\n        continue;\n      }\n      if (num % j == 0) {\n        num = 0;\n        break;\n      }\n    }\n    if (num != 0) {\n      cnt += 1;\n    }\n  }\n\n  cout << cnt << endl;\n\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int N;\n  cin >> N;\n\n  int cnt = 0;\n  int num = 0;\n  for (int i = 0; i < N; i++) {\n    cin >> num;\n    if (num == 2) {\n      cnt += 1;\n      continue;\n    }\n    if (num % 2 == 0) {\n      continue;\n    }\n\n    double sqrtnum = sqrt(num);\n    for (int j = 3; j <= sqrtnum; j += 2) {\n      if (num % j == 0) {\n        num = 0;\n        break;\n      }\n    }\n    if (num != 0) {\n      cnt += 1;\n    }\n  }\n\n  cout << cnt << endl;\n\n  return 0;\n}\n","change":"replace","i1":12,"i2":16,"j1":12,"j2":22,"error":"TLE","stderr":""}
-{"problem_id":"p02257","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cassert>\n#include <iostream>\n#include <math.h>\nusing namespace std;\n\nbool isPrime(int x) {\n  if (x < 2)\n    return false;\n  else if (x == 2)\n    return true;\n  if (x % 2 == 0)\n    return false;\n  int limit = (int)sqrt((double)x) + 1;\n  for (int i = 3; i < x \/ 2; i += 2) {\n    if (x % i == 0)\n      return false;\n  }\n  return true;\n}\n\nint main() {\n  int n, x;\n  int cnt = 0;\n  cin >> n;\n  assert(1 <= n && n <= 10000);\n  for (int i = 0; i < n; i++) {\n    cin >> x;\n    assert(2 <= x && x <= 1000000000);\n    if (isPrime(x))\n      cnt++;\n  }\n  cout << cnt << endl;\n}","changed_src":"#include <cassert>\n#include <iostream>\n#include <math.h>\nusing namespace std;\n\nbool isPrime(int x) {\n  if (x < 2)\n    return false;\n  else if (x == 2)\n    return true;\n  if (x % 2 == 0)\n    return false;\n  int limit = (int)sqrt((double)x) + 1;\n  for (int i = 3; i <= limit; i += 2) {\n    if (x % i == 0)\n      return false;\n  }\n  return true;\n}\n\nint main() {\n  int n, x;\n  int cnt = 0;\n  cin >> n;\n  assert(1 <= n && n <= 10000);\n  for (int i = 0; i < n; i++) {\n    cin >> x;\n    assert(2 <= x && x <= 1000000000);\n    if (isPrime(x))\n      cnt++;\n  }\n  cout << cnt << endl;\n}","change":"replace","i1":13,"i2":14,"j1":13,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#define INT_MIN -2000000000\n#define MAX_R 200001\nusing namespace std;\n\nint main() {\n  int n, k;\n  while (cin >> n) {\n    int max = INT_MIN;\n    int r[MAX_R];\n    k = n;\n    while (k--) {\n      cin >> r[k];\n    }\n    for (int i = 0; i < n; i++) {\n      for (int j = i + 1; j < n; j++) {\n        if (r[i] - r[j] > max)\n          max = r[i] - r[j];\n      }\n    }\n    cout << max << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\n#define INT_MIN -2000000000\n#define MAX_R 200001\nusing namespace std;\n\nint main() {\n  int n, k;\n  while (cin >> n) {\n    int max = INT_MIN;\n    int r[MAX_R];\n    k = n;\n    while (k--) {\n      cin >> r[k];\n    }\n    for (int i = 0; i < n; i++) {\n      if (r[i] < max)\n        continue;\n      for (int j = i + 1; j < n; j++) {\n        if (r[i] - r[j] > max)\n          max = r[i] - r[j];\n      }\n    }\n    cout << max << endl;\n  }\n  return 0;\n}","change":"insert","i1":15,"i2":15,"j1":15,"j2":17,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int INF = 1e9;\n\nint main() {\n  int n = 0;\n  fscanf(stdin, \"%d\", &n);\n  vector<ll> v(n);\n  for (int i = 0; i < n; ++i) {\n    fscanf(stdin, \"%lld\", &v[i]);\n  }\n  ll ans = -INF;\n  for (int i = 0; i < n; ++i) {\n    for (int j = i + 1; j < n; ++j) {\n      ans = max(ans, v[j] - v[i]);\n    }\n  }\n  fprintf(stdout, \"%lld\\n\", ans);\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int INF = 1e9;\n\nint main() {\n  int n = 0;\n  fscanf(stdin, \"%d\", &n);\n  vector<ll> v(n);\n  for (int i = 0; i < n; ++i) {\n    fscanf(stdin, \"%lld\", &v[i]);\n  }\n  ll ans = -INF;\n  ll mn = v[0];\n  for (int i = 1; i < n; ++i) {\n    ans = max(ans, v[i] - mn);\n    mn = min(mn, v[i]);\n  }\n  fprintf(stdout, \"%lld\\n\", ans);\n  return 0;\n}","change":"replace","i1":16,"i2":20,"j1":16,"j2":20,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n\nusing namespace std;\n\nstatic const int MAX = 200000;\n\nint main() {\n  int num = 0, maxProfit = -1000000000;\n  int value[MAX] = {0};\n\n  cin >> num;\n  for (int i = 0; i < num; i++) {\n    cin >> value[i];\n  }\n\n  for (int i = 0; i < num; i++) {\n    for (int j = i + 1; j < num; j++) {\n      maxProfit = max(maxProfit, value[j] - value[i]);\n    }\n  }\n\n  cout << maxProfit << endl;\n\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <iostream>\n\nusing namespace std;\n\nstatic const int MAX = 200000;\n\nint main() {\n  int num = 0, maxProfit = -1000000000;\n  int value[MAX] = {0};\n\n  cin >> num;\n  for (int i = 0; i < num; i++) {\n    cin >> value[i];\n  }\n\n  int minValue = value[0];\n\n  for (int i = 1; i < num; i++) {\n    maxProfit = max(maxProfit, value[i] - minValue);\n    minValue = min(minValue, value[i]);\n  }\n\n  cout << maxProfit << endl;\n\n  return 0;\n}\n","change":"replace","i1":16,"i2":20,"j1":16,"j2":21,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\ntypedef vector<ll> Vector;\ntypedef vector<vector<ll>> DVector;\n\n#define fi first\n#define se second\n#define pb push_back\n#define INF INT_MAX\n#define bcnt __builtin_popcount\n#define all(x) (x).begin(), (x).end()\n#define dbg(x) cout << #x \"=\" << x << endl\n#define ub(x, y) upper_bound(all(x), y) - x.begin()\n#define lb(x, y) lower_bound(all(x), y) - x.begin()\n#define uni(x) x.erase(unique(all(x)), x.end())\n#define rep(i, n) repl(i, 0, n - 1)\n#define repl(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); i++)\n#define mmax(x, y) (x > y ? x : y)\n#define mmin(x, y) (x < y ? x : y)\n#define maxch(x, y) x = mmax(x, y)\n#define minch(x, y) x = mmin(x, y)\n#define exist(x, y) (find(all(x), y) != x.end())\n#define each(itr, v) for (auto itr : v)\n#define usort(x) sort(all(x))\n#define dsort(x) sort(all(x), greater<int>())\n#define mkp(x, y) make_pair(x, y)\n\nint main() {\n  cin.sync_with_stdio(false);\n  int n;\n  cin >> n;\n  Vector a(n);\n  int mx = -INF;\n  rep(i, n) cin >> a[i];\n  rep(i, n) rep(j, i) maxch(mx, a[i] - a[j]);\n  cout << mx << endl;\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\ntypedef vector<ll> Vector;\ntypedef vector<vector<ll>> DVector;\n\n#define fi first\n#define se second\n#define pb push_back\n#define INF INT_MAX\n#define bcnt __builtin_popcount\n#define all(x) (x).begin(), (x).end()\n#define dbg(x) cout << #x \"=\" << x << endl\n#define ub(x, y) upper_bound(all(x), y) - x.begin()\n#define lb(x, y) lower_bound(all(x), y) - x.begin()\n#define uni(x) x.erase(unique(all(x)), x.end())\n#define rep(i, n) repl(i, 0, n - 1)\n#define repl(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); i++)\n#define mmax(x, y) (x > y ? x : y)\n#define mmin(x, y) (x < y ? x : y)\n#define maxch(x, y) x = mmax(x, y)\n#define minch(x, y) x = mmin(x, y)\n#define exist(x, y) (find(all(x), y) != x.end())\n#define each(itr, v) for (auto itr : v)\n#define usort(x) sort(all(x))\n#define dsort(x) sort(all(x), greater<int>())\n#define mkp(x, y) make_pair(x, y)\n\nint main() {\n  cin.sync_with_stdio(false);\n  int n;\n  cin >> n;\n  Vector a(n);\n  int mx = -INF;\n  rep(i, n) cin >> a[i];\n  Vector table(n);\n  table[0] = a[0];\n  repl(i, 1, n - 1) table[i] = mmin(table[i - 1], a[i]);\n  repl(i, 1, n - 1) maxch(mx, a[i] - table[i - 1]);\n  cout << mx << endl;\n}","change":"replace","i1":38,"i2":39,"j1":38,"j2":42,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Runtime Error","original_src":"#include \"bits\/stdc++.h\"\n\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  vector<int> R(n);\n  for (int i = 0; i < n; ++i)\n    cin >> R[i];\n  auto itr_min = min_element(R.begin(), R.end());\n  auto itr_max = max_element(itr_min, R.end());\n  cout << ((*itr_max - *itr_min) <= 0 ? -1 : (*itr_max - *itr_min)) << endl;\n  system(\"pause\");\n}","changed_src":"#include \"bits\/stdc++.h\"\n\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int ans = -999999999, minv;\n  cin >> minv;\n  for (int i = 1; i < n; ++i) {\n    int a;\n    cin >> a;\n    ans = max(ans, a - minv);\n    minv = min(minv, a);\n  }\n  cout << ans << endl;\n  \/\/ system(\"pause\");\n}","change":"replace","i1":7,"i2":14,"j1":7,"j2":17,"error":"0","stderr":"sh: 1: pause: not found\n"}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int r[n];\n  for (int i = 0; i < n; ++i) {\n    cin >> r[i];\n  }\n  int M = r[1] - r[0];\n  for (int i = 0; i < n - 1; ++i) {\n    for (int j = i + 1; j < n; ++j) {\n      M = max(M, r[j] - r[i]);\n    }\n  }\n  cout << M << endl;\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int M = -1000000000;\n  int m;\n  cin >> m;\n  for (int i = 1; i < n; ++i) {\n    int r;\n    cin >> r;\n    M = max(M, r - m);\n    m = min(m, r);\n  }\n  cout << M << endl;\n  return 0;\n}","change":"replace","i1":7,"i2":16,"j1":7,"j2":15,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\nint d[200000 + 2];\nint main() {\n  int n;\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &d[i]);\n\n  int maxv = -1000000001; \/\/(n>=2)?d[1]-d[0]:-1;\n  for (int i = 0; i < n; i++) {\n    for (int j = i + 1; j < n; j++) {\n      if (maxv < d[j] - d[i])\n        maxv = d[j] - d[i];\n    }\n  }\n\n  printf(\"%d\\n\", maxv);\n\n  return 0;\n}","changed_src":"#include <cstdio>\nint d[200000 + 2];\nint main() {\n  int n;\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &d[i]);\n\n  int maxv = d[1] - d[0]; \/\/ 2 <= n < 200000\n  int minv = d[0]; \/\/ Store a mininum value and get diff value with next value\n                   \/\/ after next mininum\n  for (int i = 1; i < n; i++) {\n    maxv = (d[i] - minv > maxv) ? (d[i] - minv) : maxv;\n    minv = (minv > d[i]) ? d[i] : minv;\n  } \/\/\tlocal save history value\n\n  printf(\"%d\\n\", maxv);\n\n  return 0;\n}","change":"replace","i1":8,"i2":15,"j1":8,"j2":15,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <iostream>\n#include <vector>\ntypedef int TInt;\ntypedef std::vector<TInt> TList;\nTList Input() {\n  int Count;\n  std::cin >> Count;\n  TList List(Count);\n  for (int i = 0; i < Count; ++i) {\n    std::cin >> List[i];\n  }\n  return List;\n}\nint main() {\n  TList A = Input();\n  assert(A.size() >= 2);\n  int Profit = A[1] - A[0];\n  int i = 0;\n  while (i < A.size()) {\n    int j = i + 1;\n    for (int j = i + 1; j < A.size(); ++j) {\n      int Diff = A[j] - A[i];\n      if (Diff < 0) {\n        i = j;\n        break;\n      }\n      if (Diff > Profit)\n        Profit = Diff;\n    }\n    if (j == A.size())\n      break;\n  }\n\n  std::cout << Profit << std::endl;\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <iostream>\n#include <vector>\ntypedef int TInt;\ntypedef std::vector<TInt> TList;\nTList Input() {\n  int Count;\n  std::cin >> Count;\n  TList List(Count);\n  for (int i = 0; i < Count; ++i) {\n    std::cin >> List[i];\n  }\n  return List;\n}\nint main() {\n  TList A = Input();\n  assert(A.size() >= 2);\n  int Profit = A[1] - A[0];\n  int i = 0;\n  while (i < A.size()) {\n    int j;\n    for (j = i + 1; j < A.size(); ++j) {\n      int Diff = A[j] - A[i];\n      if (Diff < 0) {\n        i = j;\n        break;\n      }\n      if (Diff > Profit)\n        Profit = Diff;\n    }\n    if (j == A.size())\n      break;\n  }\n\n  std::cout << Profit << std::endl;\n  return 0;\n}","change":"replace","i1":22,"i2":24,"j1":22,"j2":24,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint N, A[200000];\n\nint solve(void) {\n  int maxp = 1 - 1000000000;\n  for (int i = 0; i < N - 1; i++) {\n    for (int j = i + 1; j < N; j++) {\n      maxp = max(maxp, A[j] - A[i]);\n    }\n  }\n  return maxp;\n}\n\nint main(void) {\n  cin >> N;\n  for (int i = 0; i < N; i++) {\n    cin >> A[i];\n  }\n  cout << solve() << endl;\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint N, A[200000];\n\nint solve(void) {\n  auto maxp = A[1] - A[0];\n  auto minr = min(A[0], A[1]);\n  for (auto i = 2; i < N; i++) {\n    maxp = max(maxp, A[i] - minr);\n    minr = min(minr, A[i]);\n  }\n  return maxp;\n}\n\nint main(void) {\n  cin >> N;\n  for (int i = 0; i < N; i++) {\n    cin >> A[i];\n  }\n  cout << solve() << endl;\n\n  return 0;\n}","change":"replace","i1":7,"i2":12,"j1":7,"j2":12,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nstatic const int MAX = 200000;\n\nint main() {\n  int R[MAX], n;\n\n  cin >> n;\n  for (int i = 0; i = n; i++)\n    cin >> R[i];\n\n  int maxv = -2000000000;\n  int minv = R[0];\n\n  for (int i = 1; i < n; i++) {\n    maxv = max(maxv, R[i] - minv);\n    minv = min(minv, R[i]);\n  }\n\n  cout << maxv << endl;\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nstatic const int MAX = 200000;\n\nint main() {\n  int R[MAX], n;\n\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> R[i];\n\n  int maxv = -2000000000;\n  int minv = R[0];\n\n  for (int i = 1; i < n; i++) {\n    maxv = max(maxv, R[i] - minv);\n    minv = min(minv, R[i]);\n  }\n\n  cout << maxv << endl;\n\n  return 0;\n}","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <vector>\n\nint main() {\n  std::vector<long> Dat = {};\n  int t = 0;\n  std::cin >> t;\n  for (int i = 0; i < t; i++) {\n    int tmp = 0;\n    std::cin >> tmp;\n    Dat.push_back(tmp);\n  }\n  long max = *(Dat.begin() + 1) - *Dat.begin();\n  for (auto cur = Dat.begin(); cur != Dat.end() - 1; cur++) \/\/ may bug\n  {\n    long start = *cur;\n    long tmp = *(cur + 1);\n    for (auto curr = cur + 2; curr != Dat.end(); curr++) {\n      if (*curr > tmp)\n        tmp = *curr;\n    }\n    if (tmp - *cur > max)\n      max = tmp - *cur;\n  }\n  std::cout << max << std::endl;\n  return 0;\n}","changed_src":"#include <iostream>\n#include <vector>\n\nint main() {\n  std::vector<long> Dat = {};\n  int t = 0;\n  std::cin >> t;\n  for (int i = 0; i < t; i++) {\n    int tmp = 0;\n    std::cin >> tmp;\n    Dat.push_back(tmp);\n  }\n  long min = *Dat.begin(), max = -2E9;\n  for (auto cur = Dat.begin() + 1; cur != Dat.end(); cur++) {\n    if (*(cur - 1) < min)\n      min = *(cur - 1);\n    if (*cur - min > max)\n      max = *cur - min;\n  }\n  std::cout << max << std::endl;\n  return 0;\n}","change":"replace","i1":12,"i2":23,"j1":12,"j2":18,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\nlong long n, a[1000000], x, y, mi, an;\nint main() {\n  cin >> n;\n  for (x = 0; x < n; x++) {\n    cin >> a[x];\n    for (y = x - 1; y >= 0; y--) {\n      if (x == 1) {\n        mi = a[x];\n      }\n      if (a[x] < mi) {\n        mi = a[x];\n      }\n      if (x == 1 && y == 0) {\n        an = a[x] - a[y];\n      }\n      if (an < a[x] - a[y]) {\n        an = a[x] - a[y];\n      }\n    }\n  }\n  cout << an << endl;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\nlong long n, a[1000000], x, y, mi, an;\nint main() {\n  cin >> n;\n  for (x = 0; x < n; x++) {\n    cin >> a[x];\n    if (x == 1) {\n      an = a[x] - a[x - 1];\n    }\n    if (x == 0) {\n      mi = a[x];\n    }\n    if (an < a[x] - mi) {\n      an = a[x] - mi;\n    }\n    if (mi > a[x]) {\n      mi = a[x];\n    }\n  }\n  cout << an << endl;\n}\n","change":"replace","i1":7,"i2":20,"j1":7,"j2":18,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int *r;\n  r = new int[n];\n  if (r == NULL) {\n    cout << \"Error!\" << endl;\n    return -1;\n  }\n  int i, j;\n  for (i = 0; i < n; i++) {\n    cin >> r[i];\n  }\n  int max = r[1] - r[0];\n  for (i = 0; i < n; i++) {\n    for (j = i + 1; j < n; j++) {\n      if (r[j] - r[i] > max)\n        max = r[j] - r[i];\n    }\n  }\n  cout << max << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int *r;\n  r = new int[n];\n  if (r == NULL) {\n    cout << \"Error!\" << endl;\n    return -1;\n  }\n  int i, j;\n  for (i = 0; i < n; i++) {\n    cin >> r[i];\n  }\n  int max = r[1] - r[0];\n  for (j = n - 1; j >= 0; j--) {\n    if (r[j] <= max)\n      continue;\n    for (i = j - 1; i >= 0; i--) {\n      if (r[j] - r[i] > max)\n        max = r[j] - r[i];\n    }\n  }\n  cout << max << endl;\n  return 0;\n}","change":"replace","i1":18,"i2":20,"j1":18,"j2":22,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iomanip>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  vector<double> r(n);\n  for (int i = 0; i < n; i++) {\n    cin >> r[i];\n  }\n  double max_profit = -1000000000;\n  for (int i = 0; i < n - 1; i++) {\n    for (int j = i + 1; j < n; j++) {\n      max_profit = max(max_profit, r[j] - r[i]);\n    }\n  }\n  cout << setprecision(10) << max_profit << endl;\n}\n","changed_src":"#include <algorithm>\n#include <iomanip>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  vector<double> r(n);\n  for (int i = 0; i < n; i++) {\n    cin >> r[i];\n  }\n  double max_profit = -1000000000;\n  double min_r = r[0];\n  for (int i = 1; i < n; i++) {\n    min_r = min(min_r, r[i - 1]);\n    max_profit = max(max_profit, r[i] - min_r);\n  }\n  cout << setprecision(10) << max_profit << endl;\n}\n","change":"replace","i1":15,"i2":19,"j1":15,"j2":19,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  vector<int> rs(n);\n  for (auto &r : rs) {\n    cin >> r;\n  }\n\n  int ans = INT_MIN;\n  for (int i = 0; i < n - 1; i++) {\n    for (int j = i + 1; j < n; j++) {\n      ans = max(ans, rs[j] - rs[i]);\n    }\n  }\n  cout << ans << endl;\n}","changed_src":"#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  vector<int> rs(n);\n  for (auto &r : rs) {\n    cin >> r;\n  }\n\n  int ans = INT_MIN;\n  int min_r = rs[0];\n  for (int i = 1; i < n; i++) {\n    ans = max(ans, rs[i] - min_r);\n    min_r = min(min_r, rs[i]);\n  }\n  cout << ans << endl;\n}","change":"replace","i1":34,"i2":38,"j1":34,"j2":38,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nclass MaximumProfit {\npublic:\n  int solve(int n, int *r);\n};\n\nint MaximumProfit::solve(int n, int *r) {\n  int maxp = -2000000000;\n  for (int i = 0; i < n - 1; i++)\n    for (int j = i + 1; j < n; j++) {\n      if ((r[j] - r[i]) > maxp)\n        maxp = r[j] - r[i];\n    }\n\n  return maxp;\n}\n\nint main(void) {\n\n  MaximumProfit *mp = new MaximumProfit();\n\n  int n;\n\n  cin >> n;\n\n  int *r = new int[n];\n\n  for (int i = 0; i < n; i++)\n    cin >> r[i];\n\n  cout << mp->solve(n, r) << endl;\n\n  delete mp;\n  delete[] r;\n\n  return 0;\n}","changed_src":"#include <iostream>\n\nusing namespace std;\n\nclass MaximumProfit {\npublic:\n  int solve(int n, int *r);\n};\n\nint MaximumProfit::solve(int n, int *r) {\n  int maxp = -2000000000;\n  int minr = r[0];\n  for (int i = 1; i < n; i++) {\n    if ((r[i] - minr) > maxp)\n      maxp = r[i] - minr;\n    if (r[i] < minr)\n      minr = r[i];\n  }\n\n  return maxp;\n}\n\nint main(void) {\n\n  MaximumProfit *mp = new MaximumProfit();\n\n  int n;\n\n  cin >> n;\n\n  int *r = new int[n];\n\n  for (int i = 0; i < n; i++)\n    cin >> r[i];\n\n  cout << mp->solve(n, r) << endl;\n\n  delete mp;\n  delete[] r;\n\n  return 0;\n}","change":"replace","i1":11,"i2":16,"j1":11,"j2":18,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int m[200000];\n  for (int i = 0; i < n; i++) {\n    cin >> m[i];\n  }\n  int max = m[1] - m[0];\n  for (int i = 0; i < n - 1; i++) {\n    for (int j = i + 1; j < n; j++) {\n      if (max < m[j] - m[i])\n        max = m[j] - m[i];\n    }\n  }\n  cout << max << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int m[200000];\n  for (int i = 0; i < n; i++) {\n    cin >> m[i];\n  }\n  int max = -1000000000, min = m[0];\n  for (int i = 1; i < n; i++) {\n    if (max < m[i] - min)\n      max = m[i] - min;\n    if (m[i] < min)\n      min = m[i];\n  }\n  cout << max << endl;\n  return 0;\n}","change":"replace","i1":11,"i2":17,"j1":11,"j2":17,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n  int n, a[200001] = {};\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> a[i];\n  int max = a[1] - a[0];\n  for (int i = 1; i < n; i++)\n    for (int j = 0; j < i; j++)\n      if (a[i] - a[j] > max)\n        max = a[i] - a[j];\n  cout << max << endl;\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n  int n, a[200001] = {};\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> a[i];\n  int max = a[1] - a[0];\n  int min = a[0];\n  for (int i = 1; i < n; i++) {\n    if (a[i] - min > max)\n      max = a[i] - min;\n    if (min > a[i])\n      min = a[i];\n  }\n  cout << max << endl;\n  return 0;\n}","change":"replace","i1":8,"i2":12,"j1":8,"j2":15,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  int n, tmp;\n  cin >> n;\n  vector<int> rt(n);\n  for (int i = 0; i < n; i++) {\n    cin >> rt[i];\n  }\n  int ans = INT_MIN;\n  for (int i = 0; i < n; i++) {\n    for (int j = 0; j < n; j++) {\n      if (i < j) {\n        tmp = rt[j] - rt[i];\n        if (ans < tmp)\n          ans = tmp;\n      }\n    }\n  }\n  cout << ans << endl;\n\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  int n, tmp;\n  cin >> n;\n  vector<int> rt(n);\n  for (int i = 0; i < n; i++) {\n    cin >> rt[i];\n  }\n  int ans = INT_MIN;\n  int minv = rt[0];\n  for (int j = 1; j < n; j++) {\n    ans = (ans >= rt[j] - minv) ? ans : rt[j] - minv;\n    minv = (minv <= rt[j]) ? minv : rt[j];\n  }\n  cout << ans << endl;\n\n  return 0;\n}","change":"replace","i1":11,"i2":19,"j1":11,"j2":15,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"Python","original_status":"Runtime Error","original_src":"import sys\n\nvalues = [int(input()) for i in range(int(input()))]\nmaxv = -sys.maxsize - 1\nminv = values[0]\n\nfor val in enumerate(values):\n    if maxv < (val - minv):\n        maxv = val - minv\n    if minv > val:\n        minv = val\nprint(maxv)\n","changed_src":"n = int(input())\nR = [int(input()) for _ in range(n)]\nminv, maxv = R[0], R[1] - R[0]\nfor j in range(1, n):\n    maxv = max(maxv, R[j] - minv)\n    minv = min(minv, R[j])\nprint(maxv)\n","change":"replace","i1":0,"i2":11,"j1":0,"j2":6,"error":"TypeError: unsupported operand type(s) for -: 'tuple' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02258\/Python\/s112466969.py\", line 8, in <module>\n    if maxv < (val - minv):\nTypeError: unsupported operand type(s) for -: 'tuple' and 'int'\n"}
-{"problem_id":"p02258","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main(void) {\n  int i = 0;\n  int n = 0;\n  int min;\n  int now;\n  int max_margin = -2147483648;\n  int margin;\n\n  scanf(\"%d\", &n);\n  scanf(\"%d\", &min);\n  for (i = 1; i < n; i++) {\n    scanf(\"%d\", now);\n    margin = now - min;\n    if (margin > max_margin) {\n      max_margin = margin;\n    }\n    if (now < min) {\n      min = now;\n    }\n  }\n  printf(\"%d\\n\", max_margin);\n\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint main(void) {\n  int i = 0;\n  int n = 0;\n  int min;\n  int now;\n  int max_margin = -2147483648;\n  int margin;\n\n  scanf(\"%d\", &n);\n  scanf(\"%d\", &min);\n  for (i = 1; i < n; i++) {\n    scanf(\"%d\", &now);\n    margin = now - min;\n    if (margin > max_margin) {\n      max_margin = margin;\n    }\n    if (now < min) {\n      min = now;\n    }\n  }\n  printf(\"%d\\n\", max_margin);\n\n  return 0;\n}","change":"replace","i1":13,"i2":14,"j1":13,"j2":14,"error":"-11","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint timeSerialDiff(vector<int> &v) {\n  int size = v.size(), i, j, max, cnt = 0;\n  for (i = 0; i < size; i++) {\n    int start = v[i];\n    for (j = i + 1; j < size; j++) {\n      int diff = v[j] - v[i];\n      max = (cnt == 0 || max < diff) ? diff : max;\n      cnt++;\n    }\n  }\n  return max;\n}\nint main() {\n  int n, i, x, min, max;\n  vector<int> v;\n  cin >> n;\n  for (i = 0; i < n; i++) {\n    cin >> x;\n    v.push_back(x);\n  }\n  cout << timeSerialDiff(v) << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint timeSerialDiff(vector<int> &v) {\n  int size = v.size();\n  if (size < 2) {\n    return 0;\n  }\n  int i, max, min, cnt = 0;\n  min = v[0];\n  max = v[1] - v[0];\n  for (i = 1; i < size; i++) {\n    int diff = v[i] - min;\n    max = max < diff ? diff : max;\n    min = min > v[i] ? v[i] : min;\n  }\n  return max;\n}\nint main() {\n  int n, i, x, min, max;\n  vector<int> v;\n  cin >> n;\n  for (i = 0; i < n; i++) {\n    cin >> x;\n    v.push_back(x);\n  }\n  cout << timeSerialDiff(v) << endl;\n  return 0;\n}","change":"replace","i1":5,"i2":13,"j1":5,"j2":16,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <list>\n#include <map>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n\n  vector<int> r;\n  for (int i = 0; i < n; i++) {\n    int ri;\n    cin >> ri;\n    r.push_back(ri);\n  }\n\n  int diffmax = r[1] - r[0];\n  for (int i = 0; i < n - 1; i++) {\n    for (int j = i + 1; j < n; j++) {\n      diffmax = max(diffmax, r[j] - r[i]);\n    }\n  }\n\n  cout << diffmax << endl;\n\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <list>\n#include <map>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n\n  vector<int> r;\n  for (int i = 0; i < n; i++) {\n    int ri;\n    cin >> ri;\n    r.push_back(ri);\n  }\n\n  int diffmax = r[1] - r[0];\n  int rmin = r[0];\n  for (int i = 1; i < n; i++) {\n    diffmax = max(diffmax, r[i] - rmin);\n    rmin = min(rmin, r[i]);\n  }\n\n  cout << diffmax << endl;\n\n  return 0;\n}\n","change":"replace","i1":23,"i2":27,"j1":23,"j2":27,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\n\n#define pout(n) printf(\"%d\\n\", n)\n\n#define rep(i, a, n) for (int i = a; i < n; i++)\n#define per(i, n, a) for (int i = n - 1; i >= a; i--)\n#define SORT(v, n) sort(v, v + n);\n#define VSORT(v) sort(v.begin(), v.end());\n\nconst int d4x[4] = {1, 0, -1, 0};\nconst int d4y[4] = {0, 1, 0, -1};\nconst int d8x[8] = {1, 1, 0, -1, -1, -1, 0, 1};\nconst int d8y[8] = {0, 1, 1, 1, 0, -1, -1, -1};\n\n#define MAX_N (int)2e5 + 20\n#define INF 1e12 + 20\n\ntypedef long long ll;\nusing namespace std;\n\nint n;\nint main() {\n  cin >> n;\n  int r[n];\n  rep(i, 0, n) { cin >> r[i]; }\n  int ans = INT_MIN;\n  rep(i, 0, n - 1) {\n    rep(j, i + 1, n) { ans = max(r[j] - r[i], ans); }\n  }\n  pout(ans);\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\n\n#define pout(n) printf(\"%d\\n\", n)\n\n#define rep(i, a, n) for (int i = a; i < n; i++)\n#define per(i, n, a) for (int i = n - 1; i >= a; i--)\n#define SORT(v, n) sort(v, v + n);\n#define VSORT(v) sort(v.begin(), v.end());\n\nconst int d4x[4] = {1, 0, -1, 0};\nconst int d4y[4] = {0, 1, 0, -1};\nconst int d8x[8] = {1, 1, 0, -1, -1, -1, 0, 1};\nconst int d8y[8] = {0, 1, 1, 1, 0, -1, -1, -1};\n\n#define MAX_N (int)2e5 + 20\n#define INF 1e12 + 20\n\ntypedef long long ll;\nusing namespace std;\n\nint n;\nint main() {\n  cin >> n;\n  int r[n];\n  rep(i, 0, n) { cin >> r[i]; }\n  int ans = INT_MIN;\n  int mi = r[0];\n  rep(i, 1, n) {\n    ans = max(ans, r[i] - mi);\n    mi = min(mi, r[i]);\n  }\n  pout(ans);\n  return 0;\n}\n","change":"replace","i1":26,"i2":28,"j1":26,"j2":30,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nconst int NMAX = 20000;\n\nint maximum_profit(int *r, int n) {\n  int mini = r[0];\n  int maxi = r[1] - r[0];\n  for (int i = 1; i < n; i++) {\n    maxi = max(maxi, r[i] - mini);\n    mini = min(mini, r[i]);\n  }\n\n  return maxi;\n}\n\nint main(void) {\n  int *r;\n  r = new int[NMAX];\n\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> r[i];\n    \/\/ cout << r[i] << endl;\n  }\n\n  int max = maximum_profit(r, n);\n  cout << max << endl;\n\n  delete r;\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nconst int NMAX = 2000000;\n\nint maximum_profit(int *r, int n) {\n  int mini = r[0];\n  int maxi = r[1] - r[0];\n  for (int i = 1; i < n; i++) {\n    maxi = max(maxi, r[i] - mini);\n    mini = min(mini, r[i]);\n  }\n\n  return maxi;\n}\n\nint main(void) {\n  int *r;\n  r = new int[NMAX];\n\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> r[i];\n    \/\/ cout << r[i] << endl;\n  }\n\n  int max = maximum_profit(r, n);\n  cout << max << endl;\n\n  delete r;\n  return 0;\n}\n","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int *a = new int[n];\n  for (int i = 0; i < n; i++) {\n    cin >> a[i];\n  }\n  int m = (1 << 31);\n  for (int i = 0; i < n; i++) {\n    for (int j = i - 1; j >= 0; j--) {\n      m = max(a[i] - a[j], m);\n    }\n  }\n  cout << m << endl;\n  delete[] a;\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int *a = new int[n];\n  for (int i = 0; i < n; i++) {\n    cin >> a[i];\n  }\n  int m = (1 << 31);\n  int minx = a[0];\n  for (int i = 1; i < n; i++) {\n    m = max(m, a[i] - minx);\n    minx = min(minx, a[i]);\n  }\n  cout << m << endl;\n  delete[] a;\n  return 0;\n}","change":"replace","i1":12,"i2":16,"j1":12,"j2":16,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint functione(int num[], int N);\n\nint main() {\n  int n;\n  cin >> n;\n  int *num = new int[n];\n\n  for (int i = 0; i < n; i++)\n    cin >> num[i];\n\n  cout << functione(num, n) << endl;\n  return 0;\n}\n\nint functione(int num[], int N) {\n  int profit = -2000000000;\n  for (int i = 0; i < N; i++)\n    for (int j = i + 1; j < N; j++) {\n      if (profit < num[j] - num[i])\n        profit = num[j] - num[i];\n    }\n  return profit;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint functione(int num[], int N);\n\nint main() {\n  int n;\n  cin >> n;\n  int *num = new int[n];\n\n  for (int i = 0; i < n; i++)\n    cin >> num[i];\n\n  cout << functione(num, n) << endl;\n  return 0;\n}\n\nint functione(int num[], int N) {\n  int max = -2000000000;\n  int min = num[0];\n  for (int i = 1; i < N; i++) {\n    if (max < num[i] - min)\n      max = num[i] - min;\n    if (min > num[i])\n      min = num[i];\n  }\n  return max;\n}","change":"replace","i1":18,"i2":25,"j1":18,"j2":27,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main(void) {\n  int n;\n  cin >> n;\n\n  vector<int> prices(n);\n  for (int i = 0; i < n; i++) {\n    cin >> prices[i];\n  }\n\n  int mprofit = -1000000000;\n  for (int i = 0; i < n; i++) {\n    for (int j = i + 1; j < n; j++) {\n      mprofit = max(mprofit, prices[j] - prices[i]);\n    }\n  }\n\n  cout << mprofit << endl;\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main(void) {\n  int n;\n  cin >> n;\n\n  vector<int> prices(n);\n  for (int i = 0; i < n; i++) {\n    cin >> prices[i];\n  }\n\n  int mprofit = -1111111111;\n  int minv = prices[0];\n  for (int i = 1; i < n; i++) {\n    mprofit = max(mprofit, prices[i] - minv);\n    minv = min(minv, prices[i]);\n  }\n\n  cout << mprofit << endl;\n  return 0;\n}","change":"replace","i1":14,"i2":19,"j1":14,"j2":19,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main(void) {\n  int n;\n  cin >> n;\n  vector<int> r(n);\n  for (int i = 0; i < n; ++i) {\n    cin >> r[i];\n  }\n  int ans = -1000000007;\n  for (int i = 0; i < n; ++i) {\n    for (int j = i + 1; j < n; ++j) {\n      ans = max(ans, r[j] - r[i]);\n    }\n  }\n  cout << ans << endl;\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main(void) {\n  int n;\n  cin >> n;\n  vector<int> r(n);\n  for (int i = 0; i < n; ++i) {\n    cin >> r[i];\n  }\n  int ans = -1000000007;\n  int minv = r[0];\n  for (int i = 1; i < n; ++i) {\n    ans = max(ans, r[i] - minv);\n    minv = min(minv, r[i]);\n  }\n  cout << ans << endl;\n  return 0;\n}\n","change":"replace","i1":11,"i2":15,"j1":11,"j2":15,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nstatic const int MAX = 20000;\n\nint main() {\n  int n;\n  int minv;\n  int maxv = -2000000000;\n  int R[MAX];\n\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> R[i];\n  }\n  minv = R[0];\n  for (int j = 1; j < n; j++) {\n    maxv = max(maxv, R[j] - minv);\n    minv = min(minv, R[j]);\n  }\n  cout << maxv << endl;\n\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nstatic const int MAX = 200000;\n\nint main() {\n  int n;\n  int minv;\n  int maxv = -2000000000;\n  int R[MAX];\n\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> R[i];\n  }\n  minv = R[0];\n  for (int j = 1; j < n; j++) {\n    maxv = max(maxv, R[j] - minv);\n    minv = min(minv, R[j]);\n  }\n  cout << maxv << endl;\n\n  return 0;\n}\n","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cstdio>\n\nusing namespace std;\n\nconst int MAX_VALUE = 200000;\nint R[MAX_VALUE];\n\nint main() {\n  int n;\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &R[i]);\n\n  int max_income = -1000000001;\n  for (int i = 0; i < n - 1; i++)\n    for (int j = i + 1; j < n; j++)\n      max_income = max(max_income, R[j] - R[i]);\n\n  printf(\"%d\\n\", max_income);\n}","changed_src":"#include <algorithm>\n#include <cstdio>\n\nusing namespace std;\n\nconst int MAX_VALUE = 200000;\nint R[MAX_VALUE];\n\nint main() {\n  int n;\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &R[i]);\n\n  int min_val = R[0];\n  int max_val = -1000000001;\n  for (int j = 1; j < n; j++) {\n    max_val = max(max_val, R[j] - min_val);\n    min_val = min(min_val, R[j]);\n  }\n  printf(\"%d\\n\", max_val);\n}","change":"replace","i1":14,"i2":20,"j1":14,"j2":21,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Runtime Error","original_src":"#include <limits.h>\n#include <stdio.h>\n\nint main(void) {\n  int n, i, tmp, tmp2;\n  int profit = INT_MIN;\n  int min = INT_MAX;\n  scanf(\"%d\", &n);\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\", &tmp);\n    tmp2 = tmp - min;\n    if (tmp2 > profit) {\n      profit = tmp2;\n    }\n    if (tmp < min)\n      min = tmp;\n  }\n  return profit;\n}\n","changed_src":"#include <limits.h>\n#include <stdio.h>\n\nint main(void) {\n  int n, i, tmp, tmp2;\n  int profit = INT_MIN;\n  int min = INT_MAX;\n  scanf(\"%d\", &n);\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\", &tmp);\n    tmp2 = tmp - min;\n    if (tmp2 > profit) {\n      profit = tmp2;\n    }\n    if (tmp < min)\n      min = tmp;\n  }\n  printf(\"%d\\n\", profit);\n  return 0;\n}\n","change":"replace","i1":17,"i2":18,"j1":17,"j2":19,"error":"3","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define SORT(c) sort((c).begin(), (c).end())\nconst double EPS = 1e-10;                 \/\/ sample:if((double)>=(double)+EPS)\n#define CLR(a) memset((&a), 0, sizeof(a)) \/\/ clear memory\n#define dump(x) cerr << #x << \" = \" << (x) << endl; \/\/ debug\n#define debug(x)                                                               \\\n  cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\"                       \\\n       << \" \" << __FILE__ << endl;\n\/\/ cin,cout release\n\/\/ std::cin.tie(0);\n\/\/ ios::sync_with_stdio(false);\n\nint main(void) {\n  int n;\n  cin >> n;\n  \/\/ vector<int> r;\n  int r[200000];\n  for (int i = 0; i < n; i++) {\n    cin >> r[i];\n  }\n  int maxv = INT_MIN;\n  for (int i = 0; i < n; i++) {\n    for (int j = i + 1; j < n; j++) {\n      maxv = max(maxv, r[j] - r[i]);\n    }\n  }\n  cout << maxv << endl;\n\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define SORT(c) sort((c).begin(), (c).end())\nconst double EPS = 1e-10;                 \/\/ sample:if((double)>=(double)+EPS)\n#define CLR(a) memset((&a), 0, sizeof(a)) \/\/ clear memory\n#define dump(x) cerr << #x << \" = \" << (x) << endl; \/\/ debug\n#define debug(x)                                                               \\\n  cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\"                       \\\n       << \" \" << __FILE__ << endl;\n\/\/ cin,cout release\n\/\/ std::cin.tie(0);\n\/\/ ios::sync_with_stdio(false);\n\nint main(void) {\n  int n;\n  cin >> n;\n  \/\/ vector<int> r;\n  int r[200000];\n  for (int i = 0; i < n; i++) {\n    cin >> r[i];\n  }\n  int maxv = INT_MIN, minv = r[0];\n  for (int i = 1; i < n; i++) {\n    maxv = max(maxv, r[i] - minv);\n    minv = min(minv, r[i]);\n  }\n  cout << maxv << endl;\n\n  return 0;\n}\n","change":"replace","i1":23,"i2":28,"j1":23,"j2":27,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Runtime Error","original_src":"\/\/\n\/\/ Created by sanyinchen on 17\/4\/17.\n\/\/\n\n#include <cstdio>\n#include <iostream>\n#include <limits>\n#include <string.h>\n#include <vector>\n\nusing namespace std;\n\nvector<int> findMaxWithMidPoint(int *array, int low, int high) {\n\n  int mid = (low + high) \/ 2;\n  int leftSum = 0, leftLow = mid;\n  int rightSum = 0, rightHigh = mid + 1;\n  int maxLeft = array[leftLow], maxRight = array[rightHigh];\n\n  vector<int> res;\n  for (int i = mid; i >= low; i--) {\n    leftSum += array[i];\n    if (leftSum > maxLeft) {\n      maxLeft = leftSum;\n      leftLow = i;\n    }\n  }\n  res.push_back(leftLow);\n\n  for (int i = mid + 1; i <= high; i++) {\n    rightSum += array[i];\n    if (rightSum > maxRight) {\n      maxRight = rightSum;\n      rightHigh = i;\n    }\n  }\n  res.push_back(rightHigh);\n  \/\/    cout << low << \" \" << high << endl;\n  \/\/    cout << \"sum:\" << maxLeft + maxRight << \" left:\" << leftLow << \" \" <<\n  \/\/    \"high:\" << rightHigh << endl;\n  res.push_back(maxLeft + maxRight);\n\n  return res;\n}\n\nvector<int> findMax(int *array, int low, int high) {\n\n  if (low == high) {\n\n    vector<int> res;\n    res.push_back(low);\n    res.push_back(high);\n    res.push_back(array[low]);\n    return res;\n  } else {\n    int mid = (low + high) \/ 2;\n\n    vector<int> left = findMax(array, low, mid);\n    vector<int> right = findMax(array, mid + 1, high);\n    vector<int> midRes = findMaxWithMidPoint(array, low, high);\n    \/\/        cout << \"left:\" << left[0] << \" \" << left[1] << \" \" << left[2] <<\n    \/\/        endl; cout << \"right:\" << right[0] << \" \" << right[1] << \" \" <<\n    \/\/        right[2] << endl; cout << \"midRes:\" << midRes[0] << \" \" <<\n    \/\/        midRes[1] << \" \" << midRes[2] << endl;\n\n    if (left[2] >= right[2] && left[2] >= midRes[2]) {\n      return left;\n    }\n    if (right[2] >= left[2] && right[2] >= midRes[2]) {\n\n      return right;\n    }\n\n    return midRes;\n  }\n}\n\nint main() {\n  freopen(\"..\/files\/in.txt\", \"r\", stdin);\n  int input[200001] = {0};\n  int data[200001] = {0};\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> input[i];\n    if (i == 0) {\n      data[i] = 0 - input[i];\n    } else {\n      data[i] = input[i] - input[i - 1];\n    }\n  }\n  \/\/    for (int i = 0; i < n; i++) {\n  \/\/        cout << data[i] << \" \";\n  \/\/    }\n  \/\/ cout << endl;\n  vector<int> res = findMax(data, 0, n - 1);\n  \/\/ cout << res[0] << \" \" << res[1] << \" \" << res[2] << endl;\n  cout << res[2] << endl;\n\n  return 0;\n}","changed_src":"\/\/\n\/\/ Created by sanyinchen on 17\/4\/17.\n\/\/\n\n#include <cstdio>\n#include <iostream>\n#include <limits>\n#include <string.h>\n#include <vector>\n\nusing namespace std;\n\nvector<int> findMaxWithMidPoint(int *array, int low, int high) {\n\n  int mid = (low + high) \/ 2;\n  int leftSum = 0, leftLow = mid;\n  int rightSum = 0, rightHigh = mid + 1;\n  int maxLeft = array[leftLow], maxRight = array[rightHigh];\n\n  vector<int> res;\n  for (int i = mid; i >= low; i--) {\n    leftSum += array[i];\n    if (leftSum > maxLeft) {\n      maxLeft = leftSum;\n      leftLow = i;\n    }\n  }\n  res.push_back(leftLow);\n\n  for (int i = mid + 1; i <= high; i++) {\n    rightSum += array[i];\n    if (rightSum > maxRight) {\n      maxRight = rightSum;\n      rightHigh = i;\n    }\n  }\n  res.push_back(rightHigh);\n  \/\/    cout << low << \" \" << high << endl;\n  \/\/    cout << \"sum:\" << maxLeft + maxRight << \" left:\" << leftLow << \" \" <<\n  \/\/    \"high:\" << rightHigh << endl;\n  res.push_back(maxLeft + maxRight);\n\n  return res;\n}\n\nvector<int> findMax(int *array, int low, int high) {\n\n  if (low == high) {\n\n    vector<int> res;\n    res.push_back(low);\n    res.push_back(high);\n    res.push_back(array[low]);\n    return res;\n  } else {\n    int mid = (low + high) \/ 2;\n\n    vector<int> left = findMax(array, low, mid);\n    vector<int> right = findMax(array, mid + 1, high);\n    vector<int> midRes = findMaxWithMidPoint(array, low, high);\n    \/\/        cout << \"left:\" << left[0] << \" \" << left[1] << \" \" << left[2] <<\n    \/\/        endl; cout << \"right:\" << right[0] << \" \" << right[1] << \" \" <<\n    \/\/        right[2] << endl; cout << \"midRes:\" << midRes[0] << \" \" <<\n    \/\/        midRes[1] << \" \" << midRes[2] << endl;\n\n    if (left[2] >= right[2] && left[2] >= midRes[2]) {\n      return left;\n    }\n    if (right[2] >= left[2] && right[2] >= midRes[2]) {\n\n      return right;\n    }\n\n    return midRes;\n  }\n}\n\nint main() {\n  \/\/ freopen(\"..\/files\/in.txt\", \"r\", stdin);\n  int input[200001] = {0};\n  int data[200001] = {0};\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> input[i];\n    if (i == 0) {\n      data[i] = 0 - input[i];\n    } else {\n      data[i] = input[i] - input[i - 1];\n    }\n  }\n  \/\/    for (int i = 0; i < n; i++) {\n  \/\/        cout << data[i] << \" \";\n  \/\/    }\n  \/\/ cout << endl;\n  vector<int> res = findMax(data, 0, n - 1);\n  \/\/ cout << res[0] << \" \" << res[1] << \" \" << res[2] << endl;\n  cout << res[2] << endl;\n\n  return 0;\n}","change":"replace","i1":78,"i2":79,"j1":78,"j2":79,"error":"-11","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  vector<int> a(n);\n  for (int i = 0; i < n; i++)\n    cin >> a[i];\n\n  int maxval = -1000000000;\n  for (int i = 0; i < n - 1; i++) {\n    for (int j = i + 1; j < n; j++) {\n      maxval = max(maxval, a[j] - a[i]);\n    }\n  }\n\n  cout << maxval << endl;\n\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  vector<int> a(n);\n  for (int i = 0; i < n; i++)\n    cin >> a[i];\n\n  int maxval = -1000000000;\n  int minval = a[0];\n  for (int i = 1; i < n; i++) {\n    maxval = max(maxval, a[i] - minval);\n    minval = min(minval, a[i]);\n  }\n\n  cout << maxval << endl;\n\n  return 0;\n}\n","change":"replace","i1":11,"i2":15,"j1":11,"j2":15,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n\n  int n, x[1000000];\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> x[i];\n  }\n  int max = x[1] - x[0];\n  for (int k = 0; k < n; k++) {\n    for (int m = k + 1; m < n; m++) {\n      if (max < (x[m] - x[k]))\n        max = x[m] - x[k];\n    }\n  }\n  cout << max << endl;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n\n  int n, x[1000000];\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> x[i];\n  }\n  int max = x[1] - x[0];\n  int min = x[0];\n  for (int k = 1; k < n; k++) {\n    if (max < (x[k] - min))\n      max = (x[k] - min);\n    if (min > x[k])\n      min = x[k];\n  }\n  cout << max << endl;\n}","change":"replace","i1":10,"i2":15,"j1":10,"j2":16,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nlong long MaxProfit(int n, long long *Rt) {\n  long long max = LLONG_MIN;\n  for (int i = 0; i < n; i++) {\n    for (int j = i + 1; j < n; j++) {\n      long long tmp = Rt[j] - Rt[i];\n      if (max < tmp)\n        max = tmp;\n    }\n  }\n  return max;\n}\n\nint main() {\n\n  int n;\n  cin >> n;\n  long long Rt[n];\n  long long max;\n  for (int i = 0; i < n; i++)\n    cin >> Rt[i];\n  max = MaxProfit(n, Rt);\n  cout << max << endl;\n  return 0;\n};","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nlong long MaxProfit(int n, long long *Rt) {\n  long long max = LLONG_MIN;\n  long long MinRt = Rt[0];\n  for (int j = 1; j < n; j++) {\n    long long tmp = Rt[j] - MinRt;\n    if (max < tmp)\n      max = tmp;\n    if (MinRt > Rt[j])\n      MinRt = Rt[j];\n  }\n  return max;\n}\n\nint main() {\n\n  int n;\n  cin >> n;\n  long long Rt[n];\n  long long max;\n  for (int i = 0; i < n; i++)\n    cin >> Rt[i];\n  max = MaxProfit(n, Rt);\n  cout << max << endl;\n  return 0;\n};","change":"replace","i1":5,"i2":11,"j1":5,"j2":12,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\nstatic const int MAX = 20000;\n\nint main() {\n  int R[MAX], n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> R[i];\n  }\n\n  int maxv = -2000000000;\n  int minv = R[0];\n\n  for (int j = 1; j < n; j++) {\n    maxv = max(maxv, R[j] - minv);\n    minv = min(minv, R[j]);\n  }\n\n  cout << maxv << endl;\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nstatic const int MAX = 200000;\n\nint main() {\n  int R[MAX], n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> R[i];\n  }\n\n  int maxv = -2000000000;\n  int minv = R[0];\n\n  for (int j = 1; j < n; j++) {\n    maxv = max(maxv, R[j] - minv);\n    minv = min(minv, R[j]);\n  }\n\n  cout << maxv << endl;\n  return 0;\n}\n","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\nint R[2000];\nint num;\nint main() {\n  \/\/ cout << \"????????\\???????????\u00b6??\u00b4??????\" << endl;\n  cin >> num;\n  for (int i = 0; i < num; i++) {\n    cin >> R[i];\n  }\n  int maxv = -2000000000;\n  int minv = R[0];\n  for (int j = 1; j < num; j++) {\n    if (maxv < R[j] - minv) {\n      maxv = R[j] - minv;\n    }\n    if (minv > R[j]) {\n      minv = R[j];\n    }\n    \/*\tfor (int i = 0; i < j; i++)\n            {\n                    if (maxv < R[j] - R[i])\n                    {\n                            maxv = R[j] - R[i];\n                    }\n            }*\/\n  }\n  cout << maxv << endl;\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint R[200000];\nint num;\nint main() {\n  \/\/ cout << \"????????\\???????????\u00b6??\u00b4??????\" << endl;\n  cin >> num;\n  for (int i = 0; i < num; i++) {\n    cin >> R[i];\n  }\n  int maxv = -2000000000;\n  int minv = R[0];\n  for (int j = 1; j < num; j++) {\n    if (maxv < R[j] - minv) {\n      maxv = R[j] - minv;\n    }\n    if (minv > R[j]) {\n      minv = R[j];\n    }\n    \/*\tfor (int i = 0; i < j; i++)\n            {\n                    if (maxv < R[j] - R[i])\n                    {\n                            maxv = R[j] - R[i];\n                    }\n            }*\/\n  }\n  cout << maxv << endl;\n  return 0;\n}","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n\nusing namespace std;\n\nint n;\nconst int MAX_N = 200000;\nint R[MAX_N];\n\nint main() {\n\n  cin >> n;\n  for (int i = 0; i < n; ++i) {\n    cin >> R[i];\n  }\n  int maxv = -2000000000;\n  for (int j = 1; j <= n - 1; j++) {\n    for (int i = 0; i <= j - 1; i++) {\n      maxv = max(maxv, R[j] - R[i]);\n    }\n  }\n  cout << maxv << endl;\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n\nusing namespace std;\n\nint n;\nconst int MAX_N = 200000;\nint R[MAX_N];\n\nint main() {\n\n  cin >> n;\n  for (int i = 0; i < n; ++i) {\n    cin >> R[i];\n  }\n  int maxv = -2000000000;\n  int minv = R[0];\n  for (int j = 1; j < n; j++) {\n\n    maxv = max(maxv, R[j] - minv);\n    minv = min(minv, R[j]);\n  }\n  cout << maxv << endl;\n  return 0;\n}","change":"replace","i1":16,"i2":20,"j1":16,"j2":21,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nstatic const int MAX = 20000;\n\nint main() {\n  int R[MAX], n;\n\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> R[i];\n\n  int maxv = -2000000000;\n  int minv = R[0];\n\n  for (int i = 1; i < n; i++) {\n    maxv = max(maxv, R[i] - minv);\n    minv = min(minv, R[i]);\n  }\n\n  cout << maxv << endl;\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nstatic const int MAX = 200000;\n\nint main() {\n  int R[MAX], n;\n\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> R[i];\n\n  int maxv = -2000000000;\n  int minv = R[0];\n\n  for (int i = 1; i < n; i++) {\n    maxv = max(maxv, R[i] - minv);\n    minv = min(minv, R[i]);\n  }\n\n  cout << maxv << endl;\n\n  return 0;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nint main() {\n  int n;\n  int r[200000];\n  std::cin >> n;\n  for (int i = 0; i < n; i++) {\n    std::cin >> r[i];\n  }\n  int s = r[1] - r[0];\n  for (int i = 0; i < n - 1; i++) {\n    for (int j = i + 1; j < n; j++) {\n      int ss = r[j] - r[i];\n      if (ss > s) {\n        s = ss;\n      }\n    }\n  }\n  std::cout << s << std::endl;\n  return 0;\n}","changed_src":"#include <iostream>\n\nint main() {\n  int n;\n  int r[200000];\n  std::cin >> n;\n  for (int i = 0; i < n; i++) {\n    std::cin >> r[i];\n  }\n  int s = r[1] - r[0];\n  int rr = r[0];\n  for (int i = 1; i < n; i++) {\n    if (r[i] - rr > s) {\n      s = r[i] - rr;\n    }\n    if (r[i] < rr) {\n      rr = r[i];\n    }\n  }\n  std::cout << s << std::endl;\n  return 0;\n}","change":"replace","i1":10,"i2":16,"j1":10,"j2":17,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cmath>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n\n  long long n, MAX = -1000000000;\n  cin >> n;\n  vector<int> R(n);\n\n  \/* \u682a\u4fa1\u306e\u5024\u3092\u5165\u529b *\/\n  for (int i = 0; i < n; i++) {\n    cin >> R[i];\n  }\n\n  \/* \u682a\u4fa1\u306e\u6700\u5927\u5024\u3092\u63a2\u3059 *\/\n  for (int i = 0; i < n; i++) {\n    for (int j = i + 1; j < n; j++) {\n      if (MAX < R[j] - R[i])\n        MAX = R[j] - R[i];\n    }\n  }\n\n  cout << MAX << endl;\n\n  return 0;\n}\n","changed_src":"#include <cmath>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n\n  long long n, MAX = -1000000000;\n  cin >> n;\n  vector<int> R(n);\n\n  \/* \u682a\u4fa1\u306e\u5024\u3092\u5165\u529b *\/\n  for (int i = 0; i < n; i++) {\n    cin >> R[i];\n  }\n\n  \/* \u682a\u4fa1\u306e\u6700\u5927\u5024\u3092\u63a2\u3059 *\/\n  for (int i = 0; i < n; i++) {\n    for (int j = i + 1; j < n; j++) {\n      if (MAX < R[j] - R[i])\n        MAX = R[j] - R[i];\n      if (R[i] >= R[j])\n        break;\n    }\n  }\n\n  cout << MAX << endl;\n\n  return 0;\n}\n","change":"insert","i1":21,"i2":21,"j1":21,"j2":23,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nstatic const int MAX = 20000;\n\nint main() {\n  int R[MAX], N;\n\n  cin >> N;\n  for (int i = 0; i < N; i++)\n    cin >> R[i];\n\n  int maxv = R[1] - R[0];\n  int minv = R[0];\n  for (int i = 1; i < N; i++) {\n    maxv = max(maxv, R[i] - minv);\n    minv = min(minv, R[i]);\n  }\n  cout << maxv << endl;\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nstatic const int MAX = 200000;\n\nint main() {\n  int R[MAX], N;\n\n  cin >> N;\n  for (int i = 0; i < N; i++)\n    cin >> R[i];\n\n  int maxv = R[1] - R[0];\n  int minv = R[0];\n  for (int i = 1; i < N; i++) {\n    maxv = max(maxv, R[i] - minv);\n    minv = min(minv, R[i]);\n  }\n  cout << maxv << endl;\n  return 0;\n}\n","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nstatic const int MAX = 20000;\nint main() {\n  int R[MAX], n;\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> R[i];\n  int maxv = -2000000000;\n  int minv = R[0];\n  for (int i = 1; i < n; i++) {\n    maxv = max(maxv, R[i] - minv);\n    minv = min(minv, R[i]);\n  }\n  cout << maxv << endl;\n\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\nstatic const int MAX = 200000;\nint main() {\n  int R[MAX], n;\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> R[i];\n  int maxv = -2000000000;\n  int minv = R[0];\n  for (int i = 1; i < n; i++) {\n    maxv = max(maxv, R[i] - minv);\n    minv = min(minv, R[i]);\n  }\n  cout << maxv << endl;\n\n  return 0;\n}\n","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02258","language":"Python","original_status":"Time Limit Exceeded","original_src":"N = int(input())\nR = [int(input()) for i in range(N)]\n\nsa = R[N - 1] - R[N - 2]\nfor i in reversed(range(N)):\n    for j in reversed(range(i)):\n        tmp = R[i] - R[j]\n        if tmp > sa:\n            sa = tmp\nprint(sa)\n","changed_src":"N = int(input())\nR = [int(input()) for i in range(N)]\n\nmin_v = R[0]\nmax_v = R[1] - R[0]\nfor i in range(1, len(R)):\n    if min_v > R[i - 1]:\n        min_v = R[i - 1]\n    if max_v < R[i] - min_v:\n        max_v = R[i] - min_v\nprint(max_v)\n","change":"replace","i1":3,"i2":10,"j1":3,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p02258","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <assert.h>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n#define loop(i, a, b) for (ll i = a; i < b; i++)\n#define rloop(i, a, b) for (int i = a; i >= b; i--)\nconst int inf = 1e8;\nconst ll INF = 1e16;\n#define MOD 1000000007\n#define mod 1000000009\n\nint main() {\n  int n;\n  cin >> n;\n  vector<ll> r(n);\n  loop(i, 0, n) { cin >> r[i]; }\n  ll M = -1 * INF;\n  ll m = r[0];\n  loop(i, 0, n - 1) {\n    if (r[i] == m) {\n      vector<ll> r2(n);\n      r2 = r;\n      sort(r2.begin() + i + 1, r2.end());\n      m = r2.back();\n    }\n    M = max(M, m - r[i]);\n  }\n  cout << M << \"\\n\";\n}","changed_src":"#include <algorithm>\n#include <assert.h>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n#define loop(i, a, b) for (ll i = a; i < b; i++)\n#define rloop(i, a, b) for (int i = a; i >= b; i--)\nconst int inf = 1e8;\nconst ll INF = 1e16;\n#define MOD 1000000007\n#define mod 1000000009\n\nint main() {\n  int n;\n  cin >> n;\n  vector<ll> r(n);\n  loop(i, 0, n) { cin >> r[i]; }\n  ll M = -1 * INF;\n  ll m = r[0];\n  loop(i, 1, n) {\n    m = min(m, r[i - 1]);\n    M = max(M, r[i] - m);\n  }\n  cout << M << \"\\n\";\n}","change":"replace","i1":35,"i2":43,"j1":35,"j2":38,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\n\nint A[10001], n;\n\nint binarySearch(int key) {\n  int left = 0;\n  int right = n;\n  int i = 0;\n  int mid;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (key == A[mid]) {\n      return 1;\n    }\n    if (key > A[mid])\n      left = mid + 1;\n    else if (key < A[mid])\n      right = mid;\n  }\n  return 0;\n}\n\nint main() {\n  int q, i, k, ans = 0;\n  cin >> n;\n  for (i = 0; i < n; i++)\n    cin >> A[i];\n\n  cin >> q;\n  for (i = 0; i < q; i++) {\n    cin >> k;\n    if (binarySearch(k))\n      ans++;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\n\nint A[100000], n;\n\nint binarySearch(int key) {\n  int left = 0;\n  int right = n;\n  int i = 0;\n  int mid;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (key == A[mid]) {\n      return 1;\n    }\n    if (key > A[mid])\n      left = mid + 1;\n    else if (key < A[mid])\n      right = mid;\n  }\n  return 0;\n}\n\nint main() {\n  int q, i, k, ans = 0;\n  cin >> n;\n  for (i = 0; i < n; i++)\n    cin >> A[i];\n\n  cin >> q;\n  for (i = 0; i < q; i++) {\n    cin >> k;\n    if (binarySearch(k))\n      ans++;\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint binarySearch(int A[], int n, int key) {\n  size_t left = 0;\n  size_t right = n;\n  size_t mid = (left + right) \/ 2;\n  while (left < right) {\n    if (A[mid] == key)\n      return 1;\n    if (A[mid] < key)\n      left = mid + 1;\n    else if (A[mid] > key)\n      right = mid;\n  }\n  return 0;\n}\n\nint main() {\n  int n, q;\n  int S[100'000];\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> S[i];\n  cin >> q;\n  int key;\n  int count = 0;\n  for (int i = 0; i < q; i++) {\n    cin >> key;\n    if (binarySearch(S, n, key))\n      count++;\n  }\n\n  cout << count << endl;\n}\n","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint binarySearch(int A[], int n, int key) {\n  size_t left = 0;\n  size_t right = n;\n  size_t mid = (left + right) \/ 2;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (A[mid] == key)\n      return 1;\n    if (A[mid] < key)\n      left = mid + 1;\n    else if (A[mid] > key)\n      right = mid;\n  }\n  return 0;\n}\n\nint main() {\n  int n, q;\n  int S[100'000];\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> S[i];\n  cin >> q;\n  int key;\n  int count = 0;\n  for (int i = 0; i < q; i++) {\n    cin >> key;\n    if (binarySearch(S, n, key))\n      count++;\n  }\n\n  cout << count << endl;\n}\n","change":"insert","i1":9,"i2":9,"j1":9,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n\nusing namespace std;\n\nint b[10 ^ 9 + 1];\n\nint main() {\n  int n, q, s, t;\n  int ans = 0;\n\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> s;\n    b[s]++;\n  }\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> t;\n    if (b[t] >= 1)\n      ans++;\n  }\n  cout << ans << endl;\n  return (0);\n}","changed_src":"#include <iostream>\n\nusing namespace std;\n\nint b[1000000010];\n\nint main() {\n  int n, q, s, t;\n  int ans = 0;\n\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> s;\n    b[s]++;\n  }\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> t;\n    if (b[t] >= 1)\n      ans++;\n  }\n  cout << ans << endl;\n  return (0);\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <cstdio>\n#include <iostream>\n\nusing namespace std;\nint A[10000], B[10000], NA, NB;\n\nint binarysearch(int key) {\n  int left = 0, right = NA - 1;\n  while (left <= right) {\n    int mid = (left + right) \/ 2;\n    if (A[mid] == key)\n      return 1;\n    else if (A[mid] < key)\n      left = mid + 1;\n    else\n      right = mid - 1;\n  }\n  return 0;\n}\n\nint main() {\n  int sum = 0;\n  cin >> NA;\n  for (int i = 0; i < NA; i++) {\n    cin >> A[i];\n  }\n  cin >> NB;\n  for (int i = 0; i < NB; i++) {\n    cin >> B[i];\n    if (binarysearch(B[i]))\n      sum++;\n  }\n  cout << sum << endl;\n  return 0;\n}\n","changed_src":"#include <cstdio>\n#include <iostream>\n\nusing namespace std;\nint A[100000], B[100000], NA, NB;\n\nint binarysearch(int key) {\n  int left = 0, right = NA - 1;\n  while (left <= right) {\n    int mid = (left + right) \/ 2;\n    if (A[mid] == key)\n      return 1;\n    else if (A[mid] < key)\n      left = mid + 1;\n    else\n      right = mid - 1;\n  }\n  return 0;\n}\n\nint main() {\n  int sum = 0;\n  cin >> NA;\n  for (int i = 0; i < NA; i++) {\n    cin >> A[i];\n  }\n  cin >> NB;\n  for (int i = 0; i < NB; i++) {\n    cin >> B[i];\n    if (binarysearch(B[i]))\n      sum++;\n  }\n  cout << sum << endl;\n  return 0;\n}\n","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\n\nbool FindByBinarySearch(int x, int A[], int left, int right) {\n  int mid = (left + right) \/ 2;\n  if (x == A[mid])\n    return true;\n  if (x >= A[left] && x < A[mid])\n    return FindByBinarySearch(x, A, left, mid);\n  if (x > A[mid] && x <= A[right])\n    return FindByBinarySearch(x, A, mid + 1, right);\n\n  return false;\n}\n\nint main() {\n  int n, q, S[100000], T[50000];\n  int C = 0;\n\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; ++i) {\n    scanf(\"%d\", &S[i]);\n  }\n\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; ++i) {\n    scanf(\"%d\", &T[i]);\n  }\n\n  for (int i = 0; i < q; ++i) {\n    for (int j = 0; j < n; ++j) {\n      if (FindByBinarySearch(T[i], S, 0, n - 1)) {\n        ++C;\n        break;\n      }\n    }\n  }\n\n  printf(\"%d\\n\", C);\n\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nbool FindByBinarySearch(int x, int A[], int left, int right) {\n  int mid = (left + right) \/ 2;\n  if (x == A[mid])\n    return true;\n  if (x >= A[left] && x < A[mid])\n    return FindByBinarySearch(x, A, left, mid);\n  if (x > A[mid] && x <= A[right])\n    return FindByBinarySearch(x, A, mid + 1, right);\n\n  return false;\n}\n\nint main() {\n  int n, q, S[100000], T[50000];\n  int C = 0;\n\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; ++i) {\n    scanf(\"%d\", &S[i]);\n  }\n\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; ++i) {\n    scanf(\"%d\", &T[i]);\n  }\n\n  for (int i = 0; i < q; ++i) {\n    if (FindByBinarySearch(T[i], S, 0, n - 1)) {\n      ++C;\n    }\n  }\n\n  printf(\"%d\\n\", C);\n\n  return 0;\n}","change":"replace","i1":29,"i2":34,"j1":29,"j2":31,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\n#define N 100000\nint count = 0;\nvoid BinarySearch(int array[], int right, int left, int key) {\n  int mid = (right + left) \/ 2;\n  if (left > right) {\n    return;\n  }\n\n  if (array[mid] == key) {\n    count++;\n    return;\n  } else if (array[mid] < key) {\n    BinarySearch(array, right, mid + 1, key);\n  } else {\n    BinarySearch(array, mid, left, key);\n  }\n}\n\nint main() {\n  int i, n, array[N];\n  scanf(\"%d\", &n);\n  for (i = 0; i < n; i++)\n    scanf(\"%d\", &array[i]);\n  int m;\n  scanf(\"%d\", &m);\n  for (i = 0; i < m; i++) {\n    int l;\n    scanf(\"%d\", &l);\n    BinarySearch(array, n, 0, l);\n  }\n  printf(\"%d\\n\", count);\n}","changed_src":"#include <stdio.h>\n#define N 100000\nint count = 0;\nvoid BinarySearch(int array[], int right, int left, int key) {\n  while (left < right) {\n    int mid = (left + right) \/ 2;\n    if (array[mid] == key) {\n      count++;\n      break;\n    } else if (array[mid] < key) {\n      left = mid + 1;\n    } else {\n      right = mid;\n    }\n  }\n}\n\nint main() {\n  int i, n, array[N];\n  scanf(\"%d\", &n);\n  for (i = 0; i < n; i++)\n    scanf(\"%d\", &array[i]);\n  int m;\n  scanf(\"%d\", &m);\n  for (i = 0; i < m; i++) {\n    int l;\n    scanf(\"%d\", &l);\n    BinarySearch(array, n, 0, l);\n  }\n  printf(\"%d\\n\", count);\n}","change":"replace","i1":4,"i2":16,"j1":4,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <stack>\n#include <stdio.h>\n#include <stdlib.h>\nusing namespace std;\n\/\/ \u5e38\u306b\u5fc3\u3057\u3066\u304b\u304b\u308c\n\/\/ \u7c21\u5358\u306a\u3053\u3068\u3092\u7c21\u5358\u306b\u3067\u304d\u308b\u3088\u3046\u306b\u7df4\u7fd2\u3059\u308b\nint main() {\n  int n;\n  int q;\n  int tmp;\n  int C = 0;\n  int num_to_check;\n  int S[10001];\n  int head;\n  int tail;\n  int mid; \/\/ \u4e2d\u592e\u5024\n  stack<int> T;\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &S[i]);\n  }\n\n  \/*\u78ba\u8a8d\n  for(int i=0;i<n;i++){\n          cout <<S[i] <<\" \";\n  }\n  cout <<endl;\n  *\/\n\n  cin >> q;\n\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &tmp);\n    T.push(tmp);\n  }\n\n  \/*\u78ba\u8a8d\n  while(!T.empty()){\n          cout <<T.top() <<\" \";\n          T.pop();\n  }\n  cout <<endl;\n  *\/\n\n  \/\/ \u9ad8\u901f\u5316\u7528\u30b3\u30fc\u30c9\n  int j = 1;\n  for (int i = 1; i < n; i++) {\n    if (S[i] == S[i - 1]) {\n      ;\n    } else {\n      j++;\n      S[j] = S[i];\n    }\n  }\n  n = j + 1;\n  \/\/\n\n  while (!T.empty()) {\n    num_to_check = T.top();\n    T.pop();\n    head = 0;\n    tail = n - 1;\n\n    \/\/ \u30ad\u30fc\u306e\u63a2\u7d22\n    while (head <= tail) {\n\n      \/\/ \u9ad8\u901f\u5316\u7528\u30b3\u30fc\u30c9\n      if (num_to_check < S[0] || num_to_check > S[n - 1])\n        break;\n      \/\/\n\n      if (head == tail) {\n        if (num_to_check == S[head \/*==tail*\/]) {\n          C++;\n          break;\n        } else {\n          break;\n        }\n      }\n      mid = (head + tail) \/ 2;\n      if (num_to_check == S[mid]) { \/\/ \u898b\u3064\u304b\u3063\u305f(\u4e2d\u592e\u306e\u5024\u3068\u4e00\u81f4)\n        C++;\n        break;\n      } else { \/\/ \u4e2d\u592e\u306e\u5024\u3068\u4e00\u81f4\u3057\u306a\u3044\n        if (head == tail - 1) {\n          if (num_to_check == S[head] || num_to_check == S[tail]) {\n            C++;\n            break;\n          } else {\n            break;\n          }\n        }\n        if (num_to_check > S[mid]) { \/\/ \u4e2d\u592e\u306e\u5024\u3088\u308a\u5927\u304d\u3044\n          head = mid + 1;\n          \/\/ cout <<\"head\" <<head <<\"tail\" <<tail <<endl;\n        } else { \/\/ \u4e2d\u592e\u306e\u5024\u3088\u308a\u5c0f\u3055\u3044\n          tail = mid - 1;\n          \/\/ cout <<\"head\" <<head <<\"tail\" <<tail <<endl;\n        }\n      }\n    }\n  }\n  cout << C << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n#include <stack>\n#include <stdio.h>\n#include <stdlib.h>\nusing namespace std;\n\/\/ \u5e38\u306b\u5fc3\u3057\u3066\u304b\u304b\u308c\n\/\/ \u7c21\u5358\u306a\u3053\u3068\u3092\u7c21\u5358\u306b\u3067\u304d\u308b\u3088\u3046\u306b\u7df4\u7fd2\u3059\u308b\nint main() {\n  int n;\n  int q;\n  int tmp;\n  int C = 0;\n  int num_to_check;\n  int S[100001];\n  int head;\n  int tail;\n  int mid; \/\/ \u4e2d\u592e\u5024\n  stack<int> T;\n\n  cin >> n;\n\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &S[i]);\n  }\n\n  \/*\u78ba\u8a8d\n  for(int i=0;i<n;i++){\n          cout <<S[i] <<\" \";\n  }\n  cout <<endl;\n  *\/\n\n  cin >> q;\n\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &tmp);\n    T.push(tmp);\n  }\n\n  \/*\u78ba\u8a8d\n  while(!T.empty()){\n          cout <<T.top() <<\" \";\n          T.pop();\n  }\n  cout <<endl;\n  *\/\n\n  \/\/ \u9ad8\u901f\u5316\u7528\u30b3\u30fc\u30c9\n  int j = 1;\n  for (int i = 1; i < n; i++) {\n    if (S[i] == S[i - 1]) {\n      ;\n    } else {\n      j++;\n      S[j] = S[i];\n    }\n  }\n  n = j + 1;\n  \/\/\n\n  while (!T.empty()) {\n    num_to_check = T.top();\n    T.pop();\n    head = 0;\n    tail = n - 1;\n\n    \/\/ \u30ad\u30fc\u306e\u63a2\u7d22\n    while (head <= tail) {\n\n      \/\/ \u9ad8\u901f\u5316\u7528\u30b3\u30fc\u30c9\n      if (num_to_check < S[0] || num_to_check > S[n - 1])\n        break;\n      \/\/\n\n      if (head == tail) {\n        if (num_to_check == S[head \/*==tail*\/]) {\n          C++;\n          break;\n        } else {\n          break;\n        }\n      }\n      mid = (head + tail) \/ 2;\n      if (num_to_check == S[mid]) { \/\/ \u898b\u3064\u304b\u3063\u305f(\u4e2d\u592e\u306e\u5024\u3068\u4e00\u81f4)\n        C++;\n        break;\n      } else { \/\/ \u4e2d\u592e\u306e\u5024\u3068\u4e00\u81f4\u3057\u306a\u3044\n        if (head == tail - 1) {\n          if (num_to_check == S[head] || num_to_check == S[tail]) {\n            C++;\n            break;\n          } else {\n            break;\n          }\n        }\n        if (num_to_check > S[mid]) { \/\/ \u4e2d\u592e\u306e\u5024\u3088\u308a\u5927\u304d\u3044\n          head = mid + 1;\n          \/\/ cout <<\"head\" <<head <<\"tail\" <<tail <<endl;\n        } else { \/\/ \u4e2d\u592e\u306e\u5024\u3088\u308a\u5c0f\u3055\u3044\n          tail = mid - 1;\n          \/\/ cout <<\"head\" <<head <<\"tail\" <<tail <<endl;\n        }\n      }\n    }\n  }\n  cout << C << endl;\n  return 0;\n}","change":"replace","i1":13,"i2":14,"j1":13,"j2":14,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\n#define N 10000\n\nint S[N], T[N];\nint n, m;\n\nint binary() {\n  int l, r, mid, i;\n  int count = 0;\n  for (i = 0; i < m; i++) {\n    l = 0;\n    r = n;\n    while (l < r) {\n      mid = (l + r) \/ 2;\n      if (S[mid] == T[i]) {\n        count++;\n        l = r;\n      } else if (T[i] < S[mid]) {\n        r = mid;\n      } else {\n        l = mid + 1;\n      }\n    }\n  }\n  return count;\n}\n\nint main() {\n  scanf(\"%d\\n\", &n);\n  int i;\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\", &S[i]);\n  }\n  scanf(\"%d\\n\", &m);\n  for (i = 0; i < m; i++) {\n    scanf(\"%d\", &T[i]);\n  }\n\n  int c = binary();\n\n  printf(\"%d\\n\", c);\n  return 0;\n}","changed_src":"#include <stdio.h>\n\n#define N 100000\n\nint S[N], T[N];\nint n, m;\n\nint binary() {\n  int l, r, mid, i;\n  int count = 0;\n  for (i = 0; i < m; i++) {\n    l = 0;\n    r = n;\n    while (l < r) {\n      mid = (l + r) \/ 2;\n      if (S[mid] == T[i]) {\n        count++;\n        l = r;\n      } else if (T[i] < S[mid]) {\n        r = mid;\n      } else {\n        l = mid + 1;\n      }\n    }\n  }\n  return count;\n}\n\nint main() {\n  scanf(\"%d\\n\", &n);\n  int i;\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\", &S[i]);\n  }\n  scanf(\"%d\\n\", &m);\n  for (i = 0; i < m; i++) {\n    scanf(\"%d\", &T[i]);\n  }\n\n  int c = binary();\n\n  printf(\"%d\\n\", c);\n  return 0;\n}","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"Python","original_status":"Runtime Error","original_src":"# -*- coding: utf-8 -*-\n\ninput()\ns = set(input().split())\ninput()\nt = set(input().split())\nprint(int(s & t))\n","changed_src":"# -*- coding: utf-8 -*-\n\ninput()\ns = set(input().split())\ninput()\nt = set(input().split())\nprint(len(s & t))\n","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"TypeError: int() argument must be a string, a bytes-like object or a real number, not 'set'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02268\/Python\/s343168177.py\", line 7, in <module>\n    print(int(s & t))\nTypeError: int() argument must be a string, a bytes-like object or a real number, not 'set'\n"}
-{"problem_id":"p02268","language":"Python","original_status":"Runtime Error","original_src":"def binarySearch(array, key):\n    left = 0\n    right = len(array)\n    while left < right:\n        mid = (left + right) \/ 2\n        if key == array[mid]:\n            return True\n        elif key > array[mid]:\n            left = mid + 1\n        elif key < array[mid]:\n            right = mid\n        else:\n            print(\"ERROR\")\n    return False\n\n\nn = int(input())\ns = [int(x) for x in input().split()]\nq = int(input())\nt = [int(x) for x in input().split()]\na = [x for x in t if binarySearch(s, x)]\nprint(len(a))\n","changed_src":"def binarySearch(array, key):\n    left = 0\n    right = len(array)\n    while left < right:\n        mid = int((left + right) \/ 2)\n        if key == array[mid]:\n            return True\n        elif key > array[mid]:\n            left = mid + 1\n        elif key < array[mid]:\n            right = mid\n        else:\n            print(\"ERROR\")\n    return False\n\n\nn = int(input())\ns = [int(x) for x in input().split()]\nq = int(input())\nt = [int(x) for x in input().split()]\na = [x for x in t if binarySearch(s, x)]\nprint(len(a))\n","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"TypeError: list indices must be integers or slices, not float","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02268\/Python\/s716545650.py\", line 21, in <module>\n    a = [x for x in t if binarySearch(s, x)]\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02268\/Python\/s716545650.py\", line 21, in <listcomp>\n    a = [x for x in t if binarySearch(s, x)]\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02268\/Python\/s716545650.py\", line 6, in binarySearch\n    if key == array[mid]:\nTypeError: list indices must be integers or slices, not float\n"}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n\nint n, S[100000];\n\nint search(int T) {\n  int l = 0, r = n;\n  int mid;\n\n  while (l < r) {\n    mid = (l + r) \/ 2;\n    if (T == S[mid])\n      return 1;\n    if (T > S[mid])\n      l = mid + 1;\n    else if (T < S[mid])\n      r = mid;\n  }\n  return 0;\n}\n\nint main() {\n  int i, q;\n  int T[5000];\n  int count = 0;\n\n  std::cin >> n;\n  for (int i = 0; i < n; i++) {\n    std::cin >> S[i];\n  }\n  std::cin >> q;\n  for (int i = 0; i < q; i++) {\n    std::cin >> T[i];\n    if (search(T[i])) {\n      count++;\n    }\n  }\n  std::cout << count << std::endl;\n  return 0;\n}\n","changed_src":"#include <iostream>\n\nint n, S[100000];\n\nint search(int T) {\n  int l = 0, r = n;\n  int mid;\n\n  while (l < r) {\n    mid = (l + r) \/ 2;\n    if (T == S[mid])\n      return 1;\n    if (T > S[mid])\n      l = mid + 1;\n    else if (T < S[mid])\n      r = mid;\n  }\n  return 0;\n}\n\nint main() {\n  int i, q;\n  int T[50000];\n  int count = 0;\n\n  std::cin >> n;\n  for (int i = 0; i < n; i++) {\n    std::cin >> S[i];\n  }\n  std::cin >> q;\n  for (int i = 0; i < q; i++) {\n    std::cin >> T[i];\n    if (search(T[i])) {\n      count++;\n    }\n  }\n  std::cout << count << std::endl;\n  return 0;\n}\n","change":"replace","i1":22,"i2":23,"j1":22,"j2":23,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int n, q;\n  cin >> n;\n  int S[n];\n  for (int i = 0; i < n; i++)\n    cin >> S[i];\n  cin >> q;\n  int T[q];\n  for (int i = 0; i < q; i++)\n    cin >> T[i];\n\n  int x = 0;\n  int mid;\n  int left = 0;\n  int right = n;\n  for (int j = 0; j < q; j++) {\n    left = 0;\n    right = n;\n    while (left < right) {\n      mid = (left + right) \/ 2;\n      if (S[mid] == T[j]) {\n        x++;\n        break;\n      } else if (T[j] < S[mid]) {\n        right = mid;\n      } else if (T[j] > S[mid]) {\n        left = mid;\n      }\n    }\n  }\n  cout << x << endl;\n\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int n, q;\n  cin >> n;\n  int S[n];\n  for (int i = 0; i < n; i++)\n    cin >> S[i];\n  cin >> q;\n  int T[q];\n  for (int i = 0; i < q; i++)\n    cin >> T[i];\n\n  int x = 0;\n  int mid;\n  int left = 0;\n  int right = n;\n  for (int j = 0; j < q; j++) {\n    left = 0;\n    right = n;\n    while (left < right) {\n      mid = (left + right) \/ 2;\n      if (S[mid] == T[j]) {\n        x++;\n        break;\n      } else if (T[j] < S[mid]) {\n        right = mid;\n      } else if (T[j] > S[mid]) {\n        left = mid + 1;\n      }\n    }\n  }\n  cout << x << endl;\n\n  return 0;\n}","change":"replace","i1":29,"i2":30,"j1":29,"j2":30,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n  int n, a[10000], b, c[10000], i, k = 0, j;\n  for (cin >> n, i = 0; i < n; i++)\n    cin >> a[i];\n  for (cin >> b, i = 0; i < b; i++)\n    cin >> c[i];\n  for (i = 0; i < b; i++)\n    if (binary_search(a, a + n, c[i]))\n      k++;\n  cout << k << endl;\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n  long long n, a[100000], b, c[50000], i, k = 0, j;\n  for (cin >> n, i = 0; i < n; i++)\n    cin >> a[i];\n  for (cin >> b, i = 0; i < b; i++)\n    cin >> c[i];\n  for (i = 0; i < b; i++)\n    if (binary_search(a, a + n, c[i]))\n      k++;\n  cout << k << endl;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint A[10000], n;\n\nint Search(int key) {\n  int l = 0;\n  int r = n;\n  int m;\n  while (l < r) {\n    m = (l + r) \/ 2;\n    if (A[m] < key)\n      l = m + 1;\n    if (A[m] > key)\n      r = m;\n    else if (A[m] == key)\n      return 1;\n  }\n\n  return 0;\n}\n\nint main() {\n  int q, k, s = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> A[i];\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> k;\n\n    if (Search(k))\n      s++;\n  }\n\n  cout << s << \"\\n\";\n  return 0;\n}","changed_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint A[100000], n;\n\nint Search(int key) {\n  int l = 0;\n  int r = n;\n  int m;\n  while (l < r) {\n    m = (l + r) \/ 2;\n    if (A[m] < key)\n      l = m + 1;\n    if (A[m] > key)\n      r = m;\n    else if (A[m] == key)\n      return 1;\n  }\n\n  return 0;\n}\n\nint main() {\n  int q, k, s = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> A[i];\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> k;\n\n    if (Search(k))\n      s++;\n  }\n\n  cout << s << \"\\n\";\n  return 0;\n}","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"\/\/ \u542b\u6709\u6807\u8bb0\u7684\u7ebf\u6027\u641c\u7d22\u53ef\u4ee5\u5c06\u7b97\u6cd5\u6548\u7387\u63d0\u9ad8\u5e38\u6570\u500d\n\/\/ for(int i=0;i<n;i++)\n\/\/ s[n]==key;while(s[i]!=key)i++;if(i!=n)\n\/\/ \u533a\u522b\u5728\u4e8e\u4e3b\u5faa\u73af\u4e2d\u6bd4\u8f83\u8fd0\u7b97\u7684\u6b21\u6570\n#include <cstdio>\n#include <iostream>\nusing namespace std;\nint s[10004];\nint cnt, n;\n\/*void LinearSearch(int s[],int num)\n{\n        for(int i=0;i<n;i++)\n        {\n                if(s[i]==num)\n                {\n                        cnt++;\n                        break;\n                }\n        }\n}*\/\nint BinarySearch(int key) {\n  int left = 0;\n  int right = n;\n  while (left < right) {\n    int mid = (left + right) \/ 2;\n    if (s[mid] == key) {\n      \/\/ cout<<\"1\"<<endl;\n      return 1;\n    } else if (key < s[mid]) \/\/ \u524d\u534a\u90e8\u5206\n    {\n      right = mid;\n    } else \/\/ \u540e\u534a\u90e8\u5206\n    {\n      left = mid + 1;\n    }\n  }\n  return 0;\n}\nint main() {\n  scanf(\"%d\", &n);\n  for (int k = 0; k < n; k++) {\n    scanf(\"%d\", &s[k]);\n    \/\/ cin>>s[k];\n  }\n  int q;\n  scanf(\"%d\", &q);\n  while (q--) {\n    int nn;\n    \/\/ cin>>nn;\n    scanf(\"%d\", &nn);\n    if (BinarySearch(nn)) {\n      cnt++;\n      \/\/ cout<<nn<<endl;\n    }\n  }\n  cout << cnt << endl;\n  return 0;\n}\n","changed_src":"\/\/ \u542b\u6709\u6807\u8bb0\u7684\u7ebf\u6027\u641c\u7d22\u53ef\u4ee5\u5c06\u7b97\u6cd5\u6548\u7387\u63d0\u9ad8\u5e38\u6570\u500d\n\/\/ for(int i=0;i<n;i++)\n\/\/ s[n]==key;while(s[i]!=key)i++;if(i!=n)\n\/\/ \u533a\u522b\u5728\u4e8e\u4e3b\u5faa\u73af\u4e2d\u6bd4\u8f83\u8fd0\u7b97\u7684\u6b21\u6570\n#include <cstdio>\n#include <iostream>\nusing namespace std;\nint s[100005];\nint cnt, n;\n\/*void LinearSearch(int s[],int num)\n{\n        for(int i=0;i<n;i++)\n        {\n                if(s[i]==num)\n                {\n                        cnt++;\n                        break;\n                }\n        }\n}*\/\nint BinarySearch(int key) {\n  int left = 0;\n  int right = n;\n  while (left < right) {\n    int mid = (left + right) \/ 2;\n    if (s[mid] == key) {\n      \/\/ cout<<\"1\"<<endl;\n      return 1;\n    } else if (key < s[mid]) \/\/ \u524d\u534a\u90e8\u5206\n    {\n      right = mid;\n    } else \/\/ \u540e\u534a\u90e8\u5206\n    {\n      left = mid + 1;\n    }\n  }\n  return 0;\n}\nint main() {\n  scanf(\"%d\", &n);\n  for (int k = 0; k < n; k++) {\n    scanf(\"%d\", &s[k]);\n    \/\/ cin>>s[k];\n  }\n  int q;\n  scanf(\"%d\", &q);\n  while (q--) {\n    int nn;\n    \/\/ cin>>nn;\n    scanf(\"%d\", &nn);\n    if (BinarySearch(nn)) {\n      cnt++;\n      \/\/ cout<<nn<<endl;\n    }\n  }\n  cout << cnt << endl;\n  return 0;\n}\n","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nbool binSearch(int *s, int n, int target) {\n  int lo = 0;\n  int hi = n - 1;\n  while (lo <= hi) {\n    int mid = lo + (hi - lo) \/ 2;\n    if (s[mid] == target)\n      return true;\n    else if (target > s[mid])\n      lo = mid + 1;\n    else\n      hi = mid - 1;\n  }\n  return false;\n}\n\nint main() {\n  int val, n, q;\n  int s[10000], t[500];\n\n  cin >> n;\n  for (int i = 0; i < n && cin >> val; ++i)\n    s[i] = val;\n\n  int count = 0;\n  cin >> q;\n  while (q--) {\n    cin >> val;\n    if (binSearch(s, n, val))\n      count++;\n  }\n\n  cout << count << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nbool binSearch(int *s, int n, int target) {\n  int lo = 0;\n  int hi = n - 1;\n  while (lo <= hi) {\n    int mid = lo + (hi - lo) \/ 2;\n    if (s[mid] == target)\n      return true;\n    else if (target > s[mid])\n      lo = mid + 1;\n    else\n      hi = mid - 1;\n  }\n  return false;\n}\n\nint main() {\n  int val, n, q;\n  int s[100000], t[50000];\n\n  cin >> n;\n  for (int i = 0; i < n && cin >> val; ++i)\n    s[i] = val;\n\n  int count = 0;\n  cin >> q;\n  while (q--) {\n    cin >> val;\n    if (binSearch(s, n, val))\n      count++;\n  }\n\n  cout << count << endl;\n  return 0;\n}","change":"replace","i1":23,"i2":24,"j1":23,"j2":24,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n\n#include <algorithm>\n#include <cmath>\n\nusing namespace std;\n\nint S[10010];\nint s, q;\n\nbool binarySearch(int A[], int key) {\n  int left = 0;\n  int right = s - 1;\n  int mid;\n\n  while (left <= right) {\n    mid = (left + right) \/ 2;\n    if (A[mid] > key) {\n      right = mid - 1;\n    } else if (A[mid] < key) {\n      left = mid + 1;\n    } else {\n      return true;\n    }\n  }\n  return false;\n}\n\nint main() {\n\n  cin >> s;\n  for (int i = 0; i < s; i++) {\n    cin >> S[i];\n  }\n\n  int count = 0;\n  int temp;\n\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> temp;\n    if (binarySearch(S, temp)) {\n      count++;\n    }\n  }\n\n  cout << count << endl;\n\n  return 0;\n}","changed_src":"#include <iostream>\n\n#include <algorithm>\n#include <cmath>\n\nusing namespace std;\n\nint S[100100];\nint s, q;\n\nbool binarySearch(int A[], int key) {\n  int left = 0;\n  int right = s - 1;\n  int mid;\n\n  while (left <= right) {\n    mid = (left + right) \/ 2;\n    if (A[mid] > key) {\n      right = mid - 1;\n    } else if (A[mid] < key) {\n      left = mid + 1;\n    } else {\n      return true;\n    }\n  }\n  return false;\n}\n\nint main() {\n\n  cin >> s;\n  for (int i = 0; i < s; i++) {\n    cin >> S[i];\n  }\n\n  int count = 0;\n  int temp;\n\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> temp;\n    if (binarySearch(S, temp)) {\n      count++;\n    }\n  }\n\n  cout << count << endl;\n\n  return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <stdio.h>\nusing namespace std;\n\nint n, S[10000 + 1];\n\nbool binarySearch(int key) {\n  int left = 0, right = n - 1, mid;\n\n  while (left <= right) {\n    mid = (left + right) \/ 2;\n    \/\/ printf(\"L, R, M, S[mid]: %d %d %d %d\\n\", left, right, mid, S[mid]);\n    if (key == S[mid])\n      return true;\n    else if (key < S[mid])\n      right = mid - 1;\n    else\n      left = mid + 1;\n  }\n  return false;\n}\n\nint main() {\n  int q, key, count = 0;\n\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &S[i]);\n  }\n\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (binarySearch(key))\n      count++;\n  }\n\n  printf(\"%d\\n\", count);\n\n  return 0;\n}","changed_src":"#include <iostream>\n#include <stdio.h>\nusing namespace std;\n\nint n, S[100000 + 1];\n\nbool binarySearch(int key) {\n  int left = 0, right = n - 1, mid;\n\n  while (left <= right) {\n    mid = (left + right) \/ 2;\n    \/\/ printf(\"L, R, M, S[mid]: %d %d %d %d\\n\", left, right, mid, S[mid]);\n    if (key == S[mid])\n      return true;\n    else if (key < S[mid])\n      right = mid - 1;\n    else\n      left = mid + 1;\n  }\n  return false;\n}\n\nint main() {\n  int q, key, count = 0;\n\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &S[i]);\n  }\n\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (binarySearch(key))\n      count++;\n  }\n\n  printf(\"%d\\n\", count);\n\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\n\/\/ returns the index of the element which value equals to key.\n\/\/ if no elements matched, it returns -1.\nint search(const vector<int> &x, int key) {\n  int left = 0, right = x.size();\n  while (left < right) {\n    int mid = (left + right) \/ 2;\n    if (x[mid] == key) {\n      return mid;\n    } else if (key < x[mid]) {\n      right = mid;\n    } else if (x[mid] < key) {\n      left = mid + 1;\n    }\n  }\n  return -1;\n}\n\nint main() {\n  int n;\n  cin >> n;\n  vector<int> na(0, n);\n  for (int i = 0; i < n; i++)\n    cin >> na[i];\n  int q;\n  cin >> q;\n  int t;\n  int ans = 0;\n  for (int i = 0; i < q; ++i) {\n    cin >> t;\n    ans += search(na, t) >= 0 ? 1 : 0;\n  }\n  cout << ans << endl;\n  return 0;\n}\n","changed_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\n\/\/ returns the index of the element which value equals to key.\n\/\/ if no elements matched, it returns -1.\nint search(const vector<int> &x, int key) {\n  int left = 0, right = x.size();\n  while (left < right) {\n    int mid = (left + right) \/ 2;\n    if (x[mid] == key) {\n      return mid;\n    } else if (key < x[mid]) {\n      right = mid;\n    } else if (x[mid] < key) {\n      left = mid + 1;\n    }\n  }\n  return -1;\n}\n\nint main() {\n  int n;\n  cin >> n;\n  vector<int> na(n, 0);\n  for (int i = 0; i < n; i++)\n    cin >> na[i];\n  int q;\n  cin >> q;\n  int t;\n  int ans = 0;\n  for (int i = 0; i < q; ++i) {\n    cin >> t;\n    ans += search(na, t) >= 0 ? 1 : 0;\n  }\n  cout << ans << endl;\n  return 0;\n}\n","change":"replace","i1":24,"i2":25,"j1":24,"j2":25,"error":"-11","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"\/\/\n\/\/  main.cpp\n\/\/  binary_search\n\/\/\n\/\/  Created by ???????????? on 2017\/10\/06.\n\/\/  Copyright ?? 2017 ????????????. All rights reserved.\n\/\/\n\n#include <iostream>\n#include <stdio.h>\n\nusing namespace std;\n\nbool binary_search(int A[], int n, int key) {\n  int left, mid, right;\n  left = 0;\n  right = n;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (A[mid] == key) {\n      return true;\n    } else if (key < A[mid]) {\n      right = mid;\n    } else if (key > A[mid]) {\n      left = mid;\n    }\n  }\n  return false;\n}\n\nint main(int argc, const char *argv[]) {\n  int n, i, ct, q, key;\n\n  scanf(\"%d\", &n);\n  int S[n];\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\", &S[i]);\n  }\n\n  ct = 0;\n  scanf(\"%d\", &q);\n  for (i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    bool found = binary_search(S, n, key);\n    if (found)\n      ct++;\n  }\n  cout << ct << endl;\n  ;\n  return 0;\n}","changed_src":"\/\/\n\/\/  main.cpp\n\/\/  binary_search\n\/\/\n\/\/  Created by ???????????? on 2017\/10\/06.\n\/\/  Copyright ?? 2017 ????????????. All rights reserved.\n\/\/\n\n#include <iostream>\n#include <stdio.h>\n\nusing namespace std;\n\nbool binary_search(int A[], int n, int key) {\n  int left, mid, right;\n  left = 0;\n  right = n;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (A[mid] == key) {\n      return true;\n    } else if (key < A[mid]) {\n      right = mid;\n    } else if (key > A[mid]) {\n      left = mid + 1;\n    }\n  }\n  return false;\n}\n\nint main(int argc, const char *argv[]) {\n  int n, i, ct, q, key;\n\n  scanf(\"%d\", &n);\n  int S[n];\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\", &S[i]);\n  }\n\n  ct = 0;\n  scanf(\"%d\", &q);\n  for (i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    bool found = binary_search(S, n, key);\n    if (found)\n      ct++;\n  }\n  cout << ct << endl;\n  ;\n  return 0;\n}","change":"replace","i1":24,"i2":25,"j1":24,"j2":25,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <bitset>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\n#define all(c) (c).begin(), (c).end()\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define pb(e) push_back(e)\n#define mp(a, b) make_pair(a, b)\n#define fr first\n#define sc second\n\nconst int INF = 100000000;\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\nusing namespace std;\ntypedef pair<int, int> P;\ntypedef long long ll;\n\nbool binary_search(int *a, int n, int x) {\n  int l = 0, r = n;\n  while (r - l > 0) {\n    int mid = (l + r) \/ 2;\n    if (a[mid] < x)\n      l = mid;\n    else if (a[mid] == x)\n      return true;\n    else\n      r = mid;\n  }\n  \/\/ cout<<l<<\",\"<<r<<endl;\n  return false;\n}\n\nint n;\nint S[100005];\nint q;\nint main() {\n  int ans = 0;\n  cin >> n;\n  rep(i, n) cin >> S[i];\n  cin >> q;\n  rep(i, q) {\n    int t;\n    cin >> t;\n    if (binary_search(S, n, t))\n      ans++;\n  }\n  cout << ans << endl;\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <bitset>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\n#define all(c) (c).begin(), (c).end()\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define pb(e) push_back(e)\n#define mp(a, b) make_pair(a, b)\n#define fr first\n#define sc second\n\nconst int INF = 100000000;\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\nusing namespace std;\ntypedef pair<int, int> P;\ntypedef long long ll;\n\nbool binary_search(int *a, int n, int x) {\n  int l = 0, r = n;\n  while (r - l > 0) {\n    int mid = (l + r) \/ 2;\n    if (a[mid] < x)\n      l = mid + 1;\n    else if (a[mid] == x)\n      return true;\n    else\n      r = mid;\n  }\n  \/\/ cout<<l<<\",\"<<r<<endl;\n  return false;\n}\n\nint n;\nint S[100005];\nint q;\nint main() {\n  int ans = 0;\n  cin >> n;\n  rep(i, n) cin >> S[i];\n  cin >> q;\n  rep(i, q) {\n    int t;\n    cin >> t;\n    if (binary_search(S, n, t))\n      ans++;\n  }\n  cout << ans << endl;\n  return 0;\n}","change":"replace","i1":38,"i2":39,"j1":38,"j2":39,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\nint main(void) {\n  int n, S[10000], i, j, q, T[500], t, C, L, R, M;\n  scanf(\"%d\", &n);\n  for (i = 0; i != n; i++) {\n    scanf(\"%d\", &S[i]);\n  }\n  scanf(\"%d\", &q);\n  for (j = 0; j != q; j++) {\n    scanf(\"%d\", &T[j]);\n  }\n\n  C = 0;\n  for (i = 0; i != q; i++) {\n    L = 0;\n    R = n;\n    while (L < R) {\n      M = (L + R) \/ 2;\n      if (S[M] == T[i]) {\n        C++;\n\n        break;\n      }\n      if (S[M] > T[i]) {\n        R = M;\n      } else {\n        L = M + 1;\n      }\n    }\n  }\n  printf(\"%d\\n\", C);\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main(void) {\n  int n, S[100000], i, j, q, T[50000], t, C, L, R, M;\n  scanf(\"%d\", &n);\n  for (i = 0; i != n; i++) {\n    scanf(\"%d\", &S[i]);\n  }\n  scanf(\"%d\", &q);\n  for (j = 0; j != q; j++) {\n    scanf(\"%d\", &T[j]);\n  }\n\n  C = 0;\n  for (i = 0; i != q; i++) {\n    L = 0;\n    R = n;\n    while (L < R) {\n      M = (L + R) \/ 2;\n      if (S[M] == T[i]) {\n        C++;\n\n        break;\n      }\n      if (S[M] > T[i]) {\n        R = M;\n      } else {\n        L = M + 1;\n      }\n    }\n  }\n  printf(\"%d\\n\", C);\n  return 0;\n}","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nbool binSearch(int A[], int target, int size) {\n  int left = 0, right = size - 1, mid;\n  while (left <= right) {\n    mid = (left + right) \/ 2;\n    \/\/ cout <<  \"left : \" << left << \", right : \" << right << \", mid : \" << mid\n    \/\/ << endl;\n    if (A[mid] == target) {\n      \/\/ cout << target << \" found.\" << endl;\n      return true;\n    } else {\n      if (A[mid] < target)\n        left = mid + 1;\n      else\n        right = mid;\n    }\n  }\n  return false;\n}\n\nint main() {\n  int size, query, queryNum, count = 0;\n\n  cin >> size;\n  int *A = new int[size];\n  for (int i = 0; i < size; i++)\n    scanf(\"%d\", &A[i]);\n\n  cin >> queryNum;\n  for (int i = 0; i < queryNum; i++) {\n    scanf(\"%d\", &query);\n    if (binSearch(A, query, size))\n      count++;\n  }\n\n  cout << count << endl;\n\n  delete[] A;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nbool binSearch(int A[], int target, int size) {\n  int left = 0, right = size, mid;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    \/\/ cout <<  \"left : \" << left << \", right : \" << right << \", mid : \" << mid\n    \/\/ << endl;\n    if (A[mid] == target) {\n      \/\/ cout << target << \" found.\" << endl;\n      return true;\n    } else {\n      if (A[mid] < target)\n        left = mid + 1;\n      else\n        right = mid;\n    }\n  }\n  return false;\n}\n\nint main() {\n  int size, query, queryNum, count = 0;\n\n  cin >> size;\n  int *A = new int[size];\n  for (int i = 0; i < size; i++)\n    scanf(\"%d\", &A[i]);\n\n  cin >> queryNum;\n  for (int i = 0; i < queryNum; i++) {\n    scanf(\"%d\", &query);\n    if (binSearch(A, query, size))\n      count++;\n  }\n\n  cout << count << endl;\n\n  delete[] A;\n}","change":"replace","i1":4,"i2":6,"j1":4,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cstdlib>\n#include <iostream>\n#include <stack>\n#include <stdio.h>\n#include <string>\n\nint binarysearch(int a[], int n, int key) {\n  int left = 0;\n  int right = n;\n  int mid;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (key == a[mid])\n      return 1;\n    if (key > a[mid])\n      left = mid + 1;\n    else if (key < a[mid])\n      right = mid;\n  }\n  return 0;\n}\nusing namespace std;\nint main() {\n  int i, n, a[10001], q, key, sum = 0;\n  scanf(\"%d\", &n);\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\", &a[i]);\n  }\n  scanf(\"%d\", &q);\n  for (i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (binarysearch(a, n, key))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cstdlib>\n#include <iostream>\n#include <stack>\n#include <stdio.h>\n#include <string>\n\nint binarysearch(int a[], int n, int key) {\n  int left = 0;\n  int right = n;\n  int mid;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (key == a[mid])\n      return 1;\n    if (key > a[mid])\n      left = mid + 1;\n    else if (key < a[mid])\n      right = mid;\n  }\n  return 0;\n}\nusing namespace std;\nint main() {\n  int i, n, a[100001], q, key, sum = 0;\n  scanf(\"%d\", &n);\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\", &a[i]);\n  }\n  scanf(\"%d\", &q);\n  for (i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (binarysearch(a, n, key))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n  return 0;\n}","change":"replace","i1":24,"i2":25,"j1":24,"j2":25,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int n, s[100000], q, t[50000], i, j, l, r, m, count = 0;\n\n  cin >> n;\n  for (i = 0; i < n; i++) {\n    cin >> s[i];\n  }\n  cin >> q;\n  for (i = 0; i < q; i++) {\n    cin >> t[i];\n  }\n\n  \/\/ Binary Search\n\n  for (i = 0; i < q; i++) {\n    l = 0;\n    r = n;\n    while (l < r) {\n      m = (l + r) \/ 2;\n      if (s[m] > t[i]) {\n        r = m;\n      } else if (s[m] < t[i]) {\n        l = m;\n      } else {\n        count++;\n        break;\n      }\n    }\n  }\n\n  cout << count << endl;\n\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int n, s[100000], q, t[50000], i, j, l, r, m, count = 0;\n\n  cin >> n;\n  for (i = 0; i < n; i++) {\n    cin >> s[i];\n  }\n  cin >> q;\n  for (i = 0; i < q; i++) {\n    cin >> t[i];\n  }\n\n  \/\/ Binary Search\n\n  for (i = 0; i < q; i++) {\n    l = 0;\n    r = n;\n    while (l < r) {\n      m = (l + r) \/ 2;\n      if (s[m] > t[i]) {\n        r = m;\n      } else if (s[m] < t[i]) {\n        l = m + 1;\n      } else {\n        count++;\n        break;\n      }\n    }\n  }\n\n  cout << count << endl;\n\n  return 0;\n}","change":"replace","i1":24,"i2":25,"j1":24,"j2":25,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint A[1000000], n;\n\nint binarySearch(int key) {\n  int left = 0;\n  int right = n;\n  int mid;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (A[mid] == key)\n      return 1;\n    if (key < A[mid])\n      right = mid;\n    else if (key > A[mid])\n      left = mid + 1;\n  }\n  return 0;\n}\n\nint main() {\n  int i, q, key, sum = 0;\n\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", A[i]);\n  }\n\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (binarySearch(key))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint A[1000000], n;\n\nint binarySearch(int key) {\n  int left = 0;\n  int right = n;\n  int mid;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (A[mid] == key)\n      return 1;\n    if (key < A[mid])\n      right = mid;\n    else if (key > A[mid])\n      left = mid + 1;\n  }\n  return 0;\n}\n\nint main() {\n  int i, q, key, sum = 0;\n\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &A[i]);\n  }\n\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (binarySearch(key))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n\n  return 0;\n}\n","change":"replace","i1":25,"i2":26,"j1":25,"j2":26,"error":"-11","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint A[1000000], n;\n\nint binarySearch(int key) {\n  int left = 0;\n  int right = n;\n  int mid;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (A[mid] == key)\n      return 1;\n    if (key < A[mid])\n      right = mid;\n    else if (key > A[mid])\n      left = mid + 1;\n  }\n  return 0;\n}\n\nint main() {\n  int i, q, key, sum = 0;\n\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", A[i]);\n  }\n\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (binarySearch(key))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n\n  return 0;\n}\n","changed_src":"#include <stdio.h>\n\nint A[1000000], n;\n\nint binarySearch(int key) {\n  int left = 0;\n  int right = n;\n  int mid;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (A[mid] == key)\n      return 1;\n    if (key < A[mid])\n      right = mid;\n    else if (key > A[mid])\n      left = mid + 1;\n  }\n  return 0;\n}\n\nint main() {\n  int i, q, key, sum = 0;\n\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &A[i]);\n  }\n\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (binarySearch(key))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n\n  return 0;\n}","change":"replace","i1":25,"i2":26,"j1":25,"j2":26,"error":"-11","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#define int long long\n\nusing namespace std;\n\nint S[100100];\nint n, q;\nint T;\n\nsigned main() {\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> S[i];\n  }\n  cin >> q;\n  int L = 0;\n  int R = n;\n  int cnt = 0;\n  int mid;\n  for (int i = 0; i < q; i++) {\n    cin >> T;\n    L = 0;\n    R = n;\n    for (int j = 0; j < n \/ 2; j++) {\n      int mid = (L + R) \/ 2;\n      \/\/ cout<<mid<<endl;\n      if (S[L] == T) {\n        cnt++;\n        \/\/ cout<<\"succes\"<<endl;\n        break;\n      } else if (S[mid] <= T) {\n        L = mid;\n      } else if (S[mid] > T) {\n        R = mid;\n      }\n    }\n  }\n  cout << cnt << endl;\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#define int long long\n\nusing namespace std;\n\nint S[100100];\nint n, q;\nint T;\n\nsigned main() {\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> S[i];\n  }\n  cin >> q;\n  int L = 0;\n  int R = n;\n  int cnt = 0;\n  int mid;\n  for (int i = 0; i < q; i++) {\n    cin >> T;\n    L = 0;\n    R = n;\n    for (int j = 0; j < 18; j++) {\n      int mid = (L + R) \/ 2;\n      \/\/ cout<<mid<<endl;\n      if (S[L] == T) {\n        cnt++;\n        \/\/ cout<<\"succes\"<<endl;\n        break;\n      } else if (S[mid] <= T) {\n        L = mid;\n      } else if (S[mid] > T) {\n        R = mid;\n      }\n    }\n  }\n  cout << cnt << endl;\n  return 0;\n}","change":"replace","i1":25,"i2":26,"j1":25,"j2":26,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\nint main() {\n  ios_base::sync_with_stdio(false);\n\n  unsigned int list[100000];\n  int numOfList;\n\n  cin >> numOfList;\n\n  rep(i, numOfList) cin >> list[i];\n\n  int val;\n  int counter = 0;\n  cin >> val;\n\n  while (cin >> val) {\n    int high = numOfList - 1;\n    int low = 0;\n    int mid;\n\n    while (low <= high) {\n      if (list[mid] < val) {\n        low = mid + 1;\n      } else if (list[mid] > val) {\n        high = mid - 1;\n      } else if (list[mid] == val) {\n        counter++;\n        break;\n      }\n    }\n  }\n  cout << counter << endl;\n\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\nint main() {\n  ios_base::sync_with_stdio(false);\n\n  unsigned int list[100000];\n  int numOfList;\n\n  cin >> numOfList;\n\n  rep(i, numOfList) cin >> list[i];\n\n  int val;\n  int counter = 0;\n  cin >> val;\n\n  while (cin >> val) {\n    int high = numOfList - 1;\n    int low = 0;\n    int mid;\n\n    while (low <= high) {\n      mid = (low + high) \/ 2;\n      if (list[mid] < val) {\n        low = mid + 1;\n      } else if (list[mid] > val) {\n        high = mid - 1;\n      } else if (list[mid] == val) {\n        counter++;\n        break;\n      }\n    }\n  }\n  cout << counter << endl;\n\n  return 0;\n}","change":"insert","i1":24,"i2":24,"j1":24,"j2":25,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <cstdio>\n#include <iostream>\nusing namespace std;\n\n\/\/ ?????\u00a7????\u00b4\u00a2\nbool BinarySearch(int A[], int n, int key) {\n  int left = 0, right = n, mid;\n\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (key == A[mid])\n      return true;\n\n    if (key > A[mid])\n      left = mid + 1;\n    if (key < A[mid])\n      right = mid;\n  }\n  return false;\n}\nint main() {\n  int n, q, key;\n  int sum = 0;\n  int A[10000 + 10];\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &A[i]);\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (BinarySearch(A, n, key))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n}","changed_src":"#include <cstdio>\n#include <iostream>\nusing namespace std;\n\n\/\/ ?????\u00a7????\u00b4\u00a2\nbool BinarySearch(int A[], int n, int key) {\n  int left = 0, right = n, mid;\n\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (key == A[mid])\n      return true;\n\n    if (key > A[mid])\n      left = mid + 1;\n    if (key < A[mid])\n      right = mid;\n  }\n  return false;\n}\nint main() {\n  int n, q, key;\n  int sum = 0;\n  int A[100000 + 10];\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &A[i]);\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (BinarySearch(A, n, key))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n}","change":"replace","i1":23,"i2":24,"j1":23,"j2":24,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\nconstexpr int Nmax = 100'000;\n\nbool binarySearch(int *array, int value, int n) {\n  int left = 0;\n  int right = n - 1;\n  int center = (left + right) \/ 2;\n  while (array[center] != value) {\n    if (left == right) {\n      return false;\n    }\n    if (array[center] > value) {\n      right = center - 1;\n    } else {\n      left = center + 1;\n    }\n    center = (left + right) \/ 2;\n  }\n  return true;\n}\n\nint main() {\n  ios::sync_with_stdio(false);\n\n  int same = 0;\n\n  int S[Nmax];\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> S[i];\n  }\n\n  int q;\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    int value;\n    cin >> value;\n    if (binarySearch(S, value, n)) {\n      same++;\n    }\n  }\n  cout << same << endl;\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\nconstexpr int Nmax = 100'000;\n\nbool binarySearch(int *array, int value, int n) {\n  int left = 0;\n  int right = n - 1;\n  int center = (left + right) \/ 2;\n  while (array[center] != value) {\n    if (left >= right) {\n      return false;\n    }\n    if (array[center] > value) {\n      right = center - 1;\n    } else {\n      left = center + 1;\n    }\n    center = (left + right) \/ 2;\n  }\n  return true;\n}\n\nint main() {\n  ios::sync_with_stdio(false);\n\n  int same = 0;\n\n  int S[Nmax];\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> S[i];\n  }\n\n  int q;\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    int value;\n    cin >> value;\n    if (binarySearch(S, value, n)) {\n      same++;\n    }\n  }\n  cout << same << endl;\n\n  return 0;\n}","change":"replace","i1":13,"i2":14,"j1":13,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nint ans = 0;\n\nbool answer(int n, long num[], int p) {\n  if (n == num[p]) {\n    ans++;\n    return true;\n  }\n  return false;\n}\n\nint main() {\n  int s, t, n;\n\n  cin >> s;\n  long num[s];\n\n  for (int i = 0; i < s; i++)\n    cin >> num[i];\n\n  cin >> t;\n  for (int i = 0; i < t; i++) {\n    int p = 0, pp = s;\n    bool br = false;\n    cin >> n;\n    while (true) {\n      int a = p + ((pp - p) \/ 2);\n      if (answer(n, num, a))\n        break;\n      else if (n > num[a]) {\n        if (answer(n, num, a + 1))\n          break;\n        p = a;\n        if (p >= s)\n          break;\n      } else if (answer(n, num, a - 1))\n        break;\n      else {\n        pp = a - 2;\n        if (pp <= p)\n          break;\n      }\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","changed_src":"#include <iostream>\n\nusing namespace std;\n\nint ans = 0;\n\nbool answer(int n, long num[], int p) {\n  if (n == num[p]) {\n    ans++;\n    return true;\n  }\n  return false;\n}\n\nint main() {\n  int s, t, n;\n\n  cin >> s;\n  long num[s];\n\n  for (int i = 0; i < s; i++)\n    cin >> num[i];\n\n  cin >> t;\n  for (int i = 0; i < t; i++) {\n    int p = 0, pp = s;\n    bool br = false;\n    cin >> n;\n    while (true) {\n      int a = p + ((pp - p) \/ 2);\n      if (answer(n, num, a))\n        break;\n      else if (n > num[a]) {\n        if (answer(n, num, a + 1))\n          break;\n        p = a + 1;\n        if (p == pp)\n          break;\n      } else if (answer(n, num, a - 1))\n        break;\n      else {\n        pp = a - 2;\n        if (pp <= p)\n          break;\n      }\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}","change":"replace","i1":35,"i2":37,"j1":35,"j2":37,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  int n, q;\n  long long S[10000], T;\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> S[i];\n  cin >> q;\n\n  int count = 0;\n\n  for (int j = 0; j < q; j++) {\n    cin >> T;\n    int left = 0;\n    int right = n;\n    int mid = (left + right) \/ 2;\n    while (left < right) {\n      mid = (left + right) \/ 2;\n      if (T == S[mid]) {\n        count++;\n        break;\n      }\n      if (T > S[mid]) {\n        left = mid + 1;\n      } else if (T < S[mid]) {\n        right = mid;\n      }\n    }\n  }\n  cout << count << endl;\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n  int n, q;\n  long long S[1000000], T;\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> S[i];\n  cin >> q;\n\n  int count = 0;\n\n  for (int j = 0; j < q; j++) {\n    cin >> T;\n    int left = 0;\n    int right = n;\n    int mid = (left + right) \/ 2;\n    while (left < right) {\n      mid = (left + right) \/ 2;\n      if (T == S[mid]) {\n        count++;\n        break;\n      }\n      if (T > S[mid]) {\n        left = mid + 1;\n      } else if (T < S[mid]) {\n        right = mid;\n      }\n    }\n  }\n  cout << count << endl;\n  return 0;\n}\n","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cstdio>\n\nstatic const size_t n_max = 10000;\nstatic int S[n_max];\n\nint main() {\n  size_t n, q;\n  scanf(\"%zu\", &n);\n  for (size_t i = 0; i < n; i++)\n    scanf(\"%d\", S + i);\n  scanf(\"%zu\", &q);\n  int c = 0;\n  for (size_t i = 0; i < q; i++) {\n    int t;\n    scanf(\"%d\", &t);\n    if (std::binary_search(S, S + n, t))\n      c++;\n  }\n  printf(\"%d\\n\", c);\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cstdio>\n\nstatic const size_t n_max = 100000;\nstatic int S[n_max];\n\nint main() {\n  size_t n, q;\n  scanf(\"%zu\", &n);\n  for (size_t i = 0; i < n; i++)\n    scanf(\"%d\", S + i);\n  scanf(\"%zu\", &q);\n  int c = 0;\n  for (size_t i = 0; i < q; i++) {\n    int t;\n    scanf(\"%d\", &t);\n    if (std::binary_search(S, S + n, t))\n      c++;\n  }\n  printf(\"%d\\n\", c);\n  return 0;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\n\nint A[1000000], n;\n\nint binarySearch(int key) {\n  int left = 0, right = n, mid;\n\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (key == A[mid])\n      return 1;\n    else if (key < A[mid])\n      right = mid;\n    else if (key > A[mid])\n      left = mid;\n  }\n\n  return 0;\n}\n\nint main() {\n  int q, k, sum = 0;\n\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &A[i]);\n\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &k);\n    if (binarySearch(k))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n}","changed_src":"#include <cstdio>\n\nint A[1000000], n;\n\nint binarySearch(int key) {\n  int left = 0, right = n, mid;\n\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (key == A[mid])\n      return 1;\n    else if (key < A[mid])\n      right = mid;\n    else if (key > A[mid])\n      left = mid + 1;\n  }\n\n  return 0;\n}\n\nint main() {\n  int q, k, sum = 0;\n\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &A[i]);\n\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &k);\n    if (binarySearch(k))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n}","change":"replace","i1":14,"i2":15,"j1":14,"j2":15,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int i, n, j, k, o, count = 0;\n  int a[10001];\n  scanf(\"%d\", &n);\n  for (i = 0; i < n; i++)\n    scanf(\"%d\", &a[i]);\n  int left = 0, right = n - 1;\n  int cur = n \/ 2;\n  scanf(\"%d\", &k);\n  for (i = 0; i < k; i++) {\n    scanf(\"%d\", &o);\n    left = 0, right = n - 1;\n    while (1) {\n      if (left == right - 1 || left == right) {\n        if (a[left] == o || a[right] == o)\n          count++;\n        break;\n      }\n      if (o == a[cur] || o == a[cur + 1]) {\n        count++;\n        break;\n      }\n      if (o > a[cur]) {\n        left = cur;\n        cur = (left + right) \/ 2;\n      }\n      if (o < a[cur]) {\n        right = cur;\n        cur = (left + right) \/ 2;\n      }\n    }\n  }\n  printf(\"%d\\n\", count);\n}\n","changed_src":"#include <stdio.h>\nint main() {\n  int i, n, j, k, o, count = 0;\n  int a[1000001];\n  scanf(\"%d\", &n);\n  for (i = 0; i < n; i++)\n    scanf(\"%d\", &a[i]);\n  int left = 0, right = n - 1;\n  int cur = n \/ 2;\n  scanf(\"%d\", &k);\n  for (i = 0; i < k; i++) {\n    scanf(\"%d\", &o);\n    left = 0, right = n - 1;\n    while (1) {\n      if (left == right - 1 || left == right) {\n        if (a[left] == o || a[right] == o)\n          count++;\n        break;\n      }\n      if (o == a[cur] || o == a[cur + 1]) {\n        count++;\n        break;\n      }\n      if (o > a[cur]) {\n        left = cur;\n        cur = (left + right) \/ 2;\n      }\n      if (o < a[cur]) {\n        right = cur;\n        cur = (left + right) \/ 2;\n      }\n    }\n  }\n  printf(\"%d\\n\", count);\n}\n","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <cstdio>\n\nint main(int argc, char const *argv[]) {\n  int n, q, target;\n  int findCount = 0; \/\/ ???????????\u00a3?????\u00b0????????\u00b0\n  int inputSequence[10000];\n\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &inputSequence[i]);\n  }\n\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &target);\n    int begin = 0, end = n - 1;\n    do {\n      int current = (begin + end) \/ 2;\n      if (inputSequence[current] == target) {\n        findCount++;\n        break;\n      }\n      \/\/ ?????????????????\u00a7????????????????????????\n      else if (inputSequence[current] < target) {\n        begin = current + 1;\n      }\n      \/\/ ????????????????\u00b0?????????????????????????\n      else if (inputSequence[current] > target) {\n        end = current - 1;\n      }\n    } while (begin <= end); \/\/ ????????\u00a8????\u00b0??????\\???????????\u00a3????????????\n  }\n\n  printf(\"%d\\n\", findCount);\n  return 0;\n}","changed_src":"#include <cstdio>\n\nint main(int argc, char const *argv[]) {\n  int n, q, target;\n  int findCount = 0; \/\/ ???????????\u00a3?????\u00b0????????\u00b0\n  int inputSequence[100000];\n\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &inputSequence[i]);\n  }\n\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &target);\n    int begin = 0, end = n - 1;\n    do {\n      int current = (begin + end) \/ 2;\n      if (inputSequence[current] == target) {\n        findCount++;\n        break;\n      }\n      \/\/ ?????????????????\u00a7????????????????????????\n      else if (inputSequence[current] < target) {\n        begin = current + 1;\n      }\n      \/\/ ????????????????\u00b0?????????????????????????\n      else if (inputSequence[current] > target) {\n        end = current - 1;\n      }\n    } while (begin <= end); \/\/ ????????\u00a8????\u00b0??????\\???????????\u00a3????????????\n  }\n\n  printf(\"%d\\n\", findCount);\n  return 0;\n}","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n\n  int n, a[10000], m, b, result = 0, i, j;\n\n  cin >> n;\n  for (i = 0; i < n; i++)\n    cin >> a[i];\n  cin >> m;\n  for (i = 0; i < m; i++) {\n    cin >> b;\n    for (j = 0; j < n; j++)\n      if (b == a[j]) {\n        result++;\n        break;\n      }\n  }\n\n  cout << result << endl;\n\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n\n  int n, a[100000], m, b, result = 0, i, j;\n\n  cin >> n;\n  for (i = 0; i < n; i++)\n    cin >> a[i];\n  cin >> m;\n  for (i = 0; i < m; i++) {\n    cin >> b;\n    for (j = 0; j < n; j++)\n      if (b == a[j]) {\n        result++;\n        break;\n      }\n  }\n\n  cout << result << endl;\n\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint search(int);\n\nint n, S[100000];\n\nint main() {\n\n  int q, T[50000], counter = 0;\n\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> S[i];\n\n  cin >> q;\n  for (int i = 0; i < q; i++)\n    cin >> T[i];\n\n  sort(S, S + n);\n\n  for (int i = 0; i < q; i++)\n    counter += search(T[i]);\n\n  cout << counter << endl;\n\n  return 0;\n}\n\nint search(int t) {\n\n  int left = 0;\n  int right = n;\n\n  while (left <= right) {\n    int mid = (left + right) \/ 2;\n    if (S[mid] == t) {\n      return 1;\n    } else if (t < S[mid]) {\n      right = mid;\n    } else {\n      left = mid + 1;\n    }\n  }\n\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint search(int);\n\nint n, S[100000];\n\nint main() {\n\n  int q, T[50000], counter = 0;\n\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> S[i];\n\n  cin >> q;\n  for (int i = 0; i < q; i++)\n    cin >> T[i];\n\n  sort(S, S + n);\n\n  for (int i = 0; i < q; i++)\n    counter += search(T[i]);\n\n  cout << counter << endl;\n\n  return 0;\n}\n\nint search(int t) {\n\n  int left = 0;\n  int right = n;\n\n  while (left < right) {\n    int mid = (left + right) \/ 2;\n    if (S[mid] == t) {\n      return 1;\n    } else if (t < S[mid]) {\n      right = mid;\n    } else {\n      left = mid + 1;\n    }\n  }\n\n  return 0;\n}","change":"replace","i1":35,"i2":36,"j1":35,"j2":36,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\n\nint a[10000], b[10000];\nint binary(int l, int r, int c) {\n  while (l <= r) {\n    int p = (l + r) \/ 2, x, y;\n    if (a[p] == c)\n      return 1;\n    else if (c < a[p])\n      r = p - 1;\n    else\n      l = p + 1;\n  }\n  return 0;\n}\n\nint ar(int n) {\n  for (int i = 0; i < n; i++) {\n    cin >> b[i];\n    for (int j = 0; j < i; j++)\n      if (b[i] == b[j])\n        i--, n--;\n  }\n  return n;\n}\n\nint main() {\n  int p, q, n = 0;\n  cin >> p;\n  for (int i = 0; i < p; i++)\n    cin >> a[i];\n  cin >> q, q = ar(q);\n  for (int i = 0; i < q; i++)\n    n += binary(0, p - 1, b[i]);\n  cout << n << endl;\n\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint a[100000], b[100000];\nint binary(int l, int r, int c) {\n  while (l <= r) {\n    int p = (l + r) \/ 2, x, y;\n    if (a[p] == c)\n      return 1;\n    else if (c < a[p])\n      r = p - 1;\n    else\n      l = p + 1;\n  }\n  return 0;\n}\n\nint ar(int n) {\n  for (int i = 0; i < n; i++) {\n    cin >> b[i];\n    for (int j = 0; j < i; j++)\n      if (b[i] == b[j])\n        i--, n--;\n  }\n  return n;\n}\n\nint main() {\n  int p, q, n = 0;\n  cin >> p;\n  for (int i = 0; i < p; i++)\n    cin >> a[i];\n  cin >> q, q = ar(q);\n  for (int i = 0; i < q; i++)\n    n += binary(0, p - 1, b[i]);\n  cout << n << endl;\n\n  return 0;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\n\nint n, S[10010], q, key, cnt = 0;\n\nint search() {\n  int left = 0, right = n, med;\n  while (left < right) {\n    med = (left + right) \/ 2;\n    if (S[med] == key)\n      return 1;\n    else if (S[med] < key)\n      left = med + 1;\n    else\n      right = med;\n  }\n  return 0;\n}\n\nint main() {\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> S[i];\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> key;\n    cnt += search();\n  }\n  cout << cnt << endl;\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\n\nint n, S[100010], q, key, cnt = 0;\n\nint search() {\n  int left = 0, right = n, med;\n  while (left < right) {\n    med = (left + right) \/ 2;\n    if (S[med] == key)\n      return 1;\n    else if (S[med] < key)\n      left = med + 1;\n    else\n      right = med;\n  }\n  return 0;\n}\n\nint main() {\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> S[i];\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> key;\n    cnt += search();\n  }\n  cout << cnt << endl;\n  return 0;\n}\n","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n#include <map>\nusing namespace std;\n\nint binSearch(int A[], int n, int key) {\n  int left = 0, right = n, mid;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (A[mid] == key)\n      return 1;\n    else if (A[mid] < key)\n      left = mid + 1; \/\/+1???????????\u00a8???????????\u00a7?????\u00a3??????\n    else\n      right = mid; \/\/ left<right\n  }\n  return 0;\n}\n\nint main() {\n  int n, sum = 0, q, S[10000], T[50000];\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> S[i];\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> T[i];\n    if (binSearch(S, n, T[i]))\n      sum++;\n  }\n  cout << sum << endl;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <map>\nusing namespace std;\n\nint binSearch(int A[], int n, int key) {\n  int left = 0, right = n, mid;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (A[mid] == key)\n      return 1;\n    else if (A[mid] < key)\n      left = mid + 1; \/\/+1???????????\u00a8???????????\u00a7?????\u00a3??????\n    else\n      right = mid; \/\/ left<right\n  }\n  return 0;\n}\n\nint main() {\n  int n, sum = 0, q, S[100000], T[50000];\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> S[i];\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> T[i];\n    if (binSearch(S, n, T[i]))\n      sum++;\n  }\n  cout << sum << endl;\n}","change":"replace","i1":20,"i2":21,"j1":20,"j2":21,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <cstdio>\n#include <iostream>\n\nusing namespace std;\n\nint binSearch(int A[], int n, int key) {\n  int left = 0, right = n, mid;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (key == A[mid])\n      return 1;\n    if (key < A[mid])\n      right = mid;\n    if (key > A[mid])\n      left = mid + 1;\n  }\n  return 0;\n}\n\nint main(int argc, char const *argv[]) {\n  int i, n, q, A[10001], key, sum = 0;\n\n  cin >> n;\n  for (i = 0; i < n; i++)\n    scanf(\"%d\", &A[i]);\n\n  cin >> q;\n  for (int i = 0; i < q; ++i) {\n    scanf(\"%d\", &key);\n    sum += binSearch(A, n, key);\n  }\n  cout << sum << endl;\n  return 0;\n}","changed_src":"#include <cstdio>\n#include <iostream>\n\nusing namespace std;\n\nint binSearch(int A[], int n, int key) {\n  int left = 0, right = n, mid;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (key == A[mid])\n      return 1;\n    if (key < A[mid])\n      right = mid;\n    if (key > A[mid])\n      left = mid + 1;\n  }\n  return 0;\n}\n\nint main(int argc, char const *argv[]) {\n  int i, n, q, A[100001], key, sum = 0;\n\n  cin >> n;\n  for (i = 0; i < n; i++)\n    scanf(\"%d\", &A[i]);\n\n  cin >> q;\n  for (int i = 0; i < q; ++i) {\n    scanf(\"%d\", &key);\n    sum += binSearch(A, n, key);\n  }\n  cout << sum << endl;\n  return 0;\n}","change":"replace","i1":20,"i2":21,"j1":20,"j2":21,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#define REP(i, s, n) for (int i = s; i < n; i++)\n#define rep(i, n) REP(i, 0, n)\nusing namespace std;\n\nint main() {\n  int n, p, S[100000], T[100000];\n  bool exist;\n  cin >> n;\n  rep(i, n) cin >> S[i];\n  cin >> p;\n  rep(i, p) cin >> T[i];\n\n  int h;\n  rep(i, n) {\n    int ch = i;\n    REP(j, i, n) {\n      if (S[ch] > S[j])\n        ch = j;\n    }\n    h = S[ch];\n    S[ch] = S[i];\n    S[i] = h;\n  }\n\n  int count = 0;\n\n  rep(i, p) {\n    int lef = 0, rig = n;\n    exist = false;\n    while (lef < rig) {\n      int index = (lef + rig) \/ 2;\n      if (T[i] == S[index]) {\n        exist = true;\n        break;\n      } else if (T[i] < S[index]) {\n        rig = index;\n      } else {\n        lef = index + 1;\n      }\n    }\n    if (exist) {\n      count++;\n    }\n  }\n  cout << count << endl;\n}","changed_src":"#include <iostream>\n#define REP(i, s, n) for (int i = s; i < n; i++)\n#define rep(i, n) REP(i, 0, n)\nusing namespace std;\n\nint main() {\n  int n, p, S[100000], T[100000];\n  bool exist;\n  cin >> n;\n  rep(i, n) cin >> S[i];\n  cin >> p;\n  rep(i, p) cin >> T[i];\n\n  int count = 0;\n\n  rep(i, p) {\n    int lef = 0, rig = n;\n    exist = false;\n    while (lef < rig) {\n      int index = (lef + rig) \/ 2;\n      if (T[i] == S[index]) {\n        exist = true;\n        break;\n      } else if (T[i] < S[index]) {\n        rig = index;\n      } else {\n        lef = index + 1;\n      }\n    }\n    if (exist) {\n      count++;\n    }\n  }\n  cout << count << endl;\n}","change":"delete","i1":12,"i2":24,"j1":12,"j2":12,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint BSearch(int x, int A[], int N) {\n  int left = 0;\n  int right = N;\n\n  while (left <= right) {\n    int mid = (left + right) \/ 2;\n\n    if (A[mid] == x) {\n      return mid;\n    } else if (x < A[mid]) {\n      right = mid;\n    } else {\n      left = mid + 1;\n    }\n  }\n  return -1;\n}\n\nint main() {\n  int n;\n  cin >> n;\n  int S[n];\n  for (int i = 0; i < n; i++) {\n    cin >> S[i];\n  }\n\n  int q;\n  cin >> q;\n  int T[q];\n  for (int i = 0; i < q; i++) {\n    cin >> T[i];\n  }\n\n  int ans = 0;\n\n  for (int i = 0; i < q; i++) {\n    if (BSearch(T[i], S, n) != -1) {\n      ans++;\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\n\nint BSearch(int x, int A[], int N) {\n  int left = 0;\n  int right = N;\n\n  while (left < right) {\n    int mid = (left + right) \/ 2;\n\n    if (A[mid] == x) {\n      return mid;\n    } else if (x < A[mid]) {\n      right = mid;\n    } else {\n      left = mid + 1;\n    }\n  }\n  return -1;\n}\n\nint main() {\n  int n;\n  cin >> n;\n  int S[n];\n  for (int i = 0; i < n; i++) {\n    cin >> S[i];\n  }\n\n  int q;\n  cin >> q;\n  int T[q];\n  for (int i = 0; i < q; i++) {\n    cin >> T[i];\n  }\n\n  int ans = 0;\n\n  for (int i = 0; i < q; i++) {\n    if (BSearch(T[i], S, n) != -1) {\n      ans++;\n    }\n  }\n\n  cout << ans << endl;\n\n  return 0;\n}\n","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nbool binarySearch(vector<int> vi, int t) {\n  int right = vi.size() - 1;\n  int left = 0;\n  bool flg = true;\n  while (flg) {\n    if (right == left)\n      flg = false;\n    int center = (left + right) \/ 2;\n    if (vi[center] < t) {\n      left = center;\n    } else if (vi[center] > t) {\n      right = center;\n    } else {\n      return true;\n    }\n  }\n  return false;\n}\n\nint main() {\n  vector<int> vi;\n  int n, q;\n  int count = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    int s;\n    cin >> s;\n    vi.push_back(s);\n  }\n  sort(vi.begin(), vi.end());\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    int t;\n    cin >> t;\n    count += binarySearch(vi, t);\n  }\n  cout << count << endl;\n  return 0;\n};\n","changed_src":"#include <algorithm>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nbool binarySearch(vector<int> vi, int t) {\n  int right = vi.size() - 1;\n  int left = 0;\n  bool flg = true;\n  while (flg) {\n    if (right == left)\n      flg = false;\n    int center = (left + right) \/ 2;\n    if (vi[center] < t) {\n      left = center + 1;\n    } else if (vi[center] > t) {\n      right = center;\n    } else {\n      return true;\n    }\n  }\n  return false;\n}\n\nint main() {\n  vector<int> vi;\n  int n, q;\n  int count = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    int s;\n    cin >> s;\n    vi.push_back(s);\n  }\n  sort(vi.begin(), vi.end());\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    int t;\n    cin >> t;\n    count += binarySearch(vi, t);\n  }\n  cout << count << endl;\n  return 0;\n};\n","change":"replace","i1":15,"i2":16,"j1":15,"j2":16,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <list>\n#include <queue>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint s[100000], n;\n\nint binsearch(int key) {\n  int left = 0, right = n, mid = (left + right) \/ 2;\n  while (left < right) {\n    if (s[mid] == key)\n      return 1;\n    else if (s[mid] > key) {\n      right = mid;\n      mid = (left + right) \/ 2;\n    } else if (s[mid] < key) {\n      left = mid;\n      mid = (left + right) \/ 2;\n    }\n  }\n  return 0;\n}\n\nint main() {\n  int m, count = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> s[i];\n  }\n  cin >> m;\n  for (int i = 0; i < m; i++) {\n    int t;\n    cin >> t;\n    count += binsearch(t);\n  }\n  cout << count << endl;\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <list>\n#include <queue>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint s[100000], n;\n\nint binsearch(int key) {\n  int left = 0, right = n, mid = (left + right) \/ 2;\n  while (left < right) {\n    if (s[mid] == key)\n      return 1;\n    else if (s[mid] > key) {\n      right = mid;\n      mid = (left + right) \/ 2;\n    } else if (s[mid] < key) {\n      left = mid + 1;\n      mid = (left + right) \/ 2;\n    }\n  }\n  return 0;\n}\n\nint main() {\n  int m, count = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> s[i];\n  }\n  cin >> m;\n  for (int i = 0; i < m; i++) {\n    int t;\n    cin >> t;\n    count += binsearch(t);\n  }\n  cout << count << endl;\n  return 0;\n}","change":"replace","i1":22,"i2":23,"j1":22,"j2":23,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int n, q;\n  cin >> n;\n  int *S = new int[n];\n  int number;\n  for (int i; i < n; ++i) {\n    cin >> number;\n    S[i] = number;\n  }\n  cin >> q;\n  int *T = new int[q];\n  for (int i = 0; i < q; ++i) {\n    cin >> number;\n    T[i] = number;\n  }\n  int cnt = 0;\n\n  for (int i = 0; i < q; ++i) {\n    int left = 0, right = n;\n    while (left < right) {\n      int mid = (left + right) \/ 2;\n      if (S[mid] == T[i]) {\n        cnt++;\n        break;\n      } else if (S[mid] > T[i]) {\n        right = mid;\n      } else if (S[mid] < T[i]) {\n        left = mid;\n      }\n    }\n  }\n\n  cout << cnt << \"\\n\";\n  delete[] T;\n  delete[] S;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int n, q;\n  cin >> n;\n  int *S = new int[n];\n  int number;\n  for (int i; i < n; ++i) {\n    cin >> number;\n    S[i] = number;\n  }\n  cin >> q;\n  int *T = new int[q];\n  for (int i = 0; i < q; ++i) {\n    cin >> number;\n    T[i] = number;\n  }\n  int cnt = 0;\n\n  for (int i = 0; i < q; ++i) {\n    int left = 0, right = n;\n    while (left < right) {\n      int mid = (left + right) \/ 2;\n      if (S[mid] == T[i]) {\n        cnt++;\n        break;\n      } else if (S[mid] > T[i]) {\n        right = mid;\n      } else if (S[mid] < T[i]) {\n        left = mid + 1;\n      }\n    }\n  }\n\n  cout << cnt << \"\\n\";\n  delete[] T;\n  delete[] S;\n}","change":"replace","i1":30,"i2":31,"j1":30,"j2":31,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n#define rep(i, n) for (int i = 0; i < (int)n; i++)\n#define fori(i, k, n) for (int i = k; i < (int)n; i++)\nusing namespace std;\nconst int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};\nconst int dX[8] = {0, 1, 1, 1, 0, -1, -1, -1},\n          dY[8] = {1, 1, 0, -1, -1, -1, 0, 1};\nstruct XY {\n  int x;\n  int y;\n};\n\n\/*\n(char)'1' - (int)48 = (int)1;\n\n\n*\/\n\nint main() {\n  int n, q;\n  vector<int> s;\n  cin >> n;\n  int j;\n  rep(i, n) {\n    cin >> j;\n    s.push_back(j);\n  }\n  cin >> q;\n  int ans = 0;\n  rep(i, q) {\n    cin >> j;\n    int l = 0, r = n;\n    while (l != r) {\n      bool ri = true;\n      if (s[(l + r) \/ 2] > j) {\n        r = (l + r) \/ 2 - 1;\n      } else if (s[(l + r) \/ 2] < j) {\n        l = (l + r) \/ 2 + 1;\n      } else\n        break;\n    }\n    if (s[(l + r) \/ 2] == j)\n      ans++;\n  }\n  cout << ans << endl;\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n#define rep(i, n) for (int i = 0; i < (int)n; i++)\n#define fori(i, k, n) for (int i = k; i < (int)n; i++)\nusing namespace std;\nconst int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};\nconst int dX[8] = {0, 1, 1, 1, 0, -1, -1, -1},\n          dY[8] = {1, 1, 0, -1, -1, -1, 0, 1};\nstruct XY {\n  int x;\n  int y;\n};\n\n\/*\n(char)'1' - (int)48 = (int)1;\n\n\n*\/\n\nint main() {\n  int n, q;\n  vector<int> s;\n  cin >> n;\n  int j;\n  rep(i, n) {\n    cin >> j;\n    s.push_back(j);\n  }\n  cin >> q;\n  int ans = 0;\n  rep(i, q) {\n    cin >> j;\n    int l = 0, r = n;\n    if (binary_search(s.begin(), s.end(), j))\n      ans++;\n  }\n  cout << ans << endl;\n}","change":"replace","i1":43,"i2":53,"j1":43,"j2":44,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"\/\/\n\/\/  main.cpp\n\/\/  ALDS1_4_B\n\/\/\n\/\/  Created by ptyuan on 2018\/10\/23.\n\/\/  Copyright \u00a9 2018 YY. All rights reserved.\n\/\/\n\n#include <cstdio>\n#include <iostream>\nstatic const int kNotFound = -1;\n\nint binarySearch(int *array, int n, int key) {\n  int low = 0;\n  int hight = n - 1;\n\n  while (low <= hight) {\n    int middle = (low + hight) * 0.5;\n    int middleValue = array[middle];\n    if (middleValue == key) {\n      return middle;\n    } else if (key > middleValue) {\n      low = middle + 1;\n    } else {\n      hight = middle - 1;\n    }\n  }\n\n  return kNotFound;\n}\n\nint main(int argc, const char *argv[]) {\n  int n = 0;\n  int s[10001] = {0};\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; ++i) {\n    scanf(\"%d\", s + i);\n  }\n\n  int q = 0;\n  int sum = 0;\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    int temp = 0;\n    scanf(\"%d\", &temp);\n    if (kNotFound != binarySearch(s, n, temp)) {\n      sum++;\n    }\n  }\n  printf(\"%d\\n\", sum);\n  return 0;\n}\n","changed_src":"\/\/\n\/\/  main.cpp\n\/\/  ALDS1_4_B\n\/\/\n\/\/  Created by ptyuan on 2018\/10\/23.\n\/\/  Copyright \u00a9 2018 YY. All rights reserved.\n\/\/\n\n#include <cstdio>\n#include <iostream>\nstatic const int kNotFound = -1;\n\nint binarySearch(int *array, int n, int key) {\n  int low = 0;\n  int hight = n - 1;\n\n  while (low <= hight) {\n    int middle = (low + hight) * 0.5;\n    int middleValue = array[middle];\n    if (middleValue == key) {\n      return middle;\n    } else if (key > middleValue) {\n      low = middle + 1;\n    } else {\n      hight = middle - 1;\n    }\n  }\n\n  return kNotFound;\n}\n\nint main(int argc, const char *argv[]) {\n  int n = 0;\n  int s[100010] = {0};\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; ++i) {\n    scanf(\"%d\", s + i);\n  }\n\n  int q = 0;\n  int sum = 0;\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    int temp = 0;\n    scanf(\"%d\", &temp);\n    if (kNotFound != binarySearch(s, n, temp)) {\n      sum++;\n    }\n  }\n  printf(\"%d\\n\", sum);\n  return 0;\n}\n","change":"replace","i1":33,"i2":34,"j1":33,"j2":34,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n\nint main() {\n  int n, q;\n  std::cin >> n;\n  int *S = new int[n];\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &S[i]);\n  }\n  std::cin >> q;\n  int *T = new int[q];\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &T[i]);\n  }\n\n  int cnt = 0;\n  for (int i = 0; i < q; i++) {\n    int head = 0;\n    int tail = n - 1;\n    int j = (head + tail) \/ 2;\n    while (1) {\n      if (S[j] == T[i]) {\n        cnt++;\n        break;\n      } else if (head - tail == 1) {\n        break;\n      } else if (S[j] > T[i]) {\n        tail = j;\n        j = (head + tail) \/ 2;\n      } else if (S[j] < T[i]) {\n        head = j;\n        j = (head + tail) \/ 2;\n      }\n    }\n  }\n\n  printf(\"%d\\n\", cnt);\n  return 0;\n}\n","changed_src":"#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n\nint main() {\n  int n, q;\n  std::cin >> n;\n  int *S = new int[n];\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &S[i]);\n  }\n  std::cin >> q;\n  int *T = new int[q];\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &T[i]);\n  }\n\n  int cnt = 0;\n  for (int i = 0; i < q; i++) {\n    int head = 0;\n    int tail = n - 1;\n    int j = (head + tail) \/ 2;\n    while (1) {\n      if (S[j] == T[i]) {\n        cnt++;\n        break;\n      } else if (tail - head == 1) {\n        if (S[head] == T[i] || S[tail] == T[i]) {\n          cnt++;\n        }\n        break;\n      } else if (S[j] > T[i]) {\n        tail = j;\n        j = (head + tail) \/ 2;\n      } else if (S[j] < T[i]) {\n        head = j;\n        j = (head + tail) \/ 2;\n      }\n    }\n  }\n\n  printf(\"%d\\n\", cnt);\n  return 0;\n}\n","change":"replace","i1":26,"i2":27,"j1":26,"j2":30,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\n#define rep(i, n) for (int i = 0; i < n; i++)\nusing namespace std;\n\nint s[10000];\nint main() {\n  int n;\n  scanf(\"%d\", &n);\n  rep(i, n) scanf(\"%d\", &s[i]);\n  int q;\n  scanf(\"%d\", &q);\n  int cnt = 0;\n  rep(i, q) {\n    int t;\n    scanf(\"%d\", &t);\n    if (binary_search(s, s + n, t))\n      cnt++;\n  }\n  printf(\"%d\\n\", cnt);\n}","changed_src":"#include <bits\/stdc++.h>\n#define rep(i, n) for (int i = 0; i < n; i++)\nusing namespace std;\n\nint s[100000];\nint main() {\n  int n;\n  scanf(\"%d\", &n);\n  rep(i, n) scanf(\"%d\", &s[i]);\n  int q;\n  scanf(\"%d\", &q);\n  int cnt = 0;\n  rep(i, q) {\n    int t;\n    scanf(\"%d\", &t);\n    if (binary_search(s, s + n, t))\n      cnt++;\n  }\n  printf(\"%d\\n\", cnt);\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\nusing namespace std;\nint S[1000000], n;\nint serch(int key) {\n  int left = 0, right, mid;\n  right = n;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (key == S[mid])\n      return 1;\n    if (key > S[mid])\n      left = mid;\n    else if (key < S[mid])\n      right = mid;\n  }\n  return 0;\n}\nint main() {\n  int q, key;\n  int i, sum = 0;\n  scanf(\"%d\", &n);\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\", &S[i]);\n  }\n  scanf(\"%d\", &q);\n  for (i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (serch(key))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n  return 0;\n}","changed_src":"#include <cstdio>\nusing namespace std;\nint S[1000000], n;\nint serch(int key) {\n  int left = 0, right, mid;\n  right = n;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (key == S[mid])\n      return 1;\n    if (key > S[mid])\n      left = mid + 1;\n    else if (key < S[mid])\n      right = mid;\n  }\n  return 0;\n}\nint main() {\n  int q, key;\n  int i, sum = 0;\n  scanf(\"%d\", &n);\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\", &S[i]);\n  }\n  scanf(\"%d\", &q);\n  for (i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (serch(key))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n  return 0;\n}","change":"replace","i1":11,"i2":12,"j1":11,"j2":12,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\n#include <vector>\nusing namespace std;\n\nbool binary_search(int target, int low, int high, vector<int> &S) {\n  int mid = low + (high - low) \/ 2;\n  if (S.at(mid) == target) {\n    return true;\n  }\n  if (low == high)\n    return false;\n  if (S.at(mid) > target) {\n    return binary_search(target, low, mid - 1, S);\n  } else {\n    return binary_search(target, mid + 1, high, S);\n  }\n}\n\nint main() {\n  int n, q, a, c = 0, i, j;\n  vector<int> S;\n  scanf(\"%d\", &n);\n  S.resize(n);\n  for (i = 0; i < n; ++i) {\n    scanf(\"%d\", &S[i]);\n  }\n\n  scanf(\"%d\", &q);\n  for (j = 0; j < q; ++j) {\n    scanf(\"%d\", &a);\n    if (binary_search(a, 0, n - 1, S))\n      ++c;\n  }\n  printf(\"%d\\n\", c);\n  return 0;\n}","changed_src":"#include <cstdio>\n#include <vector>\nusing namespace std;\n\nbool binary_search(int target, int low, int high, vector<int> &S) {\n  int mid = low + (high - low) \/ 2;\n  if (S.at(mid) == target) {\n    return true;\n  }\n  if (low >= high)\n    return false;\n  if (S.at(mid) > target) {\n    return binary_search(target, low, mid - 1, S);\n  } else {\n    return binary_search(target, mid + 1, high, S);\n  }\n}\n\nint main() {\n  int n, q, a, c = 0, i, j;\n  vector<int> S;\n  scanf(\"%d\", &n);\n  S.resize(n);\n  for (i = 0; i < n; ++i) {\n    scanf(\"%d\", &S[i]);\n  }\n\n  scanf(\"%d\", &q);\n  for (j = 0; j < q; ++j) {\n    scanf(\"%d\", &a);\n    if (binary_search(a, 0, n - 1, S))\n      ++c;\n  }\n  printf(\"%d\\n\", c);\n  return 0;\n}","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int n, q, s[100001], t, ans = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> s[i];\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> t;\n    int l = 0, r = n, m;\n    while (l < r) {\n      m = (l + r) \/ 2;\n      if (t < s[m])\n        r = m;\n      else if (t > s[m])\n        l = m;\n      else {\n        ans++;\n        break;\n      }\n    }\n  }\n  cout << ans << endl;\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int n, q, s[100001], t, ans = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> s[i];\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> t;\n    int l = 0, r = n, m;\n    while (l < r) {\n      m = (l + r) \/ 2;\n      if (t < s[m])\n        r = m;\n      else if (t > s[m])\n        l = m + 1;\n      else {\n        ans++;\n        break;\n      }\n    }\n  }\n  cout << ans << endl;\n  return 0;\n}","change":"replace","i1":16,"i2":17,"j1":16,"j2":17,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int S[n];\n  for (int i = 0; i < n; i++) {\n    cin >> S[i];\n  }\n  int q;\n  cin >> q;\n  int T[q];\n  for (int i = 0; i < q; i++) {\n    cin >> T[i];\n  }\n\n  int cnt = 0;\n  for (int ti = 0; ti < q; ti++) {\n    int left = 0, right = n, mid;\n    while (left < right) {\n      mid = (left + right) \/ 2;\n      if (S[mid] == T[ti]) {\n        cnt++;\n        break;\n      } else if (T[ti] < S[mid])\n        right = mid;\n      else\n        left = mid - 1;\n    }\n  }\n  cout << cnt << endl;\n  return 0;\n}\n","changed_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int S[n];\n  for (int i = 0; i < n; i++) {\n    cin >> S[i];\n  }\n  int q;\n  cin >> q;\n  int T[q];\n  for (int i = 0; i < q; i++) {\n    cin >> T[i];\n  }\n\n  int cnt = 0;\n  for (int ti = 0; ti < q; ti++) {\n    int left = 0, right = n, mid;\n    while (left < right) {\n      mid = (left + right) \/ 2;\n      if (S[mid] == T[ti]) {\n        cnt++;\n        break;\n      } else if (T[ti] < S[mid])\n        right = mid;\n      else\n        left = mid + 1;\n    }\n  }\n  cout << cnt << endl;\n  return 0;\n}\n","change":"replace","i1":29,"i2":30,"j1":29,"j2":30,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <stdio.h>\nusing namespace std;\n\nint search(int A[], int n, int key) {\n  int i = 0;\n  A[n] = key;\n  while (A[i] != key)\n    i++;\n  return i != n;\n}\n\nint main() {\n  int n;\n  scanf(\"%d\", &n);\n  int S[n];\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &S[i]);\n  }\n  int q;\n  scanf(\"%d\", &q);\n  int T[q];\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &T[i]);\n  }\n  int cnt = 0;\n  for (int i = 0; i < q; i++) {\n    cnt += search(S, n, T[i]);\n  }\n\n  printf(\"%d\\n\", cnt);\n  return 0;\n}\n","changed_src":"#include <iostream>\n#include <stdio.h>\nusing namespace std;\n\nint search(int A[], int n, int key) {\n  int left = 0;\n  int right = n;\n  while (left < right) {\n    int mid = (left + right) \/ 2;\n    if (A[mid] == key) {\n      return 1;\n    } else if (key < A[mid]) {\n      right = mid;\n    } else {\n      left = mid + 1;\n    }\n  }\n  return 0;\n}\n\nint main() {\n  int n;\n  scanf(\"%d\", &n);\n  int S[n];\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &S[i]);\n  }\n  int q;\n  scanf(\"%d\", &q);\n  int T[q];\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &T[i]);\n  }\n  int cnt = 0;\n  for (int i = 0; i < q; i++) {\n    cnt += search(S, n, T[i]);\n  }\n\n  printf(\"%d\\n\", cnt);\n  return 0;\n}\n","change":"replace","i1":5,"i2":10,"j1":5,"j2":18,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nbool binarySearch(vector<int> vec, int target) {\n  int l = 0;\n  int r = vec.size();\n  while (l < r) {\n    int mid = (l + r) \/ 2;\n    if (vec[mid] == target) {\n      return (true);\n    } else if (vec[mid] < target) {\n      l = mid + 1;\n    } else {\n      r = mid;\n    }\n  }\n  return (false);\n}\n\nvoid solve() {\n  int n;\n  cin >> n;\n  vector<int> S(n);\n  for (int i = 0; i < n; ++i) {\n    cin >> S[i];\n  }\n  int q;\n  cin >> q;\n  vector<int> T(q);\n  for (int i = 0; i < q; ++i) {\n    cin >> T[i];\n  }\n  int ans = 0;\n  for (int i = 0; i < q; ++i) {\n    for (int j = 0; j < n; ++j) {\n      if (binarySearch(S, T[i])) {\n        ++ans;\n        break;\n      }\n    }\n  }\n  cout << ans << endl;\n}\n\nint main() {\n  solve();\n  return (0);\n}","changed_src":"#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nbool binarySearch(vector<int> vec, int target) {\n  int l = 0;\n  int r = vec.size();\n  while (l < r) {\n    int mid = (l + r) \/ 2;\n    if (vec[mid] == target) {\n      return (true);\n    } else if (vec[mid] < target) {\n      l = mid + 1;\n    } else {\n      r = mid;\n    }\n  }\n  return (false);\n}\n\nvoid solve() {\n  int n;\n  cin >> n;\n  vector<int> S(n);\n  for (int i = 0; i < n; ++i) {\n    cin >> S[i];\n  }\n  int q;\n  cin >> q;\n  vector<int> T(q);\n  for (int i = 0; i < q; ++i) {\n    cin >> T[i];\n  }\n  int ans = 0;\n  for (int i = 0; i < q; ++i) {\n    if (binarySearch(S, T[i])) {\n      ++ans;\n    }\n  }\n  cout << ans << endl;\n}\n\nint main() {\n  solve();\n  return (0);\n}","change":"replace","i1":36,"i2":41,"j1":36,"j2":38,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\n#define vi vector<int>\n#define vvi vector<vector<int>>\n#define vl vector<ll>\n#define vvl vector<vector<ll>>\n#define vb vector<bool>\n#define vc vector<char>\n#define vs vector<string>\nusing ll = long long;\nusing ld = long double;\n#define int ll\n#define INF 1e9\n#define EPS 0.0000000001\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define loop(i, s, n) for (int i = s; i < n; i++)\n#define all(in) in.begin(), in.end()\ntemplate <class T, class S> void cmin(T &a, const S &b) {\n  if (a > b)\n    a = b;\n}\ntemplate <class T, class S> void cmax(T &a, const S &b) {\n  if (a < b)\n    a = b;\n}\n#define MAX 9999999\nusing namespace std;\ntypedef pair<int, int> pii;\ntypedef pair<int, pii> piii;\n#define mp make_pair\nsigned main() {\n  int n;\n  cin >> n;\n  vi v(n);\n  rep(i, n) cin >> v[i];\n  int m;\n  cin >> m;\n  int ans = 0;\n  rep(i, m) {\n    int t;\n    cin >> t;\n    int imax = n;\n    int imin = 0;\n    int mid;\n    while (imax > imin) {\n      mid = (imax + imin) \/ 2;\n      if (v[mid] > t)\n        imax = mid;\n      else if (v[mid] < t)\n        imin += 1;\n      else {\n        ans++;\n        break;\n      }\n    }\n  }\n  cout << ans << endl;\n}","changed_src":"#include <bits\/stdc++.h>\n#define vi vector<int>\n#define vvi vector<vector<int>>\n#define vl vector<ll>\n#define vvl vector<vector<ll>>\n#define vb vector<bool>\n#define vc vector<char>\n#define vs vector<string>\nusing ll = long long;\nusing ld = long double;\n#define int ll\n#define INF 1e9\n#define EPS 0.0000000001\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define loop(i, s, n) for (int i = s; i < n; i++)\n#define all(in) in.begin(), in.end()\ntemplate <class T, class S> void cmin(T &a, const S &b) {\n  if (a > b)\n    a = b;\n}\ntemplate <class T, class S> void cmax(T &a, const S &b) {\n  if (a < b)\n    a = b;\n}\n#define MAX 9999999\nusing namespace std;\ntypedef pair<int, int> pii;\ntypedef pair<int, pii> piii;\n#define mp make_pair\nsigned main() {\n  int n;\n  cin >> n;\n  vi v(n);\n  rep(i, n) cin >> v[i];\n  int m;\n  cin >> m;\n  int ans = 0;\n  rep(i, m) {\n    int t;\n    cin >> t;\n    int imax = n;\n    int imin = 0;\n    int mid;\n    while (imax > imin) {\n      mid = (imax + imin) \/ 2;\n      if (v[mid] > t)\n        imax = mid;\n      else if (v[mid] < t)\n        imin = mid + 1;\n      else {\n        ans++;\n        break;\n      }\n    }\n  }\n  cout << ans << endl;\n}","change":"replace","i1":48,"i2":49,"j1":48,"j2":49,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint BsearchQ(int A[], int n, int key) {\n  int l = 0;\n  int r = n;\n  while (l < r) {\n    int mid = (l + r) \/ 2;\n    if (A[mid] == key) {\n      return 1;\n    } else if (A[mid] < key) {\n      l = mid + 1;\n    } else {\n      r = mid;\n    }\n  }\n  return 0;\n}\n\nint main() {\n  int n, A[10000 + 1], q, key, sum = 0;\n\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &A[i]);\n\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    sum += BsearchQ(A, n, key);\n  }\n  printf(\"%d\\n\", sum);\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint BsearchQ(int A[], int n, int key) {\n  int l = 0;\n  int r = n;\n  while (l < r) {\n    int mid = (l + r) \/ 2;\n    if (A[mid] == key) {\n      return 1;\n    } else if (A[mid] < key) {\n      l = mid + 1;\n    } else {\n      r = mid;\n    }\n  }\n  return 0;\n}\n\nint main() {\n  int n, A[100000 + 5], q, key, sum = 0;\n\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &A[i]);\n\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    sum += BsearchQ(A, n, key);\n  }\n  printf(\"%d\\n\", sum);\n  return 0;\n}","change":"replace","i1":19,"i2":20,"j1":19,"j2":20,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n\nint binarySearch(int ary[], int n, int key) {\n\n  int left = 0;\n  int right = n;\n  int mid = n \/ 2;\n\n  while (left < right) {\n\n    if (ary[mid] == key)\n      return 1;\n\n    else if (key < ary[mid])\n      right = mid;\n\n    else\n      left = mid + 1;\n\n    mid = (left + right) \/ 2;\n  }\n\n  return 0;\n}\n\nint main() {\n\n  int i, j, key, answer;\n  int num_of_ary, num_of_key;\n  int ary[10010];\n\n  answer = 0;\n\n  std::cin >> num_of_ary;\n  for (i = 0; i <= num_of_ary - 1; i++)\n    std::cin >> ary[i];\n\n  std::cin >> num_of_key;\n  for (i = 0; i <= num_of_key - 1; i++) {\n\n    std::cin >> key;\n    answer += binarySearch(ary, num_of_ary, key);\n  }\n\n  std::cout << answer << std::endl;\n  return 0;\n}\n","changed_src":"#include <iostream>\n\nint binarySearch(int ary[], int n, int key) {\n\n  int left = 0;\n  int right = n;\n  int mid = n \/ 2;\n\n  while (left < right) {\n\n    if (ary[mid] == key)\n      return 1;\n\n    else if (key < ary[mid])\n      right = mid;\n\n    else\n      left = mid + 1;\n\n    mid = (left + right) \/ 2;\n  }\n\n  return 0;\n}\n\nint main() {\n\n  int i, j, key, answer;\n  int num_of_ary, num_of_key;\n  int ary[100010];\n\n  answer = 0;\n\n  std::cin >> num_of_ary;\n  for (i = 0; i <= num_of_ary - 1; i++)\n    std::cin >> ary[i];\n\n  std::cin >> num_of_key;\n  for (i = 0; i <= num_of_key - 1; i++) {\n\n    std::cin >> key;\n    answer += binarySearch(ary, num_of_ary, key);\n  }\n\n  std::cout << answer << std::endl;\n  return 0;\n}\n","change":"replace","i1":29,"i2":30,"j1":29,"j2":30,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint Binarysearch(int *, int, int);\n#define N 10000\n\nint main() {\n  int i, s, array[N], t, m, sum = 0;\n\n  scanf(\"%d\", &s);\n  for (i = 0; i < s; i++) {\n    scanf(\"%d\", &array[i]);\n  }\n  scanf(\"%d\", &t);\n  for (i = 0; i < t; i++) {\n    scanf(\"%d\", &m);\n    if (Binarysearch(array, s, m))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n  return 0;\n}\n\nint Binarysearch(int A[], int x, int key) {\n  int left = 0, right, mid = 0;\n  right = x;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (key == A[mid])\n      return 1;\n    else if (key < A[mid])\n      right = mid;\n    else if (key > A[mid])\n      left = mid + 1;\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\nint Binarysearch(int *, int, int);\n#define N 100005\n\nint main() {\n  int i, s, array[N], t, m, sum = 0;\n\n  scanf(\"%d\", &s);\n  for (i = 0; i < s; i++) {\n    scanf(\"%d\", &array[i]);\n  }\n  scanf(\"%d\", &t);\n  for (i = 0; i < t; i++) {\n    scanf(\"%d\", &m);\n    if (Binarysearch(array, s, m))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n  return 0;\n}\n\nint Binarysearch(int A[], int x, int key) {\n  int left = 0, right, mid = 0;\n  right = x;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (key == A[mid])\n      return 1;\n    else if (key < A[mid])\n      right = mid;\n    else if (key > A[mid])\n      left = mid + 1;\n  }\n  return 0;\n}","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <cassert>\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <stack>\n#include <string.h>\n#include <vector>\n\n\/\/ TODO \u30c6\u30f3\u30d7\u30ec\u30fc\u30c8\u5316\u3057\u305f\u3044\n\/\/ std::vector<int>::iterator binarySearch(std::vector<int> sorted_array, int\n\/\/ value)\n\/\/ {\n\/\/     int left  = 0;\n\/\/     int right = sorted_array.size();\n\n\/\/     while (left < right - 1) {\n\/\/         int current = (left + right) \/ 2;\n\/\/         if(value == sorted_array.at(current)){\n\/\/             return sorted_array.begin() + current;\n\/\/         }else if(value < sorted_array.at(current)){\n\/\/             right = current;\n\/\/         }else{\n\/\/             left = current;\n\/\/         }\n\/\/     }\n\n\/\/     return sorted_array.end();\n\/\/ }\n\nint binarySearch(std::vector<int> sorted_array, int value) {\n  int left = 0;\n  int right = sorted_array.size();\n\n  while (left < right) {\n    int current = (left + right) \/ 2;\n    if (value == sorted_array.at(current)) {\n      return current;\n    } else if (value < sorted_array.at(current)) {\n      right = current;\n    } else {\n      left = current;\n      if (current + 1 == right)\n        break;\n    }\n  }\n\n  return sorted_array.size();\n}\n\nstd::vector<int> createVectorFronCin(int cnt) {\n  std::vector<int> ret;\n  ret.reserve(cnt);\n\n  int cur = 0;\n  for (int i = 0; i < cnt; ++i) {\n    std::cin >> cur;\n    ret.push_back(cur);\n  }\n\n  return ret;\n}\n\nint main() {\n  std::ifstream ifs(\"input\/alds1_04_b_01.txt\");\n  if (!ifs)\n    assert(false);\n  std::cin.rdbuf(ifs.rdbuf());\n\n  int n = 0;\n  int q = 0;\n\n  std::cin >> n;\n  std::vector<int> sorted_array = createVectorFronCin(n);\n\n  std::cin >> q;\n  std::vector<int> values = createVectorFronCin(q);\n\n  int counter = 0;\n  for (std::vector<int>::iterator it = values.begin(); it < values.end();\n       ++it) {\n    int pos = binarySearch(sorted_array, *it);\n    if (pos < sorted_array.size())\n      counter++;\n\n    \/\/ std::vector<int>::iterator pos = binarySearch(sorted_array, *it);\n    \/\/ if (pos != sorted_array.end())\n    \/\/     counter++;\n\n    \/\/ if (binarySearch(sorted_array, *it) != sorted_array.end())\n    \/\/     counter++;\n  }\n\n  std::cout << counter << std::endl;\n}\n","changed_src":"#include <cassert>\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <stack>\n#include <string.h>\n#include <vector>\n\n\/\/ TODO \u30c6\u30f3\u30d7\u30ec\u30fc\u30c8\u5316\u3057\u305f\u3044\n\/\/ std::vector<int>::iterator binarySearch(std::vector<int> sorted_array, int\n\/\/ value)\n\/\/ {\n\/\/     int left  = 0;\n\/\/     int right = sorted_array.size();\n\n\/\/     while (left < right - 1) {\n\/\/         int current = (left + right) \/ 2;\n\/\/         if(value == sorted_array.at(current)){\n\/\/             return sorted_array.begin() + current;\n\/\/         }else if(value < sorted_array.at(current)){\n\/\/             right = current;\n\/\/         }else{\n\/\/             left = current;\n\/\/         }\n\/\/     }\n\n\/\/     return sorted_array.end();\n\/\/ }\n\nint binarySearch(std::vector<int> sorted_array, int value) {\n  int left = 0;\n  int right = sorted_array.size();\n\n  while (left < right) {\n    int current = (left + right) \/ 2;\n    if (value == sorted_array.at(current)) {\n      return current;\n    } else if (value < sorted_array.at(current)) {\n      right = current;\n    } else {\n      left = current;\n      if (current + 1 == right)\n        break;\n    }\n  }\n\n  return sorted_array.size();\n}\n\nstd::vector<int> createVectorFronCin(int cnt) {\n  std::vector<int> ret;\n  ret.reserve(cnt);\n\n  int cur = 0;\n  for (int i = 0; i < cnt; ++i) {\n    std::cin >> cur;\n    ret.push_back(cur);\n  }\n\n  return ret;\n}\n\nint main() {\n  int n = 0;\n  int q = 0;\n\n  std::cin >> n;\n  std::vector<int> sorted_array = createVectorFronCin(n);\n\n  std::cin >> q;\n  std::vector<int> values = createVectorFronCin(q);\n\n  int counter = 0;\n  for (std::vector<int>::iterator it = values.begin(); it < values.end();\n       ++it) {\n    int pos = binarySearch(sorted_array, *it);\n    if (pos < sorted_array.size())\n      counter++;\n\n    \/\/ std::vector<int>::iterator pos = binarySearch(sorted_array, *it);\n    \/\/ if (pos != sorted_array.end())\n    \/\/     counter++;\n\n    \/\/ if (binarySearch(sorted_array, *it) != sorted_array.end())\n    \/\/     counter++;\n  }\n\n  std::cout << counter << std::endl;\n}\n","change":"delete","i1":63,"i2":68,"j1":63,"j2":63,"error":"-6","stderr":"1d68f5f0-3617-4774-9b6f-dda702dfac12.out: \/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02268\/C++\/s459023231.cpp:68: int main(): Assertion `false' failed.\n"}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n\n  int n;\n\n  cin >> n;\n\n  int a[101];\n\n  for (int i = 0; i < n; i++) {\n    cin >> a[i];\n  }\n\n  int t, cnt = 0;\n  cin >> t;\n\n  int q;\n\n  for (int i = 0; i < t; i++) {\n    cin >> q;\n\n    if (upper_bound(a, a + n, q) - lower_bound(a, a + n, q)) {\n      cnt++;\n    }\n  }\n\n  cout << cnt << endl;\n\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n\n  int n;\n\n  cin >> n;\n\n  int a[100001];\n\n  for (int i = 0; i < n; i++) {\n    cin >> a[i];\n  }\n\n  int t, cnt = 0;\n  cin >> t;\n\n  int q;\n\n  for (int i = 0; i < t; i++) {\n    cin >> q;\n\n    if (upper_bound(a, a + n, q) - lower_bound(a, a + n, q)) {\n      cnt++;\n    }\n  }\n\n  cout << cnt << endl;\n\n  return 0;\n}\n","change":"replace","i1":8,"i2":9,"j1":8,"j2":9,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nbool search(vector<int> &S, int s, int b, int e) {\n  int m = (e + b) \/ 2;\n  int _s = S[m];\n  if (s == _s)\n    return true;\n  if (b == e)\n    return false;\n  if (_s > s)\n    return search(S, s, b, m - 1);\n  if (_s < s)\n    return search(S, s, m + 1, e);\n}\n\nint main() {\n  int n;\n  cin >> n;\n  vector<int> S(n);\n  for (auto &s : S)\n    cin >> s;\n  int q;\n  cin >> q;\n  int C = 0;\n  while (q--) {\n    int t;\n    cin >> t;\n    if (search(S, t, 0, n - 1))\n      C++;\n  }\n  cout << C << endl;\n}","changed_src":"#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nbool search(vector<int> &S, int s, int b, int e) {\n  int m = (e + b) \/ 2;\n  if (m < b)\n    return false;\n  int _s = S[m];\n  if (s == _s)\n    return true;\n  if (b == e)\n    return false;\n  if (_s > s)\n    return search(S, s, b, m - 1);\n  if (_s < s)\n    return search(S, s, m + 1, e);\n}\n\nint main() {\n  int n;\n  cin >> n;\n  vector<int> S(n);\n  for (auto &s : S)\n    cin >> s;\n  int q;\n  cin >> q;\n  int C = 0;\n  while (q--) {\n    int t;\n    cin >> t;\n    if (search(S, t, 0, n - 1))\n      C++;\n  }\n  cout << C << endl;\n}","change":"insert","i1":7,"i2":7,"j1":7,"j2":9,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\n#define N 10000\nint S[N], T[N], count = 0, n, q, i, j, minj, temp, left, right, mid;\nint binarySearch(int);\nint main() {\n\n  scanf(\"%d\", &n);\n  i = 0;\n  while (i < n) {\n    scanf(\"%d\", &S[i]);\n    i++;\n  }\n\n  scanf(\"%d\", &q);\n  i = 0;\n  while (i < q) {\n    scanf(\"%d\", &T[i]);\n    if (binarySearch(T[i]) == 1) {\n      count++;\n    }\n    i++;\n  }\n  printf(\"%d\\n\", count);\n\n  return 0;\n}\n\nint binarySearch(int key) {\n  left = 0;\n  right = n;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (S[mid] == key) {\n      return 1;\n    } else if (key < S[mid]) {\n      right = mid;\n    } else {\n      left = mid + 1;\n    }\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\n\n#define N 100000\nint S[N], T[N], count = 0, n, q, i, j, minj, temp, left, right, mid;\nint binarySearch(int);\nint main() {\n\n  scanf(\"%d\", &n);\n  i = 0;\n  while (i < n) {\n    scanf(\"%d\", &S[i]);\n    i++;\n  }\n\n  scanf(\"%d\", &q);\n  i = 0;\n  while (i < q) {\n    scanf(\"%d\", &T[i]);\n    if (binarySearch(T[i]) == 1) {\n      count++;\n    }\n    i++;\n  }\n  printf(\"%d\\n\", count);\n\n  return 0;\n}\n\nint binarySearch(int key) {\n  left = 0;\n  right = n;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (S[mid] == key) {\n      return 1;\n    } else if (key < S[mid]) {\n      right = mid;\n    } else {\n      left = mid + 1;\n    }\n  }\n  return 0;\n}","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nvoid A() {\n  int S[10000];\n  int T[500];\n  int N;\n  int Q;\n  int C = 0;\n  cin >> N;\n  for (int i = 0; i < N; i++) {\n    cin >> S[i];\n  }\n\n  cin >> Q;\n  for (int i = 0; i < Q; i++) {\n    cin >> T[i];\n  }\n\n  for (int i = 0; i < Q; i++) {\n    for (int j = 0; j < N; j++) {\n      if (T[i] == S[j]) {\n        C++;\n        break;\n      }\n    }\n  }\n\n  cout << C << endl;\n}\n\nvoid B() {\n  int S[100001];\n  int T[50000];\n  int N;\n  int Q;\n  int C = 0;\n\n  cin >> N;\n  for (int i = 0; i < N; i++) {\n    cin >> S[i];\n  }\n\n  cin >> Q;\n  for (int i = 0; i < Q; i++) {\n    cin >> T[i];\n  }\n\n  for (int i = 0; i < N - 1; i++) {\n    for (int j = i + 1; j < N; j++) {\n      if (S[i] > S[j]) {\n        int tmp = S[i];\n        S[i] = S[j];\n        S[j] = tmp;\n      }\n    }\n  }\n\n  for (int i = 0; i < Q; i++) {\n    int left = 0;\n    int right = N;\n    while (left < right) {\n      int center = (left + right) \/ 2;\n\n      if (T[i] == S[center]) {\n        C++;\n        break;\n      }\n\n      if (T[i] > S[center]) {\n        left = center + 1;\n      } else {\n        right = center;\n      }\n    }\n  }\n\n  cout << C << endl;\n}\n\nint main() {\n  \/\/ A();\n  B();\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\nvoid A() {\n  int S[10000];\n  int T[500];\n  int N;\n  int Q;\n  int C = 0;\n  cin >> N;\n  for (int i = 0; i < N; i++) {\n    cin >> S[i];\n  }\n\n  cin >> Q;\n  for (int i = 0; i < Q; i++) {\n    cin >> T[i];\n  }\n\n  for (int i = 0; i < Q; i++) {\n    for (int j = 0; j < N; j++) {\n      if (T[i] == S[j]) {\n        C++;\n        break;\n      }\n    }\n  }\n\n  cout << C << endl;\n}\n\nvoid B() {\n  int S[100001];\n  int T[50000];\n  int N;\n  int Q;\n  int C = 0;\n\n  cin >> N;\n  for (int i = 0; i < N; i++) {\n    cin >> S[i];\n  }\n\n  cin >> Q;\n  for (int i = 0; i < Q; i++) {\n    cin >> T[i];\n  }\n\n  for (int i = 0; i < Q; i++) {\n    int left = 0;\n    int right = N;\n    while (left < right) {\n      int center = (left + right) \/ 2;\n\n      if (T[i] == S[center]) {\n        C++;\n        break;\n      }\n\n      if (T[i] > S[center]) {\n        left = center + 1;\n      } else {\n        right = center;\n      }\n    }\n  }\n\n  cout << C << endl;\n}\n\nint main() {\n  \/\/ A();\n  B();\n  return 0;\n}","change":"delete","i1":47,"i2":57,"j1":47,"j2":47,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint binarySearch(int A[], int n, int key) {\n  int mid, left = 0, right = n;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (A[mid] == key)\n      return 1;\n    else if (key < A[mid])\n      right = mid;\n    else\n      left = mid + 1;\n  }\n  return 0;\n}\n\nint main() {\n  int n, s[10100], q, key, count = 0;\n  int i, j, k;\n\n  cin >> n;\n\n  for (i = 0; i < n; i++)\n    scanf(\"%d\", &s[i]);\n\n  cin >> q;\n\n  for (i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (binarySearch(s, n, key))\n      count++;\n  }\n\n  cout << count << endl;\n\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint binarySearch(int A[], int n, int key) {\n  int mid, left = 0, right = n;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (A[mid] == key)\n      return 1;\n    else if (key < A[mid])\n      right = mid;\n    else\n      left = mid + 1;\n  }\n  return 0;\n}\n\nint main() {\n  int n, s[100100], q, key, count = 0;\n  int i, j, k;\n\n  cin >> n;\n\n  for (i = 0; i < n; i++)\n    scanf(\"%d\", &s[i]);\n\n  cin >> q;\n\n  for (i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (binarySearch(s, n, key))\n      count++;\n  }\n\n  cout << count << endl;\n\n  return 0;\n}\n","change":"replace","i1":18,"i2":19,"j1":18,"j2":19,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n\nusing namespace std;\n\nbool myBinarySearch(int S[], int begin, int end, int target) {\n  if (begin > end) {\n    return false;\n  }\n  int mid = (begin + end) \/ 2;\n  if (S[mid] > target) {\n    return myBinarySearch(S, begin, mid - 1, target);\n  } else if (S[mid] < target) {\n    return myBinarySearch(S, mid + 1, end, target);\n  } else {\n    return true;\n  }\n}\n\nint main(void) {\n  int S[10000];\n  int T[500];\n  int n, m;\n\n  cin >> m;\n  for (int i = 0; i < m; i++) {\n    cin >> S[i];\n  }\n  sort(S, S + m);\n\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> T[i];\n  }\n  sort(T, T + n);\n\n  int ans = 0;\n  for (int i = 0; i < n; i++) {\n    if (myBinarySearch(S, 0, m, T[i])) {\n      ans++;\n    }\n  }\n  cout << ans << endl;\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n\nusing namespace std;\n\nbool myBinarySearch(int S[], int begin, int end, int target) {\n  if (begin > end) {\n    return false;\n  }\n  int mid = (begin + end) \/ 2;\n  if (S[mid] > target) {\n    return myBinarySearch(S, begin, mid - 1, target);\n  } else if (S[mid] < target) {\n    return myBinarySearch(S, mid + 1, end, target);\n  } else {\n    return true;\n  }\n}\n\nint main(void) {\n  int S[100000];\n  int T[50000];\n  int n, m;\n\n  cin >> m;\n  for (int i = 0; i < m; i++) {\n    cin >> S[i];\n  }\n  sort(S, S + m);\n\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> T[i];\n  }\n  sort(T, T + n);\n\n  int ans = 0;\n  for (int i = 0; i < n; i++) {\n    if (myBinarySearch(S, 0, m, T[i])) {\n      ans++;\n    }\n  }\n  cout << ans << endl;\n\n  return 0;\n}","change":"replace","i1":20,"i2":22,"j1":20,"j2":22,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <bitset>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <set>\n#include <string>\n#include <vector>\n#define REP(i, n) for (int i = 0; i < (n); i++)\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)\n#define RFOR(i, a, b) for (int i = (a)-1; i >= (b); i--)\n#define ll long long\n#define ull unsigned long long\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\nconst int INF = 1e9;\nconst int MOD = 1e9 + 7;\n\nusing namespace std;\n\nint main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n  int s[10003], t[5003];\n  int n, q;\n  cin >> n;\n  REP(i, n) cin >> s[i];\n  cin >> q;\n  REP(i, q) cin >> t[i];\n  int ct = 0;\n  REP(i, q) {\n    int l = 0;\n    int r = n;\n    while (abs(r - l) > 1) {\n      int mid = (r + l) \/ 2;\n      if (t[i] < s[mid])\n        r = mid;\n      else\n        l = mid;\n    }\n    if (s[(r + l) \/ 2] == t[i])\n      ct++;\n  }\n  cout << ct << endl;\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <bitset>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <set>\n#include <string>\n#include <vector>\n#define REP(i, n) for (int i = 0; i < (n); i++)\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)\n#define RFOR(i, a, b) for (int i = (a)-1; i >= (b); i--)\n#define ll long long\n#define ull unsigned long long\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\nconst int INF = 1e9;\nconst int MOD = 1e9 + 7;\n\nusing namespace std;\n\nint main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n  int s[100003], t[50003];\n  int n, q;\n  cin >> n;\n  REP(i, n) cin >> s[i];\n  cin >> q;\n  REP(i, q) cin >> t[i];\n  int ct = 0;\n  REP(i, q) {\n    int l = 0;\n    int r = n;\n    while (abs(r - l) > 1) {\n      int mid = (r + l) \/ 2;\n      if (t[i] < s[mid])\n        r = mid;\n      else\n        l = mid;\n    }\n    if (s[(r + l) \/ 2] == t[i])\n      ct++;\n  }\n  cout << ct << endl;\n  return 0;\n}","change":"replace","i1":29,"i2":30,"j1":29,"j2":30,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\n\nint binarySearch(int n, int s[], int t) {\n  int i = 0;\n  int j = n - 1;\n  while (i <= j) {\n    int mid = i + (j - i) \/ 2;\n    int guess = s[mid];\n    if (guess == t) {\n      return 1;\n    }\n    if (guess < t) {\n      i = mid + 1;\n    } else {\n      j = mid - 1;\n    }\n  }\n  return 0;\n}\n\nint main() {\n  int n, q, s[10001], t, ans = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> s[i];\n  }\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> t;\n    ans += binarySearch(n, s, t);\n  }\n  cout << ans << endl;\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\n\nint binarySearch(int n, int s[], int t) {\n  int i = 0;\n  int j = n - 1;\n  while (i <= j) {\n    int mid = i + (j - i) \/ 2;\n    int guess = s[mid];\n    if (guess == t) {\n      return 1;\n    }\n    if (guess < t) {\n      i = mid + 1;\n    } else {\n      j = mid - 1;\n    }\n  }\n  return 0;\n}\n\nint main() {\n  int n, q, s[100000], t, ans = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> s[i];\n  }\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> t;\n    ans += binarySearch(n, s, t);\n  }\n  cout << ans << endl;\n  return 0;\n}\n","change":"replace","i1":22,"i2":23,"j1":22,"j2":23,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iomanip>\n#include <iostream>\n#include <queue>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n\ntypedef pair<int, int> lake;\n\nint main(void) {\n  int n, q;\n  cin >> n;\n  vector<int> s(n);\n  for (int i = 0; i < n; i++)\n    cin >> s[i];\n  cin >> q;\n  vector<int> t(q);\n  for (int i = 0; i < q; i++)\n    cin >> t[i];\n  \/\/ sort(s.begin(), s.end());\n  \/\/ sort(t.begin(), t.end());\n  int count = 0;\n  for (int i = 0; i < q; i++) {\n    int left = 0;\n    int right = n;\n    while (left < right) {\n      int mid = (left + right) \/ 2;\n      if (s[mid] == t[i]) {\n        count++;\n        break;\n      } else if (s[mid] < t[i]) {\n        left = mid;\n      } else {\n        right = mid;\n      }\n    }\n  }\n  cout << count << endl;\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iomanip>\n#include <iostream>\n#include <queue>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n\ntypedef pair<int, int> lake;\n\nint main(void) {\n  int n, q;\n  cin >> n;\n  vector<int> s(n);\n  for (int i = 0; i < n; i++)\n    cin >> s[i];\n  cin >> q;\n  vector<int> t(q);\n  for (int i = 0; i < q; i++)\n    cin >> t[i];\n  \/\/ sort(s.begin(), s.end());\n  \/\/ sort(t.begin(), t.end());\n  int count = 0;\n  for (int i = 0; i < q; i++) {\n    int left = 0;\n    int right = n;\n    while (left < right) {\n      int mid = (left + right) \/ 2;\n      if (s[mid] == t[i]) {\n        count++;\n        break;\n      } else if (s[mid] < t[i]) {\n        left = mid + 1;\n      } else {\n        right = mid;\n      }\n    }\n  }\n  cout << count << endl;\n  return 0;\n}","change":"replace","i1":36,"i2":37,"j1":36,"j2":37,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int n, q;\n\n  cin >> n;\n  int S[n];\n  for (int k = 0; k < n; k++) {\n    cin >> S[k];\n  }\n  cin >> q;\n  int T[q];\n  for (int l = 0; l < q; l++) {\n    cin >> T[l];\n  }\n\n  int count = 0;\n  for (int j = 0; j < q; j++) {\n    int left = 0;\n    int right = n;\n    while (left < right) {\n      int mid = (left + right) \/ 2;\n      if (S[mid] == T[j]) {\n        count += 1;\n      } else if (T[j] < S[mid]) {\n        right = mid;\n      } else {\n        left = mid + 1;\n      }\n    }\n  }\n\n  cout << count << endl;\n\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int n, q;\n\n  cin >> n;\n  int S[n];\n  for (int k = 0; k < n; k++) {\n    cin >> S[k];\n  }\n  cin >> q;\n  int T[q];\n  for (int l = 0; l < q; l++) {\n    cin >> T[l];\n  }\n\n  int count = 0;\n  for (int j = 0; j < q; j++) {\n    int left = 0;\n    int right = n;\n    while (left < right) {\n      int mid = (left + right) \/ 2;\n      if (S[mid] == T[j]) {\n        count += 1;\n        break;\n      } else if (T[j] < S[mid]) {\n        right = mid;\n      } else {\n        left = mid + 1;\n      }\n    }\n  }\n\n  cout << count << endl;\n\n  return 0;\n}","change":"insert","i1":25,"i2":25,"j1":25,"j2":26,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define EACH(i, c)                                                             \\\n  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).end())\n#define SORT(c) sort((c).begin(), (c).end())\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x)                                                               \\\n  cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\"                       \\\n       << \" \" << __FILE__ << endl;\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n\nusing namespace std;\n\nbool binary_search(vector<int> v, int kay, bool is_sorted) {\n  if (is_sorted)\n    sort(ALL(v));\n\n  int left = 0;\n  int right = SZ(v);\n  int mid;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (v[mid] == kay)\n      return true;\n    else if (kay < v[mid])\n      right = mid;\n    else\n      left = mid + 1;\n  }\n  return false;\n}\n\nsigned main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n\n  int n;\n  cin >> n;\n\n  vector<int> v;\n  int t;\n  REP(_, n) {\n    cin >> t;\n    v.PB(t);\n  }\n\n  cin >> n;\n  int count = 0;\n  REP(_, n) {\n    cin >> t;\n    if (binary_search(v, t, true))\n      count++;\n  }\n\n  cout << count << endl;\n}\n","changed_src":"#include <bits\/stdc++.h>\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define EACH(i, c)                                                             \\\n  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).end())\n#define SORT(c) sort((c).begin(), (c).end())\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x)                                                               \\\n  cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\"                       \\\n       << \" \" << __FILE__ << endl;\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n\nusing namespace std;\n\nbool binary_search(vector<int> v, int kay, bool is_sorted) {\n  if (!is_sorted)\n    sort(ALL(v));\n\n  int left = 0;\n  int right = SZ(v);\n  int mid;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (v[mid] == kay)\n      return true;\n    else if (kay < v[mid])\n      right = mid;\n    else\n      left = mid + 1;\n  }\n  return false;\n}\n\nsigned main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n\n  int n;\n  cin >> n;\n\n  vector<int> v;\n  int t;\n  REP(_, n) {\n    cin >> t;\n    v.PB(t);\n  }\n\n  cin >> n;\n  int count = 0;\n  REP(_, n) {\n    cin >> t;\n    if (binary_search(v, t, true))\n      count++;\n  }\n\n  cout << count << endl;\n}\n","change":"replace","i1":20,"i2":21,"j1":20,"j2":21,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  int n, q, S[10000], T, res = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> S[i];\n  }\n  sort(S, S + n);\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> T;\n    if (binary_search(S, S + n, T))\n      res++;\n  }\n  cout << res << endl;\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  int n, q, S[100000], T, res = 0;\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> S[i];\n  }\n  sort(S, S + n);\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> T;\n    if (binary_search(S, S + n, T))\n      res++;\n  }\n  cout << res << endl;\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\nusing namespace std;\n\nint A[100000];\n\nint search(int key, int n) {\n  int left = 0;\n  int right = n;\n  int mid;\n  while (left < right) { \/\/??????????????\u00a3?????????notfound\n    mid = (left + right) \/ 2;\n    if (A[mid] == key)\n      return 1;\n    else if (key < A[mid]) { \/\/ motto left\n      right = mid;\n    } else {\n      left = mid;\n    }\n  }\n  return 0;\n}\n\nint main() {\n  int n, q, key;\n  int cnt = 0;\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &A[i]);\n  }\n\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (search(key, n))\n      cnt++;\n  }\n  printf(\"%d\\n\", cnt);\n  return 0;\n}","changed_src":"#include <cstdio>\nusing namespace std;\n\nint A[100000];\n\nint search(int key, int n) {\n  int left = 0;\n  int right = n;\n  int mid;\n  while (left < right) { \/\/??????????????\u00a3?????????notfound\n    mid = (left + right) \/ 2;\n    if (A[mid] == key)\n      return 1;\n    else if (key < A[mid]) { \/\/ motto left\n      right = mid;\n    } else {\n      left = mid + 1; \/\/?????\u00b6???????????????????\n    }\n  }\n  return 0;\n}\n\nint main() {\n  int n, q, key;\n  int cnt = 0;\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &A[i]);\n  }\n\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (search(key, n))\n      cnt++;\n  }\n  printf(\"%d\\n\", cnt);\n  return 0;\n}","change":"replace","i1":16,"i2":17,"j1":16,"j2":17,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\n\nbool binarySearch(int a[], int n, int x) {\n  int mid;\n  int left = 0;\n  int right = n;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (a[mid] == x)\n      return true;\n    else if (x < a[mid])\n      right = mid;\n    else\n      left = mid + 1;\n  }\n  return false;\n}\n\nint main(void) {\n  int n, q, sum = 0;\n  int S[10001], T[10001];\n\n  \/* input *\/\n\n  std::cin >> n;\n  for (int i = 0; i < n; i++) {\n    std::cin >> S[i];\n  }\n\n  std::cin >> q;\n  for (int i = 0; i < q; i++) {\n    std::cin >> T[i];\n  }\n\n  for (int i = 0; i < q; i++) {\n    if (binarySearch(S, n, T[i])) {\n      sum++;\n    }\n  }\n\n  cout << sum << \"\\n\";\n\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\n\nbool binarySearch(int a[], int n, int x) {\n  int mid;\n  int left = 0;\n  int right = n;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (a[mid] == x)\n      return true;\n    else if (x < a[mid])\n      right = mid;\n    else\n      left = mid + 1;\n  }\n  return false;\n}\n\nint main(void) {\n  int n, q, sum = 0;\n  int S[100001], T[50001];\n\n  \/* input *\/\n\n  std::cin >> n;\n  for (int i = 0; i < n; i++) {\n    std::cin >> S[i];\n  }\n\n  std::cin >> q;\n  for (int i = 0; i < q; i++) {\n    std::cin >> T[i];\n  }\n\n  for (int i = 0; i < q; i++) {\n    if (binarySearch(S, n, T[i])) {\n      sum++;\n    }\n  }\n\n  cout << sum << \"\\n\";\n\n  return 0;\n}\n","change":"replace","i1":21,"i2":22,"j1":21,"j2":22,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <map>\n#include <set>\n#include <vector>\n\nint main(void) {\n  int ans = 0;\n  int n, q;\n  std::cin >> n;\n  std::vector<int> arr(n);\n  for (auto &a : arr)\n    std::cin >> a;\n  std::cin >> q;\n  for (size_t i = 0; i < q; i++) {\n    int in = 0;\n    std::cin >> in;\n    int left = 0, mid = n \/ 2, right = n;\n    while (left != right) {\n      if (arr[mid] == in) {\n        ans++;\n        break;\n      }\n      if (in < arr[mid])\n        right = mid;\n      else\n        left = mid;\n\n      mid = (right + left) \/ 2;\n    }\n  }\n\n  std::cout << ans << std::endl;\n  return 0;\n}","changed_src":"#include <iostream>\n#include <map>\n#include <set>\n#include <vector>\n\nint main(void) {\n  int ans = 0;\n  int n, q;\n  std::cin >> n;\n  std::vector<int> arr(n);\n  for (auto &a : arr)\n    std::cin >> a;\n  std::cin >> q;\n  for (size_t i = 0; i < q; i++) {\n    int in = 0;\n    std::cin >> in;\n    int left = 0, mid = n \/ 2, right = n;\n    while (left != right) {\n      if (arr[mid] == in) {\n        ans++;\n        break;\n      }\n      if (in < arr[mid])\n        right = mid;\n      else\n        left = mid + 1;\n\n      mid = (right + left) \/ 2;\n    }\n  }\n\n  std::cout << ans << std::endl;\n  return 0;\n}","change":"replace","i1":25,"i2":26,"j1":25,"j2":26,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\n\nint A[1000000], n;\n\nint binarySearch(int key) {\n  int left = 0;\n  int right = n;\n  int mid;\n\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (key == A[mid])\n      return 1;\n    if (key > A[mid])\n      left = mid + 1;\n    else if (key < A[mid])\n      right = mid;\n  }\n  return 0;\n}\n\nint main(void) {\n  int i, q, k, sum = 0;\n\n  scanf(\"%d\", &n);\n  for (i = 0; k < n; i++) {\n    scanf(\"%d\", &A[i]);\n  }\n\n  scanf(\"%d\", &q);\n  for (i = 0; i < q; i++) {\n    scanf(\"%d\", &k);\n    if (binarySearch(k))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint A[1000000], n;\n\nint binarySearch(int key) {\n  int left = 0;\n  int right = n;\n  int mid;\n\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (key == A[mid])\n      return 1;\n    if (key > A[mid])\n      left = mid + 1;\n    else if (key < A[mid])\n      right = mid;\n  }\n  return 0;\n}\n\nint main(void) {\n  int i, q, k, sum = 0;\n\n  scanf(\"%d\", &n);\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\", &A[i]);\n  }\n\n  scanf(\"%d\", &q);\n  for (i = 0; i < q; i++) {\n    scanf(\"%d\", &k);\n    if (binarySearch(k))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n  return 0;\n}","change":"replace","i1":25,"i2":26,"j1":25,"j2":26,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\nstruct cww {\n  cww() {\n    ios::sync_with_stdio(false);\n    cin.tie(0);\n  }\n} star;\n#define P(x) cout << (x) << endl\n#define p(x) cout << (x)\n#define all(c) (c).begin(), (c).end()\n#define rall(c) (c).rbegin(), (c).rend()\n#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i));\n#define rep(i, a, n) for (int i = (a), i##_len = (n); i < i##_len; ++i)\n#define rrep(i, a, n) for (int i = (a); i > n; --i)\n#define len(x) ((int)(x).size())\n#define mp make_pair\n#define eb emplace_back\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<double> vd;\ntypedef vector<long long> vll;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ninline int f(int n, vi s, int q, vi t) {\n  int cnt = 0;\n  rep(j, 0, q) {\n    if (count(all(s), t[j]))\n      ++cnt;\n  }\n  return cnt;\n}\nint main() {\n  int n;\n  cin >> n;\n  unordered_set<int> ss;\n  {\n    ll t;\n    rep(i, 0, n) {\n      cin >> t;\n      ss.emplace(t);\n    }\n  }\n  vi s(all(ss));\n  int q;\n  cin >> q;\n  vi t(q);\n  rep(i, 0, q) cin >> t[i];\n  P(f(len(s), s, q, t));\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\nstruct cww {\n  cww() {\n    ios::sync_with_stdio(false);\n    cin.tie(0);\n  }\n} star;\n#define P(x) cout << (x) << endl\n#define p(x) cout << (x)\n#define all(c) (c).begin(), (c).end()\n#define rall(c) (c).rbegin(), (c).rend()\n#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i));\n#define rep(i, a, n) for (int i = (a), i##_len = (n); i < i##_len; ++i)\n#define rrep(i, a, n) for (int i = (a); i > n; --i)\n#define len(x) ((int)(x).size())\n#define mp make_pair\n#define eb emplace_back\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<double> vd;\ntypedef vector<long long> vll;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ninline int f(int n, vi s, int q, vi t) {\n  int cnt = 0;\n  rep(j, 0, q) {\n    if (find(all(s), t[j]) != s.end())\n      ++cnt;\n  }\n  return cnt;\n}\nint main() {\n  int n;\n  cin >> n;\n  unordered_set<int> ss;\n  {\n    ll t;\n    rep(i, 0, n) {\n      cin >> t;\n      ss.emplace(t);\n    }\n  }\n  vi s(all(ss));\n  int q;\n  cin >> q;\n  vi t(q);\n  rep(i, 0, q) cin >> t[i];\n  P(f(len(s), s, q, t));\n  return 0;\n}","change":"replace","i1":27,"i2":28,"j1":27,"j2":28,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int S[100000], T[100000], n, q, key, low = 0, upper = 0, mid, flag;\n  int i = 0, cnt = 0;\n\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> S[i];\n  }\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> T[i];\n  }\n\n  for (i = 0; i < q; i++) {\n    \/\/\/------------------------------\n    key = T[i];\n    low = 0;\n    upper = 0;\n    mid = 0;\n    upper = n; \/\/ n-1\n\n    mid = (low + upper) \/ 2;\n    while (low <= upper) {\n      \/\/ mid=(low+upper)\/2;\n\n      if (S[mid] == key) {\n\n        flag = 1;\n        cnt++;\n        break;\n      }\n\n      if (S[mid] < key) {\n        low = mid + 1;\n      } else {\n        upper = mid; \/\/ mid-1\n      }\n      mid = (low + upper) \/ 2; \/\/\n    }\n    if (flag != 1) {\n      \/\/ no\n    }\n\n    \/\/\/------------------------------\n  }\n\n  cout << cnt << endl;\n\n  return 0;\n}\n","changed_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int S[100000], T[100000], n, q, key, low = 0, upper = 0, mid, flag;\n  int i = 0, cnt = 0;\n\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> S[i];\n  }\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> T[i];\n  }\n\n  for (i = 0; i < q; i++) {\n    \/\/\/------------------------------\n    key = T[i];\n    low = 0;\n    upper = 0;\n    mid = 0;\n    upper = n; \/\/ n-1\n\n    mid = (low + upper) \/ 2;\n    while (low < upper) {\n      \/\/ mid=(low+upper)\/2;\n\n      if (S[mid] == key) {\n\n        flag = 1;\n        cnt++;\n        break;\n      }\n\n      if (S[mid] < key) {\n        low = mid + 1;\n      } else {\n        upper = mid; \/\/ mid-1\n      }\n      mid = (low + upper) \/ 2; \/\/\n    }\n    if (flag != 1) {\n      \/\/ no\n    }\n\n    \/\/\/------------------------------\n  }\n\n  cout << cnt << endl;\n\n  return 0;\n}\n","change":"replace","i1":26,"i2":27,"j1":26,"j2":27,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nint binarySearch(int s[], int n, int key) {\n\n  int head = 0;\n  int tail = n - 1;\n\n  int center;\n\n  while (head != tail) {\n    center = (head + tail) \/ 2;\n    if (s[center] == key) {\n      return center;\n    } else if (s[center] < key) {\n      head = center + 1;\n    } else {\n      tail = center - 1;\n    }\n  }\n\n  if (s[head] == key) {\n    return head;\n  }\n\n  return -1;\n}\n\nint main() {\n\n  int n, q;\n  int cnt = 0;\n\n  std::cin >> n;\n\n  int s[n];\n\n  for (int i = 0; i < n; i++) {\n    std::cin >> s[i];\n  }\n\n  std::cin >> q;\n\n  int key;\n\n  for (int i = 0; i < q; i++) {\n    std::cin >> key;\n\n    if (binarySearch(s, n, key) >= 0) {\n      cnt++;\n    }\n  }\n\n  std::cout << cnt << \"\\n\";\n}\n","changed_src":"#include <iostream>\n\nint binarySearch(int s[], int n, int key) {\n\n  int head = 0;\n  int tail = n - 1;\n\n  int center;\n\n  while (head != tail) {\n    center = (head + tail) \/ 2;\n    if (s[center] == key) {\n      return center;\n    } else if (s[center] < key) {\n      head = center + 1;\n    } else {\n      tail = center;\n    }\n  }\n\n  if (s[head] == key) {\n    return head;\n  }\n\n  return -1;\n}\n\nint main() {\n\n  int n, q;\n  int cnt = 0;\n\n  std::cin >> n;\n\n  int s[n];\n\n  for (int i = 0; i < n; i++) {\n    std::cin >> s[i];\n  }\n\n  std::cin >> q;\n\n  int key;\n\n  for (int i = 0; i < q; i++) {\n    std::cin >> key;\n\n    if (binarySearch(s, n, key) >= 0) {\n      cnt++;\n    }\n  }\n\n  std::cout << cnt << \"\\n\";\n}\n","change":"replace","i1":16,"i2":17,"j1":16,"j2":17,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#define MAXN 200000 + 10\nusing namespace std;\nint s[MAXN];\nint t[MAXN];\nint ns, nt;\nint tot, l, r, mid;\nint main() {\n  int i, now;\n  cin >> ns;\n  for (i = 0; i < ns; ++i)\n    cin >> s[i];\n  cin >> nt;\n  for (i = 0; i < nt; ++i)\n    cin >> t[i];\n\n  for (i = 0; i < nt; ++i) {\n    now = t[i];\n    l = 0;\n    r = ns;\n    while (l < r) {\n      mid = l + (r - l) \/ 2;\n      if (s[mid] == now) {\n        tot++;\n        break;\n      }\n      if (s[mid] < now)\n        l = mid;\n      else\n        r = mid;\n    }\n  }\n  cout << tot << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n#define MAXN 200000 + 10\nusing namespace std;\nint s[MAXN];\nint t[MAXN];\nint ns, nt;\nint tot, l, r, mid;\nint main() {\n  int i, now;\n  cin >> ns;\n  for (i = 0; i < ns; ++i)\n    cin >> s[i];\n  cin >> nt;\n  for (i = 0; i < nt; ++i)\n    cin >> t[i];\n\n  for (i = 0; i < nt; ++i) {\n    now = t[i];\n    l = 0;\n    r = ns;\n    while (l < r) {\n      mid = l + (r - l) \/ 2;\n      if (s[mid] == now) {\n        tot++;\n        break;\n      }\n      if (s[mid] < now)\n        l = mid + 1;\n      else\n        r = mid;\n    }\n  }\n  cout << tot << endl;\n  return 0;\n}","change":"replace","i1":27,"i2":28,"j1":27,"j2":28,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\n#define MAXN 100000\n#define MAXQ 50000\n\nusing namespace std;\n\nint n, q;\nint S[MAXN + 1], T[MAXQ + 1];\nint cnt = 0;\n\nbool binarySearch(int num) {\n  int lo, mi, hi;\n  bool res = false;\n  lo = 0;\n  mi = hi = n;\n  while (1 < mi) {\n    mi = (lo + hi) \/ 2;\n    if (num < S[mi]) {\n      hi = mi - 1;\n    } else if (S[mi] < num) {\n      lo = mi + 1;\n    } else {\n      res = true;\n      break;\n    }\n  }\n\n  return res;\n}\n\nint main() {\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> S[i];\n  }\n\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> T[i];\n    cnt += binarySearch(T[i]);\n  }\n  cout << cnt << endl;\n\n  return 0;\n}","changed_src":"#include <iostream>\n\n#define MAXN 100000\n#define MAXQ 50000\n\nusing namespace std;\n\nint n, q;\nint S[MAXN + 1], T[MAXQ + 1];\nint cnt = 0;\n\nbool binarySearch(int num) {\n  int lo, mi, hi;\n  bool res = false;\n  lo = 0;\n  mi = hi = n;\n  while (lo <= hi) {\n    mi = (lo + hi) \/ 2;\n    if (num < S[mi]) {\n      hi = mi - 1;\n    } else if (S[mi] < num) {\n      lo = mi + 1;\n    } else {\n      res = true;\n      break;\n    }\n  }\n\n  return res;\n}\n\nint main() {\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> S[i];\n  }\n\n  cin >> q;\n  for (int i = 0; i < q; i++) {\n    cin >> T[i];\n    cnt += binarySearch(T[i]);\n  }\n  cout << cnt << endl;\n\n  return 0;\n}","change":"replace","i1":16,"i2":17,"j1":16,"j2":17,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cctype>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <deque>\n#include <iostream>\n#include <list>\n#include <queue>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\nconst int maxn = 1e5 + 8;\nint n, q, x, num;\nint s[maxn];\n\nbool is_find(int x) {\n  int left, right, mid;\n  left = 0;\n  right = n;\n  while (left <= right) {\n    mid = (left + right) \/ 2;\n    if (s[mid] == x)\n      return true;\n    else if (s[mid] > x) {\n      right = mid;\n    } else if (s[mid] < x) {\n      left = mid + 1;\n    }\n  }\n  return false;\n}\nint main() {\n  scanf(\"%d\", &n);\n  num = 0;\n  for (int i = 0; i < n; ++i)\n    scanf(\"%d\", &s[i]);\n  sort(s, s + n);\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; ++i) {\n    scanf(\"%d\", &x);\n    if (is_find(x))\n      num++;\n  }\n  printf(\"%d\\n\", num);\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cctype>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <deque>\n#include <iostream>\n#include <list>\n#include <queue>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\nconst int maxn = 1e5 + 8;\nint n, q, x, num;\nint s[maxn];\n\nbool is_find(int x) {\n  int left, right, mid;\n  left = 0;\n  right = n;\n  while (left < right) {\n    mid = (left + right) \/ 2;\n    if (s[mid] == x)\n      return true;\n    else if (s[mid] > x) {\n      right = mid;\n    } else if (s[mid] < x) {\n      left = mid + 1;\n    }\n  }\n  return false;\n}\nint main() {\n  scanf(\"%d\", &n);\n  num = 0;\n  for (int i = 0; i < n; ++i)\n    scanf(\"%d\", &s[i]);\n  sort(s, s + n);\n  scanf(\"%d\", &q);\n  for (int i = 0; i < q; ++i) {\n    scanf(\"%d\", &x);\n    if (is_find(x))\n      num++;\n  }\n  printf(\"%d\\n\", num);\n  return 0;\n}","change":"replace","i1":23,"i2":24,"j1":23,"j2":24,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nbool find(const vector<int> &S, int begin, int end, int x) {\n  if (end - begin <= 0) {\n    return false;\n  }\n  int mid = (begin + end) \/ 2;\n  if (x < S[mid]) {\n    return find(S, begin, mid, x);\n  } else if (S[mid] < x) {\n    return find(S, mid, end, x);\n  } else {\n    return true;\n  }\n}\n\nint main() {\n  ios_base::sync_with_stdio(false);\n  cin.tie(nullptr);\n\n  int n;\n  cin >> n;\n  vector<int> S(n);\n  for (int i = 0; i < n; ++i) {\n    cin >> S[i];\n  }\n\n  int q;\n  cin >> q;\n  vector<int> T(q);\n  for (int i = 0; i < q; ++i) {\n    cin >> T[i];\n  }\n\n  int count = 0;\n  for (int i = 0; i < q; ++i) {\n    if (find(S, 0, S.size(), T[i])) {\n      ++count;\n    }\n  }\n  cout << count << endl;\n}\n","changed_src":"#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nbool find(const vector<int> &S, int begin, int end, int x) {\n  if (end - begin == 1) {\n    return S[begin] == x;\n  }\n  int mid = (begin + end) \/ 2;\n  if (x < S[mid]) {\n    return find(S, begin, mid, x);\n  } else if (S[mid] < x) {\n    return find(S, mid, end, x);\n  } else {\n    return true;\n  }\n}\n\nint main() {\n  ios_base::sync_with_stdio(false);\n  cin.tie(nullptr);\n\n  int n;\n  cin >> n;\n  vector<int> S(n);\n  for (int i = 0; i < n; ++i) {\n    cin >> S[i];\n  }\n\n  int q;\n  cin >> q;\n  vector<int> T(q);\n  for (int i = 0; i < q; ++i) {\n    cin >> T[i];\n  }\n\n  int count = 0;\n  for (int i = 0; i < q; ++i) {\n    if (find(S, 0, S.size(), T[i])) {\n      ++count;\n    }\n  }\n  cout << count << endl;\n}\n","change":"replace","i1":6,"i2":8,"j1":6,"j2":8,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint binarySearch(int A[], int n, int key) {\n  int left = 0;\n  int right = n;\n  while (left < right) {\n    int mid = (left + right) \/ 2;\n    if (A[mid] == key)\n      return 1;\n    else if (A[mid] < key)\n      left = mid + 1;\n    else\n      right = mid;\n  }\n  return 0;\n}\n\nint main() {\n  int i, n, A[10000 + 1], q, key, sum = 0;\n\n  scanf(\"%d\", &n);\n  for (i = 0; i < n; i++)\n    scanf(\"%d\", &A[i]);\n\n  scanf(\"%d\", &q);\n  for (i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (binarySearch(A, n, key))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n\n  return 0;\n}\n","changed_src":"#include <stdio.h>\n\nint binarySearch(int A[], int n, int key) {\n  int left = 0;\n  int right = n;\n  while (left < right) {\n    int mid = (left + right) \/ 2;\n    if (A[mid] == key)\n      return 1;\n    else if (A[mid] < key)\n      left = mid + 1;\n    else\n      right = mid;\n  }\n  return 0;\n}\n\nint main() {\n  int i, n, A[100000 + 1], q, key, sum = 0;\n\n  scanf(\"%d\", &n);\n  for (i = 0; i < n; i++)\n    scanf(\"%d\", &A[i]);\n\n  scanf(\"%d\", &q);\n  for (i = 0; i < q; i++) {\n    scanf(\"%d\", &key);\n    if (binarySearch(A, n, key))\n      sum++;\n  }\n  printf(\"%d\\n\", sum);\n\n  return 0;\n}\n","change":"replace","i1":18,"i2":19,"j1":18,"j2":19,"error":"0","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <iostream>\n#include <string>\n#include <vector>\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) FOR(i, 0, n)\n#define rep(i, n) FOR(i, 0, n)\n#define DEBUG(x) cout << #x << \": \" << x << endl\n#define vint vector<int>\n#define vdouble vector<double>\n#define vstring vector<string>\nusing namespace std;\n\n#include <map>\n#include <queue>\n#include <set>\n\ntypedef long long ll;\ntypedef unsigned long long ull;\n\nconst int MAX_N = 1000000;\nint NS;\nint S[MAX_N];\nint NT;\nint T[MAX_N];\n\n\/\/ not the most left\nint binarySearch(int A[], int N, int key) {\n  int left = 0;\n  int right = N;\n  while (left < right) {\n    int mid = (left + right) \/ 2;\n    if (A[mid] == key) {\n      return mid;\n    } else if (key < A[mid]) {\n      right = mid;\n    } else {\n      left = mid;\n    }\n  }\n  return -1;\n}\n\nint main() {\n\n  cin >> NS;\n  rep(i, NS) { cin >> S[i]; }\n  cin >> NT;\n  rep(i, NT) { cin >> T[i]; }\n\n  int ret = 0;\n  rep(i, NT) {\n    if (binarySearch(S, NS, T[i]) >= 0)\n      ret++;\n  }\n  cout << ret << endl;\n}","changed_src":"#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <iostream>\n#include <string>\n#include <vector>\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) FOR(i, 0, n)\n#define rep(i, n) FOR(i, 0, n)\n#define DEBUG(x) cout << #x << \": \" << x << endl\n#define vint vector<int>\n#define vdouble vector<double>\n#define vstring vector<string>\nusing namespace std;\n\n#include <map>\n#include <queue>\n#include <set>\n\ntypedef long long ll;\ntypedef unsigned long long ull;\n\nconst int MAX_N = 1000000;\nint NS;\nint S[MAX_N];\nint NT;\nint T[MAX_N];\n\n\/\/ not the most left\nint binarySearch(int A[], int N, int key) {\n  int left = 0;\n  int right = N;\n  while (left < right) {\n    int mid = (left + right) \/ 2;\n    if (A[mid] == key) {\n      return mid;\n    } else if (key < A[mid]) {\n      right = mid;\n    } else {\n      left = mid + 1;\n    }\n  }\n  return -1;\n}\n\nint main() {\n\n  cin >> NS;\n  rep(i, NS) { cin >> S[i]; }\n  cin >> NT;\n  rep(i, NT) { cin >> T[i]; }\n\n  int ret = 0;\n  rep(i, NT) {\n    if (binarySearch(S, NS, T[i]) >= 0)\n      ret++;\n  }\n  cout << ret << endl;\n}","change":"replace","i1":39,"i2":40,"j1":39,"j2":40,"error":"TLE","stderr":""}
-{"problem_id":"p02268","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\ntemplate <const int U = 1 << 30> class vEB {\n\n  struct node {\n    int min, max;\n    node *summary, **cluster;\n    node() : min(U), max(-1), summary(nullptr), cluster(nullptr) {}\n  } *root;\n\n  int cnt;\n\nprivate:\n  int downsqrt(int ub) const { return ub >> 1; }\n\n  int upsqrt(int ub) { return (ub >> 1) + (ub & 1); }\n\n  int high(int x, int ub) const { return x >> ub; }\n\n  int low(int x, int ub) const { return x & ((1 << ub) - 1); }\n\n  int index(int x, int y, int ub) const { return (x << downsqrt(ub)) + y; }\n\n  int minimum(node *v) const { return v ? v->min : U; }\n\n  int maximum(node *v) const { return v ? v->max : -1; }\n\n  bool member(node *v, int x, int ub) const {\n    if (!v)\n      return false;\n    if (v->min == x || v->max == x)\n      return true;\n    if (!v->cluster)\n      return false;\n    return member(v->cluster[high(x, ub)], low(x, ub), downsqrt(ub));\n  }\n\n  node *new_node(int ub) {\n    node *v = new node();\n    if (ub > 1) {\n      int sz = 1 << upsqrt(ub);\n      v->cluster = new node *[sz];\n      for (int i = 0; i < sz; i++) {\n        v->cluster[i] = nullptr;\n      }\n    }\n    return v;\n  }\n\n  node *empty_insert(node *v, int x, int ub) {\n    if (!v)\n      v = new_node(ub);\n    v->min = v->max = x;\n    return v;\n  }\n\n  node *insert(node *v, int x, int ub) {\n    if (!v)\n      v = new_node(ub);\n    if (v->min == U) {\n      empty_insert(v, x, ub);\n      return v;\n    }\n    if (x < v->min)\n      swap(x, v->min);\n    if (ub > 1) {\n      if (minimum(v->cluster[high(x, ub)]) == U) {\n        v->summary = insert(v->summary, high(x, ub), upsqrt(ub));\n        v->cluster[high(x, ub)] =\n            empty_insert(v->cluster[high(x, ub)], low(x, ub), downsqrt(ub));\n      } else {\n        v->cluster[high(x, ub)] =\n            insert(v->cluster[high(x, ub)], low(x, ub), downsqrt(ub));\n      }\n    }\n    if (x > v->max)\n      v->max = x;\n    return v;\n  }\n\n  node *erase(node *v, int x, int ub) {\n    if (v->min == v->max) {\n      v->min = U;\n      v->max = -1;\n      return nullptr;\n    }\n    if (ub <= 1) {\n      v->max = v->min = (x == 0);\n      return v;\n    }\n    if (x == v->min) {\n      int first_cluster = minimum(v->summary);\n      v->min = x = index(first_cluster, minimum(v->cluster[first_cluster]), ub);\n    }\n    v->cluster[high(x, ub)] =\n        erase(v->cluster[high(x, ub)], low(x, ub), downsqrt(ub));\n    if (minimum(v->cluster[high(x, ub)]) == U) {\n      v->summary = erase(v->summary, high(x, ub), upsqrt(ub));\n      if (x == v->max) {\n        int summary_max = maximum(v->summary);\n        if (summary_max == -1) {\n          v->max = v->min;\n        } else {\n          v->max = index(summary_max, maximum(v->cluster[summary_max]), ub);\n        }\n      }\n    } else if (x == v->max) {\n      v->max = index(high(x, ub), maximum(v->cluster[high(x, ub)]), ub);\n    }\n    return v;\n  }\n\n  int successor(node *v, int x, int ub) const {\n    if (ub <= 1) {\n      if (x == 0 && v->max == 1)\n        return 1;\n      return U;\n    }\n    if (v->min != U && x < v->min)\n      return v->min;\n    int max_low = maximum(v->cluster[high(x, ub)]);\n    if (max_low != -1 && low(x, ub) < max_low) {\n      return index(high(x, ub),\n                   successor(v->cluster[high(x, ub)], low(x, ub), downsqrt(ub)),\n                   ub);\n    }\n    int succ_cluster = successor(v->summary, high(x, ub), upsqrt(ub));\n    if (succ_cluster == U)\n      return U;\n    return index(succ_cluster, minimum(v->cluster[succ_cluster]), ub);\n  }\n\n  int predecessor(node *v, int x, int ub) const {\n    if (ub <= 1) {\n      if (x == 1 && v->min == 0)\n        return 0;\n      return -1;\n    }\n    if (v->max != -1 && x > v->max)\n      return v->max;\n    int min_low = minimum(v->cluster[high(x, ub)]);\n    if (min_low != U && low(x, ub) > min_low) {\n      return index(\n          high(x, ub),\n          predecessor(v->cluster[high(x, ub)], low(x, ub), downsqrt(ub)), ub);\n    }\n    int pred_cluster = predecessor(v->summary, high(x, ub), upsqrt(ub));\n    if (pred_cluster == -1) {\n      if (v->min != -1 && x > v->min)\n        return v->min;\n      return -1;\n    }\n    return index(pred_cluster, maximum(v->cluster[pred_cluster]), ub);\n  }\n\npublic:\n  vEB() : root(nullptr), cnt(0) {}\n\n  int size() const { return cnt; }\n\n  bool member(int x) const { return member(root, x, __builtin_ctz(U)); }\n\n  int minimum() const { return minimum(root); }\n\n  int maximum() const { return maximum(root); }\n\n  void insert(int x) {\n    if (!member(x))\n      root = insert(root, x, __builtin_ctz(U)), cnt++;\n  }\n\n  void erase(int x) {\n    if (member(x))\n      root = erase(root, x, __builtin_ctz(U)), cnt--;\n  }\n\n  int successor(int x) const { return successor(root, x, __builtin_ctz(U)); }\n\n  int predecessor(int x) const {\n    return predecessor(root, x, __builtin_ctz(U));\n  }\n};\n\nint main() {\n  ios::sync_with_stdio(false), cin.tie(0);\n  int n, q;\n  cin >> n;\n  vEB<> veb;\n  for (int i = 0; i < n; i++) {\n    int si;\n    cin >> si;\n    veb.insert(si);\n  }\n  int res = 0;\n  cin >> q;\n  for (int j = 0; j < q; j++) {\n    int ti;\n    cin >> ti;\n    res += veb.member(ti);\n  }\n  cout << res << endl;\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\ntemplate <const int U = 1 << 30> class vEB {\n\n  struct node {\n    int min, max;\n    node *summary, **cluster;\n    node() : min(U), max(-1), summary(nullptr), cluster(nullptr) {}\n  } *root;\n\n  int cnt;\n\nprivate:\n  int downsqrt(int ub) const { return ub >> 1; }\n\n  int upsqrt(int ub) { return (ub >> 1) + (ub & 1); }\n\n  int high(int x, int ub) const { return x >> downsqrt(ub); }\n\n  int low(int x, int ub) const { return x & ((1 << downsqrt(ub)) - 1); }\n\n  int index(int x, int y, int ub) const { return (x << downsqrt(ub)) + y; }\n\n  int minimum(node *v) const { return v ? v->min : U; }\n\n  int maximum(node *v) const { return v ? v->max : -1; }\n\n  bool member(node *v, int x, int ub) const {\n    if (!v)\n      return false;\n    if (v->min == x || v->max == x)\n      return true;\n    if (!v->cluster)\n      return false;\n    return member(v->cluster[high(x, ub)], low(x, ub), downsqrt(ub));\n  }\n\n  node *new_node(int ub) {\n    node *v = new node();\n    if (ub > 1) {\n      int sz = 1 << upsqrt(ub);\n      v->cluster = new node *[sz];\n      for (int i = 0; i < sz; i++) {\n        v->cluster[i] = nullptr;\n      }\n    }\n    return v;\n  }\n\n  node *empty_insert(node *v, int x, int ub) {\n    if (!v)\n      v = new_node(ub);\n    v->min = v->max = x;\n    return v;\n  }\n\n  node *insert(node *v, int x, int ub) {\n    if (!v)\n      v = new_node(ub);\n    if (v->min == U) {\n      empty_insert(v, x, ub);\n      return v;\n    }\n    if (x < v->min)\n      swap(x, v->min);\n    if (ub > 1) {\n      if (minimum(v->cluster[high(x, ub)]) == U) {\n        v->summary = insert(v->summary, high(x, ub), upsqrt(ub));\n        v->cluster[high(x, ub)] =\n            empty_insert(v->cluster[high(x, ub)], low(x, ub), downsqrt(ub));\n      } else {\n        v->cluster[high(x, ub)] =\n            insert(v->cluster[high(x, ub)], low(x, ub), downsqrt(ub));\n      }\n    }\n    if (x > v->max)\n      v->max = x;\n    return v;\n  }\n\n  node *erase(node *v, int x, int ub) {\n    if (v->min == v->max) {\n      v->min = U;\n      v->max = -1;\n      return nullptr;\n    }\n    if (ub <= 1) {\n      v->max = v->min = (x == 0);\n      return v;\n    }\n    if (x == v->min) {\n      int first_cluster = minimum(v->summary);\n      v->min = x = index(first_cluster, minimum(v->cluster[first_cluster]), ub);\n    }\n    v->cluster[high(x, ub)] =\n        erase(v->cluster[high(x, ub)], low(x, ub), downsqrt(ub));\n    if (minimum(v->cluster[high(x, ub)]) == U) {\n      v->summary = erase(v->summary, high(x, ub), upsqrt(ub));\n      if (x == v->max) {\n        int summary_max = maximum(v->summary);\n        if (summary_max == -1) {\n          v->max = v->min;\n        } else {\n          v->max = index(summary_max, maximum(v->cluster[summary_max]), ub);\n        }\n      }\n    } else if (x == v->max) {\n      v->max = index(high(x, ub), maximum(v->cluster[high(x, ub)]), ub);\n    }\n    return v;\n  }\n\n  int successor(node *v, int x, int ub) const {\n    if (ub <= 1) {\n      if (x == 0 && v->max == 1)\n        return 1;\n      return U;\n    }\n    if (v->min != U && x < v->min)\n      return v->min;\n    int max_low = maximum(v->cluster[high(x, ub)]);\n    if (max_low != -1 && low(x, ub) < max_low) {\n      return index(high(x, ub),\n                   successor(v->cluster[high(x, ub)], low(x, ub), downsqrt(ub)),\n                   ub);\n    }\n    int succ_cluster = successor(v->summary, high(x, ub), upsqrt(ub));\n    if (succ_cluster == U)\n      return U;\n    return index(succ_cluster, minimum(v->cluster[succ_cluster]), ub);\n  }\n\n  int predecessor(node *v, int x, int ub) const {\n    if (ub <= 1) {\n      if (x == 1 && v->min == 0)\n        return 0;\n      return -1;\n    }\n    if (v->max != -1 && x > v->max)\n      return v->max;\n    int min_low = minimum(v->cluster[high(x, ub)]);\n    if (min_low != U && low(x, ub) > min_low) {\n      return index(\n          high(x, ub),\n          predecessor(v->cluster[high(x, ub)], low(x, ub), downsqrt(ub)), ub);\n    }\n    int pred_cluster = predecessor(v->summary, high(x, ub), upsqrt(ub));\n    if (pred_cluster == -1) {\n      if (v->min != -1 && x > v->min)\n        return v->min;\n      return -1;\n    }\n    return index(pred_cluster, maximum(v->cluster[pred_cluster]), ub);\n  }\n\npublic:\n  vEB() : root(nullptr), cnt(0) {}\n\n  int size() const { return cnt; }\n\n  bool member(int x) const { return member(root, x, __builtin_ctz(U)); }\n\n  int minimum() const { return minimum(root); }\n\n  int maximum() const { return maximum(root); }\n\n  void insert(int x) {\n    if (!member(x))\n      root = insert(root, x, __builtin_ctz(U)), cnt++;\n  }\n\n  void erase(int x) {\n    if (member(x))\n      root = erase(root, x, __builtin_ctz(U)), cnt--;\n  }\n\n  int successor(int x) const { return successor(root, x, __builtin_ctz(U)); }\n\n  int predecessor(int x) const {\n    return predecessor(root, x, __builtin_ctz(U));\n  }\n};\n\nint main() {\n  ios::sync_with_stdio(false), cin.tie(0);\n  int n, q;\n  cin >> n;\n  vEB<> veb;\n  for (int i = 0; i < n; i++) {\n    int si;\n    cin >> si;\n    veb.insert(si);\n  }\n  int res = 0;\n  cin >> q;\n  for (int j = 0; j < q; j++) {\n    int ti;\n    cin >> ti;\n    res += veb.member(ti);\n  }\n  cout << res << endl;\n  return 0;\n}\n","change":"replace","i1":18,"i2":21,"j1":18,"j2":21,"error":"0","stderr":""}
-{"problem_id":"p02274","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <assert.h>\n#include <iostream>\nusing namespace std;\n#define int long long\nint tempmarge[1000100];\nint N, A[10000000];\n\nint MargeSort(int x[], int left, int right) {\n  int mid, i, j, k, cl, cr, c;\n  if (left >= right)\n    return 0;\n  mid = (left + right) \/ 2;\n  cl = MargeSort(x, left, mid);\n  cr = MargeSort(x, mid + 1, right);\n\n  for (i = left; i <= mid; i++)\n    tempmarge[i] = x[i];\n  for (i = mid + 1, j = right; i <= right; i++, j--)\n    tempmarge[i] = x[j];\n  i = left;\n  j = right;\n  c = 0;\n  for (k = left; k <= right; k++)\n    if (tempmarge[i] <= tempmarge[j])\n      x[k] = tempmarge[i++];\n    else {\n      c += mid + 1 - i;\n      x[k] = tempmarge[j--];\n    }\n  return c + cl + cr;\n}\n\nsigned main() {\n\n  cin >> N;\n  for (int i = 0; i < N; i++)\n    cin >> A[i];\n  cout << MargeSort(A, 0, N - 1) << endl;\n  for (int i = 0; i < N; i++)\n    cerr << A[i] << endl;\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <assert.h>\n#include <iostream>\nusing namespace std;\n#define int long long\nint tempmarge[1000100];\nint N, A[10000000];\n\nint MargeSort(int x[], int left, int right) {\n  int mid, i, j, k, cl, cr, c;\n  if (left >= right)\n    return 0;\n  mid = (left + right) \/ 2;\n  cl = MargeSort(x, left, mid);\n  cr = MargeSort(x, mid + 1, right);\n\n  for (i = left; i <= mid; i++)\n    tempmarge[i] = x[i];\n  for (i = mid + 1, j = right; i <= right; i++, j--)\n    tempmarge[i] = x[j];\n  i = left;\n  j = right;\n  c = 0;\n  for (k = left; k <= right; k++)\n    if (tempmarge[i] <= tempmarge[j])\n      x[k] = tempmarge[i++];\n    else {\n      c += mid + 1 - i;\n      x[k] = tempmarge[j--];\n    }\n  return c + cl + cr;\n}\n\nsigned main() {\n\n  cin >> N;\n  for (int i = 0; i < N; i++)\n    cin >> A[i];\n  cout << MargeSort(A, 0, N - 1) << endl;\n  return 0;\n}","change":"delete","i1":39,"i2":41,"j1":39,"j2":39,"error":"0","stderr":"1\n2\n3\n4\n5\n"}
-{"problem_id":"p02274","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define INF (1000000001)\nint N;\nint A[(1 << 21) + 1];\nint T[(1 << 21) + 1];\nll res = 0;\nvoid marge(int l, int r) {\n  if (r - l == 2) {\n    if (A[l] > A[r - 1]) {\n      res++;\n      swap(A[l], A[r - 1]);\n    }\n  } else {\n    int m = (l + r) \/ 2;\n    marge(l, m);\n    marge(m, r);\n    for (int i = l, j = m, k = l; k < r; k++) {\n      if ((j < r && A[i] > A[j]) || i == m) {\n        res += (m - i);\n        T[k] = A[j++];\n      } else {\n        T[k] = A[i++];\n      }\n    }\n    for (int i = l; i < r; i++)\n      A[i] = T[i];\n  }\n  \/*\n  cout <<\"( \" <<  l << \" , \"<< r << \" ) \" << endl;\n  for(int i=l;i<r;i++) cout << A[i] << \" \";\n  cout << endl;\n  cout << \"res = \"<< res << endl;\n  *\/\n}\n\nint main() {\n  cin >> N;\n  for (int i = 0; i < N; i++)\n    cin >> A[i];\n  int n = 1;\n  while (n < N)\n    n *= 2;\n  for (int i = N; i < n; i++)\n    A[i] = INF + i;\n  N = n;\n  marge(0, N);\n  cout << res << endl;\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define INF (1000000001)\nint N;\nint A[(1 << 21) + 1];\nint T[(1 << 21) + 1];\nll res = 0;\nvoid marge(int l, int r) {\n  if (r - l == 2) {\n    if (A[l] > A[r - 1]) {\n      res++;\n      swap(A[l], A[r - 1]);\n    }\n  } else {\n    int m = (l + r) \/ 2;\n    marge(l, m);\n    marge(m, r);\n    for (int i = l, j = m, k = l; k < r; k++) {\n      if ((j < r && A[i] > A[j]) || i == m) {\n        res += (m - i);\n        T[k] = A[j++];\n      } else {\n        T[k] = A[i++];\n      }\n    }\n    for (int i = l; i < r; i++)\n      A[i] = T[i];\n  }\n  \/*\n  cout <<\"( \" <<  l << \" , \"<< r << \" ) \" << endl;\n  for(int i=l;i<r;i++) cout << A[i] << \" \";\n  cout << endl;\n  cout << \"res = \"<< res << endl;\n  *\/\n}\n\nint main() {\n  cin >> N;\n  for (int i = 0; i < N; i++)\n    cin >> A[i];\n  if (N == 1)\n    cout << 0 << endl;\n  else {\n    int n = 1;\n    while (n < N)\n      n *= 2;\n    for (int i = N; i < n; i++)\n      A[i] = INF + i;\n    N = n;\n    marge(0, N);\n    cout << res << endl;\n  }\n}","change":"replace","i1":42,"i2":50,"j1":42,"j2":54,"error":"0","stderr":""}
-{"problem_id":"p02274","language":"C++","original_status":"Runtime Error","original_src":"\n#include <cstdio>\n#include <iostream>\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst int maxn = 2e4 + 5;\nconst int sentinel = 0x3f3f3f3f;\n\nint l[maxn \/ 2 + 2], r[maxn \/ 2 + 2], a[maxn], n;\n\nLL merge(int left, int mid, int right) {\n  int i, j, k;\n  LL cnt = 0;\n  int n1 = mid - left;\n  int n2 = right - mid;\n  for (int i = 0; i < n1; i++) {\n    l[i] = a[left + i];\n  }\n  for (int i = 0; i < n2; i++) {\n    r[i] = a[mid + i];\n  }\n  l[n1] = r[n2] = sentinel;\n  i = j = 0;\n  for (int k = left; k < right; k++) {\n    if (l[i] <= r[j]) {\n      a[k] = l[i++];\n    } else {\n      a[k] = r[j++];\n      cnt += n1 - i;\n    }\n  }\n  return cnt;\n}\n\nLL mergesort(int left, int right) {\n  int mid;\n  LL v1, v2, v3;\n  if (left + 1 < right) {\n    mid = (left + right) >> 1;\n    v1 = mergesort(left, mid);\n    v2 = mergesort(mid, right);\n    v3 = merge(left, mid, right);\n    return v1 + v2 + v3;\n  } else {\n    return 0;\n  }\n}\n\nint main() {\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &a[i]);\n  }\n  LL ans = mergesort(0, n);\n  cout << ans << endl;\n  return 0;\n}\n\/*\n5\n3 5 2 1 4\n*\/\n","changed_src":"\n#include <cstdio>\n#include <iostream>\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst int maxn = 2e5 + 5;\nconst int sentinel = 0x3f3f3f3f;\n\nint l[maxn \/ 2 + 2], r[maxn \/ 2 + 2], a[maxn], n;\n\nLL merge(int left, int mid, int right) {\n  int i, j, k;\n  LL cnt = 0;\n  int n1 = mid - left;\n  int n2 = right - mid;\n  for (int i = 0; i < n1; i++) {\n    l[i] = a[left + i];\n  }\n  for (int i = 0; i < n2; i++) {\n    r[i] = a[mid + i];\n  }\n  l[n1] = r[n2] = sentinel;\n  i = j = 0;\n  for (int k = left; k < right; k++) {\n    if (l[i] <= r[j]) {\n      a[k] = l[i++];\n    } else {\n      a[k] = r[j++];\n      cnt += n1 - i;\n    }\n  }\n  return cnt;\n}\n\nLL mergesort(int left, int right) {\n  int mid;\n  LL v1, v2, v3;\n  if (left + 1 < right) {\n    mid = (left + right) >> 1;\n    v1 = mergesort(left, mid);\n    v2 = mergesort(mid, right);\n    v3 = merge(left, mid, right);\n    return v1 + v2 + v3;\n  } else {\n    return 0;\n  }\n}\n\nint main() {\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &a[i]);\n  }\n  LL ans = mergesort(0, n);\n  cout << ans << endl;\n  return 0;\n}\n\/*\n5\n3 5 2 1 4\n*\/\n","change":"replace","i1":8,"i2":9,"j1":8,"j2":9,"error":"0","stderr":""}
-{"problem_id":"p02274","language":"C++","original_status":"Runtime Error","original_src":"#include \"bits\/stdc++.h\"\nusing namespace std;\nusing LL = long long;\nusing ULL = unsigned long long;\nconst double PI = acos(-1);\ntemplate <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }\ntemplate <class T> constexpr T HINF() { return INF<T>() \/ 2; }\ntemplate <typename T_char> T_char TL(T_char cX) { return tolower(cX); };\ntemplate <typename T_char> T_char TU(T_char cX) { return toupper(cX); };\ntypedef pair<LL, LL> pii;\nconst int vy[] = {-1, -1, -1, 0, 1, 1, 1, 0},\n          vx[] = {-1, 0, 1, 1, 1, 0, -1, -1};\nconst int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};\nint popcnt(unsigned long long n) {\n  int cnt = 0;\n  for (int i = 0; i < 64; i++)\n    if ((n >> i) & 1)\n      cnt++;\n  return cnt;\n}\nint d_sum(LL n) {\n  int ret = 0;\n  while (n > 0) {\n    ret += n % 10;\n    n \/= 10;\n  }\n  return ret;\n}\nint d_cnt(LL n) {\n  int ret = 0;\n  while (n > 0) {\n    ret++;\n    n \/= 10;\n  }\n  return ret;\n}\nLL gcd(LL a, LL b) {\n  if (b == 0)\n    return a;\n  return gcd(b, a % b);\n};\nLL lcm(LL a, LL b) {\n  LL g = gcd(a, b);\n  return a \/ g * b;\n};\n#define ALL(qpqpq) (qpqpq).begin(), (qpqpq).end()\n#define UNIQUE(wpwpw)                                                          \\\n  sort(ALL((wpwpw)));                                                          \\\n  (wpwpw).erase(unique(ALL((wpwpw))), (wpwpw).end())\n#define LOWER(epepe) transform(ALL((epepe)), (epepe).begin(), TL<char>)\n#define UPPER(rprpr) transform(ALL((rprpr)), (rprpr).begin(), TU<char>)\n#define FOR(i, tptpt, ypypy) for (LL i = (tptpt); i < (ypypy); i++)\n#define REP(i, upupu) FOR(i, 0, upupu)\n#define INIT                                                                   \\\n  std::ios::sync_with_stdio(false);                                            \\\n  std::cin.tie(0)\n#pragma warning(disable : 4996)\n\nint a[101010], n;\n\nstruct BIT {\n  int bit[202020];\n  void init() { REP(i, 202020) bit[i] = 0; }\n  int sum(int i) {\n    int s = 0;\n    while (i > 0) {\n      s += bit[i];\n      i -= i & -i;\n    }\n    return s;\n  }\n  void add(int i, int x) {\n    while (i <= 202020) {\n      bit[i] += x;\n      i += i & -i;\n    }\n  }\n};\n\nvector<pair<LL, LL>> v;\n\nint main() {\n  BIT bit;\n  bit.init();\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> a[i];\n    v.emplace_back(make_pair(a[i], i));\n  }\n  sort(ALL(v));\n  REP(i, n) { a[v[i].second] = i + 1; }\n  LL ans = 0;\n  for (int j = 0; j < n; j++) {\n    ans += j - bit.sum(a[j]);\n    bit.add(a[j], 1);\n  }\n  cout << ans << endl;\n}\n","changed_src":"#include \"bits\/stdc++.h\"\nusing namespace std;\nusing LL = long long;\nusing ULL = unsigned long long;\nconst double PI = acos(-1);\ntemplate <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }\ntemplate <class T> constexpr T HINF() { return INF<T>() \/ 2; }\ntemplate <typename T_char> T_char TL(T_char cX) { return tolower(cX); };\ntemplate <typename T_char> T_char TU(T_char cX) { return toupper(cX); };\ntypedef pair<LL, LL> pii;\nconst int vy[] = {-1, -1, -1, 0, 1, 1, 1, 0},\n          vx[] = {-1, 0, 1, 1, 1, 0, -1, -1};\nconst int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};\nint popcnt(unsigned long long n) {\n  int cnt = 0;\n  for (int i = 0; i < 64; i++)\n    if ((n >> i) & 1)\n      cnt++;\n  return cnt;\n}\nint d_sum(LL n) {\n  int ret = 0;\n  while (n > 0) {\n    ret += n % 10;\n    n \/= 10;\n  }\n  return ret;\n}\nint d_cnt(LL n) {\n  int ret = 0;\n  while (n > 0) {\n    ret++;\n    n \/= 10;\n  }\n  return ret;\n}\nLL gcd(LL a, LL b) {\n  if (b == 0)\n    return a;\n  return gcd(b, a % b);\n};\nLL lcm(LL a, LL b) {\n  LL g = gcd(a, b);\n  return a \/ g * b;\n};\n#define ALL(qpqpq) (qpqpq).begin(), (qpqpq).end()\n#define UNIQUE(wpwpw)                                                          \\\n  sort(ALL((wpwpw)));                                                          \\\n  (wpwpw).erase(unique(ALL((wpwpw))), (wpwpw).end())\n#define LOWER(epepe) transform(ALL((epepe)), (epepe).begin(), TL<char>)\n#define UPPER(rprpr) transform(ALL((rprpr)), (rprpr).begin(), TU<char>)\n#define FOR(i, tptpt, ypypy) for (LL i = (tptpt); i < (ypypy); i++)\n#define REP(i, upupu) FOR(i, 0, upupu)\n#define INIT                                                                   \\\n  std::ios::sync_with_stdio(false);                                            \\\n  std::cin.tie(0)\n#pragma warning(disable : 4996)\n\nint a[202020], n;\n\nstruct BIT {\n  int bit[202020];\n  void init() { REP(i, 202020) bit[i] = 0; }\n  int sum(int i) {\n    int s = 0;\n    while (i > 0) {\n      s += bit[i];\n      i -= i & -i;\n    }\n    return s;\n  }\n  void add(int i, int x) {\n    while (i <= 202020) {\n      bit[i] += x;\n      i += i & -i;\n    }\n  }\n};\n\nvector<pair<LL, LL>> v;\n\nint main() {\n  BIT bit;\n  bit.init();\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> a[i];\n    v.emplace_back(make_pair(a[i], i));\n  }\n  sort(ALL(v));\n  REP(i, n) { a[v[i].second] = i + 1; }\n  LL ans = 0;\n  for (int j = 0; j < n; j++) {\n    ans += j - bit.sum(a[j]);\n    bit.add(a[j], 1);\n  }\n  cout << ans << endl;\n}\n","change":"replace","i1":58,"i2":59,"j1":58,"j2":59,"error":"0","stderr":""}
-{"problem_id":"p02274","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\ntypedef unsigned long long ull;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef pair<double, double> pdd;\nconst ull mod = 1e9 + 7;\n#define REP(i, n) for (int i = 0; i < (int)n; ++i)\n\ntemplate <class V, int ME> class BIT {\npublic:\n  V bit[1 << ME];\n  V total(int e) {\n    V s = 0;\n    e++;\n    while (e)\n      s += bit[e - 1], e -= e & -e;\n    return s;\n  }\n  void update(int e, V val) {\n    e++;\n    while (e <= 1 << ME)\n      bit[e - 1] += val, e += e & -e;\n  }\n};\n\nint main() {\n  int N, tmp;\n  cin >> N;\n  vector<int> inputs(N), rank(N);\n  vector<pii> x(N);\n  REP(i, N) {\n    cin >> x[i].first;\n    x[i].second = i;\n  }\n  sort(x.begin(), x.end());\n  REP(i, N) { rank[x[i].second] = i + 1; }\n\n  REP(i, N) { inputs[--rank[i]] = i; }\n\n  BIT<int, 17> bit;\n  ll res = 0;\n  REP(i, N) {\n    bit.update(inputs[i], 1);\n    \/\/ cout << bit.total(N) - bit.total(inputs[i]) << endl;\n    res += (bit.total(N) - bit.total(inputs[i]));\n  }\n  cout << res << endl;\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\ntypedef unsigned long long ull;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef pair<double, double> pdd;\nconst ull mod = 1e9 + 7;\n#define REP(i, n) for (int i = 0; i < (int)n; ++i)\n\ntemplate <class V, int ME> class BIT {\npublic:\n  V bit[1 << ME];\n  V total(int e) {\n    V s = 0;\n    e++;\n    while (e)\n      s += bit[e - 1], e -= e & -e;\n    return s;\n  }\n  void update(int e, V val) {\n    e++;\n    while (e <= 1 << ME)\n      bit[e - 1] += val, e += e & -e;\n  }\n};\n\nint main() {\n  int N, tmp;\n  cin >> N;\n  vector<int> inputs(N), rank(N);\n  vector<pii> x(N);\n  REP(i, N) {\n    cin >> x[i].first;\n    x[i].second = i;\n  }\n  sort(x.begin(), x.end());\n  REP(i, N) { rank[x[i].second] = i + 1; }\n\n  REP(i, N) { inputs[--rank[i]] = i; }\n\n  BIT<int, 19> bit;\n  ll res = 0;\n  REP(i, N) {\n    bit.update(inputs[i], 1);\n    \/\/ cout << bit.total(N) - bit.total(inputs[i]) << endl;\n    res += (bit.total(N) - bit.total(inputs[i]));\n  }\n  cout << res << endl;\n  return 0;\n}\n","change":"replace","i1":42,"i2":43,"j1":42,"j2":43,"error":"0","stderr":""}
-{"problem_id":"p02274","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\nconst int MAX_N = 100010;\nint bit[MAX_N], n_, n;\n\nint sum(int i) {\n  int s = 0;\n  while (i > 0) {\n    s += bit[i];\n    i -= i & -i;\n  }\n  return s;\n}\n\nvoid add(int i, int x) {\n  while (i <= n) {\n    bit[i] += x;\n    i += i & -i;\n  }\n}\n\nint a[MAX_N], b[MAX_N];\nP c[MAX_N];\nint main() {\n  ll ans = 0;\n\n  cin >> n;\n  \/\/    n_=1;\n  \/\/    while(n_ < n) n_ *=2;\n\n  for (int j = 0; j < n; j++) {\n    cin >> b[j];\n    c[j] = P(b[j], j);\n  }\n  sort(c, c + n);\n  for (int j = 0; j < n; j++) {\n    c[j].first = j + 1;\n    swap(c[j].first, c[j].second);\n  }\n  sort(c, c + n);\n  for (int j = 0; j < n; j++) {\n    a[j] = c[j].second;\n  }\n  for (int j = 0; j < n; j++) {\n    ans += j - sum(a[j]);\n    add(a[j], 1);\n  }\n  cout << ans << endl;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\nconst int MAX_N = 1000100;\nint bit[MAX_N], n_, n;\n\nint sum(int i) {\n  int s = 0;\n  while (i > 0) {\n    s += bit[i];\n    i -= i & -i;\n  }\n  return s;\n}\n\nvoid add(int i, int x) {\n  while (i <= n) {\n    bit[i] += x;\n    i += i & -i;\n  }\n}\n\nint a[MAX_N], b[MAX_N];\nP c[MAX_N];\nint main() {\n  ll ans = 0;\n\n  cin >> n;\n  \/\/    n_=1;\n  \/\/    while(n_ < n) n_ *=2;\n\n  for (int j = 0; j < n; j++) {\n    cin >> b[j];\n    c[j] = P(b[j], j);\n  }\n  sort(c, c + n);\n  for (int j = 0; j < n; j++) {\n    c[j].first = j + 1;\n    swap(c[j].first, c[j].second);\n  }\n  sort(c, c + n);\n  for (int j = 0; j < n; j++) {\n    a[j] = c[j].second;\n  }\n  for (int j = 0; j < n; j++) {\n    ans += j - sum(a[j]);\n    add(a[j], 1);\n  }\n  cout << ans << endl;\n}\n","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02274","language":"Python","original_status":"Time Limit Exceeded","original_src":"n = int(input())\nnd = list(map(int, input().split()))\nc = 0\nfor i in range(n):\n    m = min(nd)\n    index = nd.index(m)\n    nd.remove(m)\n    c += index\nprint(c)\n","changed_src":"n = int(input())\nnlist = list(map(int, input().split()))\nW = [0 for i in range(n)]\n\n\ndef M(l, r):  ##l~r-1 \uae4c\uc9c0\uc758 \ub9ac\uc2a4\ud2b8.\n    if l + 1 >= r:\n        return 0\n    elif l + 2 == r:\n        if nlist[l] <= nlist[l + 1]:\n            return 0\n        else:\n            nlist[l], nlist[l + 1] = nlist[l + 1], nlist[l]\n            return 1\n    ##\uc704\uc758 if\ubb38\uc73c\ub85c (r-l)\uac00 2\uc774\ud558\uc77c \uacbd\uc6b0\ub294 \ud574\ub193\uc74c\n    m = (l + r) \/\/ 2\n    i = l\n    j = m\n    k = l\n    cl = M(l, m)\n    cr = M(m, r)\n    c = 0\n    while i < m and j < r:\n        if nlist[i] <= nlist[j]:\n            W[k] = nlist[i]  ##l\ubd80\ud130 r\uae4c\uc9c0 W\uc5d0 \ud06c\uae30\uc21c\uc73c\ub85c \ub300\uc785\ud574\ub098\uac10\n            k += 1\n            i += 1\n        else:\n            W[k] = nlist[j]  ##\uc77c\ub2e8 W[k]\uc5d0\ub294 \ub354 \uc791\uc740\ucabd\uc744 \uc800\uc7a5\ud558\ub294\ub4ef\n            k += 1\n            j += 1\n            c += m - i  ##\ub9cc\uc57d nlist[i] > nlist[j]\ub77c\uba74 i~m-1 \uae4c\uc9c0 \ubc18\uc804 \ud558\uace0\uc788\uae30 \ub54c\ubb38\n            ##\uadf8\ub7ec\uace0 \ub354 \uc791\uc740 nlist[j]\ub97c \uc548\uc5d0 \ub123\ub294\uac83.\n    while i < m:  ##i\ubc88\uc9f8\ucabd\uc5d0 \ub354 \ud070\uac83\ub4e4\uc774 \ub0a8\uc558\uc744 \uacbd\uc6b0 (j=r \uc774 \ub418\uc788\ub294 \uc0c1\ud669\uc774\uae30\uc5d0 \ub354 \ubc18\uc804\uc218\ub97c \ub298\ub9ac\uc9c0\ub294 \uc54a\uc74c)\n        W[k] = nlist[i]\n        k += 1\n        i += 1\n    while j < r:  ##j\ucabd\uc5d0 \ud070\uac8c \ub0a8\uc544\uc788\ub294\uacbd\uc6b0\ub3c4 \ub3d9\uc77c\n        W[k] = nlist[j]\n        k += 1\n        j += 1\n    for i in range(l, r):\n        nlist[i] = W[i]\n    return cl + cr + c\n\n\nprint(M(0, n))\n","change":"replace","i1":1,"i2":9,"j1":1,"j2":47,"error":"TLE","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cctype>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <iostream>\n#include <limits>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\nusing namespace std;\n#define REP(i, j) for (int i = 0; i < (int)(j); ++i)\n#define FOR(i, j, k) for (int i = (int)(j); i < (int)(k); ++i)\n#define SORT(v) sort((v).begin(), (v).end())\n#define REVERSE(v) reverse((v).begin(), (v).end())\n\/\/ typedef complex<double> P;\ntypedef pair<int, int> P;\nconst int MAX_V = 100010;\nconst int INF = 1e9 + 7;\n\nint dijkstra(const vector<vector<P>> &cost, int s, int t, int V) {\n  priority_queue<P, vector<P>, greater<P>> open;\n  open.push(P(s, 0));\n  int closed[MAX_V];\n  REP(i, V) closed[i] = INF;\n  while (!open.empty()) {\n    P tmp = open.top();\n    open.pop();\n    int now = tmp.first, c = tmp.second;\n    if (closed[now] < c)\n      continue;\n    closed[now] = c;\n    REP(i, cost[now].size()) {\n      int next = cost[now][i].first, nc = cost[now][i].second;\n      if (nc == INF || c + nc >= closed[next])\n        continue;\n      closed[next] = c + nc;\n      open.push(P(next, closed[next]));\n    }\n  }\n  REP(i, V) {\n    if (closed[i] == INF)\n      cout << \"INF\" << endl;\n    else\n      cout << closed[i] << endl;\n  }\n  return closed[t];\n}\n\nint main() {\n  int V, E, r;\n  cin >> V >> E >> r;\n  vector<vector<P>> cost(V);\n  REP(i, E) {\n    int f, t, c;\n    cin >> f >> t >> c;\n    cost[f].push_back(P(t, c));\n  }\n  REP(i, E) {\n    if ((int)cost[i].size() <= 0)\n      continue;\n    SORT(cost[i]);\n    vector<P> tmp;\n    int now = cost[i][0].first;\n    tmp.push_back(cost[i][0]);\n    FOR(j, 1, cost[i].size()) {\n      if (now == cost[i][j].first)\n        continue;\n      now = cost[i][j].first;\n      tmp.push_back(cost[i][j]);\n    }\n    cost[i] = tmp;\n  }\n  dijkstra(cost, r, -1, V);\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cctype>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <iostream>\n#include <limits>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\nusing namespace std;\n#define REP(i, j) for (int i = 0; i < (int)(j); ++i)\n#define FOR(i, j, k) for (int i = (int)(j); i < (int)(k); ++i)\n#define SORT(v) sort((v).begin(), (v).end())\n#define REVERSE(v) reverse((v).begin(), (v).end())\n\/\/ typedef complex<double> P;\ntypedef pair<int, int> P;\nconst int MAX_V = 100010;\nconst int INF = 1e9 + 7;\n\nint dijkstra(const vector<vector<P>> &cost, int s, int t, int V) {\n  priority_queue<P, vector<P>, greater<P>> open;\n  open.push(P(s, 0));\n  int closed[MAX_V];\n  REP(i, V) closed[i] = INF;\n  while (!open.empty()) {\n    P tmp = open.top();\n    open.pop();\n    int now = tmp.first, c = tmp.second;\n    if (closed[now] < c)\n      continue;\n    closed[now] = c;\n    REP(i, cost[now].size()) {\n      int next = cost[now][i].first, nc = cost[now][i].second;\n      if (nc == INF || c + nc >= closed[next])\n        continue;\n      closed[next] = c + nc;\n      open.push(P(next, closed[next]));\n    }\n  }\n  REP(i, V) {\n    if (closed[i] == INF)\n      cout << \"INF\" << endl;\n    else\n      cout << closed[i] << endl;\n  }\n  return closed[t];\n}\n\nint main() {\n  int V, E, r;\n  cin >> V >> E >> r;\n  vector<vector<P>> cost(V);\n  REP(i, E) {\n    int f, t, c;\n    cin >> f >> t >> c;\n    cost[f].push_back(P(t, c));\n  }\n  \/\/ REP(i, E){\n  \/\/   if((int)cost[i].size() <= 0) continue;\n  \/\/   SORT(cost[i]);\n  \/\/   vector<P> tmp;\n  \/\/   int now = cost[i][0].first;\n  \/\/   tmp.push_back(cost[i][0]);\n  \/\/   FOR(j, 1, cost[i].size()){\n  \/\/     if(now == cost[i][j].first) continue;\n  \/\/     now = cost[i][j].first;\n  \/\/     tmp.push_back(cost[i][j]);\n  \/\/   }\n  \/\/   cost[i] = tmp;\n  \/\/ }\n  dijkstra(cost, r, -1, V);\n  return 0;\n}","change":"replace","i1":67,"i2":82,"j1":67,"j2":80,"error":"-11","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\n\n#define pb push_back\n#define INF 1010001000\n#define loop(i, n) for (int i = 0; i < n; i++)\n\ntypedef pair<int, int> i_i;\ntypedef struct edge {\n  int st, en, cst;\n} Edge;\n\nint main() {\n  int v, e, r;\n  cin >> v >> e >> r;\n\n  vector<vector<i_i>> G(v);\n  vector<int> ans(v, INF);\n\n  loop(i, e) {\n    int st, en, d;\n    cin >> st >> en >> d;\n    G[st].pb(i_i(d, en));\n  }\n\n  priority_queue<i_i, vector<i_i>, greater<i_i>> pq;\n  pq.push(i_i(0, r));\n  ans[r] = 0;\n  while (!pq.empty()) {\n    i_i p = pq.top();\n    pq.pop();\n    int u = p.second;\n    if (ans[u] < p.first) {\n      continue;\n    }\n    for (i_i i : G[u]) {\n      if (ans[i.second] > ans[u] + i.first) {\n        ans[i.second] = ans[u] + i.first;\n        pq.push(i_i(ans[i.second], i.second));\n      }\n    }\n  }\n\n  loop(i, v) {\n    if (ans[i] != INF) {\n      cout << ans[i] << endl;\n    } else {\n      cout << \"INF\" << endl;\n    }\n  }\n  return 0;\n}","changed_src":"#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\n\n#define pb push_back\n#define INF 1010001000\n#define loop(i, n) for (int i = 0; i < n; i++)\n\ntypedef pair<int, int> i_i;\ntypedef struct edge {\n  int st, en, cst;\n} Edge;\n\nint main() {\n  int v, e, r;\n  cin >> v >> e >> r;\n\n  vector<vector<i_i>> G(v);\n  vector<int> ans(v, INF);\n\n  loop(i, e) {\n    int st, en, d;\n    cin >> st >> en >> d;\n    G[st].pb(i_i(d, en));\n  }\n\n  priority_queue<i_i, vector<i_i>, greater<i_i>> pq;\n  pq.push(i_i(0, r));\n  ans[r] = 0;\n  while (!pq.empty()) {\n    i_i p = pq.top();\n    pq.pop();\n    int u = p.second;\n    if (ans[u] < p.first) {\n      continue;\n    }\n    for (int j = 0; j < G[u].size(); j++) {\n      i_i i = G[u][j];\n      if (ans[i.second] > ans[u] + i.first) {\n        ans[i.second] = ans[u] + i.first;\n        pq.push(i_i(ans[i.second], i.second));\n      }\n    }\n  }\n\n  loop(i, v) {\n    if (ans[i] != INF) {\n      cout << ans[i] << endl;\n    } else {\n      cout << \"INF\" << endl;\n    }\n  }\n  return 0;\n}","change":"replace","i1":37,"i2":38,"j1":37,"j2":39,"error":"TLE","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <stack>\n#include <vector>\nusing namespace std;\n#define int long long\ninline int in() {\n  int32_t x;\n  scanf(\"%d\", &x);\n  return x;\n}\ninline string getStr() {\n  char ch[200000];\n  scanf(\"%s\", ch);\n  return ch;\n}\ninline char getCh() {\n  char ch;\n  scanf(\" %c\", &ch);\n  return ch;\n}\ntemplate <class P, class Q> inline P smin(P &a, Q b) {\n  if (b < a)\n    a = b;\n  return a;\n}\ntemplate <class P, class Q> inline P smax(P &a, Q b) {\n  if (a < b)\n    a = b;\n  return a;\n}\nconst int MOD = 1e9 + 7;\nconst int MAX_N = 5e3 + 10;\nconst int MA_LG = 21;\nconst int base = 29;\nvector<pair<int, int>> g[MAX_N];\nint res[MAX_N];\nbool vis[MAX_N];\nint32_t main() {\n  int n = in(), m = in(), source = in();\n  for (int i = 0; i < m; i++) {\n    int v = in(), u = in(), w = in();\n    g[v].push_back({u, w});\n  }\n  for (int v = 0; v < n; v++)\n    res[v] = 1e18;\n  res[source] = 0;\n  priority_queue<pair<int, int>> pq;\n  pq.push({0, source});\n  res[source] = 0;\n  while (!pq.empty()) {\n    int v = pq.top().second;\n    int di = -pq.top().first;\n    pq.pop();\n    if (vis[v] && res[v] <= di)\n      continue;\n    vis[v] = true;\n    res[v] = di;\n    for (int pt = 0; pt < g[v].size(); pt++) {\n      int u = g[v][pt].first, w = g[v][pt].second;\n      if (res[u] > w + di) {\n        if (vis[u] && w + di < 0) {\n          cout << \"NEGATIVE CYCLE\\n\";\n          exit(0);\n        }\n        \/\/                res[u] = w + di;\n        pq.push({-w - di, u});\n      }\n    }\n  }\n  for (int i = 0; i < n; i++) {\n    if (res[i] >= 1e18) {\n      cout << \"INF\\n\";\n    } else\n      cout << res[i] << \"\\n\";\n  }\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <stack>\n#include <vector>\nusing namespace std;\n#define int long long\ninline int in() {\n  int32_t x;\n  scanf(\"%d\", &x);\n  return x;\n}\ninline string getStr() {\n  char ch[200000];\n  scanf(\"%s\", ch);\n  return ch;\n}\ninline char getCh() {\n  char ch;\n  scanf(\" %c\", &ch);\n  return ch;\n}\ntemplate <class P, class Q> inline P smin(P &a, Q b) {\n  if (b < a)\n    a = b;\n  return a;\n}\ntemplate <class P, class Q> inline P smax(P &a, Q b) {\n  if (a < b)\n    a = b;\n  return a;\n}\nconst int MOD = 1e9 + 7;\nconst int MAX_N = 1e5 + 10;\nconst int MA_LG = 21;\nconst int base = 29;\nvector<pair<int, int>> g[MAX_N];\nint res[MAX_N];\nbool vis[MAX_N];\nint32_t main() {\n  int n = in(), m = in(), source = in();\n  for (int i = 0; i < m; i++) {\n    int v = in(), u = in(), w = in();\n    g[v].push_back({u, w});\n  }\n  for (int v = 0; v < n; v++)\n    res[v] = 1e18;\n  res[source] = 0;\n  priority_queue<pair<int, int>> pq;\n  pq.push({0, source});\n  res[source] = 0;\n  while (!pq.empty()) {\n    int v = pq.top().second;\n    int di = -pq.top().first;\n    pq.pop();\n    if (vis[v] && res[v] <= di)\n      continue;\n    vis[v] = true;\n    res[v] = di;\n    for (int pt = 0; pt < g[v].size(); pt++) {\n      int u = g[v][pt].first, w = g[v][pt].second;\n      if (res[u] > w + di) {\n        if (vis[u] && w + di < 0) {\n          cout << \"NEGATIVE CYCLE\\n\";\n          exit(0);\n        }\n        \/\/                res[u] = w + di;\n        pq.push({-w - di, u});\n      }\n    }\n  }\n  for (int i = 0; i < n; i++) {\n    if (res[i] >= 1e18) {\n      cout << \"INF\\n\";\n    } else\n      cout << res[i] << \"\\n\";\n  }\n}","change":"replace","i1":35,"i2":36,"j1":35,"j2":36,"error":"0","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include \"bits\/stdc++.h\"\nusing namespace std;\ntypedef long long lint;\n\n#define MAXN 100010\n\/\/ d,edge,g,P,q\nlint d[MAXN];\nstruct edge {\n  int to;\n  lint cost;\n};\nvector<edge> g[MAXN];\ntypedef pair<lint, int> P;\npriority_queue<P, vector<P>, greater<P>> q;\n\nvoid pfs(int s) {\n  d[s] = 0;\n  q.push({0, s});\n  lint cd, v;\n  while (q.size()) {\n    cd = q.top().first;\n    v = q.top().second;\n    q.pop();\n    if (cd > d[v])\n      continue;\n    for (edge &e : g[v])\n      if (d[e.to] > cd + e.cost) {\n        d[e.to] = cd + e.cost;\n        q.push({d[e.to], e.to});\n      }\n  }\n}\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n\nint main() {\n  lint v, e, r;\n  cin >> v >> e >> r;\n  rep(i, v) d[i] = INT_MAX;\n  int a, b;\n  lint c;\n  rep(i, e) {\n    cin >> a >> b >> c;\n    g[a].push_back({b, c});\n  }\n  pfs(r);\n  rep(i, v) {\n    if (d[i] == INT_MAX)\n      cout << \"INF\u00a5n\";\n    else\n      cout << d[i] << endl;\n  }\n}\n","changed_src":"#include \"bits\/stdc++.h\"\nusing namespace std;\ntypedef long long lint;\n\n#define MAXN 100010\n\/\/ d,edge,g,P,q\nlint d[MAXN];\nstruct edge {\n  int to;\n  lint cost;\n};\nvector<edge> g[MAXN];\ntypedef pair<lint, int> P;\npriority_queue<P, vector<P>, greater<P>> q;\n\nvoid pfs(int s) {\n  d[s] = 0;\n  q.push({0, s});\n  lint cd, v;\n  while (q.size()) {\n    cd = q.top().first;\n    v = q.top().second;\n    q.pop();\n    if (cd > d[v])\n      continue;\n    for (edge &e : g[v])\n      if (d[e.to] > cd + e.cost) {\n        d[e.to] = cd + e.cost;\n        q.push({d[e.to], e.to});\n      }\n  }\n}\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n\nint main() {\n  lint v, e, r;\n  cin >> v >> e >> r;\n  rep(i, v) d[i] = INT_MAX;\n  int a, b;\n  lint c;\n  rep(i, e) {\n    cin >> a >> b >> c;\n    g[a].push_back({b, c});\n  }\n  pfs(r);\n  rep(i, v) {\n    if (d[i] == INT_MAX)\n      cout << \"INF\" << endl;\n    else\n      cout << d[i] << endl;\n  }\n}\n","change":"replace","i1":48,"i2":49,"j1":48,"j2":49,"error":"0","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\n#define ll long long\n#define INF 1000000005\n#define MOD 1000000007\n#define EPS 1e-10\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)\n#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define each(a, b) for (auto(a) : (b))\n#define all(v) (v).begin(), (v).end()\n#define len(v) (int)(v).size()\n#define zip(v) sort(all(v)), v.erase(unique(all(v)), v.end())\n#define cmx(x, y) x = max(x, y)\n#define cmn(x, y) x = min(x, y)\n#define fi first\n#define se second\n#define pb push_back\n#define show(x) cout << #x << \" = \" << (x) << endl\n#define spair(p) cout << #p << \": \" << p.fi << \" \" << p.se << endl\n#define svec(v)                                                                \\\n  cout << #v << \":\";                                                           \\\n  rep(kbrni, v.size()) cout << \" \" << v[kbrni];                                \\\n  cout << endl\n#define sset(s)                                                                \\\n  cout << #s << \":\";                                                           \\\n  each(kbrni, s) cout << \" \" << kbrni;                                         \\\n  cout << endl\n#define smap(m)                                                                \\\n  cout << #m << \":\";                                                           \\\n  each(kbrni, m) cout << \" {\" << kbrni.first << \":\" << kbrni.second << \"}\";    \\\n  cout << endl\n\nusing namespace std;\n\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<double> vd;\ntypedef vector<P> vp;\ntypedef vector<string> vs;\n\nconst int MAX_N = 100005;\n\ntemplate <typename T> class Heap {\npublic:\n  struct node {\n    node *l;\n    node *r;\n    T val;\n    node(T t) : l(nullptr), r(nullptr), val(t) {}\n  };\n  node *root;\n  Heap() : root(nullptr) {}\n  node *meld(node *a, node *b) {\n    if (!a)\n      return b;\n    if (!b)\n      return a;\n    if (a->val < b->val)\n      swap(a, b);\n    a->r = meld(a->r, b);\n    swap(a->l, a->r);\n    return a;\n  }\n  void push(T val) {\n    node *p = new node(val);\n    root = meld(root, p);\n  }\n  T top() { return root->val; }\n  void pop() {\n    node *p = root;\n    root = meld(root->r, root->l);\n    delete p;\n  }\n};\n\nstruct edge {\n  int to, cost;\n};\n\nint d[MAX_N];\nvector<edge> G[MAX_N];\n\nvoid dijkstra(int s) {\n  Heap<P> que;\n  d[s] = 0;\n  que.push(P(0, s));\n  while (que.root) {\n    P p = que.top();\n    que.pop();\n    int v = p.second;\n    if (d[v] < p.first)\n      continue;\n    for (auto w : G[v]) {\n      if (d[w.to] > d[v] + w.cost) {\n        d[w.to] = d[v] + w.cost;\n        que.push(P(d[w.to], w.to));\n      }\n    }\n  }\n}\n\nint main() {\n  int n, m, s;\n  scanf(\"%d%d%d\", &n, &m, &s);\n  rep(i, m) {\n    int a, b, c;\n    scanf(\"%d%d%d\", &a, &b, &c);\n    G[a].pb((edge){b, c});\n  }\n  fill(d, d + n, INF);\n  dijkstra(s);\n  rep(i, n) {\n    if (d[i] == INF) {\n      cout << \"INF\\n\";\n    } else {\n      cout << d[i] << \"\\n\";\n    }\n  }\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\n#define ll long long\n#define INF 1000000005\n#define MOD 1000000007\n#define EPS 1e-10\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)\n#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define each(a, b) for (auto(a) : (b))\n#define all(v) (v).begin(), (v).end()\n#define len(v) (int)(v).size()\n#define zip(v) sort(all(v)), v.erase(unique(all(v)), v.end())\n#define cmx(x, y) x = max(x, y)\n#define cmn(x, y) x = min(x, y)\n#define fi first\n#define se second\n#define pb push_back\n#define show(x) cout << #x << \" = \" << (x) << endl\n#define spair(p) cout << #p << \": \" << p.fi << \" \" << p.se << endl\n#define svec(v)                                                                \\\n  cout << #v << \":\";                                                           \\\n  rep(kbrni, v.size()) cout << \" \" << v[kbrni];                                \\\n  cout << endl\n#define sset(s)                                                                \\\n  cout << #s << \":\";                                                           \\\n  each(kbrni, s) cout << \" \" << kbrni;                                         \\\n  cout << endl\n#define smap(m)                                                                \\\n  cout << #m << \":\";                                                           \\\n  each(kbrni, m) cout << \" {\" << kbrni.first << \":\" << kbrni.second << \"}\";    \\\n  cout << endl\n\nusing namespace std;\n\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<double> vd;\ntypedef vector<P> vp;\ntypedef vector<string> vs;\n\nconst int MAX_N = 100005;\n\ntemplate <typename T> class Heap {\npublic:\n  struct node {\n    node *l;\n    node *r;\n    T val;\n    node(T t) : l(nullptr), r(nullptr), val(t) {}\n  };\n  node *root;\n  Heap() : root(nullptr) {}\n  node *meld(node *a, node *b) {\n    if (!a)\n      return b;\n    if (!b)\n      return a;\n    if (a->val > b->val)\n      swap(a, b);\n    a->r = meld(a->r, b);\n    swap(a->l, a->r);\n    return a;\n  }\n  void push(T val) {\n    node *p = new node(val);\n    root = meld(root, p);\n  }\n  T top() { return root->val; }\n  void pop() {\n    node *p = root;\n    root = meld(root->r, root->l);\n    delete p;\n  }\n};\n\nstruct edge {\n  int to, cost;\n};\n\nint d[MAX_N];\nvector<edge> G[MAX_N];\n\nvoid dijkstra(int s) {\n  Heap<P> que;\n  d[s] = 0;\n  que.push(P(0, s));\n  while (que.root) {\n    P p = que.top();\n    que.pop();\n    int v = p.second;\n    if (d[v] < p.first)\n      continue;\n    for (auto w : G[v]) {\n      if (d[w.to] > d[v] + w.cost) {\n        d[w.to] = d[v] + w.cost;\n        que.push(P(d[w.to], w.to));\n      }\n    }\n  }\n}\n\nint main() {\n  int n, m, s;\n  scanf(\"%d%d%d\", &n, &m, &s);\n  rep(i, m) {\n    int a, b, c;\n    scanf(\"%d%d%d\", &a, &b, &c);\n    G[a].pb((edge){b, c});\n  }\n  fill(d, d + n, INF);\n  dijkstra(s);\n  rep(i, n) {\n    if (d[i] == INF) {\n      cout << \"INF\\n\";\n    } else {\n      cout << d[i] << \"\\n\";\n    }\n  }\n  return 0;\n}","change":"replace","i1":60,"i2":61,"j1":60,"j2":61,"error":"TLE","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include <climits>\n#include <iostream>\n#include <queue>\n#include <vector>\n#define INF 1e+18\nusing namespace std;\n\nstruct Edge {\n  int trg;\n  long long w;\n};\n\nstruct vertex {\n  int v;\n  long long w;\n  bool operator<(const vertex &x) const { return w < x.w; }\n  bool operator>(const vertex &x) const { return w > x.w; }\n};\n\nconst int MAX_V = 10000;\nvector<vector<Edge>> graph(MAX_V);\nvector<long long> min_cost(MAX_V, INF);\nvector<bool> used(MAX_V, false);\n\nvoid dijkstra(int s, int V) {\n  min_cost[s] = 0;\n\n  priority_queue<vertex, vector<vertex>, greater<vertex>> pq;\n  pq.push(vertex{s, 0});\n  while (!pq.empty()) {\n    vertex ver = pq.top();\n    pq.pop();\n    int v = ver.v;\n    if (used[v])\n      continue;\n    used[v] = true;\n    min_cost[v] = ver.w;\n\n    for (int i = 0; i < graph[v].size(); i++) {\n      if (!used[graph[v][i].trg]) {\n        pq.push(vertex{graph[v][i].trg, min_cost[v] + graph[v][i].w});\n      }\n    }\n  }\n}\n\nvoid print_array(vector<long long> &array, int node) {\n  for (int i = 0; i < node; i++) {\n    if (array[i] == INF) {\n      cout << \"INF\" << endl;\n    } else {\n      cout << array[i] << endl;\n    }\n  }\n}\n\nint main() {\n\n  int V, E, r;\n  cin >> V >> E >> r;\n  int s, t, d;\n  for (int i = 0; i < E; i++) {\n    cin >> s >> t >> d;\n    graph[s].push_back(Edge{t, d});\n  }\n  dijkstra(r, V);\n  print_array(min_cost, V);\n\n  return 0;\n}","changed_src":"#include <climits>\n#include <iostream>\n#include <queue>\n#include <vector>\n#define INF 1e+18\nusing namespace std;\n\nstruct Edge {\n  int trg;\n  long long w;\n};\n\nstruct vertex {\n  int v;\n  long long w;\n  bool operator<(const vertex &x) const { return w < x.w; }\n  bool operator>(const vertex &x) const { return w > x.w; }\n};\n\nconst int MAX_V = 100000;\nvector<vector<Edge>> graph(MAX_V);\nvector<long long> min_cost(MAX_V, INF);\nvector<bool> used(MAX_V, false);\n\nvoid dijkstra(int s, int V) {\n  min_cost[s] = 0;\n\n  priority_queue<vertex, vector<vertex>, greater<vertex>> pq;\n  pq.push(vertex{s, 0});\n  while (!pq.empty()) {\n    vertex ver = pq.top();\n    pq.pop();\n    int v = ver.v;\n    if (used[v])\n      continue;\n    used[v] = true;\n    min_cost[v] = ver.w;\n\n    for (int i = 0; i < graph[v].size(); i++) {\n      if (!used[graph[v][i].trg]) {\n        pq.push(vertex{graph[v][i].trg, min_cost[v] + graph[v][i].w});\n      }\n    }\n  }\n}\n\nvoid print_array(vector<long long> &array, int node) {\n  for (int i = 0; i < node; i++) {\n    if (array[i] == INF) {\n      cout << \"INF\" << endl;\n    } else {\n      cout << array[i] << endl;\n    }\n  }\n}\n\nint main() {\n\n  int V, E, r;\n  cin >> V >> E >> r;\n  int s, t, d;\n  for (int i = 0; i < E; i++) {\n    cin >> s >> t >> d;\n    graph[s].push_back(Edge{t, d});\n  }\n  dijkstra(r, V);\n  print_array(min_cost, V);\n\n  return 0;\n}","change":"replace","i1":19,"i2":20,"j1":19,"j2":20,"error":"0","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Memory Limit Exceeded","original_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))\n\nconst int INF_32 = -1 + (1 << 30);\n\ntemplate <class Abel> struct D_Graph {\n  int V, E;\n  bool **exist;\n  vector<vector<pair<int, Abel>>> adj;\n  vector<vector<pair<int, Abel>>> adj_inv;\n\n  D_Graph(int V_size = 0) { init(V_size); }\n\n  void init(int V_size) {\n    V = V_size, E = 0;\n\n    \/*exist = (bool**)malloc(sizeof(bool*) * (V + 1));\n    for(int i = 0; i <= V; ++i){\n            exist[i] = (bool*)malloc(sizeof(bool) * (V + 1));\n            fill(exist[i],exist[i] + V + 1,0);\n    }*\/\n\n    adj.clear();\n    adj_inv.clear();\n    adj.resize(V + 1);\n    adj_inv.resize(V + 1);\n    adj[0].resize(V);\n    for (int i = 1; i <= V; ++i) {\n      adj[0][i - 1] = {i, 0};\n      \/\/ exist[0][i] = 1;\n      adj[i].reserve(min(V, 1000));\n      adj_inv[i].reserve(min(V, 1000));\n    }\n  }\n\n  int deg_out(int v) { return adj[v].size(); }\n\n  int deg_in(int v) { return adj_inv[v].size(); }\n\n  bool is_leaf(int v) { return deg_out(v) == 0; }\n\n  bool is_root(int v) { return deg_in(v) == 0; }\n\n  void add_edge(int from, int to, Abel cost = 1) {\n    adj[from].push_back({to, cost});\n    adj_inv[to].push_back({from, cost});\n    \/\/ exist[from][to] = 1;\n    ++E;\n  }\n\n  void sort_edge() {\n    for (int i = 0; i <= V; ++i)\n      sort_edge(i);\n  }\n\n  void sort_edge(int v) {\n    sort(begin(adj[v]), end(adj[v]));\n    sort(begin(adj_inv[v]), end(adj_inv[v]));\n  }\n\n  void dijkstra(vector<Abel> &dist, int src, Abel dist_max = INF_32) {\n    dist.clear();\n    dist.resize(V + 1);\n    fill(begin(dist), end(dist), dist_max);\n    priority_queue<pair<Abel, int>, vector<pair<Abel, int>>,\n                   greater<pair<Abel, int>>>\n        que;\n    que.push({0, src});\n    while (!que.empty()) {\n      int d = que.top().first;\n      int v = que.top().second;\n      que.pop();\n      if (dist[v] <= d)\n        continue;\n      dist[v] = d;\n      for (auto e : adj[v])\n        que.push({e.second + d, e.first});\n    }\n  }\n\n  \/*bool is_cyclic(){\n          vector<int> s;\n          return !tsort(s);\n  }\n\n  bool tsort(vector<int> &seq, bool idx_ord = 0) {\n          seq.clear();\n          seq.reserve(V + 1);\n\n          vector<int> in(V + 1);\n          for(int i = 0; i <= V; ++i) in[i] = deg_in(i);\n\n          stack<int> rt;\n          rt.push(0);\n\n          while(!rt.empty()){\n                  int r = rt.top();\n                  rt.pop();\n                  for(auto e : adj[r]){\n                          int v = e.first;\n                          if(r) --in[v];\n                          if(!in[v]){\n                                  rt.push(v);\n                                  if(idx_ord){\n                                          auto pos = begin(seq);\n                                          bool det = 0;\n                                          for(auto i = begin(seq); i < end(seq);\n  ++i){ if(!det && v > *i) ++pos; else det = 1; if(exist[*i][v]){ pos = i + 1;\n                                                          det = 0;\n                                                  }\n                                          }\n                                          seq.insert(pos,v);\n                                  }else{\n                                          seq.push_back(v);\n                                  }\n                          }\n                  }\n          }\n\n          if(seq.size() == V) return 1;\n          return 0;\n  }*\/\n};\n\nint main() {\n  ios::sync_with_stdio(false);\n  cin.tie(0);\n\n  int V, E, r;\n  cin >> V >> E >> r;\n  D_Graph<int> G(V);\n  int s, t, d;\n  rep(i, E) {\n    cin >> s >> t >> d;\n    G.add_edge(++s, ++t, d);\n  }\n  vector<int> dist;\n  G.dijkstra(dist, ++r);\n  rep(i, V) {\n    if (dist[i + 1] < INF_32)\n      cout << dist[i + 1] << '\\n';\n    else\n      cout << \"INF\\n\";\n  }\n}\n","changed_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))\n\nconst int INF_32 = -1 + (1 << 30);\n\ntemplate <class Abel> struct D_Graph {\n  int V, E;\n  bool **exist;\n  vector<vector<pair<int, Abel>>> adj;\n  vector<vector<pair<int, Abel>>> adj_inv;\n\n  D_Graph(int V_size = 0) { init(V_size); }\n\n  void init(int V_size) {\n    V = V_size, E = 0;\n\n    \/*exist = (bool**)malloc(sizeof(bool*) * (V + 1));\n    for(int i = 0; i <= V; ++i){\n            exist[i] = (bool*)malloc(sizeof(bool) * (V + 1));\n            fill(exist[i],exist[i] + V + 1,0);\n    }*\/\n\n    adj.clear();\n    adj_inv.clear();\n    adj.resize(V + 1);\n    adj_inv.resize(V + 1);\n    adj[0].resize(V);\n    for (int i = 1; i <= V; ++i) {\n      adj[0][i - 1] = {i, 0};\n      \/\/ exist[0][i] = 1;\n      \/\/ adj[i].reserve(min(V,1000));\n      \/\/ adj_inv[i].reserve(min(V,1000));\n    }\n  }\n\n  int deg_out(int v) { return adj[v].size(); }\n\n  int deg_in(int v) { return adj_inv[v].size(); }\n\n  bool is_leaf(int v) { return deg_out(v) == 0; }\n\n  bool is_root(int v) { return deg_in(v) == 0; }\n\n  void add_edge(int from, int to, Abel cost = 1) {\n    adj[from].push_back({to, cost});\n    adj_inv[to].push_back({from, cost});\n    \/\/ exist[from][to] = 1;\n    ++E;\n  }\n\n  void sort_edge() {\n    for (int i = 0; i <= V; ++i)\n      sort_edge(i);\n  }\n\n  void sort_edge(int v) {\n    sort(begin(adj[v]), end(adj[v]));\n    sort(begin(adj_inv[v]), end(adj_inv[v]));\n  }\n\n  void dijkstra(vector<Abel> &dist, int src, Abel dist_max = INF_32) {\n    dist.clear();\n    dist.resize(V + 1);\n    fill(begin(dist), end(dist), dist_max);\n    priority_queue<pair<Abel, int>, vector<pair<Abel, int>>,\n                   greater<pair<Abel, int>>>\n        que;\n    que.push({0, src});\n    while (!que.empty()) {\n      int d = que.top().first;\n      int v = que.top().second;\n      que.pop();\n      if (dist[v] <= d)\n        continue;\n      dist[v] = d;\n      for (auto e : adj[v])\n        que.push({e.second + d, e.first});\n    }\n  }\n\n  \/*bool is_cyclic(){\n          vector<int> s;\n          return !tsort(s);\n  }\n\n  bool tsort(vector<int> &seq, bool idx_ord = 0) {\n          seq.clear();\n          seq.reserve(V + 1);\n\n          vector<int> in(V + 1);\n          for(int i = 0; i <= V; ++i) in[i] = deg_in(i);\n\n          stack<int> rt;\n          rt.push(0);\n\n          while(!rt.empty()){\n                  int r = rt.top();\n                  rt.pop();\n                  for(auto e : adj[r]){\n                          int v = e.first;\n                          if(r) --in[v];\n                          if(!in[v]){\n                                  rt.push(v);\n                                  if(idx_ord){\n                                          auto pos = begin(seq);\n                                          bool det = 0;\n                                          for(auto i = begin(seq); i < end(seq);\n  ++i){ if(!det && v > *i) ++pos; else det = 1; if(exist[*i][v]){ pos = i + 1;\n                                                          det = 0;\n                                                  }\n                                          }\n                                          seq.insert(pos,v);\n                                  }else{\n                                          seq.push_back(v);\n                                  }\n                          }\n                  }\n          }\n\n          if(seq.size() == V) return 1;\n          return 0;\n  }*\/\n};\n\nint main() {\n  ios::sync_with_stdio(false);\n  cin.tie(0);\n\n  int V, E, r;\n  cin >> V >> E >> r;\n  D_Graph<int> G(V);\n  int s, t, d;\n  rep(i, E) {\n    cin >> s >> t >> d;\n    G.add_edge(++s, ++t, d);\n  }\n  vector<int> dist;\n  G.dijkstra(dist, ++r);\n  rep(i, V) {\n    if (dist[i + 1] < INF_32)\n      cout << dist[i + 1] << '\\n';\n    else\n      cout << \"INF\\n\";\n  }\n}\n","change":"replace","i1":33,"i2":35,"j1":33,"j2":35,"error":"MLE","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#define MAX_V 1000\n#define MAX_E 2000\n#define INF 1e9\nusing namespace std;\nstruct edge {\n  int from, to, cost;\n};\nedge es[MAX_E];\nint d[MAX_V];\nint V;\nint E;\n\nbool find_negative_loop(int s) {\n  d[s] = 0;\n  int count = 0;\n  while (true) {\n    bool update = false;\n    count++;\n    for (int i = 0; i < MAX_E; i++) {\n\n      if (d[es[i].from] != INF && d[es[i].to] > d[es[i].from] + es[i].cost) {\n        if (count == V) {\n          return true;\n        }\n        d[es[i].to] = d[es[i].from] + es[i].cost;\n        update = true;\n      }\n    }\n    if (update == false) {\n      break;\n    }\n  }\n  return false;\n}\n\nint main() {\n\n  int r;\n  cin >> V >> E >> r;\n  for (int i = 0; i < MAX_V; i++) {\n    d[i] = INF;\n  }\n  for (int i = 0; i < E; i++) {\n    cin >> es[i].from >> es[i].to >> es[i].cost;\n  }\n  if (find_negative_loop(r)) {\n    cout << \"NEGATIVE CYCLE\" << endl;\n  } else {\n    for (int i = 0; i < V; i++) {\n      if (d[i] == INF) {\n        cout << \"INF\" << endl;\n      } else {\n        cout << d[i] << endl;\n      }\n    }\n  }\n\n  return 0;\n}\n","changed_src":"#include <iostream>\n#define MAX_V 100000\n#define MAX_E 500000\n#define INF 1e9\nusing namespace std;\nstruct edge {\n  int from, to, cost;\n};\nedge es[MAX_E];\nint d[MAX_V];\nint V;\nint E;\n\nbool find_negative_loop(int s) {\n  d[s] = 0;\n  int count = 0;\n  while (true) {\n    bool update = false;\n    count++;\n    for (int i = 0; i < MAX_E; i++) {\n\n      if (d[es[i].from] != INF && d[es[i].to] > d[es[i].from] + es[i].cost) {\n        if (count == V) {\n          return true;\n        }\n        d[es[i].to] = d[es[i].from] + es[i].cost;\n        update = true;\n      }\n    }\n    if (update == false) {\n      break;\n    }\n  }\n  return false;\n}\n\nint main() {\n\n  int r;\n  cin >> V >> E >> r;\n  for (int i = 0; i < MAX_V; i++) {\n    d[i] = INF;\n  }\n  for (int i = 0; i < E; i++) {\n    cin >> es[i].from >> es[i].to >> es[i].cost;\n  }\n  if (find_negative_loop(r)) {\n    cout << \"NEGATIVE CYCLE\" << endl;\n  } else {\n    for (int i = 0; i < V; i++) {\n      if (d[i] == INF) {\n        cout << \"INF\" << endl;\n      } else {\n        cout << d[i] << endl;\n      }\n    }\n  }\n\n  return 0;\n}\n","change":"replace","i1":1,"i2":3,"j1":1,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <queue>\n#include <set>\n#include <vector>\nusing namespace std;\n\nconst int MAXN = 20020;\nint NODOS = 0;\ntypedef int Costo;\nconst Costo INF = 1 << 30;\n\ntypedef pair<Costo, int> CostoNodo;\nvector<CostoNodo> grafoCosto[MAXN];\nconst bool bi = false;\n\/\/ Grafos con ponderacion.\n\/\/ Nodos indexados de 0 a n - 1.\n\/\/ bi = true -> Bidireccional.\n\/\/ bi = false -> Dirigido.\n\nstruct Ponderada {\n  int x, y;\n  Costo c;\n  Ponderada() {}\n  Ponderada(int x_, int y_, int c_) : x(x_), y(y_), c(c_) {}\n  bool operator<(const Ponderada &q) const { return c < q.c ? true : false; }\n};\n\nvoid AgregarArista(int u, int v, Costo c) {\n  if (bi)\n    grafoCosto[v].push_back(CostoNodo(c, u));\n  grafoCosto[u].push_back(CostoNodo(c, v));\n}\n\nvoid limpia() {\n  for (int i = 0; i < NODOS; i++)\n    grafoCosto[i].clear();\n}\n\n\/\/ Algoritmo de dijkstra desde el nodo s.\n\/\/ Devuelve el vector de distancias a todos\n\/\/ los nodos desde s. Un valor INF indica que\n\/\/ no es posible ir de s al respectivo nodo.\nCosto dist[MAXN];\nvoid Dijkstra(int s) {\n  for (int i = 0; i < NODOS; i++)\n    dist[i] = INF;\n  priority_queue<CostoNodo> pq;\n  pq.push(CostoNodo(0, s)), dist[s] = 0;\n  while (!pq.empty()) {\n    Costo p = -pq.top().first;\n    int u = pq.top().second;\n    pq.pop();\n    if (dist[u] < p)\n      continue;\n    for (CostoNodo arista : grafoCosto[u]) {\n      int v = arista.second;\n      p = dist[u] + arista.first;\n      if (p < dist[v])\n        dist[v] = p, pq.push(CostoNodo(-p, v));\n    }\n  }\n}\n\nint main() {\n  cin.tie(0);\n  ios_base::sync_with_stdio(0);\n  int casos, N, M, S, T, x, y, c;\n\n  cin >> N >> M >> S;\n  NODOS = N;\n\n  limpia();\n  for (int i = 0; i < M; i++) {\n    cin >> x >> y >> c;\n    AgregarArista(x, y, c);\n  }\n  Dijkstra(S);\n\n  for (int i = 0; i < NODOS; i++) {\n    if (dist[i] == INF) {\n      cout << \"INF\\n\";\n    } else\n      cout << dist[i] << '\\n';\n  }\n\n  return 0;\n}","changed_src":"#include <iostream>\n#include <queue>\n#include <set>\n#include <vector>\nusing namespace std;\n\nconst int MAXN = 200020;\nint NODOS = 0;\ntypedef int Costo;\nconst Costo INF = 1 << 30;\n\ntypedef pair<Costo, int> CostoNodo;\nvector<CostoNodo> grafoCosto[MAXN];\nconst bool bi = false;\n\/\/ Grafos con ponderacion.\n\/\/ Nodos indexados de 0 a n - 1.\n\/\/ bi = true -> Bidireccional.\n\/\/ bi = false -> Dirigido.\n\nstruct Ponderada {\n  int x, y;\n  Costo c;\n  Ponderada() {}\n  Ponderada(int x_, int y_, int c_) : x(x_), y(y_), c(c_) {}\n  bool operator<(const Ponderada &q) const { return c < q.c ? true : false; }\n};\n\nvoid AgregarArista(int u, int v, Costo c) {\n  if (bi)\n    grafoCosto[v].push_back(CostoNodo(c, u));\n  grafoCosto[u].push_back(CostoNodo(c, v));\n}\n\nvoid limpia() {\n  for (int i = 0; i < NODOS; i++)\n    grafoCosto[i].clear();\n}\n\n\/\/ Algoritmo de dijkstra desde el nodo s.\n\/\/ Devuelve el vector de distancias a todos\n\/\/ los nodos desde s. Un valor INF indica que\n\/\/ no es posible ir de s al respectivo nodo.\nCosto dist[MAXN];\nvoid Dijkstra(int s) {\n  for (int i = 0; i < NODOS; i++)\n    dist[i] = INF;\n  priority_queue<CostoNodo> pq;\n  pq.push(CostoNodo(0, s)), dist[s] = 0;\n  while (!pq.empty()) {\n    Costo p = -pq.top().first;\n    int u = pq.top().second;\n    pq.pop();\n    if (dist[u] < p)\n      continue;\n    for (CostoNodo arista : grafoCosto[u]) {\n      int v = arista.second;\n      p = dist[u] + arista.first;\n      if (p < dist[v])\n        dist[v] = p, pq.push(CostoNodo(-p, v));\n    }\n  }\n}\n\nint main() {\n  cin.tie(0);\n  ios_base::sync_with_stdio(0);\n  int casos, N, M, S, T, x, y, c;\n\n  cin >> N >> M >> S;\n  NODOS = N;\n\n  limpia();\n  for (int i = 0; i < M; i++) {\n    cin >> x >> y >> c;\n    AgregarArista(x, y, c);\n  }\n  Dijkstra(S);\n\n  for (int i = 0; i < NODOS; i++) {\n    if (dist[i] == INF) {\n      cout << \"INF\\n\";\n    } else\n      cout << dist[i] << '\\n';\n  }\n\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"0","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\ntypedef pair<long long, long long> P;\nint v, e, r;\nstruct edge {\n  int to;\n  long long cost;\n  edge(int _to, long long _cost) : to(_to), cost(_cost) {}\n};\nvector<edge> G[100010];\nlong long d[10010];\n\nvoid dijkstra(int start) {\n  priority_queue<P, vector<P>, greater<P>> que;\n  for (int i = 0; i < v; i++)\n    d[i] = 1e12;\n  d[start] = 0;\n  que.push(P(d[r], r));\n\n  while (!que.empty()) {\n    P p = que.top();\n    que.pop();\n    int v = p.second;\n\n    if (d[v] < p.first)\n      continue;\n\n    for (int i = 0; i < G[v].size(); i++) {\n      edge e = G[v][i];\n\n      if (d[e.to] > d[v] + e.cost) {\n        d[e.to] = d[v] + e.cost;\n        que.push(P(d[e.to], e.to));\n      }\n    }\n  }\n}\nint main() {\n  cin >> v >> e >> r;\n  for (int i = 0; i < e; i++) {\n    int s, t, d;\n    cin >> s >> t >> d;\n    G[s].push_back(edge(t, d));\n  }\n\n  dijkstra(r);\n  for (int i = 0; i < v; i++) {\n    if (d[i] != 1e12)\n      cout << d[i] << endl;\n    else\n      cout << \"INF\" << endl;\n  }\n}","changed_src":"#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\ntypedef pair<long long, long long> P;\nint v, e, r;\nstruct edge {\n  int to;\n  long long cost;\n  edge(int _to, long long _cost) : to(_to), cost(_cost) {}\n};\nvector<edge> G[100010];\nlong long d[100100];\n\nvoid dijkstra(int start) {\n  priority_queue<P, vector<P>, greater<P>> que;\n  for (int i = 0; i < v; i++)\n    d[i] = 1e12;\n  d[start] = 0;\n  que.push(P(d[r], r));\n\n  while (!que.empty()) {\n    P p = que.top();\n    que.pop();\n    int v = p.second;\n\n    if (d[v] < p.first)\n      continue;\n\n    for (int i = 0; i < G[v].size(); i++) {\n      edge e = G[v][i];\n\n      if (d[e.to] > d[v] + e.cost) {\n        d[e.to] = d[v] + e.cost;\n        que.push(P(d[e.to], e.to));\n      }\n    }\n  }\n}\nint main() {\n  cin >> v >> e >> r;\n  for (int i = 0; i < e; i++) {\n    int s, t, d;\n    cin >> s >> t >> d;\n    G[s].push_back(edge(t, d));\n  }\n\n  dijkstra(r);\n  for (int i = 0; i < v; i++) {\n    if (d[i] != 1e12)\n      cout << d[i] << endl;\n    else\n      cout << \"INF\" << endl;\n  }\n}","change":"replace","i1":12,"i2":13,"j1":12,"j2":13,"error":"0","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <queue>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\n#define MAX_V 100001\n#define INF (1e9 + 1)\n\nint V, E, r, a, b, c;\nvector<int> G_t[MAX_V];\nvector<int> G_c[MAX_V];\n\nint d[MAX_V];\nvoid dijkstra() {\n  int i;\n  for (i = 0; i < MAX_V; i++)\n    d[i] = INF;\n  d[r] = 0;\n  priority_queue<pair<int, int>> Q;\n  Q.push(make_pair(-d[r], r));\n  while (!Q.empty()) {\n    pair<int, int> p = Q.top();\n    Q.top();\n    int pos = p.second, cost = -p.first;\n    if (cost > d[pos])\n      continue;\n    for (i = 0; i < G_t[pos].size(); i++) {\n      int to = G_t[pos][i];\n      int newcost = cost + G_c[pos][i];\n      if (newcost < d[to]) {\n        d[to] = newcost;\n        Q.push(make_pair(-d[to], to));\n      }\n    }\n  }\n  for (i = 0; i < V; i++) {\n    if (d[i] == INF)\n      printf(\"INF\\n\");\n    else\n      printf(\"%d\\n\", d[i]);\n  }\n}\nint main() {\n  int i;\n  scanf(\"%d%d%d\", &V, &E, &r);\n  for (i = 0; i < E; i++) {\n    scanf(\"%d%d%d\", &a, &b, &c);\n    G_t[a].push_back(b);\n    G_c[a].push_back(c);\n  }\n  dijkstra();\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <queue>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\n#define MAX_V 100001\n#define INF (1e9 + 1)\n\nint V, E, r, a, b, c;\nvector<int> G_t[MAX_V];\nvector<int> G_c[MAX_V];\n\nint d[MAX_V];\nvoid dijkstra() {\n  int i;\n  for (i = 0; i < MAX_V; i++)\n    d[i] = INF;\n  d[r] = 0;\n  priority_queue<pair<int, int>> Q;\n  Q.push(make_pair(-d[r], r));\n  while (!Q.empty()) {\n    pair<int, int> p = Q.top();\n    Q.pop();\n    int pos = p.second, cost = -p.first;\n    if (cost > d[pos])\n      continue;\n    for (i = 0; i < G_t[pos].size(); i++) {\n      int to = G_t[pos][i];\n      int newcost = cost + G_c[pos][i];\n      if (newcost < d[to]) {\n        d[to] = newcost;\n        Q.push(make_pair(-d[to], to));\n      }\n    }\n  }\n  for (i = 0; i < V; i++) {\n    if (d[i] == INF)\n      printf(\"INF\\n\");\n    else\n      printf(\"%d\\n\", d[i]);\n  }\n}\nint main() {\n  int i;\n  scanf(\"%d%d%d\", &V, &E, &r);\n  for (i = 0; i < E; i++) {\n    scanf(\"%d%d%d\", &a, &b, &c);\n    G_t[a].push_back(b);\n    G_c[a].push_back(c);\n  }\n  dijkstra();\n  return 0;\n}","change":"replace","i1":22,"i2":23,"j1":22,"j2":23,"error":"TLE","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include \"bits\/stdc++.h\"\nusing namespace std;\n\n#include <chrono>\n\n\/\/?????????\n#pragma region MACRO\n#define putans(x)                                                              \\\n  std::cerr << \"[ answer ]: \";                                                 \\\n  cout << (x) << endl\n#define dputans(x)                                                             \\\n  std::cerr << \"[ answer ]: \";                                                 \\\n  cout << setprecision(27) << (double)(x) << endl\n#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)\n#define RREP(i, a, n) for (int i = (int)(n - 1); i >= a; i--)\n#define rep(i, n) REP(i, 0, n)\n#define rrep(i, n) RREP(i, 0, n)\n#define all(a) begin((a)), end((a))\n#define mp make_pair\n#define exist(container, n) ((container).find((n)) != (container).end())\n#define equals(a, b) (fabs((a) - (b)) < EPS)\n#ifdef _DEBUG \/\/???????????????????????????????????????????????????\nstd::ifstream ifs(\"data.txt\");\n#define put ifs >>\n#else \/\/?????\u00a3????????????????????\u00a7?????????????????????\n#define put cin >>\n#endif\n#pragma endregion\n\n\/\/???????????\u00b0??????????????\u00b4\n#pragma region CODING_SUPPORT\n#ifdef _DEBUG\n#define dbg(var0)                                                              \\\n  { std::cerr << (#var0) << \"=\" << (var0) << endl; }\n#define dbg2(var0, var1)                                                       \\\n  {                                                                            \\\n    std::cerr << (#var0) << \"=\" << (var0) << \", \";                             \\\n    dbg(var1);                                                                 \\\n  }\n#define dbg3(var0, var1, var2)                                                 \\\n  {                                                                            \\\n    std::cerr << (#var0) << \"=\" << (var0) << \", \";                             \\\n    dbg2(var1, var2);                                                          \\\n  }\n#define dbgArray(a, n)                                                         \\\n  {                                                                            \\\n    std::cerr << (#a) << \"=\";                                                  \\\n    rep(i, n) { std::cerr << (a[i]) << \",\"; }                                  \\\n    cerr << endl;                                                              \\\n  }\n#else\n#define dbg(var0)                                                              \\\n  {}\n#define dbg2(var0, var1)                                                       \\\n  {}\n#define dbg3(var0, var1, var2)                                                 \\\n  {}\n#define dbgArray(a, n)                                                         \\\n  {}\n#endif\n#pragma endregion\n\/\/ typedef????????????????????????????\u00b6????????????\u00a7?????????\n#pragma region TYPE_DEF\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<string, string> pss;\ntypedef pair<int, string> pis;\ntypedef vector<string> vs;\ntypedef vector<int> vi;\n#pragma endregion\n\/\/??????????????\u00b0(???????????????????????\u00a7??????)\n#pragma region CONST_VAL\n#define PI (2 * acos(0.0))\n#define EPS (1e-10)\n#define MOD (ll)(1e9 + 7)\n#define INF (ll)(1e9)\n#pragma endregion\n\n\/\/ static const int MAX = 100;\n\/\/ static const int WHITE = 0;\n\/\/ static const int GRAY = 1;\n\/\/ static const int BLACK = 2;\n\/\/\n\/\/ static const int n = 100;\n\/\/ int d[n][n];\n\/*\nvoid floyd() {\n        rep(k, n) {\n                rep(i, n) {\n                        if (d[i][k] == INF) continue;\n                        rep(j, n) {\n                                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);\n                        }\n                }\n        }\n}\n\n void topologicalSort() {\n         auto bfs = [&](int s )->void{\n                 queue<int> q;\n        q.push(s);\n        V[s] = true;\n        while (!q.empty()) {\n                int u = q.front(); q.pop();\n                rep(i, G[u].size()) {\n                        int v = G[u][i];\n                        indeg[v]--;\n                        if (indeg[v] == 0 && !V[v]) {\n                                q.push();\n                        }\n                }\n        }\n         };\n\n         rep(i, n) {\n                 indeg[i] = 0;\n         }\n         rep(u, n) {\n                 rep(i, G[u].size()) {\n                         int v = G[u][i];\n                         indeg[v]++;\n                 }\n                 rep(i, n) {\n                         if (indeg[i] == !V[i]) bfs(u);\n                 }\/\/????????\u00a7???????????????\n         }\n\n}*\/\n\n\/\/??????????\u00a3?????????\u00b0???\n\/\/ https:\/\/www23.atwiki.jp\/akitaicpc\/pages\/65.html\n\nstruct edge {\n  int to, cost;\n};\ntypedef pair<int, int> P;\n\n\/\/ dikstra\nint V;\nstatic const int MAX_V = 10000;\nvector<edge> G[MAX_V];\nint d[MAX_V];\n\nvoid dijkstra(int s) {\n  priority_queue<P, vector<P>, greater<P>> que;\n  fill(d, d + V, INF);\n  d[s] = 0;\n  que.push(P(0, s));\n  while (!que.empty()) {\n    P p = que.top();\n    que.pop();\n    int v = p.second;\n    if (d[v] < p.first)\n      continue;\n    for (int i = 0; i < G[v].size(); i++) {\n      edge e = G[v][i];\n      if (d[e.to] > d[v] + e.cost) {\n        d[e.to] = d[v] + e.cost;\n        que.push(P(d[e.to], e.to));\n      }\n    }\n  }\n}\n\nvoid AddEdge(int from, int to, int cost) {\n  edge e = {to, cost};\n  G[from].push_back(e);\n}\n\nvoid calc() {\n  int v, e, r;\n  put v >> e >> r;\n  V = v;\n  rep(i, e) {\n    int from, to, cost;\n    put from >> to >> cost;\n    AddEdge(from, to, cost);\n  }\n  dijkstra(r);\n  rep(i, v) {\n    string ans = ((d[i] != INF ? to_string(d[i]) : \"INF\"));\n    cout << ans << endl;\n  }\n}\n\nint main() {\n  calc();\nEND:\n  return 0;\n}","changed_src":"#include \"bits\/stdc++.h\"\nusing namespace std;\n\n#include <chrono>\n\n\/\/?????????\n#pragma region MACRO\n#define putans(x)                                                              \\\n  std::cerr << \"[ answer ]: \";                                                 \\\n  cout << (x) << endl\n#define dputans(x)                                                             \\\n  std::cerr << \"[ answer ]: \";                                                 \\\n  cout << setprecision(27) << (double)(x) << endl\n#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)\n#define RREP(i, a, n) for (int i = (int)(n - 1); i >= a; i--)\n#define rep(i, n) REP(i, 0, n)\n#define rrep(i, n) RREP(i, 0, n)\n#define all(a) begin((a)), end((a))\n#define mp make_pair\n#define exist(container, n) ((container).find((n)) != (container).end())\n#define equals(a, b) (fabs((a) - (b)) < EPS)\n#ifdef _DEBUG \/\/???????????????????????????????????????????????????\nstd::ifstream ifs(\"data.txt\");\n#define put ifs >>\n#else \/\/?????\u00a3????????????????????\u00a7?????????????????????\n#define put cin >>\n#endif\n#pragma endregion\n\n\/\/???????????\u00b0??????????????\u00b4\n#pragma region CODING_SUPPORT\n#ifdef _DEBUG\n#define dbg(var0)                                                              \\\n  { std::cerr << (#var0) << \"=\" << (var0) << endl; }\n#define dbg2(var0, var1)                                                       \\\n  {                                                                            \\\n    std::cerr << (#var0) << \"=\" << (var0) << \", \";                             \\\n    dbg(var1);                                                                 \\\n  }\n#define dbg3(var0, var1, var2)                                                 \\\n  {                                                                            \\\n    std::cerr << (#var0) << \"=\" << (var0) << \", \";                             \\\n    dbg2(var1, var2);                                                          \\\n  }\n#define dbgArray(a, n)                                                         \\\n  {                                                                            \\\n    std::cerr << (#a) << \"=\";                                                  \\\n    rep(i, n) { std::cerr << (a[i]) << \",\"; }                                  \\\n    cerr << endl;                                                              \\\n  }\n#else\n#define dbg(var0)                                                              \\\n  {}\n#define dbg2(var0, var1)                                                       \\\n  {}\n#define dbg3(var0, var1, var2)                                                 \\\n  {}\n#define dbgArray(a, n)                                                         \\\n  {}\n#endif\n#pragma endregion\n\/\/ typedef????????????????????????????\u00b6????????????\u00a7?????????\n#pragma region TYPE_DEF\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<string, string> pss;\ntypedef pair<int, string> pis;\ntypedef vector<string> vs;\ntypedef vector<int> vi;\n#pragma endregion\n\/\/??????????????\u00b0(???????????????????????\u00a7??????)\n#pragma region CONST_VAL\n#define PI (2 * acos(0.0))\n#define EPS (1e-10)\n#define MOD (ll)(1e9 + 7)\n#define INF (ll)(1e9)\n#pragma endregion\n\n\/\/ static const int MAX = 100;\n\/\/ static const int WHITE = 0;\n\/\/ static const int GRAY = 1;\n\/\/ static const int BLACK = 2;\n\/\/\n\/\/ static const int n = 100;\n\/\/ int d[n][n];\n\/*\nvoid floyd() {\n        rep(k, n) {\n                rep(i, n) {\n                        if (d[i][k] == INF) continue;\n                        rep(j, n) {\n                                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);\n                        }\n                }\n        }\n}\n\n void topologicalSort() {\n         auto bfs = [&](int s )->void{\n                 queue<int> q;\n        q.push(s);\n        V[s] = true;\n        while (!q.empty()) {\n                int u = q.front(); q.pop();\n                rep(i, G[u].size()) {\n                        int v = G[u][i];\n                        indeg[v]--;\n                        if (indeg[v] == 0 && !V[v]) {\n                                q.push();\n                        }\n                }\n        }\n         };\n\n         rep(i, n) {\n                 indeg[i] = 0;\n         }\n         rep(u, n) {\n                 rep(i, G[u].size()) {\n                         int v = G[u][i];\n                         indeg[v]++;\n                 }\n                 rep(i, n) {\n                         if (indeg[i] == !V[i]) bfs(u);\n                 }\/\/????????\u00a7???????????????\n         }\n\n}*\/\n\n\/\/??????????\u00a3?????????\u00b0???\n\/\/ https:\/\/www23.atwiki.jp\/akitaicpc\/pages\/65.html\n\nstruct edge {\n  int to, cost;\n};\ntypedef pair<int, int> P;\n\n\/\/ dikstra\nint V;\nstatic const int MAX_V = 100001;\nvector<edge> G[MAX_V];\nint d[MAX_V];\n\nvoid dijkstra(int s) {\n  priority_queue<P, vector<P>, greater<P>> que;\n  fill(d, d + V, INF);\n  d[s] = 0;\n  que.push(P(0, s));\n  while (!que.empty()) {\n    P p = que.top();\n    que.pop();\n    int v = p.second;\n    if (d[v] < p.first)\n      continue;\n    for (int i = 0; i < G[v].size(); i++) {\n      edge e = G[v][i];\n      if (d[e.to] > d[v] + e.cost) {\n        d[e.to] = d[v] + e.cost;\n        que.push(P(d[e.to], e.to));\n      }\n    }\n  }\n}\n\nvoid AddEdge(int from, int to, int cost) {\n  edge e = {to, cost};\n  G[from].push_back(e);\n}\n\nvoid calc() {\n  int v, e, r;\n  put v >> e >> r;\n  V = v;\n  rep(i, e) {\n    int from, to, cost;\n    put from >> to >> cost;\n    AddEdge(from, to, cost);\n  }\n  dijkstra(r);\n  rep(i, v) {\n    string ans = ((d[i] != INF ? to_string(d[i]) : \"INF\"));\n    cout << ans << endl;\n  }\n}\n\nint main() {\n  calc();\nEND:\n  return 0;\n}","change":"replace","i1":139,"i2":140,"j1":139,"j2":140,"error":"0","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\nvector<pair<int, int>> x[500];\nint n, m, s, a, b, c, dist[500], dist2[500][500];\npriority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>\n    Q;\nvoid dijkstra(int V, int E, int s) {\n  for (int i = 0; i < V; i++)\n    dist[i] = 999999999;\n  dist[s] = 0;\n  Q.push(make_pair(0, s));\n  while (!Q.empty()) {\n    int a1 = Q.top().first, a2 = Q.top().second;\n    Q.pop();\n    for (int i = 0; i < x[a2].size(); i++) {\n      if (dist[x[a2][i].first] > a1 + x[a2][i].second) {\n        dist[x[a2][i].first] = a1 + x[a2][i].second;\n        Q.push(make_pair(dist[x[a2][i].first], x[a2][i].first));\n      }\n    }\n  }\n}\nint main() {\n  int s;\n  cin >> n >> m;\n  cin >> s;\n  for (int i = 0; i < m; i++) {\n    cin >> a >> b >> c;\n    x[a].push_back(make_pair(b, c));\n  }\n  \/*for(int i=0;i<n;i++){\n          dijkstra(n,m,i);\n          for(int j=0;j<n;j++)dist2[i][j]=dist[j];\n  }\n  int q;cin>>q;\n  for(int i=0;i<q;i++){\n          cin>>a>>b;a--;b--;\n          if(dist2[a][b]>=999999999)cout<<\"-1\"<<endl;\n          else cout<<dist2[a][b]<<endl;\n  }*\/\n  dijkstra(n, m, s);\n  for (int i = 0; i < n; i++) {\n    if (dist[i] == 999999999)\n      cout << \"INF\" << endl;\n    else\n      cout << dist[i] << endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\nvector<pair<int, int>> x[300000];\nint n, m, s, a, b, c, dist[300000], dist2[500][500];\npriority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>\n    Q;\nvoid dijkstra(int V, int E, int s) {\n  for (int i = 0; i < V; i++)\n    dist[i] = 999999999;\n  dist[s] = 0;\n  Q.push(make_pair(0, s));\n  while (!Q.empty()) {\n    int a1 = Q.top().first, a2 = Q.top().second;\n    Q.pop();\n    for (int i = 0; i < x[a2].size(); i++) {\n      if (dist[x[a2][i].first] > a1 + x[a2][i].second) {\n        dist[x[a2][i].first] = a1 + x[a2][i].second;\n        Q.push(make_pair(dist[x[a2][i].first], x[a2][i].first));\n      }\n    }\n  }\n}\nint main() {\n  int s;\n  cin >> n >> m;\n  cin >> s;\n  for (int i = 0; i < m; i++) {\n    cin >> a >> b >> c;\n    x[a].push_back(make_pair(b, c));\n  }\n  \/*for(int i=0;i<n;i++){\n          dijkstra(n,m,i);\n          for(int j=0;j<n;j++)dist2[i][j]=dist[j];\n  }\n  int q;cin>>q;\n  for(int i=0;i<q;i++){\n          cin>>a>>b;a--;b--;\n          if(dist2[a][b]>=999999999)cout<<\"-1\"<<endl;\n          else cout<<dist2[a][b]<<endl;\n  }*\/\n  dijkstra(n, m, s);\n  for (int i = 0; i < n; i++) {\n    if (dist[i] == 999999999)\n      cout << \"INF\" << endl;\n    else\n      cout << dist[i] << endl;\n  }\n  return 0;\n}","change":"replace","i1":6,"i2":8,"j1":6,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n#define int long long\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<int, pii> pip;\ntypedef vector<int> vi;\ntypedef vector<vi> vii;\ntypedef vector<pii> vpii;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define rep2(i, a, b) for (int i = (a); i < (b); i++)\n#define rrep(i, n) for (int i = (n); i >= 0; i--)\n#define rrep2(i, a, b) for (int i = (a); i > b; i--)\n#define pb push_back\n#define mp make_pair\n#define fi first\n#define se second\n#define all(a) (a).begin(), (a).end()\n\nconst int mod = 1e9 + 7;\nconst ll INF = 1 << 30;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\n\nint V, E, r;\nstruct edge {\n  int to, cost;\n};\nvector<edge> g[100000 + 5];\nint d[10000 + 5];\n\nvoid dijkstra(int s) {\n  priority_queue<pii, vector<pii>, greater<pii>> que;\n  fill(d, d + V, INF);\n  d[s] = 0;\n  que.push(pii(0, s));\n\n  while (!que.empty()) {\n    pii p = que.top();\n    que.pop();\n    int v = p.second;\n    if (d[v] < p.first)\n      continue;\n    for (int i = 0; i < g[v].size(); i++) {\n      edge e = g[v][i];\n      if (d[e.to] > d[v] + e.cost) {\n        d[e.to] = d[v] + e.cost;\n        que.push(pii(d[e.to], e.to));\n      }\n    }\n  }\n}\n\nsigned main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n  cin >> V >> E >> r;\n  rep(i, E) {\n    int s, t, d;\n    cin >> s >> t >> d;\n    g[s].pb(edge{t, d});\n  }\n  dijkstra(r);\n  rep(i, V) {\n    if (d[i] == INF)\n      cout << \"INF\" << endl;\n    else\n      cout << d[i] << endl;\n  }\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n#define int long long\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<int, pii> pip;\ntypedef vector<int> vi;\ntypedef vector<vi> vii;\ntypedef vector<pii> vpii;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define rep2(i, a, b) for (int i = (a); i < (b); i++)\n#define rrep(i, n) for (int i = (n); i >= 0; i--)\n#define rrep2(i, a, b) for (int i = (a); i > b; i--)\n#define pb push_back\n#define mp make_pair\n#define fi first\n#define se second\n#define all(a) (a).begin(), (a).end()\n\nconst int mod = 1e9 + 7;\nconst ll INF = 1 << 30;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\n\nint V, E, r;\nstruct edge {\n  int to, cost;\n};\nvector<edge> g[100000 + 5];\nint d[100000 + 5];\n\nvoid dijkstra(int s) {\n  priority_queue<pii, vector<pii>, greater<pii>> que;\n  fill(d, d + V, INF);\n  d[s] = 0;\n  que.push(pii(0, s));\n\n  while (!que.empty()) {\n    pii p = que.top();\n    que.pop();\n    int v = p.second;\n    if (d[v] < p.first)\n      continue;\n    for (int i = 0; i < g[v].size(); i++) {\n      edge e = g[v][i];\n      if (d[e.to] > d[v] + e.cost) {\n        d[e.to] = d[v] + e.cost;\n        que.push(pii(d[e.to], e.to));\n      }\n    }\n  }\n}\n\nsigned main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n  cin >> V >> E >> r;\n  rep(i, E) {\n    int s, t, d;\n    cin >> s >> t >> d;\n    g[s].pb(edge{t, d});\n  }\n  dijkstra(r);\n  rep(i, V) {\n    if (d[i] == INF)\n      cout << \"INF\" << endl;\n    else\n      cout << d[i] << endl;\n  }\n}","change":"replace","i1":31,"i2":32,"j1":31,"j2":32,"error":"0","stderr":""}
-{"problem_id":"p02361","language":"Python","original_status":"Runtime Error","original_src":"import sys\nimport queue\n\n\nclass Dijkstra:\n    class Edge:\n        def __init__(self, end, cost):\n            self.to = end\n            self.cost = cost\n\n    def __init__(self, node_size, inf):\n        self._node = node_size\n        self._graph = [[] for _ in range(self._node)]\n        self.inf = inf\n        self.dist = [self.inf for _ in range(self._node)]\n\n    def add_edge(self, st, ed, cs):\n        self._graph[st].append(self.Edge(ed, cs))\n\n    def solve(self, start):\n        que = queue.PriorityQueue()\n        self.dist[start] = 0\n        que.put((0, start))\n        while que:\n            cur_cost, cur_vertex = que.get()\n            if self.dist[cur_vertex] < cur_cost:\n                continue\n            for e in self._graph[cur_vertex]:\n                if self.dist[e.to] > cur_cost + e.cost:\n                    self.dist[e.to] = cur_cost + e.cost\n                    que.put((self.dist[e.to], e.to))\n\n\nif __name__ == \"__main__\":\n    V, E, r = map(int, sys.stdin.readline().split())\n    dk = Dijkstra(V, 10**10)\n    for i in range(E):\n        s, t, d = map(int, sys.stdin.readline().split())\n        dk.add_edge(s, t, d)\n    dk.solve(r)\n    for value in dk.dist:\n        if value == dk.inf:\n            print(\"INF\")\n        else:\n            print(value)\n","changed_src":"import sys\nimport queue\n\n\nclass Dijkstra:\n    class Edge:\n        def __init__(self, end, cost):\n            self.to = end\n            self.cost = cost\n\n    def __init__(self, node_size, inf):\n        self._node = node_size\n        self._graph = [[] for _ in range(self._node)]\n        self.inf = inf\n        self.dist = [self.inf for _ in range(self._node)]\n\n    def add_edge(self, st, ed, cs):\n        self._graph[st].append(self.Edge(ed, cs))\n\n    def solve(self, start):\n        que = queue.PriorityQueue()\n        self.dist[start] = 0\n        que.put((0, start))\n        while not que.empty():\n            cur_cost, cur_vertex = que.get()\n            if self.dist[cur_vertex] < cur_cost:\n                continue\n            for e in self._graph[cur_vertex]:\n                if self.dist[e.to] > cur_cost + e.cost:\n                    self.dist[e.to] = cur_cost + e.cost\n                    que.put((self.dist[e.to], e.to))\n\n\nif __name__ == \"__main__\":\n    V, E, r = map(int, sys.stdin.readline().split())\n    dk = Dijkstra(V, 10**10)\n    for i in range(E):\n        s, t, d = map(int, sys.stdin.readline().split())\n        dk.add_edge(s, t, d)\n    dk.solve(r)\n    for value in dk.dist:\n        if value == dk.inf:\n            print(\"INF\")\n        else:\n            print(value)\n","change":"replace","i1":23,"i2":24,"j1":23,"j2":24,"error":"TLE","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\nconst int kInfinity = 0x3F3F3F3F;\nconst int kNil = -1;\nconst int kMaxV = 10010;\n\ntemplate <class T> struct Edge {\n  using w_type = T;\n  Edge(int u, int v, w_type w) : u(u), v(v), w(w) {}\n  int u, v;\n  w_type w;\n  bool operator<(const Edge<T> &rhs) const {\n    if (w != rhs.w) {\n      return w < rhs.w;\n    }\n    if (u != rhs.u) {\n      return u < rhs.u;\n    }\n    return v < rhs.v;\n  }\n};\n\ntemplate <class Edge>\ndecltype(auto) Dijkstra(const vector<Edge> &edges,\n                        typename vector<Edge>::size_type node_num,\n                        typename vector<Edge>::size_type source) {\n  using size_type = typename vector<Edge>::size_type;\n  using w_type = typename Edge::w_type;\n\n  bitset<kMaxV> bs;\n  vector<vector<Edge>> adjacency(node_num, vector<Edge>());\n  for (const auto &e : edges) {\n    adjacency[e.u].push_back(e);\n  }\n  vector<w_type> dist(node_num, kInfinity);\n  vector<int> parent(node_num, kNil);\n  dist[source] = 0;\n\n  using Pair = pair<size_type, w_type>;\n  auto compare = [](const Pair &x, const Pair &y) {\n    return y.second < x.second || (!(x.second < y.second) && y.first < x.first);\n  };\n  priority_queue<Pair, vector<Pair>, decltype(compare)> que(compare);\n  que.emplace(source, 0);\n\n  while (!que.empty()) {\n    auto top_no = que.top().first;\n    auto top_dist = que.top().second;\n    que.pop();\n    bs.set(top_no);\n    for (const auto &e : adjacency[top_no]) {\n      const auto cost = dist[e.u] + e.w;\n      if (dist[e.v] > cost && !bs.test(e.v)) {\n        dist[e.v] = cost;\n        parent[e.v] = e.u;\n        que.emplace(e.v, cost);\n      }\n    }\n  }\n\n  return dist;\n}\n\nint main(int argc, char const *argv[]) {\n  vector<Edge<int>> edges;\n  unsigned V, E, r;\n  cin >> V >> E >> r;\n  for (unsigned i = 0; i < E; ++i) {\n    unsigned u, v;\n    unsigned w;\n    cin >> u >> v >> w;\n    edges.emplace_back(u, v, w);\n  }\n\n  auto dist = Dijkstra(edges, V, r);\n  for (unsigned i = 0; i < V; ++i) {\n    if (dist[i] == kInfinity) {\n      cout << \"INF\\n\";\n    } else {\n      cout << dist[i] << endl;\n    }\n  }\n\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\nconst int kInfinity = 0x3F3F3F3F;\nconst int kNil = -1;\nconst int kMaxV = 100010;\n\ntemplate <class T> struct Edge {\n  using w_type = T;\n  Edge(int u, int v, w_type w) : u(u), v(v), w(w) {}\n  int u, v;\n  w_type w;\n  bool operator<(const Edge<T> &rhs) const {\n    if (w != rhs.w) {\n      return w < rhs.w;\n    }\n    if (u != rhs.u) {\n      return u < rhs.u;\n    }\n    return v < rhs.v;\n  }\n};\n\ntemplate <class Edge>\ndecltype(auto) Dijkstra(const vector<Edge> &edges,\n                        typename vector<Edge>::size_type node_num,\n                        typename vector<Edge>::size_type source) {\n  using size_type = typename vector<Edge>::size_type;\n  using w_type = typename Edge::w_type;\n\n  bitset<kMaxV> bs;\n  vector<vector<Edge>> adjacency(node_num, vector<Edge>());\n  for (const auto &e : edges) {\n    adjacency[e.u].push_back(e);\n  }\n  vector<w_type> dist(node_num, kInfinity);\n  vector<int> parent(node_num, kNil);\n  dist[source] = 0;\n\n  using Pair = pair<size_type, w_type>;\n  auto compare = [](const Pair &x, const Pair &y) {\n    return y.second < x.second || (!(x.second < y.second) && y.first < x.first);\n  };\n  priority_queue<Pair, vector<Pair>, decltype(compare)> que(compare);\n  que.emplace(source, 0);\n\n  while (!que.empty()) {\n    auto top_no = que.top().first;\n    auto top_dist = que.top().second;\n    que.pop();\n    bs.set(top_no);\n    for (const auto &e : adjacency[top_no]) {\n      const auto cost = dist[e.u] + e.w;\n      if (dist[e.v] > cost && !bs.test(e.v)) {\n        dist[e.v] = cost;\n        parent[e.v] = e.u;\n        que.emplace(e.v, cost);\n      }\n    }\n  }\n\n  return dist;\n}\n\nint main(int argc, char const *argv[]) {\n  vector<Edge<int>> edges;\n  unsigned V, E, r;\n  cin >> V >> E >> r;\n  for (unsigned i = 0; i < E; ++i) {\n    unsigned u, v;\n    unsigned w;\n    cin >> u >> v >> w;\n    edges.emplace_back(u, v, w);\n  }\n\n  auto dist = Dijkstra(edges, V, r);\n  for (unsigned i = 0; i < V; ++i) {\n    if (dist[i] == kInfinity) {\n      cout << \"INF\\n\";\n    } else {\n      cout << dist[i] << endl;\n    }\n  }\n\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"0","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n#include <queue>\n#include <utility>\n\nusing namespace std;\n\nconst int Inf = 10000 * 100000 + 100;\nint a, b, V, E, R, S, Start[500000 + 10], To[500000 + 10], Dis[500000 + 10],\n    N[500000 + 10];\nint Ans[100000 + 10];\n\npriority_queue<pair<int, int>> Q;\n\n\/\/ first is the distance from R, second is the number of V\n\/\/ redefine the operator '<' to let the priority_queue making the smallest in\n\/\/ the first place\nbool operator<(pair<int, int> a, pair<int, int> b) {\n  return (a.first == b.first) ? a.second > b.second : a.first > b.first;\n}\n\nint main() {\n  cin >> V >> E >> R;\n  for (int i = 1; i <= E; i++) {\n    cin >> S >> To[i] >> Dis[i];\n    N[i] = Start[S];\n    Start[S] = i;\n  }\n\n  fill(Ans, Ans + 100010, Inf);\n  Ans[R] = 0;\n  Q.push(make_pair(0, R));\n\n  while (!Q.empty()) {\n    a = Q.top().first;\n    b = Q.top().second;\n    Q.pop();\n    if (Ans[b] == a) {\n      for (int i = Start[b]; i; i = N[i]) {\n        int t = To[i];\n        if (a + Dis[i] < Ans[t]) {\n          Ans[t] = a + Dis[i];\n          Q.push(make_pair(Ans[t], t));\n        }\n      }\n    }\n  }\n\n  for (int i = 0; i < V; i++) {\n    if (Ans[i] < Inf) {\n      cout << Ans[i] << endl;\n    } else {\n      cout << \"INF\" << endl;\n    }\n  }\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <queue>\n#include <utility>\n\nusing namespace std;\n\nconst int Inf = 10000 * 100000 + 100;\nint a, b, V, E, R, S, Start[500000 + 10], To[500000 + 10], Dis[500000 + 10],\n    N[500000 + 10];\nint Ans[100000 + 10];\n\npriority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>\n    Q;\n\nint main() {\n  cin >> V >> E >> R;\n  for (int i = 1; i <= E; i++) {\n    cin >> S >> To[i] >> Dis[i];\n    N[i] = Start[S];\n    Start[S] = i;\n  }\n\n  fill(Ans, Ans + 100010, Inf);\n  Ans[R] = 0;\n  Q.push(make_pair(0, R));\n\n  while (!Q.empty()) {\n    a = Q.top().first;\n    b = Q.top().second;\n    Q.pop();\n    if (Ans[b] == a) {\n      for (int i = Start[b]; i; i = N[i]) {\n        int t = To[i];\n        if (a + Dis[i] < Ans[t]) {\n          Ans[t] = a + Dis[i];\n          Q.push(make_pair(Ans[t], t));\n        }\n      }\n    }\n  }\n\n  for (int i = 0; i < V; i++) {\n    if (Ans[i] < Inf) {\n      cout << Ans[i] << endl;\n    } else {\n      cout << \"INF\" << endl;\n    }\n  }\n}","change":"replace","i1":12,"i2":20,"j1":12,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\n\nstruct node {\n  int id;\n  ll dp;\n};\n\nstruct edge {\n  int des;\n  ll w;\n};\n\nint n, m;\nvector<edge> adj[10007];\nll Min[100007];\nbool mark[100007];\n\nbool operator<(node a, node b) { return a.dp >= b.dp; }\n\nvoid prim(int u) {\n  fill(Min, Min + 100007, 1e11);\n  Min[u] = 0;\n  node nd;\n  nd.id = u;\n  nd.dp = 0;\n\n  priority_queue<node> q;\n  q.push(nd);\n\n  while (q.size() > 0) {\n    nd = q.top();\n    q.pop();\n    if (mark[nd.id])\n      continue;\n    mark[nd.id] = 1;\n    int u = nd.id;\n\n    for (int i = 0; i < adj[u].size(); i++) {\n      int v = adj[u][i].des;\n      int val = adj[u][i].w;\n\n      if (Min[v] <= val + nd.dp)\n        continue;\n      Min[v] = val + nd.dp;\n      node nn;\n      nn.id = v;\n      nn.dp = val + nd.dp;\n      q.push(nn);\n    }\n  }\n}\n\nint main() {\n  int u;\n  cin >> n >> m >> u;\n  for (int i = 0; i < m; i++) {\n    int x, y;\n    edge e;\n    cin >> x >> y >> e.w;\n    e.des = y;\n    adj[x].push_back(e);\n  }\n  prim(u);\n  for (int i = 0; i < n; i++) {\n    if (Min[i] < 1e11)\n      cout << Min[i] << endl;\n    else\n      cout << \"INF\" << endl;\n  }\n}","changed_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\n\nstruct node {\n  int id;\n  ll dp;\n};\n\nstruct edge {\n  int des;\n  ll w;\n};\n\nint n, m;\nvector<edge> adj[100007];\nll Min[100007];\nbool mark[100007];\n\nbool operator<(node a, node b) { return a.dp >= b.dp; }\n\nvoid prim(int u) {\n  fill(Min, Min + 100007, 1e11);\n  Min[u] = 0;\n  node nd;\n  nd.id = u;\n  nd.dp = 0;\n\n  priority_queue<node> q;\n  q.push(nd);\n\n  while (q.size() > 0) {\n    nd = q.top();\n    q.pop();\n    if (mark[nd.id])\n      continue;\n    mark[nd.id] = 1;\n    int u = nd.id;\n\n    for (int i = 0; i < adj[u].size(); i++) {\n      int v = adj[u][i].des;\n      int val = adj[u][i].w;\n\n      if (Min[v] <= val + nd.dp)\n        continue;\n      Min[v] = val + nd.dp;\n      node nn;\n      nn.id = v;\n      nn.dp = val + nd.dp;\n      q.push(nn);\n    }\n  }\n}\n\nint main() {\n  int u;\n  cin >> n >> m >> u;\n  for (int i = 0; i < m; i++) {\n    int x, y;\n    edge e;\n    cin >> x >> y >> e.w;\n    e.des = y;\n    adj[x].push_back(e);\n  }\n  prim(u);\n  for (int i = 0; i < n; i++) {\n    if (Min[i] < 1e11)\n      cout << Min[i] << endl;\n    else\n      cout << \"INF\" << endl;\n  }\n}","change":"replace","i1":16,"i2":17,"j1":16,"j2":17,"error":"0","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Time Limit Exceeded","original_src":"\/****Author: Barish Namazov****\/\n#include <bits\/stdc++.h>\n\nusing namespace std;\n\n\/***TEMPLATE***\/\n#define intt long long\n#define pii pair<intt, intt>\n\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n\n#define F first\n#define S second\n#define pb push_back\n\n#define IO                                                                     \\\n  ios_base::sync_with_stdio(false);                                            \\\n  cin.tie();\n#define endl '\\n'\n\nconst intt max4 = 10004;\nconst intt maxx = 100005;\nconst intt max6 = 1000006;\nconst intt max7 = 10000007;\n\nconst intt lg4 = 13;\nconst intt lg5 = 17;\nconst intt lg6 = 20;\n\nconst intt INF = 2LL * 1000000000;\n\n\/***************\/\n\nintt powmod(intt a, intt b, intt mod) {\n  intt res = 1;\n  a %= mod;\n  for (; b; b >>= 1) {\n    if (b & 1)\n      res = (res * a) % mod;\n    a = (a * a) % mod;\n  }\n  return res;\n}\n\nintt gcd(intt a, intt b) {\n  while (b > 0) {\n    intt t = a % b;\n    a = b, b = t;\n  }\n  return a;\n}\n\nintt lcm(intt a, intt b) { return (a \/ gcd(a, b)) * b; }\n\nintt is_prime(intt n) {\n  if (n <= 1 || n > 3 && (n % 2 == 0 || n % 3 == 0))\n    return 0;\n  for (intt i = 5, t = 2; i * i <= n; i += t, t = 6 - t)\n    if (n % i == 0)\n      return 0;\n  return 1;\n}\n\n\/**************************\/\n\nintt n, m, source;\nintt a, b, c;\nvector<pii> g[maxx];\nintt used[maxx], dis[maxx];\npriority_queue<pii, vector<pii>, greater<pii>> pq;\nint main() {\n  \/\/ freopen(\"in.txt\",\"r\",stdin);\n  \/\/ freopen(\"out.txt\",\"w\",stdout);\n  IO;\n  cin >> n >> m >> source;\n  source++;\n  for (intt i = 1; i <= m; i++) {\n    cin >> a >> b >> c;\n    a++, b++;\n    g[a].pb({b, c}); \/\/ g[b].pb ({a, c}); delete \"\/\/\" if graph is undirected\n  }\n  for (intt i = 1; i <= n; i++)\n    dis[i] = INF;\n  dis[source] = 0;\n  pq.push({0, source});\n  while (!pq.empty()) {\n    a = pq.top().S;\n    pq.pop();\n    if (used[a])\n      continue;\n    used[a] = 1;\n    for (pii u : g[a]) {\n      b = u.F, c = u.S;\n      if (dis[a] + c < dis[b]) {\n        dis[b] = dis[a] + c;\n        pq.push({dis[b], b});\n      }\n    }\n  }\n  for (intt i = 1; i <= n; i++) {\n    if (dis[i] == INF)\n      cout << \"INF\" << endl;\n    else\n      cout << dis[i] << endl;\n  }\n  return 0;\n}","changed_src":"\/****Author: Barish Namazov****\/\n#include <bits\/stdc++.h>\n\nusing namespace std;\n\n\/***TEMPLATE***\/\n#define intt long long\n#define pii pair<intt, intt>\n\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n\n#define F first\n#define S second\n#define pb push_back\n\n#define IO                                                                     \\\n  ios_base::sync_with_stdio(false);                                            \\\n  cin.tie();\n#define endl '\\n'\n\nconst intt max4 = 10004;\nconst intt maxx = 100005;\nconst intt max6 = 1000006;\nconst intt max7 = 10000007;\n\nconst intt lg4 = 13;\nconst intt lg5 = 17;\nconst intt lg6 = 20;\n\nconst intt INF = 2LL * 1000000000;\n\n\/***************\/\n\nintt powmod(intt a, intt b, intt mod) {\n  intt res = 1;\n  a %= mod;\n  for (; b; b >>= 1) {\n    if (b & 1)\n      res = (res * a) % mod;\n    a = (a * a) % mod;\n  }\n  return res;\n}\n\nintt gcd(intt a, intt b) {\n  while (b > 0) {\n    intt t = a % b;\n    a = b, b = t;\n  }\n  return a;\n}\n\nintt lcm(intt a, intt b) { return (a \/ gcd(a, b)) * b; }\n\nintt is_prime(intt n) {\n  if (n <= 1 || n > 3 && (n % 2 == 0 || n % 3 == 0))\n    return 0;\n  for (intt i = 5, t = 2; i * i <= n; i += t, t = 6 - t)\n    if (n % i == 0)\n      return 0;\n  return 1;\n}\n\n\/**************************\/\n\nintt n, m, source;\nintt a, b, c;\nvector<pii> g[maxx];\nintt used[maxx], dis[maxx];\npriority_queue<pii, vector<pii>, greater<pii>> pq;\nint main() {\n  \/\/ freopen(\"in.txt\",\"r\",stdin);\n  \/\/ freopen(\"out.txt\",\"w\",stdout);\n  IO;\n  cin >> n >> m >> source;\n  source++;\n  for (intt i = 1; i <= m; i++) {\n    cin >> a >> b >> c;\n    a++, b++;\n    g[a].pb({b, c}); \/\/ g[b].pb ({a, c}); delete \"\/\/\" if graph is undirected\n  }\n  for (intt i = 1; i <= n; i++)\n    dis[i] = INF;\n  dis[source] = 0;\n  pq.push({0, source});\n  while (!pq.empty()) {\n    a = pq.top().S;\n    pq.pop();\n    if (used[a])\n      continue;\n    used[a] = 1;\n    for (auto u : g[a]) {\n      b = u.F, c = u.S;\n      if (dis[a] + c < dis[b]) {\n        dis[b] = dis[a] + c;\n        pq.push({dis[b], b});\n      }\n    }\n  }\n  for (intt i = 1; i <= n; i++) {\n    if (dis[i] == INF)\n      cout << \"INF\" << endl;\n    else\n      cout << dis[i] << endl;\n  }\n  return 0;\n}","change":"replace","i1":92,"i2":93,"j1":92,"j2":93,"error":"TLE","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <queue>\n#include <vector>\n#define INF 50000000000\nstruct vertex {\n  std::vector<int> edge_to;\n  std::vector<int> edge_cost;\n  bool done;\n  long long int mincost;\n};\nstd::vector<vertex> G(10000);\nvoid shortest_path(int v);\nint V, E;\nint r;\nint main(void) {\n  std::cin >> V >> E >> r;\n  for (int i = 0; i < E; i++) {\n    int from, to, cost;\n    std::cin >> from >> to >> cost;\n    G[from].edge_to.push_back(to);\n    G[from].edge_cost.push_back(cost);\n    \/\/\t\tG[to].edge_to.push_back(from);\n    \/\/\t\tG[to].edge_cost.push_back(cost);\n  }\n  shortest_path(r);\n  for (int i = 0; i < V; i++) {\n    if (G[i].mincost != INF) {\n      std::cout << G[i].mincost << std::endl;\n    } else {\n      std::cout << \"INF\" << std::endl;\n    }\n  }\n  return 0;\n}\nvoid shortest_path(int v) {\n  for (int i = 0; i < V; i++) {\n    G[i].mincost = INF;\n  }\n  G[v].mincost = 0;\n  while (1) {\n    bool update = false;\n    for (int i = 0; i < V; i++) {\n      for (int j = 0; j < G[i].edge_to.size(); j++) {\n        if (G[G[i].edge_to[j]].mincost > G[i].mincost + G[i].edge_cost[j]) {\n          G[G[i].edge_to[j]].mincost = G[i].mincost + G[i].edge_cost[j];\n          update = true;\n        }\n      }\n    }\n    if (!update) {\n      break;\n    }\n  }\n}","changed_src":"#include <iostream>\n#include <queue>\n#include <vector>\n#define INF 50000000000\nstruct vertex {\n  std::vector<int> edge_to;\n  std::vector<int> edge_cost;\n  bool done;\n  long long int mincost;\n};\nstd::vector<vertex> G(100000);\nvoid shortest_path(int v);\nint V, E;\nint r;\nint main(void) {\n  std::cin >> V >> E >> r;\n  for (int i = 0; i < E; i++) {\n    int from, to, cost;\n    std::cin >> from >> to >> cost;\n    G[from].edge_to.push_back(to);\n    G[from].edge_cost.push_back(cost);\n    \/\/\t\tG[to].edge_to.push_back(from);\n    \/\/\t\tG[to].edge_cost.push_back(cost);\n  }\n  shortest_path(r);\n  for (int i = 0; i < V; i++) {\n    if (G[i].mincost != INF) {\n      std::cout << G[i].mincost << std::endl;\n    } else {\n      std::cout << \"INF\" << std::endl;\n    }\n  }\n  return 0;\n}\nvoid shortest_path(int v) {\n  for (int i = 0; i < V; i++) {\n    G[i].mincost = INF;\n  }\n  G[v].mincost = 0;\n  while (1) {\n    bool update = false;\n    for (int i = 0; i < V; i++) {\n      for (int j = 0; j < G[i].edge_to.size(); j++) {\n        if (G[G[i].edge_to[j]].mincost > G[i].mincost + G[i].edge_cost[j]) {\n          G[G[i].edge_to[j]].mincost = G[i].mincost + G[i].edge_cost[j];\n          update = true;\n        }\n      }\n    }\n    if (!update) {\n      break;\n    }\n  }\n}","change":"replace","i1":10,"i2":11,"j1":10,"j2":11,"error":"0","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cassert>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <deque>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\n#define FOR(i, k, n) for (int(i) = (k); (i) < (n); ++(i))\n#define rep(i, n) FOR(i, 0, n)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define fst first\n#define snd second\n#define all(v) begin(v), end(v)\n#define debug(x) cerr << #x << \": \" << x << endl\n#define debug2(x, y) cerr << #x << \": \" << x << \", \" << #y << \": \" << y << endl\n#define INF INT_MAX \/ 2\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\ntypedef vector<vector<int>> vvi;\ntypedef vector<ll> vll;\ntypedef vector<vector<ll>> vvll;\ntemplate <class T> using vv = vector<vector<T>>;\n\nstruct Edge {\n  int cost;\n  int to;\n};\n\nint n;\nvv<Edge> g;\nvector<int> d;\n\nvoid dijkstra(int s) {\n  d.assign(n, INF);\n  priority_queue<vi, vector<vi>> q;\n  d[s] = 0;\n  q.push({0, s}); \/\/ candidate of min-cost, edge number\n\n  while (!q.empty()) {\n    auto p = q.top(); \/\/ delete from queue\n    q.pop();\n    int v = p[1];\n    if (d[v] < p[0]) {\n      continue;\n    }\n    for (auto e : g[v]) {\n      if (d[e.to] > d[v] + e.cost) {\n        d[e.to] = d[v] + e.cost;\n        q.push({d[e.to], e.to});\n      }\n    }\n  }\n}\n\nint main() {\n  int ne, s;\n  scanf(\"%d %d %d\", &n, &ne, &s);\n  g.resize(n);\n  rep(i, ne) {\n    int a, b, d;\n    scanf(\"%d %d %d\", &a, &b, &d);\n    Edge e;\n    e.cost = d;\n    e.to = b;\n    g[a].pb(e);\n  }\n  dijkstra(s);\n  rep(i, n) {\n    if (d[i] == INF) {\n      printf(\"INF\\n\");\n    } else {\n      printf(\"%d\\n\", d[i]);\n    }\n  }\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cassert>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <deque>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\n#define FOR(i, k, n) for (int(i) = (k); (i) < (n); ++(i))\n#define rep(i, n) FOR(i, 0, n)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define fst first\n#define snd second\n#define all(v) begin(v), end(v)\n#define debug(x) cerr << #x << \": \" << x << endl\n#define debug2(x, y) cerr << #x << \": \" << x << \", \" << #y << \": \" << y << endl\n#define INF INT_MAX \/ 2\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\ntypedef vector<vector<int>> vvi;\ntypedef vector<ll> vll;\ntypedef vector<vector<ll>> vvll;\ntemplate <class T> using vv = vector<vector<T>>;\n\nstruct Edge {\n  int cost;\n  int to;\n};\n\nint n;\nvv<Edge> g;\nvector<int> d;\n\nvoid dijkstra(int s) {\n  d.assign(n, INF);\n  priority_queue<vi, vector<vi>, greater<vi>> q;\n  d[s] = 0;\n  q.push({0, s}); \/\/ candidate of min-cost, edge number\n\n  while (!q.empty()) {\n    auto p = q.top(); \/\/ delete from queue\n    q.pop();\n    int v = p[1];\n    if (d[v] < p[0]) {\n      continue;\n    }\n    for (auto e : g[v]) {\n      if (d[e.to] > d[v] + e.cost) {\n        d[e.to] = d[v] + e.cost;\n        q.push({d[e.to], e.to});\n      }\n    }\n  }\n}\n\nint main() {\n  int ne, s;\n  scanf(\"%d %d %d\", &n, &ne, &s);\n  g.resize(n);\n  rep(i, ne) {\n    int a, b, d;\n    scanf(\"%d %d %d\", &a, &b, &d);\n    Edge e;\n    e.cost = d;\n    e.to = b;\n    g[a].pb(e);\n  }\n  dijkstra(s);\n  rep(i, n) {\n    if (d[i] == INF) {\n      printf(\"INF\\n\");\n    } else {\n      printf(\"%d\\n\", d[i]);\n    }\n  }\n\n  return 0;\n}","change":"replace","i1":52,"i2":53,"j1":52,"j2":53,"error":"TLE","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n#define inf 999999999\ntypedef pair<int, int> P;\nint V, E, r;\nint d[100000];\nvector<P> edges[10000];\npriority_queue<P, vector<P>, greater<P>> q;\n\nvoid solve() {\n  P start = P(0, r);\n  d[r] = 0;\n  q.push(start);\n\n  while (!q.empty()) {\n    P p = q.top();\n    q.pop();\n    if (d[p.second] < p.first)\n      continue;\n\n    for (int i = 0; i < edges[p.second].size(); i++) {\n      P edge = edges[p.second][i];\n      P next = P(p.first + edge.second, edge.first);\n      if (d[next.second] < next.first)\n        continue;\n\n      d[next.second] = next.first;\n      q.push(next);\n    }\n  }\n\n  return;\n}\n\nint main() {\n  fill_n(d, 100000, inf);\n  cin >> V >> E >> r;\n  for (int i = 0; i < E; i++) {\n    int A, B, cost;\n    cin >> A >> B >> cost;\n    edges[A].push_back(P(B, cost));\n  }\n\n  solve();\n  for (int i = 0; i < V; i++) {\n    if (d[i] == inf) {\n      cout << \"INF\" << endl;\n    } else {\n      cout << d[i] << endl;\n    }\n  }\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n#define inf 999999999\ntypedef pair<int, int> P;\nint V, E, r;\nint d[100000];\nvector<P> edges[100000];\npriority_queue<P, vector<P>, greater<P>> q;\n\nvoid solve() {\n  P start = P(0, r);\n  d[r] = 0;\n  q.push(start);\n\n  while (!q.empty()) {\n    P p = q.top();\n    q.pop();\n    if (d[p.second] < p.first)\n      continue;\n\n    for (int i = 0; i < edges[p.second].size(); i++) {\n      P edge = edges[p.second][i];\n      P next = P(p.first + edge.second, edge.first);\n      if (d[next.second] < next.first)\n        continue;\n\n      d[next.second] = next.first;\n      q.push(next);\n    }\n  }\n\n  return;\n}\n\nint main() {\n  fill_n(d, 100000, inf);\n  cin >> V >> E >> r;\n  for (int i = 0; i < E; i++) {\n    int A, B, cost;\n    cin >> A >> B >> cost;\n    edges[A].push_back(P(B, cost));\n  }\n\n  solve();\n  for (int i = 0; i < V; i++) {\n    if (d[i] == inf) {\n      cout << \"INF\" << endl;\n    } else {\n      cout << d[i] << endl;\n    }\n  }\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"0","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <bitset>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> i_i;\ntypedef pair<long long, int> ll_i;\ntypedef pair<double, int> d_i;\ntypedef pair<long long, long long> ll_ll;\ntypedef pair<double, double> d_d;\ntypedef vector<int> vint;\ntypedef vector<char> vchar;\n\n#define PI 3.141592653589793238462643383279\n#define intinf 200000014\n#define longinf 200000000000000014LL\n#define mod 1000000007LL\n#define rep(i, n) for (i = 0; i < n; ++i)\n#define rep1(i, n) for (i = 1; i < n; ++i)\n#define rep2d(i, j, n)                                                         \\\n  for (i = 0; i < n; ++i)                                                      \\\n    for (j = i + 1; j < n; ++j)\n#define per(i, n) for (i = n - 1; i > -1; --i)\n#define int(x)                                                                 \\\n  int x;                                                                       \\\n  scanf(\"%d\", &x)\n#define int2(x, y)                                                             \\\n  int x, y;                                                                    \\\n  scanf(\"%d%d\", &x, &y)\n#define int3(x, y, z)                                                          \\\n  int x, y, z;                                                                 \\\n  scanf(\"%d%d%d\", &x, &y, &z)\n#define sc(x) cin >> x\n#define sc2(x, y) cin >> x >> y\n#define sc3(x, y, z) cin >> x >> y >> z\n#define scn(n, a) rep(i, n) cin >> a[i]\n#define sc2n(n, a, b) rep(i, n) cin >> a[i] >> b[i]\n#define pri(x) cout << x << \"\\n\"\n#define pri2(x, y) cout << x << \" \" << y << \"\\n\"\n#define pri3(x, y, z) cout << x << \" \" << y << \" \" << z << \"\\n\"\n#define pb push_back\n#define mp make_pair\n#define all(a) (a).begin(), (a).end()\n#define kabe puts(\"---------------------------\")\n#define kara puts(\"\")\n#define debug(x) cout << \" --- \" << x << \"\\n\"\n#define debug2(x, y) cout << \" --- \" << x << \" \" << y << \"\\n\"\n#define debug3(x, y, z) cout << \" --- \" << x << \" \" << y << \" \" << z << \"\\n\"\n#define debugn(i, n, a) rep(i, n) cout << \" --- \" << a[i] << \"\\n\";\n#define debugin(i, n, a) rep(i, n) printf(\" --- %10d\\n\", a[i])\n#define debugi2n(i, n, a, b) rep(i, n) printf(\" --- %10d %10d\\n\", a[i], b[i])\n#define debugiin(i, n, a)                                                      \\\n  rep(i, n) printf(\" --- %10d %10d\\n\", a[i].first, a[i].second)\n#define X first\n#define Y second\n#define eps 0.0001\n#define prid(x) printf(\"%.15lf\\n\", x)\n\nstruct edge {\n  int to, cost;\n};\n\nvector<edge> G[100000];\n\nll dijkstra(int v, int e, int r) {\n  ll res;\n  int i, j;\n  ll d[v];\n  rep(i, v) d[i] = longinf;\n  d[r] = 0LL;\n  priority_queue<ll_i> Q;\n  Q.push(mp(0LL, r));\n  for (; !Q.empty();) {\n    ll_i now = Q.top();\n    Q.pop();\n    if (d[now.Y] < now.X)\n      continue;\n    rep(i, G[now.Y].size()) {\n      edge tmp = G[now.Y][i];\n      if (d[tmp.to] > d[now.Y] + tmp.cost) {\n        d[tmp.to] = d[now.Y] + tmp.cost;\n        Q.push(mp(d[tmp.to], tmp.to));\n      }\n    }\n  }\n\n  rep(i, v) {\n    if (d[i] >= longinf)\n      pri(\"INF\");\n    else\n      pri(d[i]);\n  }\n\n  return 0;\n}\n\nsigned main(void) {\n  int i, j, tmp, tmp2;\n  for (int testcase = 0;; testcase++) {\n    int3(v, e, r);\n    rep(i, e) {\n      int3(s, t, d);\n      G[s].pb((edge){t, d});\n    }\n    dijkstra(v, e, r);\n\n    \/*\/\n\n    \/\/*\/\n    break;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <bitset>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> i_i;\ntypedef pair<long long, int> ll_i;\ntypedef pair<double, int> d_i;\ntypedef pair<long long, long long> ll_ll;\ntypedef pair<double, double> d_d;\ntypedef vector<int> vint;\ntypedef vector<char> vchar;\n\n#define PI 3.141592653589793238462643383279\n#define intinf 200000014\n#define longinf 200000000000000014LL\n#define mod 1000000007LL\n#define rep(i, n) for (i = 0; i < n; ++i)\n#define rep1(i, n) for (i = 1; i < n; ++i)\n#define rep2d(i, j, n)                                                         \\\n  for (i = 0; i < n; ++i)                                                      \\\n    for (j = i + 1; j < n; ++j)\n#define per(i, n) for (i = n - 1; i > -1; --i)\n#define int(x)                                                                 \\\n  int x;                                                                       \\\n  scanf(\"%d\", &x)\n#define int2(x, y)                                                             \\\n  int x, y;                                                                    \\\n  scanf(\"%d%d\", &x, &y)\n#define int3(x, y, z)                                                          \\\n  int x, y, z;                                                                 \\\n  scanf(\"%d%d%d\", &x, &y, &z)\n#define sc(x) cin >> x\n#define sc2(x, y) cin >> x >> y\n#define sc3(x, y, z) cin >> x >> y >> z\n#define scn(n, a) rep(i, n) cin >> a[i]\n#define sc2n(n, a, b) rep(i, n) cin >> a[i] >> b[i]\n#define pri(x) cout << x << \"\\n\"\n#define pri2(x, y) cout << x << \" \" << y << \"\\n\"\n#define pri3(x, y, z) cout << x << \" \" << y << \" \" << z << \"\\n\"\n#define pb push_back\n#define mp make_pair\n#define all(a) (a).begin(), (a).end()\n#define kabe puts(\"---------------------------\")\n#define kara puts(\"\")\n#define debug(x) cout << \" --- \" << x << \"\\n\"\n#define debug2(x, y) cout << \" --- \" << x << \" \" << y << \"\\n\"\n#define debug3(x, y, z) cout << \" --- \" << x << \" \" << y << \" \" << z << \"\\n\"\n#define debugn(i, n, a) rep(i, n) cout << \" --- \" << a[i] << \"\\n\";\n#define debugin(i, n, a) rep(i, n) printf(\" --- %10d\\n\", a[i])\n#define debugi2n(i, n, a, b) rep(i, n) printf(\" --- %10d %10d\\n\", a[i], b[i])\n#define debugiin(i, n, a)                                                      \\\n  rep(i, n) printf(\" --- %10d %10d\\n\", a[i].first, a[i].second)\n#define X first\n#define Y second\n#define eps 0.0001\n#define prid(x) printf(\"%.15lf\\n\", x)\n\nstruct edge {\n  int to, cost;\n};\n\nvector<edge> G[100000];\n\nll dijkstra(int v, int e, int r) {\n  ll res;\n  int i, j;\n  ll d[v];\n  rep(i, v) d[i] = longinf;\n  d[r] = 0LL;\n  priority_queue<ll_i, vector<ll_i>, greater<ll_i>> Q;\n  Q.push(mp(0LL, r));\n  for (; !Q.empty();) {\n    ll_i now = Q.top();\n    Q.pop();\n    if (d[now.Y] < now.X)\n      continue;\n    rep(i, G[now.Y].size()) {\n      edge tmp = G[now.Y][i];\n      if (d[tmp.to] > d[now.Y] + tmp.cost) {\n        d[tmp.to] = d[now.Y] + tmp.cost;\n        Q.push(mp(d[tmp.to], tmp.to));\n      }\n    }\n  }\n\n  rep(i, v) {\n    if (d[i] >= longinf)\n      pri(\"INF\");\n    else\n      pri(d[i]);\n  }\n\n  return 0;\n}\n\nsigned main(void) {\n  int i, j, tmp, tmp2;\n  for (int testcase = 0;; testcase++) {\n    int3(v, e, r);\n    rep(i, e) {\n      int3(s, t, d);\n      G[s].pb((edge){t, d});\n    }\n    dijkstra(v, e, r);\n\n    \/*\/\n\n    \/\/*\/\n    break;\n  }\n  return 0;\n}","change":"replace","i1":92,"i2":93,"j1":92,"j2":93,"error":"TLE","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n#include <queue>\n#define ll long long\n#define INF 100000000000000\nusing namespace std;\nint main() {\n  ios_base::sync_with_stdio(false);\n  ll V, E, r;\n  cin >> V >> E >> r;\n  vector<vector<pair<ll, ll>>> edges(V);\n  vector<ll> dist(V, INF);\n  for (ll i = 0; i < E; i++) {\n    ll s, t, d;\n    cin >> s >> t >> d;\n    edges[s].push_back(make_pair(t, d));\n  }\n  dist[r] = 0;\n  priority_queue<pair<ll, ll>> pq;\n  pq.push(make_pair(0, r));\n  while (!pq.empty()) {\n    ll source = pq.top().second;\n    pq.pop();\n    for (auto i : edges[source]) {\n      if (dist[i.first] == INF || dist[source] + i.second < dist[i.first]) {\n        dist[i.first] = dist[source] + i.second;\n        pq.push(make_pair(dist[i.first], i.first));\n      }\n    }\n  }\n  for (ll i = 0; i < V; i++) {\n    if (dist[i] == INF)\n      cout << \"INF\" << endl;\n    else\n      cout << dist[i] << endl;\n  }\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <queue>\n#define ll long long\n#define INF 100000000000000\nusing namespace std;\nint main() {\n  ios_base::sync_with_stdio(false);\n  ll V, E, r;\n  cin >> V >> E >> r;\n  vector<vector<pair<ll, ll>>> edges(V);\n  vector<ll> dist(V, INF);\n  for (ll i = 0; i < E; i++) {\n    ll s, t, d;\n    cin >> s >> t >> d;\n    edges[s].push_back(make_pair(t, d));\n  }\n  dist[r] = 0;\n  priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> pq;\n  pq.push(make_pair(0, r));\n  while (!pq.empty()) {\n    ll source = pq.top().second;\n    pq.pop();\n    for (auto i : edges[source]) {\n      if (dist[i.first] == INF || dist[source] + i.second < dist[i.first]) {\n        dist[i.first] = dist[source] + i.second;\n        pq.push(make_pair(dist[i.first], i.first));\n      }\n    }\n  }\n  for (ll i = 0; i < V; i++) {\n    if (dist[i] == INF)\n      cout << \"INF\" << endl;\n    else\n      cout << dist[i] << endl;\n  }\n}","change":"replace","i1":18,"i2":19,"j1":18,"j2":19,"error":"TLE","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n#include <queue>\n#include <vector>\n#define INF 10000000000000000\n#define ll long long\n\nusing namespace std;\n\nint main() {\n  ll V, E, r;\n  cin >> V >> E >> r;\n  vector<vector<pair<ll, ll>>> edges(V);\n  for (ll i = 0; i < E; i++) {\n    ll s, t, d;\n    cin >> s >> t >> d;\n    edges[s].push_back(make_pair(t, d));\n  }\n  vector<ll> dist(V, INF);\n  dist[r] = 0;\n  priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, less<pair<ll, ll>>> pq;\n  pq.push(make_pair(0, r));\n\n  while (!pq.empty()) {\n    ll source = pq.top().second;\n    pq.pop();\n    for (pair<ll, ll> edge : edges[source]) {\n      if (dist[edge.first] > dist[source] + edge.second) {\n        dist[edge.first] = dist[source] + edge.second;\n        pq.push(make_pair(dist[edge.first], edge.first));\n      }\n    }\n  }\n\n  for (ll i = 0; i < V; i++) {\n    if (dist[i] == INF) {\n      cout << \"INF\" << endl;\n    } else {\n      cout << dist[i] << endl;\n    }\n  }\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <queue>\n#include <vector>\n#define INF 10000000000000000\n#define ll long long\n\nusing namespace std;\n\nint main() {\n  ll V, E, r;\n  cin >> V >> E >> r;\n  vector<vector<pair<ll, ll>>> edges(V);\n  for (ll i = 0; i < E; i++) {\n    ll s, t, d;\n    cin >> s >> t >> d;\n    edges[s].push_back(make_pair(t, d));\n  }\n  vector<ll> dist(V, INF);\n  dist[r] = 0;\n  priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> pq;\n  pq.push(make_pair(0, r));\n\n  while (!pq.empty()) {\n    ll source = pq.top().second;\n    pq.pop();\n    for (pair<ll, ll> edge : edges[source]) {\n      if (dist[edge.first] > dist[source] + edge.second) {\n        dist[edge.first] = dist[source] + edge.second;\n        pq.push(make_pair(dist[edge.first], edge.first));\n      }\n    }\n  }\n\n  for (ll i = 0; i < V; i++) {\n    if (dist[i] == INF) {\n      cout << \"INF\" << endl;\n    } else {\n      cout << dist[i] << endl;\n    }\n  }\n}","change":"replace","i1":20,"i2":21,"j1":20,"j2":21,"error":"TLE","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\n#define INF (INT_MAX \/ 2)\n#define PI (2 * acos(0.0))\n#define EPS (1e-8)\n\n#define REP(i, a, b) for (int i = (a); i < (b); ++i)\n#define rep(i, n) REP(i, 0, n)\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\ntypedef int Cost;\nstruct Edge {\n  int src, dst;\n  Cost cst;\n  Edge(int s, int d, Cost c) : src(s), dst(d), cst(c) {}\n};\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\ntypedef vector<Cost> Array;\ntypedef vector<Array> Matrix;\n\nint dx[8] = {0, 1, 0, -1, 1, -1, 1, -1};\nint dy[8] = {1, 0, -1, 0, 1, -1, -1, 1};\n\nvector<Cost> dijkstra(const Graph &g, int s) {\n  const Cost inf = numeric_limits<Cost>::max() \/ 2;\n  typedef tuple<Cost, int> State;\n  priority_queue<State> q;\n  vector<Cost> dist(g.size(), inf);\n  dist[s] = 0;\n  q.emplace(0, s);\n  while (q.size()) {\n    Cost c;\n    int v;\n    tie(c, v) = q.top();\n    q.pop();\n    c *= -1;\n    if (dist[v] < c)\n      continue;\n    for (auto &e : g[v]) {\n      if (dist[e.dst] > dist[v] + e.cst) {\n        dist[e.dst] = dist[v] + e.cst;\n        q.emplace(dist[e.dst], e.dst);\n      }\n    }\n  }\n  return dist;\n}\n\nint main(void) {\n  ios_base::sync_with_stdio(false);\n  cin.tie(0);\n  int v, e, r;\n  int s, t, d;\n\n  cin >> v >> e >> r;\n\n  Graph g(v);\n  for (int i = 0; i < e; i++) {\n    cin >> s >> t >> d;\n    g[s].push_back(Edge(s, t, d));\n  }\n\n  vector<Cost> c = dijkstra(g, r);\n  for (int i = 0; i < (int)c.size(); i++) {\n    if (c[i] == numeric_limits<Cost>::max() \/ 2)\n      cout << \"INF\" << endl;\n    else\n      cout << c[i] << endl;\n  }\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\n#define INF (INT_MAX \/ 2)\n#define PI (2 * acos(0.0))\n#define EPS (1e-8)\n\n#define REP(i, a, b) for (int i = (a); i < (b); ++i)\n#define rep(i, n) REP(i, 0, n)\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\ntypedef int Cost;\nstruct Edge {\n  int src, dst;\n  Cost cst;\n  Edge(int s, int d, Cost c) : src(s), dst(d), cst(c) {}\n};\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\ntypedef vector<Cost> Array;\ntypedef vector<Array> Matrix;\n\nint dx[8] = {0, 1, 0, -1, 1, -1, 1, -1};\nint dy[8] = {1, 0, -1, 0, 1, -1, -1, 1};\n\nvector<Cost> dijkstra(const Graph &g, int s) {\n  const Cost inf = numeric_limits<Cost>::max() \/ 2;\n  typedef tuple<Cost, int> State;\n  priority_queue<State, vector<State>, greater<State>> q;\n  vector<Cost> dist(g.size(), inf);\n  dist[s] = 0;\n  q.emplace(0, s);\n  while (q.size()) {\n    Cost c;\n    int v;\n    tie(c, v) = q.top();\n    q.pop();\n    c *= -1;\n    if (dist[v] < c)\n      continue;\n    for (auto &e : g[v]) {\n      if (dist[e.dst] > dist[v] + e.cst) {\n        dist[e.dst] = dist[v] + e.cst;\n        q.emplace(dist[e.dst], e.dst);\n      }\n    }\n  }\n  return dist;\n}\n\nint main(void) {\n  ios_base::sync_with_stdio(false);\n  cin.tie(0);\n  int v, e, r;\n  int s, t, d;\n\n  cin >> v >> e >> r;\n\n  Graph g(v);\n  for (int i = 0; i < e; i++) {\n    cin >> s >> t >> d;\n    g[s].push_back(Edge(s, t, d));\n  }\n\n  vector<Cost> c = dijkstra(g, r);\n  for (int i = 0; i < (int)c.size(); i++) {\n    if (c[i] == numeric_limits<Cost>::max() \/ 2)\n      cout << \"INF\" << endl;\n    else\n      cout << c[i] << endl;\n  }\n  return 0;\n}","change":"replace","i1":32,"i2":33,"j1":32,"j2":33,"error":"TLE","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Time Limit Exceeded","original_src":"\n#include <bits\/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, j) for (int i = 0; i < (int)(j); i++)\nconstexpr int INF = 1 << 28;\nstruct Edge {\n  int to;\n  ll cost;\n  Edge(int to, ll cost) : to(to), cost(cost) {}\n};\nusing EdgeList = vector<vector<Edge>>;\nusing Vatex = int;\nconstexpr ll INFL = 1LL << 60;\nstruct State {\n  int index;\n  ll cost;\n  State(int i, ll c) : index(i), cost(c) {}\n  bool operator>(const State &r) const { return cost < r.cost; }\n};\n\/\/\n\/\/\nvector<ll> dijkstra(const EdgeList &G, int start) {\n  priority_queue<State, vector<State>, greater<State>> que;\n  vector<ll> dist(G.size(), INFL);\n  que.emplace(start, 0);\n  dist[start] = 0;\n  while (not que.empty()) {\n    State now = que.top();\n    que.pop();\n    for (Edge e : G[now.index]) {\n      if (dist[e.to] > now.cost + e.cost) {\n        State nxt = State(e.to, now.cost + e.cost);\n        dist[e.to] = nxt.cost;\n        que.push(nxt);\n      }\n    }\n  }\n  return dist;\n}\n\/\/ http:\/\/judge.u-aizu.ac.jp\/onlinejudge\/description.jsp?id=GRL_1_A&lang=jp\nint main() {\n  int N, M, R;\n  cin >> N >> M >> R;\n  EdgeList E(N);\n  rep(i, M) {\n    int a, b, c;\n    cin >> a >> b >> c;\n    E[a].push_back(Edge(b, c));\n  }\n  auto dist = dijkstra(E, R);\n  for (ll d : dist)\n    cout << (d < INFL ? to_string(d) : \"INF\") << endl;\n  return 0;\n}","changed_src":"\n#include <bits\/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, j) for (int i = 0; i < (int)(j); i++)\nconstexpr int INF = 1 << 28;\nstruct Edge {\n  int to;\n  ll cost;\n  Edge(int to, ll cost) : to(to), cost(cost) {}\n};\nusing EdgeList = vector<vector<Edge>>;\nusing Vatex = int;\nconstexpr ll INFL = 1LL << 60;\nstruct State {\n  int index;\n  ll cost;\n  State(int i, ll c) : index(i), cost(c) {}\n  bool operator>(const State &r) const { return cost > r.cost; }\n};\n\/\/\n\/\/\nvector<ll> dijkstra(const EdgeList &G, int start) {\n  priority_queue<State, vector<State>, greater<State>> que;\n  vector<ll> dist(G.size(), INFL);\n  que.emplace(start, 0);\n  dist[start] = 0;\n  while (not que.empty()) {\n    State now = que.top();\n    que.pop();\n    for (Edge e : G[now.index]) {\n      if (dist[e.to] > now.cost + e.cost) {\n        State nxt = State(e.to, now.cost + e.cost);\n        dist[e.to] = nxt.cost;\n        que.push(nxt);\n      }\n    }\n  }\n  return dist;\n}\n\/\/ http:\/\/judge.u-aizu.ac.jp\/onlinejudge\/description.jsp?id=GRL_1_A&lang=jp\nint main() {\n  int N, M, R;\n  cin >> N >> M >> R;\n  EdgeList E(N);\n  rep(i, M) {\n    int a, b, c;\n    cin >> a >> b >> c;\n    E[a].push_back(Edge(b, c));\n  }\n  auto dist = dijkstra(E, R);\n  for (ll d : dist)\n    cout << (d < INFL ? to_string(d) : \"INF\") << endl;\n  return 0;\n}","change":"replace","i1":18,"i2":19,"j1":18,"j2":19,"error":"TLE","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)\n#define REP(i, n) for (int i = 0; i < (n); i++)\n#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)\ntypedef long long LL;\nint V, E, S;\nLL d[100001];\ntypedef pair<LL, int> P;\nvector<P> G[100001];\nint main() {\n  cin >> V >> E >> S;\n  REP(i, E) {\n    int a, b;\n    LL c;\n    cin >> a >> b >> c;\n    G[a].push_back(make_pair(c, b));\n    \/\/ G[b].push_back(make_pair(c,a));\n  }\n  REP(i, 100001) { d[i] = 10e12; }\n  priority_queue<P> q;\n  q.push(make_pair(0, S));\n  while (!q.empty()) {\n    P p = q.top();\n    q.pop();\n    LL cost = p.first;\n    LL num = p.second;\n    if (d[num] < cost)\n      continue;\n    \/\/ cout<<num<<\"aaa\"<<cost<<endl;\n    d[num] = cost;\n    REP(i, G[num].size()) {\n      if (d[num] + G[num][i].first < d[G[num][i].second]) {\n        q.push(make_pair(d[num] + G[num][i].first, G[num][i].second));\n        d[G[num][i].second] = d[num] + G[num][i].first;\n      }\n    }\n  }\n  REP(i, V) {\n    if (d[i] == 10e12) {\n      cout << \"INF\" << endl;\n    } else {\n      cout << d[i] << endl;\n    }\n  }\n  return (0);\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)\n#define REP(i, n) for (int i = 0; i < (n); i++)\n#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)\ntypedef long long LL;\nint V, E, S;\nLL d[100001];\ntypedef pair<LL, int> P;\nvector<P> G[100001];\nint main() {\n  cin >> V >> E >> S;\n  REP(i, E) {\n    int a, b;\n    LL c;\n    cin >> a >> b >> c;\n    G[a].push_back(make_pair(c, b));\n    \/\/ G[b].push_back(make_pair(c,a));\n  }\n  REP(i, 100001) { d[i] = 10e12; }\n  priority_queue<P, vector<P>, greater<P>> q;\n  q.push(make_pair(0, S));\n  while (!q.empty()) {\n    P p = q.top();\n    q.pop();\n    LL cost = p.first;\n    LL num = p.second;\n    if (d[num] < cost)\n      continue;\n    \/\/ cout<<num<<\"aaa\"<<cost<<endl;\n    d[num] = cost;\n    REP(i, G[num].size()) {\n      if (d[num] + G[num][i].first < d[G[num][i].second]) {\n        q.push(make_pair(d[num] + G[num][i].first, G[num][i].second));\n        d[G[num][i].second] = d[num] + G[num][i].first;\n      }\n    }\n  }\n  REP(i, V) {\n    if (d[i] == 10e12) {\n      cout << \"INF\" << endl;\n    } else {\n      cout << d[i] << endl;\n    }\n  }\n  return (0);\n}","change":"replace","i1":21,"i2":22,"j1":21,"j2":22,"error":"TLE","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Memory Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n#include <numeric>\n\n#include <queue>\n#include <vector>\nusing namespace std;\n\n#define numof(array) (sizeof(array) \/ sizeof *(array))\n\nconst int INF = 1000000007;\nconst int MAX_V = 10000007;\n\ntypedef long long ll;\ntypedef pair<int, int> P; \/\/ first: ???????????\u00a2???second: ???????????????\n\nstruct edge {\n  int to;\n  int cost;\n};\n\nint V = 0;\nvector<edge> G[MAX_V];\nint d[MAX_V];\n\nvoid dijkstra(int s) {\n  priority_queue<P, vector<P>, greater<P>> qu;\n  fill(d, d + V, INF);\n  d[s] = 0;\n  qu.push(P(0, s));\n  while (!qu.empty()) {\n    P p = qu.top();\n    qu.pop();\n    int v = p.second;\n    if (d[v] < p.first)\n      continue;\n    for (int i = 0; i < G[v].size(); i++) {\n      edge e = G[v][i];\n      if (d[e.to] > d[v] + e.cost) {\n        d[e.to] = d[v] + e.cost;\n        qu.push(P(d[e.to], e.to));\n      }\n    }\n  }\n}\n\nint main() {\n\n  int E, r;\n  cin >> V >> E >> r;\n  for (int i = 0; i < E; i++) {\n    int s, t, d;\n    cin >> s >> t >> d;\n    edge e = {t, d};\n    \/\/    e.to = t; e.cost = d;\n    G[s].push_back(e);\n  }\n  dijkstra(r);\n  for (int i = 0; i < V; i++) {\n    if (d[i] == INF)\n      cout << \"INF\" << endl;\n    else\n      cout << d[i] << endl;\n  }\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <numeric>\n\n#include <queue>\n#include <vector>\nusing namespace std;\n\n#define numof(array) (sizeof(array) \/ sizeof *(array))\n\nconst int INF = 1000000007;\nconst int MAX_V = 1000007;\n\ntypedef long long ll;\ntypedef pair<int, int> P; \/\/ first: ???????????\u00a2???second: ???????????????\n\nstruct edge {\n  int to;\n  int cost;\n};\n\nint V = 0;\nvector<edge> G[MAX_V];\nint d[MAX_V];\n\nvoid dijkstra(int s) {\n  priority_queue<P, vector<P>, greater<P>> qu;\n  fill(d, d + V, INF);\n  d[s] = 0;\n  qu.push(P(0, s));\n  while (!qu.empty()) {\n    P p = qu.top();\n    qu.pop();\n    int v = p.second;\n    if (d[v] < p.first)\n      continue;\n    for (int i = 0; i < G[v].size(); i++) {\n      edge e = G[v][i];\n      if (d[e.to] > d[v] + e.cost) {\n        d[e.to] = d[v] + e.cost;\n        qu.push(P(d[e.to], e.to));\n      }\n    }\n  }\n}\n\nint main() {\n\n  int E, r;\n  cin >> V >> E >> r;\n  for (int i = 0; i < E; i++) {\n    int s, t, d;\n    cin >> s >> t >> d;\n    edge e = {t, d};\n    \/\/    e.to = t; e.cost = d;\n    G[s].push_back(e);\n  }\n  dijkstra(r);\n  for (int i = 0; i < V; i++) {\n    if (d[i] == INF)\n      cout << \"INF\" << endl;\n    else\n      cout << d[i] << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":11,"i2":12,"j1":11,"j2":12,"error":"MLE","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\n#define INF 1000000000\nusing namespace std;\ntypedef pair<int, int> pii;\nnamespace MyLib {\n\nclass Dijkstra {\n  struct edge {\n    int to, cost;\n    edge(int to_, int cost_) : to(to_), cost(cost_) {}\n  };\n  bool isdirected;\n  vector<int> d;\n  vector<vector<edge>> G;\n  int V, E;\n\npublic:\n  Dijkstra(int _V, bool _isdirected = true)\n      : isdirected(_isdirected), V(_V), E(0), d(V), G(V) {}\n  void add(int a, int b, int c) {\n    G[a].push_back(edge(b, c));\n    if (!isdirected)\n      G[b].push_back(edge(a, c));\n    E++;\n  }\n  void calc(int start) {\n    fill(d.begin(), d.end(), INF);\n    priority_queue<pii, vector<pii>, greater<pii>> que;\n    d[start] = 0;\n    que.push(pii(0, start));\n\n    while (!que.empty()) {\n      pii p = que.top();\n      que.pop();\n      int v = p.second;\n      if (d[v] < p.first)\n        continue;\n      for (size_t i = 0; i < G[v].size(); i++) {\n        edge e = G[v][i];\n        if (d[e.to] > d[v] + e.cost) {\n          d[e.to] = d[v] + e.cost;\n          que.push(pii(d[e.to], e.to));\n        }\n      }\n    }\n  }\n  int dist(int to) { return d[to]; }\n};\n} \/\/ namespace MyLib\nusing namespace MyLib;\nint main() {\n  int v, e, r;\n  cin >> v >> e >> r;\n  Dijkstra dk(v);\n  for (int i = 0, s, t, d; i < e; i++) {\n    cin >> s >> t >> d;\n    dk.add(s, t, d);\n  }\n  dk.calc(r);\n  for (int i = 0; i < v; i++) {\n    if (dk.dist(i) == INF)\n      cout << \"INF\" << endl;\n    else\n      cout << dk.dist(i) << endl;\n  }\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\n#define INF 1000000000\nusing namespace std;\ntypedef pair<int, int> pii;\nnamespace MyLib {\n\nclass Dijkstra {\n  struct edge {\n    int to, cost;\n    edge(int to_, int cost_) : to(to_), cost(cost_) {}\n  };\n  bool isdirected;\n  vector<int> d;\n  vector<vector<edge>> G;\n  int V, E;\n\npublic:\n  Dijkstra(int _V, bool _isdirected = true)\n      : isdirected(_isdirected), V(_V), E(0), d(_V), G(_V) {}\n  void add(int a, int b, int c) {\n    G[a].push_back(edge(b, c));\n    if (!isdirected)\n      G[b].push_back(edge(a, c));\n    E++;\n  }\n  void calc(int start) {\n    fill(d.begin(), d.end(), INF);\n    priority_queue<pii, vector<pii>, greater<pii>> que;\n    d[start] = 0;\n    que.push(pii(0, start));\n\n    while (!que.empty()) {\n      pii p = que.top();\n      que.pop();\n      int v = p.second;\n      if (d[v] < p.first)\n        continue;\n      for (size_t i = 0; i < G[v].size(); i++) {\n        edge e = G[v][i];\n        if (d[e.to] > d[v] + e.cost) {\n          d[e.to] = d[v] + e.cost;\n          que.push(pii(d[e.to], e.to));\n        }\n      }\n    }\n  }\n  int dist(int to) { return d[to]; }\n};\n} \/\/ namespace MyLib\nusing namespace MyLib;\nint main() {\n  int v, e, r;\n  cin >> v >> e >> r;\n  Dijkstra dk(v);\n  for (int i = 0, s, t, d; i < e; i++) {\n    cin >> s >> t >> d;\n    dk.add(s, t, d);\n  }\n  dk.calc(r);\n  for (int i = 0; i < v; i++) {\n    if (dk.dist(i) == INF)\n      cout << \"INF\" << endl;\n    else\n      cout << dk.dist(i) << endl;\n  }\n  return 0;\n}","change":"replace","i1":18,"i2":19,"j1":18,"j2":19,"error":"-6","stderr":"terminate called after throwing an instance of 'std::length_error'\n  what():  cannot create std::vector larger than max_size()\n"}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\n#define EPS 1e-9\n#define INF 1070000000LL\n#define MOD 1000000007LL\n#define fir first\n#define foreach(it, X) for (auto it = (X).begin(); it != (X).end(); it++)\n#define numa(x, a) for (auto x : a)\n#define ite iterator\n#define mp make_pair\n#define mt make_tuple\n#define rep(i, n) rep2(i, 0, n)\n#define rep2(i, m, n) for (int i = m; i < (n); i++)\n#define pb push_back\n#define pf push_front\n#define sec second\n#define sz(x) ((int)(x).size())\n#define ALL(c) (c).begin(), (c).end()\n#define loop(n) for (int xxxxxxxx = 0; xxxxxxxx < (n); xxxxxxxx++)\n#define gcd(a, b) __gcd(a, b)\n#define endl \"\\n\"\nusing namespace std;\ntemplate <int POS, class TUPLE>\nvoid deploy(std::ostream &os, const TUPLE &tuple) {}\ntemplate <int POS, class TUPLE, class H, class... Ts>\nvoid deploy(std::ostream &os, const TUPLE &t) {\n  os << (POS == 0 ? \"\" : \", \") << get<POS>(t);\n  deploy<POS + 1, TUPLE, Ts...>(os, t);\n}\ntemplate <class... Ts>\nstd::ostream &operator<<(std::ostream &os, const std::tuple<Ts...> &t) {\n  os << \"(\";\n  deploy<0, std::tuple<Ts...>, Ts...>(os, t);\n  os << \")\";\n  return os;\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, std::vector<T> &v) {\n  int remain = v.size();\n  os << \"{\";\n  for (auto e : v)\n    os << e << (--remain == 0 ? \"}\" : \", \");\n  return os;\n}\ntemplate <class T> std::ostream &operator<<(std::ostream &os, std::set<T> &v) {\n  int remain = v.size();\n  os << \"{\";\n  for (auto e : v)\n    os << e << (--remain == 0 ? \"}\" : \", \");\n  return os;\n}\ntemplate <class T> std::ostream &operator<<(std::ostream &os, std::queue<T> q) {\n  os << \"{\";\n  for (; !q.empty(); q.pop()) {\n    os << q.front() << (q.size() != 1 ? \", \" : \"}\");\n  }\n  return os;\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, std::priority_queue<T> q) {\n  os << \"{\";\n  for (; !q.empty(); q.pop()) {\n    os << q.top() << (q.size() != 1 ? \", \" : \"}\");\n  }\n  return os;\n}\ntemplate <class T, class K>\nstd::ostream &operator<<(std::ostream &os, std::map<T, K> &mp) {\n  int remain = mp.size();\n  os << \"{\";\n  for (auto e : mp)\n    os << \"(\" << e.first << \" -> \" << e.second << \")\"\n       << (--remain == 0 ? \"}\" : \", \");\n  return os;\n}\ntemplate <class T, class K>\nstd::ostream &operator<<(std::ostream &os, std::unordered_map<T, K> &mp) {\n  int remain = mp.size();\n  os << \"{\";\n  for (auto e : mp)\n    os << \"(\" << e.first << \" -> \" << e.second << \")\"\n       << (--remain == 0 ? \"}\" : \", \");\n  return os;\n}\n#define DEBUG1(var0)                                                           \\\n  { std::cerr << (#var0) << \"=\" << (var0) << endl; }\n#define DEBUG2(var0, var1)                                                     \\\n  {                                                                            \\\n    std::cerr << (#var0) << \"=\" << (var0) << \", \";                             \\\n    DEBUG1(var1);                                                              \\\n  }\n#define DEBUG3(var0, var1, var2)                                               \\\n  {                                                                            \\\n    std::cerr << (#var0) << \"=\" << (var0) << \", \";                             \\\n    DEBUG2(var1, var2);                                                        \\\n  }\n#define DEBUG4(var0, var1, var2, var3)                                         \\\n  {                                                                            \\\n    std::cerr << (#var0) << \"=\" << (var0) << \", \";                             \\\n    DEBUG3(var1, var2, var3);                                                  \\\n  }\n#define DEBUG5(var0, var1, var2, var3, var4)                                   \\\n  {                                                                            \\\n    std::cerr << (#var0) << \"=\" << (var0) << \", \";                             \\\n    DEBUG4(var1, var2, var3, var4);                                            \\\n  }\n#define DEBUG6(var0, var1, var2, var3, var4, var5)                             \\\n  {                                                                            \\\n    std::cerr << (#var0) << \"=\" << (var0) << \", \";                             \\\n    DEBUG5(var1, var2, var3, var4, var5);                                      \\\n  }\n\ntypedef istringstream iss;\ntypedef long long ll;\ntypedef pair<ll, ll> pi;\ntypedef stringstream sst;\ntypedef vector<ll> vi;\n#define MAX_V 1100\n\nint V, E;\nvector<pair<int, ll>> edge[MAX_V];\nll dis[MAX_V];\n\nvoid dijkstra(int s) {\n  fill(dis, dis + MAX_V, INF);\n  priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>\n      que;\n  dis[s] = 0;\n  que.push(mp(0, s));\n  while (!que.empty()) {\n    pair<ll, int> now = que.top();\n    que.pop();\n    int now_v = now.sec;\n    rep(i, sz(edge[now_v])) {\n      pair<int, ll> next = edge[now_v][i];\n      if (dis[next.fir] > dis[now_v] + next.sec) {\n        dis[next.fir] = dis[now_v] + next.sec;\n        que.push(mp(dis[next.fir], next.fir));\n      }\n    }\n  }\n}\n\nint main() {\n  cin.tie(0);\n  ios_base::sync_with_stdio(0);\n  int r;\n  cin >> V >> E >> r;\n  rep(i, E) {\n    int x, y;\n    ll z;\n    cin >> x >> y >> z;\n    edge[x].pb(mp(y, z));\n  }\n  dijkstra(r);\n  rep(i, V) {\n    if (dis[i] == INF) {\n      cout << \"INF\\n\";\n    } else {\n      cout << dis[i] << endl;\n    }\n  }\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\n#define EPS 1e-9\n#define INF 1070000000LL\n#define MOD 1000000007LL\n#define fir first\n#define foreach(it, X) for (auto it = (X).begin(); it != (X).end(); it++)\n#define numa(x, a) for (auto x : a)\n#define ite iterator\n#define mp make_pair\n#define mt make_tuple\n#define rep(i, n) rep2(i, 0, n)\n#define rep2(i, m, n) for (int i = m; i < (n); i++)\n#define pb push_back\n#define pf push_front\n#define sec second\n#define sz(x) ((int)(x).size())\n#define ALL(c) (c).begin(), (c).end()\n#define loop(n) for (int xxxxxxxx = 0; xxxxxxxx < (n); xxxxxxxx++)\n#define gcd(a, b) __gcd(a, b)\n#define endl \"\\n\"\nusing namespace std;\ntemplate <int POS, class TUPLE>\nvoid deploy(std::ostream &os, const TUPLE &tuple) {}\ntemplate <int POS, class TUPLE, class H, class... Ts>\nvoid deploy(std::ostream &os, const TUPLE &t) {\n  os << (POS == 0 ? \"\" : \", \") << get<POS>(t);\n  deploy<POS + 1, TUPLE, Ts...>(os, t);\n}\ntemplate <class... Ts>\nstd::ostream &operator<<(std::ostream &os, const std::tuple<Ts...> &t) {\n  os << \"(\";\n  deploy<0, std::tuple<Ts...>, Ts...>(os, t);\n  os << \")\";\n  return os;\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, std::vector<T> &v) {\n  int remain = v.size();\n  os << \"{\";\n  for (auto e : v)\n    os << e << (--remain == 0 ? \"}\" : \", \");\n  return os;\n}\ntemplate <class T> std::ostream &operator<<(std::ostream &os, std::set<T> &v) {\n  int remain = v.size();\n  os << \"{\";\n  for (auto e : v)\n    os << e << (--remain == 0 ? \"}\" : \", \");\n  return os;\n}\ntemplate <class T> std::ostream &operator<<(std::ostream &os, std::queue<T> q) {\n  os << \"{\";\n  for (; !q.empty(); q.pop()) {\n    os << q.front() << (q.size() != 1 ? \", \" : \"}\");\n  }\n  return os;\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, std::priority_queue<T> q) {\n  os << \"{\";\n  for (; !q.empty(); q.pop()) {\n    os << q.top() << (q.size() != 1 ? \", \" : \"}\");\n  }\n  return os;\n}\ntemplate <class T, class K>\nstd::ostream &operator<<(std::ostream &os, std::map<T, K> &mp) {\n  int remain = mp.size();\n  os << \"{\";\n  for (auto e : mp)\n    os << \"(\" << e.first << \" -> \" << e.second << \")\"\n       << (--remain == 0 ? \"}\" : \", \");\n  return os;\n}\ntemplate <class T, class K>\nstd::ostream &operator<<(std::ostream &os, std::unordered_map<T, K> &mp) {\n  int remain = mp.size();\n  os << \"{\";\n  for (auto e : mp)\n    os << \"(\" << e.first << \" -> \" << e.second << \")\"\n       << (--remain == 0 ? \"}\" : \", \");\n  return os;\n}\n#define DEBUG1(var0)                                                           \\\n  { std::cerr << (#var0) << \"=\" << (var0) << endl; }\n#define DEBUG2(var0, var1)                                                     \\\n  {                                                                            \\\n    std::cerr << (#var0) << \"=\" << (var0) << \", \";                             \\\n    DEBUG1(var1);                                                              \\\n  }\n#define DEBUG3(var0, var1, var2)                                               \\\n  {                                                                            \\\n    std::cerr << (#var0) << \"=\" << (var0) << \", \";                             \\\n    DEBUG2(var1, var2);                                                        \\\n  }\n#define DEBUG4(var0, var1, var2, var3)                                         \\\n  {                                                                            \\\n    std::cerr << (#var0) << \"=\" << (var0) << \", \";                             \\\n    DEBUG3(var1, var2, var3);                                                  \\\n  }\n#define DEBUG5(var0, var1, var2, var3, var4)                                   \\\n  {                                                                            \\\n    std::cerr << (#var0) << \"=\" << (var0) << \", \";                             \\\n    DEBUG4(var1, var2, var3, var4);                                            \\\n  }\n#define DEBUG6(var0, var1, var2, var3, var4, var5)                             \\\n  {                                                                            \\\n    std::cerr << (#var0) << \"=\" << (var0) << \", \";                             \\\n    DEBUG5(var1, var2, var3, var4, var5);                                      \\\n  }\n\ntypedef istringstream iss;\ntypedef long long ll;\ntypedef pair<ll, ll> pi;\ntypedef stringstream sst;\ntypedef vector<ll> vi;\n#define MAX_V 100100\n\nint V, E;\nvector<pair<int, ll>> edge[MAX_V];\nll dis[MAX_V];\n\nvoid dijkstra(int s) {\n  fill(dis, dis + MAX_V, INF);\n  priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>\n      que;\n  dis[s] = 0;\n  que.push(mp(0, s));\n  while (!que.empty()) {\n    pair<ll, int> now = que.top();\n    que.pop();\n    int now_v = now.sec;\n    rep(i, sz(edge[now_v])) {\n      pair<int, ll> next = edge[now_v][i];\n      if (dis[next.fir] > dis[now_v] + next.sec) {\n        dis[next.fir] = dis[now_v] + next.sec;\n        que.push(mp(dis[next.fir], next.fir));\n      }\n    }\n  }\n}\n\nint main() {\n  cin.tie(0);\n  ios_base::sync_with_stdio(0);\n  int r;\n  cin >> V >> E >> r;\n  rep(i, E) {\n    int x, y;\n    ll z;\n    cin >> x >> y >> z;\n    edge[x].pb(mp(y, z));\n  }\n  dijkstra(r);\n  rep(i, V) {\n    if (dis[i] == INF) {\n      cout << \"INF\\n\";\n    } else {\n      cout << dis[i] << endl;\n    }\n  }\n  return 0;\n}","change":"replace","i1":116,"i2":117,"j1":116,"j2":117,"error":"0","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <map>\n#include <memory>\n#include <queue>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nint N, M;\n\nstruct Edge {\n  int src, dst, weight;\n  Edge *next, *prev;\n  Edge(int s, int d, int w, Edge *n, Edge *p)\n      : src(s), dst(d), weight(w), next(n), prev(p) {}\n  Edge() : Edge(0, 0, 0, nullptr, nullptr) {}\n\n  void *operator new(size_t) {\n    static char buf[1000010];\n    static int i = 0;\n    Edge *res = (Edge *)(buf + i);\n    i += sizeof(Edge);\n    return res;\n  }\n};\n\nvector<Edge *> first;\n\nvoid add_edge(int u, int v, int d) {\n  Edge *next = first[u];\n  first[u] = new Edge(u, v, d, next, nullptr);\n  if (next != nullptr)\n    next->prev = first[u];\n}\n\nint main() {\n  int V, E, r;\n  while (cin >> V >> E >> r) {\n    first.assign(V, nullptr);\n    for (int i = 0; i < E; ++i) {\n      int s, t, d;\n      cin >> s >> t >> d;\n      add_edge(s, t, d);\n    }\n\n    using State = pair<int, int>;\n    priority_queue<State> q;\n    vector<long long> dist(V, 1e18);\n    q.emplace(0, r);\n    dist[r] = 0;\n\n    while (q.size()) {\n      long long d, v;\n      tie(d, v) = q.top();\n      q.pop();\n      d = -d;\n      if (dist[v] < d)\n        continue;\n      for (Edge *e = first[v]; e != nullptr; e = e->next) {\n        if (dist[e->dst] > e->weight + dist[v]) {\n          dist[e->dst] = e->weight + dist[v];\n          q.emplace(-dist[e->dst], e->dst);\n        }\n      }\n    }\n\n    for (int i = 0; i < V; ++i) {\n      if (dist[i] == 1e18)\n        cout << \"INF\";\n      else\n        cout << dist[i];\n      cout << '\\n';\n    }\n  }\n\n  \/\/ {\n  \/\/     vector<string> u, v;\n  \/\/     static char s[3000], t[3000];\n  \/\/     map<string,int> id;\n  \/\/     N = 0;\n  \/\/     M = 0;\n  \/\/     while(cin >> s >> t){\n  \/\/         u.push_back(s);\n  \/\/         v.push_back(t);\n  \/\/         if(id.count(s) == 0) id[s] = N++;\n  \/\/         if(id.count(t) == 0) id[t] = N++;\n  \/\/         ++M;\n  \/\/     }\n\n  \/\/     first.assign(N, nullptr);\n  \/\/     for(int i = 0; i < M; ++i){\n  \/\/         add_edge(id[u[i]], id[v[i]]);\n  \/\/     }\n  \/\/ }\n}","changed_src":"#include <iostream>\n#include <map>\n#include <memory>\n#include <queue>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nint N, M;\n\nstruct Edge {\n  int src, dst, weight;\n  Edge *next, *prev;\n  Edge(int s, int d, int w, Edge *n, Edge *p)\n      : src(s), dst(d), weight(w), next(n), prev(p) {}\n  Edge() : Edge(0, 0, 0, nullptr, nullptr) {}\n\n  void *operator new(size_t) {\n    static char buf[500010 * sizeof(Edge)];\n    static int i = 0;\n    Edge *res = (Edge *)(buf + i);\n    i += sizeof(Edge);\n    return res;\n  }\n};\n\nvector<Edge *> first;\n\nvoid add_edge(int u, int v, int d) {\n  Edge *next = first[u];\n  first[u] = new Edge(u, v, d, next, nullptr);\n  if (next != nullptr)\n    next->prev = first[u];\n}\n\nint main() {\n  int V, E, r;\n  while (cin >> V >> E >> r) {\n    first.assign(V, nullptr);\n    for (int i = 0; i < E; ++i) {\n      int s, t, d;\n      cin >> s >> t >> d;\n      add_edge(s, t, d);\n    }\n\n    using State = pair<int, int>;\n    priority_queue<State> q;\n    vector<long long> dist(V, 1e18);\n    q.emplace(0, r);\n    dist[r] = 0;\n\n    while (q.size()) {\n      long long d, v;\n      tie(d, v) = q.top();\n      q.pop();\n      d = -d;\n      if (dist[v] < d)\n        continue;\n      for (Edge *e = first[v]; e != nullptr; e = e->next) {\n        if (dist[e->dst] > e->weight + dist[v]) {\n          dist[e->dst] = e->weight + dist[v];\n          q.emplace(-dist[e->dst], e->dst);\n        }\n      }\n    }\n\n    for (int i = 0; i < V; ++i) {\n      if (dist[i] == 1e18)\n        cout << \"INF\";\n      else\n        cout << dist[i];\n      cout << '\\n';\n    }\n  }\n\n  \/\/ {\n  \/\/     vector<string> u, v;\n  \/\/     static char s[3000], t[3000];\n  \/\/     map<string,int> id;\n  \/\/     N = 0;\n  \/\/     M = 0;\n  \/\/     while(cin >> s >> t){\n  \/\/         u.push_back(s);\n  \/\/         v.push_back(t);\n  \/\/         if(id.count(s) == 0) id[s] = N++;\n  \/\/         if(id.count(t) == 0) id[t] = N++;\n  \/\/         ++M;\n  \/\/     }\n\n  \/\/     first.assign(N, nullptr);\n  \/\/     for(int i = 0; i < M; ++i){\n  \/\/         add_edge(id[u[i]], id[v[i]]);\n  \/\/     }\n  \/\/ }\n}","change":"replace","i1":19,"i2":20,"j1":19,"j2":20,"error":"0","stderr":""}
-{"problem_id":"p02361","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\n#define ll long long\n#define INF 1000000005\n#define MOD 1000000007\n#define EPS 1e-10\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)\n#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define each(a, b) for (auto &(a) : (b))\n#define all(v) (v).begin(), (v).end()\n#define len(v) (int)(v).size()\n#define zip(v) sort(all(v)), v.erase(unique(all(v)), v.end())\n#define cmx(x, y) x = max(x, y)\n#define cmn(x, y) x = min(x, y)\n#define fi first\n#define se second\n#define pb push_back\n#define show(x) cout << #x << \" = \" << (x) << endl\n#define spair(p) cout << #p << \": \" << p.fi << \" \" << p.se << endl\n#define sar(a, n)                                                              \\\n  cout << #a << \":\";                                                           \\\n  rep(pachico, n) cout << \" \" << a[pachico];                                   \\\n  cout << endl\n#define svec(v)                                                                \\\n  cout << #v << \":\";                                                           \\\n  rep(pachico, v.size()) cout << \" \" << v[pachico];                            \\\n  cout << endl\n#define svecp(v)                                                               \\\n  cout << #v << \":\";                                                           \\\n  each(pachico, v) cout << \" {\" << pachico.first << \":\" << pachico.second      \\\n                        << \"}\";                                                \\\n  cout << endl\n#define sset(s)                                                                \\\n  cout << #s << \":\";                                                           \\\n  each(pachico, s) cout << \" \" << pachico;                                     \\\n  cout << endl\n#define smap(m)                                                                \\\n  cout << #m << \":\";                                                           \\\n  each(pachico, m) cout << \" {\" << pachico.first << \":\" << pachico.second      \\\n                        << \"}\";                                                \\\n  cout << endl\n\nusing namespace std;\n\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<P> vp;\ntypedef vector<string> vs;\n\nconst int MAX_N = 100005;\n\n#define T int\n\nclass Dijkstra {\npublic:\n  struct edge {\n    int to;\n    T cost;\n  };\n  vector<vector<edge>> G;\n  vector<T> d;\n  int V;\n  using pti = pair<T, int>;\n  Dijkstra(int node_size) {\n    V = node_size;\n    G.resize(V), d.resize(V, numeric_limits<T>::max());\n  }\n  \/\/ \u7121\u5411\u30b0\u30e9\u30d5\u306e\u5834\u5408\n  void add_edge(int u, int v, T cost) { G[u].pb((edge){v, cost}); }\n  void solve(int s) {\n    set<pti> st;\n    d[s] = 0;\n    st.insert(pti(0, s));\n    while (!st.empty()) {\n      pti p = *(--st.end());\n      st.erase(--st.end());\n      int v = p.second;\n      if (d[v] < p.first)\n        continue;\n      for (auto &w : G[v]) {\n        if (d[w.to] > d[v] + w.cost) {\n          d[w.to] = d[v] + w.cost;\n          st.insert(pti(d[w.to], w.to));\n        }\n      }\n    }\n  }\n};\n\nint main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n  int n, m, r;\n  cin >> n >> m >> r;\n  Dijkstra dj(n);\n  rep(i, m) {\n    int a, b, c;\n    cin >> a >> b >> c;\n    dj.add_edge(a, b, c);\n  }\n  dj.solve(r);\n  each(val, dj.d) {\n    if (val == numeric_limits<T>::max()) {\n      cout << \"INF\\n\";\n    } else {\n      cout << val << \"\\n\";\n    }\n  }\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\n#define ll long long\n#define INF 1000000005\n#define MOD 1000000007\n#define EPS 1e-10\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)\n#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define each(a, b) for (auto &(a) : (b))\n#define all(v) (v).begin(), (v).end()\n#define len(v) (int)(v).size()\n#define zip(v) sort(all(v)), v.erase(unique(all(v)), v.end())\n#define cmx(x, y) x = max(x, y)\n#define cmn(x, y) x = min(x, y)\n#define fi first\n#define se second\n#define pb push_back\n#define show(x) cout << #x << \" = \" << (x) << endl\n#define spair(p) cout << #p << \": \" << p.fi << \" \" << p.se << endl\n#define sar(a, n)                                                              \\\n  cout << #a << \":\";                                                           \\\n  rep(pachico, n) cout << \" \" << a[pachico];                                   \\\n  cout << endl\n#define svec(v)                                                                \\\n  cout << #v << \":\";                                                           \\\n  rep(pachico, v.size()) cout << \" \" << v[pachico];                            \\\n  cout << endl\n#define svecp(v)                                                               \\\n  cout << #v << \":\";                                                           \\\n  each(pachico, v) cout << \" {\" << pachico.first << \":\" << pachico.second      \\\n                        << \"}\";                                                \\\n  cout << endl\n#define sset(s)                                                                \\\n  cout << #s << \":\";                                                           \\\n  each(pachico, s) cout << \" \" << pachico;                                     \\\n  cout << endl\n#define smap(m)                                                                \\\n  cout << #m << \":\";                                                           \\\n  each(pachico, m) cout << \" {\" << pachico.first << \":\" << pachico.second      \\\n                        << \"}\";                                                \\\n  cout << endl\n\nusing namespace std;\n\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<P> vp;\ntypedef vector<string> vs;\n\nconst int MAX_N = 100005;\n\n#define T int\n\nclass Dijkstra {\npublic:\n  struct edge {\n    int to;\n    T cost;\n  };\n  vector<vector<edge>> G;\n  vector<T> d;\n  int V;\n  using pti = pair<T, int>;\n  Dijkstra(int node_size) {\n    V = node_size;\n    G.resize(V), d.resize(V, numeric_limits<T>::max());\n  }\n  \/\/ \u7121\u5411\u30b0\u30e9\u30d5\u306e\u5834\u5408\n  void add_edge(int u, int v, T cost) { G[u].pb((edge){v, cost}); }\n  void solve(int s) {\n    set<pti> st;\n    d[s] = 0;\n    st.insert(pti(0, s));\n    while (!st.empty()) {\n      pti p = *(st.begin());\n      st.erase(st.begin());\n      int v = p.second;\n      if (d[v] < p.first)\n        continue;\n      for (auto &w : G[v]) {\n        if (d[w.to] > d[v] + w.cost) {\n          d[w.to] = d[v] + w.cost;\n          st.insert(pti(d[w.to], w.to));\n        }\n      }\n    }\n  }\n};\n\nint main() {\n  cin.tie(0);\n  ios::sync_with_stdio(false);\n  int n, m, r;\n  cin >> n >> m >> r;\n  Dijkstra dj(n);\n  rep(i, m) {\n    int a, b, c;\n    cin >> a >> b >> c;\n    dj.add_edge(a, b, c);\n  }\n  dj.solve(r);\n  each(val, dj.d) {\n    if (val == numeric_limits<T>::max()) {\n      cout << \"INF\\n\";\n    } else {\n      cout << val << \"\\n\";\n    }\n  }\n  return 0;\n}\n","change":"replace","i1":79,"i2":81,"j1":79,"j2":81,"error":"TLE","stderr":""}
-{"problem_id":"p02379","language":"Python","original_status":"Runtime Error","original_src":"import math\n\nx1, y1, x2, y2 = map(int, input().split())\nprint(f\"{math.sqrt((x2-x1)**2+(y2-y1)**2):.8f}\")\n","changed_src":"import math\n\nx1, y1, x2, y2 = map(float, input().split())\nprint(f\"{math.sqrt((x2-x1)**2+(y2-y1)**2):.8f}\")\n","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p02379","language":"Python","original_status":"Runtime Error","original_src":"x1, y1, x2, y2 = map(int, input().split())\nprint(\"%.8f\" % (((x2 - x1) ** 2 + (y2 - y1) ** 2)) ** 0.5)\n","changed_src":"x1, y1, x2, y2 = map(float, input().split())\nprint(\"%.8f\" % (((x2 - x1) ** 2 + (y2 - y1) ** 2)) ** 0.5)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"0","stderr":""}
-{"problem_id":"p02379","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\n\n#ifndef DEBUG\n#define fprintf (void)\n#endif\n\ndouble absval(double x);\n\nint main(void) {\n\n  double x1, y1, x2, y2;\n  double b = 0;\n  int n;\n  scanf(\"%lf\", &x1);\n  scanf(\"%lf\", &y1);\n  scanf(\"%lf\", &x2);\n  scanf(\"%lf\", &y2);\n  double dx = absval(x1 - x2);\n  double dy = absval(y1 - y2);\n\n  double x = dx * dx + dy * dy;\n  fprintf(stdout, \"%lf\\n\", x);\n\n  scanf(\"%d\", &n);\n\n  while (b * b < x) {\n    b++;\n  }\n  while (absval(b * b - x) > 0.000001) {\n    b = (b * b + x) \/ (2 * b);\n    fprintf(stdout, \"%f\\n\", b);\n  }\n  printf(\"%f\\n\", b);\n\n  return 0;\n}\n\ndouble absval(double x) {\n  if (x < 0) {\n    return -x;\n  } else {\n    return x;\n  }\n}","changed_src":"#include <stdio.h>\n\n#ifndef DEBUG\n#define fprintf (void)\n#endif\n\ndouble absval(double x);\n\nint main(void) {\n\n  double x1, y1, x2, y2;\n  double b = 0;\n  int n;\n  scanf(\"%lf\", &x1);\n  scanf(\"%lf\", &y1);\n  scanf(\"%lf\", &x2);\n  scanf(\"%lf\", &y2);\n  double dx = absval(x1 - x2);\n  double dy = absval(y1 - y2);\n\n  double x = dx * dx + dy * dy;\n  fprintf(stdout, \"%lf\\n\", x);\n\n  scanf(\"%d\", &n);\n\n  while (b * b < x) {\n    b++;\n  }\n  while (absval(b * b - x) > 0.0001) {\n    b = (b * b + x) \/ (2 * b);\n    fprintf(stdout, \"%f\\n\", b);\n  }\n  printf(\"%f\\n\", b);\n\n  return 0;\n}\n\ndouble absval(double x) {\n  if (x < 0) {\n    return -x;\n  } else {\n    return x;\n  }\n}","change":"replace","i1":28,"i2":29,"j1":28,"j2":29,"error":"TLE","stderr":""}
-{"problem_id":"p02379","language":"Python","original_status":"Runtime Error","original_src":"# -*- coding: utf-8 -*-\n\nimport math\n\nx1, y1, x2, y2 = map(int, input().split())\ndis = math.sqrt((x1 + x2) * (x1 + x2) + (y1 + y2) * (y1 + y2))\nprint(dis)\n","changed_src":"# -*- coding: utf-8 -*-\n\nimport math\n\nx1, y1, x2, y2 = map(float, input().split())\ndis = math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2))\nprint(dis)\n","change":"replace","i1":4,"i2":6,"j1":4,"j2":6,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"Python","original_status":"Runtime Error","original_src":"from statistics import pstdev\n\nwhile True:\n    data_count = int(input())\n    if data_count == 0:\n        break\n    print(pstdev(sum(int(x) for x in input().split())))\n","changed_src":"from statistics import pstdev\n\nwhile True:\n    data_count = int(input())\n    if data_count == 0:\n        break\n    print(pstdev(int(x) for x in input().split()))\n","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"TypeError: 'int' object is not iterable","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02381\/Python\/s197979549.py\", line 6, in <module>\n    print(pstdev(sum(int(x) for x in input().split())))\n  File \"\/usr\/lib\/python3.10\/statistics.py\", line 847, in pstdev\n    var = pvariance(data, mu)\n  File \"\/usr\/lib\/python3.10\/statistics.py\", line 807, in pvariance\n    if iter(data) is data:\nTypeError: 'int' object is not iterable\n"}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\n\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n  int n;\n  int score[100];\n  double stdev;\n\n  double a;\n\n  while (true) {\n    double sum1 = 0, sum2 = 0, ave = 0;\n\n    cin >> n;\n    if (n == 0) {\n      break;\n    } else {\n      for (int i = 0; i < n; ++i) {\n        cin >> score[i];\n        sum1 = sum1 + score[i];\n      }\n      ave = sum1 \/ n;\n      for (int i = 0; i < n; ++i) {\n        a = score[i] - ave;\n        a = a * a;\n        sum2 = sum2 + a;\n      }\n      stdev = sum2 \/ n;\n      stdev = sqrt(stdev);\n    }\n    printf(\"%.15lf\\n\", stdev);\n  }\n}","changed_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\n\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n  int n;\n  int score[1000];\n  double stdev;\n\n  double a;\n\n  while (true) {\n    double sum1 = 0, sum2 = 0, ave = 0;\n\n    cin >> n;\n    if (n == 0) {\n      break;\n    } else {\n      for (int i = 0; i < n; ++i) {\n        cin >> score[i];\n        sum1 = sum1 + score[i];\n      }\n      ave = sum1 \/ n;\n      for (int i = 0; i < n; ++i) {\n        a = score[i] - ave;\n        a = a * a;\n        sum2 = sum2 + a;\n      }\n      stdev = sum2 \/ n;\n      stdev = sqrt(stdev);\n    }\n    printf(\"%.15lf\\n\", stdev);\n  }\n}","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cmath>\n#include <iostream>\n#include <stdio.h>\n\nusing namespace std;\nint main() {\n  int n, s[99];\n  double ave, hensa[99], sum = 0;\n  cin >> n;\n  while (n != 0) {\n    for (int i = 0; n > i; i++) {\n      cin >> s[i];\n      sum += s[i];\n    }\n    ave = sum \/ n;\n    sum = 0;\n    for (int i = 0; n > i; i++) {\n      sum += (s[i] - ave) * (s[i] - ave);\n    }\n    printf(\"%.6f\\n\", sqrt(sum \/ n));\n  }\n}\n","changed_src":"#include <cmath>\n#include <iostream>\n#include <stdio.h>\n\nusing namespace std;\nint main() {\n  int n;\n  while (cin >> n, n != 0) {\n    double ave, hensa[99], sum = 0, s[999];\n    for (int i = 0; n > i; i++) {\n      cin >> s[i];\n      sum += s[i];\n    }\n    ave = sum \/ n;\n    sum = 0;\n    for (int i = 0; n > i; i++) {\n      sum += (s[i] - ave) * (s[i] - ave);\n    }\n    printf(\"%.6f\\n\", sqrt(sum \/ n));\n  }\n}\n","change":"replace","i1":6,"i2":10,"j1":6,"j2":9,"error":"TLE","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n, s[100];\n\n  while (cin >> n, n) {\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n    }\n    int sum = 0;\n    for (int i = 0; i < n; i++) {\n      sum += s[i];\n    }\n    double m = 1.0 * sum \/ n;\n\n    double t = 0;\n    for (int i = 0; i < n; i++) {\n      t += (s[i] - m) * (s[i] - m);\n    }\n\n    double a = sqrt(t \/ n);\n    printf(\"%.6f\\n\", a);\n  }\n\n  return 0;\n}","changed_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n, s[1000];\n\n  while (cin >> n, n) {\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n    }\n    int sum = 0;\n    for (int i = 0; i < n; i++) {\n      sum += s[i];\n    }\n    double m = 1.0 * sum \/ n;\n\n    double t = 0;\n    for (int i = 0; i < n; i++) {\n      t += (s[i] - m) * (s[i] - m);\n    }\n\n    double a = sqrt(t \/ n);\n    printf(\"%.6f\\n\", a);\n  }\n\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  double b, s[100], n;\n  long x;\n  while (1) {\n    cin >> n;\n    if (n == 0)\n      break;\n    x = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      x += s[i];\n    }\n    double m = x \/ n;\n    b = 0;\n    for (int i = 0; i < n; i++) {\n      b += (s[i] - m) * (s[i] - m);\n    }\n    printf(\"%.8lf\\n\", sqrt(b \/ n));\n  }\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  double b, s[1000], n, x;\n  while (1) {\n    cin >> n;\n    if (n == 0)\n      break;\n    x = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      x += s[i];\n    }\n    double m = x \/ n;\n    b = 0;\n    for (int i = 0; i < n; i++) {\n      b += (s[i] - m) * (s[i] - m);\n    }\n    printf(\"%.8lf\\n\", sqrt(b \/ n));\n  }\n  return 0;\n}\n","change":"replace","i1":4,"i2":6,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\n#include <cmath>\n\nint main() {\n  double m, n, a, s[100];\n  for (int j = 0; j < 100; j++) {\n    cin >> n;\n    if (n == 0)\n      break;\n    m = 0;\n    a = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      m += s[i];\n    }\n    m \/= n;\n    for (int i = 0; i < n; i++) {\n      a += pow(s[i] - m, 2);\n    }\n    a \/= n;\n    cout << sqrt(a) << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n#include <cmath>\n\nint main() {\n  double m, n, a, s[1000];\n  for (int j = 0; j < 100; j++) {\n    cin >> n;\n    if (n == 0)\n      break;\n    m = 0;\n    a = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      m += s[i];\n    }\n    m \/= n;\n    for (int i = 0; i < n; i++) {\n      a += pow(s[i] - m, 2);\n    }\n    a \/= n;\n    cout << sqrt(a) << endl;\n  }\n  return 0;\n}","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iomanip>\n#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main(void) {\n  int n;\n  int *score;\n  double ave, S;\n\n  while (true) {\n    cin >> n;\n\n    score = new int[n];\n\n    S = ave = 0.0;\n    for (int i = 0; i < n; i++) {\n      cin >> score[i];\n      ave += score[i];\n    }\n    ave \/= n;\n\n    for (int i = 0; i < n; i++) {\n      S += (score[i] - ave) * (score[i] - ave);\n    }\n\n    cout << fixed << setprecision(10) << sqrt(S \/ n) << \"\\n\";\n\n    delete[] score;\n  }\n\n  return 0;\n}","changed_src":"#include <iomanip>\n#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main(void) {\n  int n;\n  int *score;\n  double ave, S;\n\n  while (true) {\n    cin >> n;\n\n    if (n == 0)\n      break;\n\n    score = new int[n];\n\n    S = ave = 0.0;\n    for (int i = 0; i < n; i++) {\n      cin >> score[i];\n      ave += score[i];\n    }\n    ave \/= n;\n\n    for (int i = 0; i < n; i++) {\n      S += (score[i] - ave) * (score[i] - ave);\n    }\n\n    cout << fixed << setprecision(10) << sqrt(S \/ n) << \"\\n\";\n\n    delete[] score;\n  }\n\n  return 0;\n}","change":"insert","i1":12,"i2":12,"j1":12,"j2":15,"error":"TLE","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int n;\n  float m, tmp;\n  int s[100] = {};\n  while (true) {\n    cin >> n;\n    if (n == 0)\n      break;\n    m = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      m += s[i];\n    }\n    m \/= n;\n    tmp = 0;\n    for (int i = 0; i < n; i++) {\n      tmp += (s[i] - m) * (s[i] - m);\n    }\n    cout << sqrt(tmp \/ n) << endl;\n  }\n}\n","changed_src":"#include <cmath>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int n;\n  float m, tmp;\n  int s[1000] = {};\n  while (true) {\n    cin >> n;\n    if (n == 0)\n      break;\n    m = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      m += s[i];\n    }\n    m \/= n;\n    tmp = 0;\n    for (int i = 0; i < n; i++) {\n      tmp += (s[i] - m) * (s[i] - m);\n    }\n    cout << sqrt(tmp \/ n) << endl;\n  }\n}\n","change":"replace","i1":8,"i2":9,"j1":8,"j2":9,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#define _CRT_SECURE_NO_WARNINGS\n#define _USE_MATH_DEFINES\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <queue>\n#include <string>\n#include <utility>\n#include <vector>\n#define INF 2147483647\n\nusing namespace std;\n\nint main() {\n  double s[105], ave, a;\n  int n;\n\n  while (1) {\n    cin >> n;\n    if (n == 0)\n      break;\n    ave = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      ave += s[i];\n    }\n    ave \/= n;\n    a = 0;\n    for (int i = 0; i < n; i++) {\n      a += pow((s[i] - ave), 2);\n    }\n    a \/= n;\n    cout << fixed << setprecision(8) << sqrt(a) << endl;\n  }\n\n  return (0);\n}","changed_src":"#define _CRT_SECURE_NO_WARNINGS\n#define _USE_MATH_DEFINES\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <queue>\n#include <string>\n#include <utility>\n#include <vector>\n#define INF 2147483647\n\nusing namespace std;\n\nint main() {\n  double s[1005], ave, a;\n  int n;\n\n  while (1) {\n    cin >> n;\n    if (n == 0)\n      break;\n    ave = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      ave += s[i];\n    }\n    ave \/= n;\n    a = 0;\n    for (int i = 0; i < n; i++) {\n      a += pow((s[i] - ave), 2);\n    }\n    a \/= n;\n    cout << fixed << setprecision(8) << sqrt(a) << endl;\n  }\n\n  return (0);\n}","change":"replace","i1":18,"i2":19,"j1":18,"j2":19,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <cstdlib>\n#include <iomanip>\n#include <iostream>\n#include <stdio.h>\n#include <string.h>\n#include <string>\n\nusing namespace std;\n\nint main() {\n\n  int n, s[100];\n  double m, a2;\n  while (1) {\n    scanf(\"%d\\n\", &n);\n    if (n == 0)\n      return 0;\n    m = 0;\n    a2 = 0;\n    for (int i = 0; i < n; i++) {\n      scanf(\"%d\", &s[i]);\n      m += s[i];\n    }\n    m \/= n;\n    for (int i = 0; i < n; i++) {\n      a2 += pow(s[i] - m, 2);\n    }\n    printf(\"%.8lf\\n\", sqrt(a2 \/ n));\n  }\n}\n","changed_src":"#include <cmath>\n#include <cstdlib>\n#include <iomanip>\n#include <iostream>\n#include <stdio.h>\n#include <string.h>\n#include <string>\n\nusing namespace std;\n\nint main() {\n\n  int n, s[1000];\n  double m, a2;\n  while (1) {\n    scanf(\"%d\\n\", &n);\n    if (n == 0)\n      return 0;\n    m = 0;\n    a2 = 0;\n    for (int i = 0; i < n; i++) {\n      scanf(\"%d\", &s[i]);\n      m += s[i];\n    }\n    m \/= n;\n    for (int i = 0; i < n; i++) {\n      a2 += pow(s[i] - m, 2);\n    }\n    printf(\"%.8lf\\n\", sqrt(a2 \/ n));\n  }\n}\n","change":"replace","i1":12,"i2":13,"j1":12,"j2":13,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <iomanip>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  while (true) {\n    int n;\n    cin >> n;\n    if (n == 0)\n      break;\n    double s[100], a = 0, m = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      m += s[i];\n    }\n    m \/= n;\n    for (int i = 0; i < n; i++)\n      a += pow(s[i] - m, 2);\n    a \/= n;\n    a = pow(a, 0.5);\n    cout << fixed << setprecision(10) << a << endl;\n  }\n}\n","changed_src":"#include <cmath>\n#include <iomanip>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  while (true) {\n    int n;\n    cin >> n;\n    if (n == 0)\n      break;\n    double s[1000], a = 0, m = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      m += s[i];\n    }\n    m \/= n;\n    for (int i = 0; i < n; i++)\n      a += pow(s[i] - m, 2);\n    a \/= n;\n    a = pow(a, 0.5);\n    cout << fixed << setprecision(10) << a << endl;\n  }\n}\n","change":"replace","i1":11,"i2":12,"j1":11,"j2":12,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <math.h>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\n\nint main() {\n  vector<int> v(100, 0);\n  int i, n, sum;\n  double a = 0;\n\n  while (cin >> n, n != 0) {\n    for (i = 0; i < n; i++) {\n      cin >> v[i];\n      sum += v[i];\n    }\n\n    double m = (double)sum \/ (double)n;\n\n    for (i = 0; i < n; i++) {\n      a += pow((v[i] - m), 2) \/ n;\n    }\n    printf(\"%.8f\\n\", sqrt(a));\n    a = 0;\n    sum = 0;\n    v.erase(v.begin(), v.end());\n  }\n\n  return 0;\n}","changed_src":"#include <iostream>\n#include <math.h>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\n\nint main() {\n  vector<int> v(1024, 0);\n  int i, n, sum;\n  double a = 0;\n\n  while (cin >> n, n != 0) {\n    for (i = 0; i < n; i++) {\n      cin >> v[i];\n      sum += v[i];\n    }\n\n    double m = (double)sum \/ (double)n;\n\n    for (i = 0; i < n; i++) {\n      a += pow((v[i] - m), 2) \/ n;\n    }\n    printf(\"%.8f\\n\", sqrt(a));\n    a = 0;\n    sum = 0;\n    v.erase(v.begin(), v.end());\n  }\n\n  return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cmath>\n#include <iomanip>\n#include <iostream>\nusing namespace std;\nint main() {\n  int n;\n  long double ave;      \/\/??????\n  long double sum1 = 0; \/\/????\u00a8????\n  long double sum2 = 0;\n  int s[100] = {0}; \/\/??????\n  long double a;    \/\/?????\u00a3\n\n  while (1) {\n    cin >> n;\n    if (n == 0)\n      break;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      sum1 += s[i];\n    }\n    ave = sum1 \/ n;\n    for (int i = 0; i < n; i++)\n      sum2 += (s[i] - ave) * (s[i] - ave);\n\n    a = sum2 \/ n;\n    cout << fixed << setprecision(6) << sqrt(a) << endl;\n    sum1 = 0;\n    sum2 = 0;\n    ave = 0;\n  }\n}\n","changed_src":"#include <cmath>\n#include <iomanip>\n#include <iostream>\nusing namespace std;\nint main() {\n  int n;\n  long double ave;      \/\/??????\n  long double sum1 = 0; \/\/????\u00a8????\n  long double sum2 = 0;\n  int s[1000] = {0}; \/\/??????\n  long double a;     \/\/?????\u00a3\n\n  while (1) {\n    cin >> n;\n    if (n == 0)\n      break;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      sum1 += s[i];\n    }\n    ave = sum1 \/ n;\n    for (int i = 0; i < n; i++)\n      sum2 += (s[i] - ave) * (s[i] - ave);\n\n    a = sum2 \/ n;\n    cout << fixed << setprecision(6) << sqrt(a) << endl;\n    sum1 = 0;\n    sum2 = 0;\n    ave = 0;\n  }\n}\n","change":"replace","i1":9,"i2":11,"j1":9,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cctype>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <utility>\n#include <vector>\nconst int inf = 0x7fffffff;\ntypedef long long int ll;\nusing namespace std;\nconst int N = 100 + 5;\ndouble A[N];\nint main() {\n  \/\/ #ifdef DEBUG\n  \/\/\tfreopen(\"in\", \"r\", stdin);\n  \/\/\/\/\tfreopen(\"out\", \"w\", stdout);\n  \/\/ #endif\n  int n;\n  while (scanf(\"%d\", &n) != EOF && n) {\n    double sum = 0;\n    double ans = 0;\n    for (int i = 0; i < n; i++) {\n      scanf(\"%lf\", &A[i]);\n      sum += A[i];\n    }\n    sum \/= n;\n    \/\/\tcout<<sum<<endl;\n    for (int i = 0; i < n; i++) {\n      ans += (A[i] - sum) * (A[i] - sum);\n    }\n    ans = sqrt(ans \/ n);\n    printf(\"%f\\n\", ans);\n  }\n  \/\/ insert code above\n  return 0;\n}\n\/\/ aoj1_10_c.cc","changed_src":"#include <algorithm>\n#include <cctype>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <utility>\n#include <vector>\nconst int inf = 0x7fffffff;\ntypedef long long int ll;\nusing namespace std;\nconst int N = 1000 + 5;\ndouble A[N];\nint main() {\n  \/\/ #ifdef DEBUG\n  \/\/\tfreopen(\"in\", \"r\", stdin);\n  \/\/\/\/\tfreopen(\"out\", \"w\", stdout);\n  \/\/ #endif\n  int n;\n  while (scanf(\"%d\", &n) != EOF && n) {\n    double sum = 0;\n    double ans = 0;\n    for (int i = 0; i < n; i++) {\n      scanf(\"%lf\", &A[i]);\n      sum += A[i];\n    }\n    sum \/= n;\n    \/\/\tcout<<sum<<endl;\n    for (int i = 0; i < n; i++) {\n      ans += (A[i] - sum) * (A[i] - sum);\n    }\n    ans = sqrt(ans \/ n);\n    printf(\"%f\\n\", ans);\n  }\n  \/\/ insert code above\n  return 0;\n}\n\/\/ aoj1_10_c.cc","change":"replace","i1":16,"i2":17,"j1":16,"j2":17,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n  double s[100], a, m;\n\n  while (1) {\n    cin >> n;\n\n    if (n == 0)\n      break;\n\n    double all = 0, z = 0;\n\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      all += s[i];\n    }\n\n    m = all \/ n;\n\n    for (int i = 0; i < n; i++) {\n      z += pow(s[i] - m, 2);\n    }\n\n    a = sqrt(z \/ n);\n\n    printf(\"%f\\n\", a);\n    \/\/ printf(\"test all=%.10f m=%.10f z=%.10f\\n\",all,m,z); \/\/test\n  }\n\n  return 0;\n}","changed_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n  double s[1000], a, m;\n\n  while (1) {\n    cin >> n;\n\n    if (n == 0)\n      break;\n\n    double all = 0, z = 0;\n\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      all += s[i];\n    }\n\n    m = all \/ n;\n\n    for (int i = 0; i < n; i++) {\n      z += pow(s[i] - m, 2);\n    }\n\n    a = sqrt(z \/ n);\n\n    printf(\"%f\\n\", a);\n    \/\/ printf(\"test all=%.10f m=%.10f z=%.10f\\n\",all,m,z); \/\/test\n  }\n\n  return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iomanip>\n#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main() {\n  int n, s[100], i, j;\n  double a, m;\n  while (1) {\n    cin >> n;\n    if (!n)\n      break;\n    m = a = 0;\n    for (i = 0; i < n; i++) {\n      cin >> s[i];\n      m += s[i];\n    }\n    m \/= n;\n    for (i = 0; i < n; i++) {\n      a += (s[i] - m) * (s[i] - m);\n    }\n    a = sqrt(a \/ n);\n    cout << fixed << setprecision(6) << a << endl;\n  }\n  return 0;\n}","changed_src":"#include <iomanip>\n#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main() {\n  int n, s[1000], i, j;\n  double a, m;\n  while (1) {\n    cin >> n;\n    if (!n)\n      break;\n    m = a = 0;\n    for (i = 0; i < n; i++) {\n      cin >> s[i];\n      m += s[i];\n    }\n    m \/= n;\n    for (i = 0; i < n; i++) {\n      a += (s[i] - m) * (s[i] - m);\n    }\n    a = sqrt(a \/ n);\n    cout << fixed << setprecision(6) << a << endl;\n  }\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cmath>\n#include <iomanip>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n, s[110];\n  double ave, sum, alpha;\n  while (1) {\n    ave = 0;\n    sum = 0;\n    alpha = 0;\n    cin >> n;\n    if (n == 0)\n      break;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      sum += s[i];\n    }\n    ave = sum \/ n;\n\n    for (int i = 0; i < n; i++) {\n      alpha += (s[i] - ave) * (s[i] - ave);\n    }\n    alpha \/= n;\n    alpha = sqrt(alpha);\n    cout << fixed << setprecision(6) << alpha << endl;\n  }\n  return 0;\n}","changed_src":"#include <cmath>\n#include <iomanip>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n, s[1010];\n  double ave, sum, alpha;\n  while (1) {\n    ave = 0;\n    sum = 0;\n    alpha = 0;\n    cin >> n;\n    if (n == 0)\n      break;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      sum += s[i];\n    }\n    ave = sum \/ n;\n\n    for (int i = 0; i < n; i++) {\n      alpha += (s[i] - ave) * (s[i] - ave);\n    }\n    alpha \/= n;\n    alpha = sqrt(alpha);\n    cout << fixed << setprecision(6) << alpha << endl;\n  }\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <math.h>\n#include <stdio.h>\nusing namespace std;\n\nint main() {\n  int n;\n  double s[105];\n  while (cin >> n && n != 0) {\n    double sum = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      sum += s[i];\n    }\n    double avg = sum \/ n;\n    sum = 0;\n    for (int i = 0; i < n; i++) {\n      sum += (s[i] - avg) * (s[i] - avg);\n    }\n    if (sum == 0) {\n      printf(\"%lf\\n\", sum);\n    } else {\n      printf(\"%lf\\n\", sqrt(sum \/ n));\n    }\n  }\n  return 0;\n}","changed_src":"#include <iostream>\n#include <math.h>\n#include <stdio.h>\nusing namespace std;\n\nint main() {\n  int n;\n  double s[1005];\n  while (cin >> n && n != 0) {\n    double sum = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      sum += s[i];\n    }\n    double avg = sum \/ n;\n    sum = 0;\n    for (int i = 0; i < n; i++) {\n      sum += (s[i] - avg) * (s[i] - avg);\n    }\n    if (sum == 0) {\n      printf(\"%lf\\n\", sum);\n    } else {\n      printf(\"%lf\\n\", sqrt(sum \/ n));\n    }\n  }\n  return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n  int n;\n  cin >> n;\n  while (n) {\n    int s[n];\n    double sum = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      sum += s[i];\n    }\n    double ave = sum \/ n;\n    sum = 0.0;\n    for (int i = 0; i < n; i++)\n      sum += (s[i] - ave) * (s[i] - ave);\n    cout << sqrt(sum \/ n) << endl;\n  }\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n  int n;\n  cin >> n;\n  while (n) {\n    int s[n];\n    double sum = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      sum += s[i];\n    }\n    double ave = sum \/ n;\n    sum = 0.0;\n    for (int i = 0; i < n; i++)\n      sum += (s[i] - ave) * (s[i] - ave);\n    cout << sqrt(sum \/ n) << endl;\n    cin >> n;\n  }\n  return 0;\n}\n","change":"insert","i1":17,"i2":17,"j1":17,"j2":18,"error":"TLE","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <iomanip>\n#include <iostream>\nusing namespace std;\nint main(void) {\n  int n, s[101], i;\n  double m, a2, a;\n  cin >> n;\n\n  while (n != 0) {\n    m = 0;\n    a2 = 0;\n    for (i = 0; i < n; i++) {\n      cin >> s[i];\n      m += s[i];\n    }\n    m = m \/ n;\n    for (i = 0; i < n; i++) {\n      a2 += (s[i] - m) * (s[i] - m);\n    }\n    a2 = a2 \/ n;\n    a = sqrt(a2);\n\n    cout << fixed << setprecision(5) << a << endl;\n\n    cin >> n;\n  }\n  return 0;\n}\n","changed_src":"#include <cmath>\n#include <iomanip>\n#include <iostream>\nusing namespace std;\nint main(void) {\n  long int n, s[1001], i;\n  double m, a2, a;\n  cin >> n;\n\n  while (n != 0) {\n    m = 0;\n    a2 = 0;\n    for (i = 0; i < n; i++) {\n      cin >> s[i];\n      m += s[i];\n    }\n    m = m \/ n;\n    for (i = 0; i < n; i++) {\n      a2 += (s[i] - m) * (s[i] - m);\n    }\n    a2 = a2 \/ n;\n    a = sqrt(a2);\n\n    cout << fixed << setprecision(5) << a << endl;\n\n    cin >> n;\n  }\n  return 0;\n}\n","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <math.h>\n#include <stdio.h>\n#include <string.h>\n#define rep(i, a, n) for (int i = a; i < n; i++)\n\nint main() {\n  int n;\n  while (1) {\n    scanf(\"%d\", &n);\n    if (n == 0)\n      break;\n    double s[101] = {0}, ave = 0, a = 0;\n    rep(i, 0, n) {\n      scanf(\"%lf\", &s[i]);\n      ave += s[i];\n    }\n    ave \/= (double)n;\n    rep(i, 0, n) { a += pow(s[i] - ave, 2); }\n    a \/= (double)n;\n    a = sqrt(a);\n    printf(\"%.10lf\\n\", a);\n  }\n  return 0;\n}","changed_src":"#include <math.h>\n#include <stdio.h>\n#include <string.h>\n#define rep(i, a, n) for (int i = a; i < n; i++)\n\nint main() {\n  int n;\n  while (1) {\n    scanf(\"%d\", &n);\n    if (n == 0)\n      break;\n    double s[1001] = {0}, ave = 0, a = 0;\n    rep(i, 0, n) {\n      scanf(\"%lf\", &s[i]);\n      ave += s[i];\n    }\n    ave \/= (double)n;\n    rep(i, 0, n) { a += pow(s[i] - ave, 2); }\n    a \/= (double)n;\n    a = sqrt(a);\n    printf(\"%.10lf\\n\", a);\n  }\n  return 0;\n}","change":"replace","i1":11,"i2":12,"j1":11,"j2":12,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cmath>\n#include <iostream>\n#include <stdio.h>\nusing namespace std;\n\nint main(void) {\n  \/\/ Here your code !\n  int n, s[100];\n  double m, A;\n  while (1) {\n    cin >> n;\n    if (n == 0)\n      break;\n    m = 0;\n    A = 0;\n    for (int i = 0; i < n; i++) {\n\n      cin >> s[i];\n      m = m + s[i];\n    }\n    m = m \/ n;\n\n    for (int i = 0; i < n; i++) {\n\n      A = A + pow((s[i] - m), 2);\n    }\n    A = A \/ n;\n    A = sqrt(A);\n    printf(\"%f\\n\", A);\n  }\n}","changed_src":"#include <cmath>\n#include <iostream>\n#include <stdio.h>\nusing namespace std;\n\nint main(void) {\n  \/\/ Here your code !\n  int n, s[1000];\n  double m, A;\n  while (1) {\n    cin >> n;\n    if (n == 0)\n      break;\n    m = 0;\n    A = 0;\n    for (int i = 0; i < n; i++) {\n\n      cin >> s[i];\n      m = m + s[i];\n    }\n    m = m \/ n;\n\n    for (int i = 0; i < n; i++) {\n\n      A = A + pow((s[i] - m), 2);\n    }\n    A = A \/ n;\n    A = sqrt(A);\n    printf(\"%f\\n\", A);\n  }\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"TLE","stderr":""}
-{"problem_id":"p02381","language":"Python","original_status":"Runtime Error","original_src":"# -*- coding: utf-8 -*-\n\nimport math\n\nwhile True:\n    n = int(input())\n\n    if n == 0:\n        break\n\n    s = list(map(float, input().split()))\n    mean = sum(s) \/ len(s)\n\n    for i in range(len(s)):\n        s[i] = (s[i] - sum) * (s[i] - sum)\n\n    variance = sum(s) \/ len(s)\n    stdev = math.sqrt(variance)\n\n    print(stdev)\n","changed_src":"# -*- coding: utf-8 -*-\n\nimport math\n\nwhile True:\n    n = int(input())\n\n    if n == 0:\n        break\n\n    s = list(map(float, input().split()))\n    mean = sum(s) \/ len(s)\n\n    for i in range(len(s)):\n        s[i] = (s[i] - mean) * (s[i] - mean)\n\n    variance = sum(s) \/ len(s)\n    stdev = math.sqrt(variance)\n\n    print(stdev)\n","change":"replace","i1":14,"i2":15,"j1":14,"j2":15,"error":"TypeError: unsupported operand type(s) for -: 'float' and 'builtin_function_or_method'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02381\/Python\/s289178962.py\", line 15, in <module>\n    s[i] = (s[i] - sum) * (s[i] - sum)\nTypeError: unsupported operand type(s) for -: 'float' and 'builtin_function_or_method'\n"}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <iomanip>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int q = 0;\n  while (1) {\n    double n;\n    double date[100];\n    double sum = 0;\n    double var = 0;\n    string haki;\n    cin >> n;\n    getline(cin, haki);\n    if (n == 0)\n      break;\n    for (int i = 0; i < n; i++) {\n      cin >> date[i];\n      sum += date[i];\n    }\n    double ave = sum \/ n;\n    for (int i = 0; i < n; i++) {\n      var += pow(date[i] - ave, 2);\n    }\n    cout << fixed << pow(var \/ n, 0.5) << endl;\n    q++;\n    if (q > 10)\n      break;\n  }\n  return 0;\n}\n","changed_src":"#include <cmath>\n#include <iomanip>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int q = 0;\n  while (1) {\n    double n;\n    double date[1000];\n    double sum = 0;\n    double var = 0;\n    string haki;\n    cin >> n;\n    getline(cin, haki);\n    if (n == 0)\n      break;\n    for (int i = 0; i < n; i++) {\n      cin >> date[i];\n      sum += date[i];\n    }\n    double ave = sum \/ n;\n    for (int i = 0; i < n; i++) {\n      var += pow(date[i] - ave, 2);\n    }\n    cout << fixed << pow(var \/ n, 0.5) << endl;\n    q++;\n    if (q > 10)\n      break;\n  }\n  return 0;\n}\n","change":"replace","i1":10,"i2":11,"j1":10,"j2":11,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <iomanip>\n#include <iostream>\n#include <math.h>\nusing namespace std;\nint main() {\n  int n;\n  double a[101], s, e;\n  do {\n    cin >> n;\n    if (n == 0)\n      break;\n    s = 0;\n    e = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> a[i];\n      s += (a[i] \/ n);\n    }\n    for (int i = 0; i < n; i++) {\n      e += ((a[i] - s) * (a[i] - s)) \/ n;\n    }\n    cout << fixed;\n    cout << setprecision(8) << sqrt(e) << endl;\n  } while (true);\n  return 0;\n}","changed_src":"#include <iomanip>\n#include <iostream>\n#include <math.h>\nusing namespace std;\nint main() {\n  int n;\n  double a[1001], s, e;\n  do {\n    cin >> n;\n    if (n == 0)\n      break;\n    s = 0;\n    e = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> a[i];\n      s += (a[i] \/ n);\n    }\n    for (int i = 0; i < n; i++) {\n      e += ((a[i] - s) * (a[i] - s)) \/ n;\n    }\n    cout << fixed;\n    cout << setprecision(8) << sqrt(e) << endl;\n  } while (true);\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n  cout << fixed << setprecision(12);\n  int n;\n  int s[100];\n  double sum, ans;\n  while (1) {\n    cin >> n;\n    if (n == 0)\n      break;\n    sum = 0;\n    ans = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      sum += s[i];\n    }\n    sum \/= n;\n    for (int i = 0; i < n; i++) {\n      ans += pow(sum - s[i], 2);\n    }\n    ans = sqrt(ans \/ n);\n    cout << ans << endl;\n  }\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n  cout << fixed << setprecision(12);\n  int n;\n  int s[1000];\n  double sum, ans;\n  while (1) {\n    cin >> n;\n    if (n == 0)\n      break;\n    sum = 0;\n    ans = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      sum += s[i];\n    }\n    sum \/= n;\n    for (int i = 0; i < n; i++) {\n      ans += pow(sum - s[i], 2);\n    }\n    ans = sqrt(ans \/ n);\n    cout << ans << endl;\n  }\n  return 0;\n}\n","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <iostream>\n#include <stdio.h>\nusing namespace std;\nint main() {\n  double point, a, n, s[100], m; \/\/ a\u6a19\u6e96\u504f\u5dee n\u5b66\u751f\u306e\u6570\n  while (1) {\n    m = 0;\n    point = 0;\n    cin >> n;\n    if (n == 0)\n      break;\n    a = 0;\n\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      point += s[i];\n    }\n\n    m = point \/ n;\n\n    for (int i = 0; i < n; i++) {\n      a += pow(s[i] - m, 2);\n    }\n    a = sqrt(a \/ n);\n    printf(\"%f\\n\", a);\n  }\n\n  return 0;\n}\n","changed_src":"#include <cmath>\n#include <iostream>\n#include <stdio.h>\nusing namespace std;\nint main() {\n  double point, a, n, s[1000], m; \/\/ a\u6a19\u6e96\u504f\u5dee n\u5b66\u751f\u306e\u6570\n  while (1) {\n    m = 0;\n    point = 0;\n    cin >> n;\n    if (n == 0)\n      break;\n    a = 0;\n\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      point += s[i];\n    }\n\n    m = point \/ n;\n\n    for (int i = 0; i < n; i++) {\n      a += pow(s[i] - m, 2);\n    }\n    a = sqrt(a \/ n);\n    printf(\"%f\\n\", a);\n  }\n\n  return 0;\n}\n","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <cctype>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <sstream>\nusing namespace std;\n#define MPI 3.14159265358979323846\n\nint main() {\n  while (true) {\n    int n, s[101], sum = 0;\n    double a = 0, m;\n    cin >> n;\n    if (n == 0)\n      break;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      sum += s[i];\n    }\n    m = (double)sum \/ (double)n;\n    for (int i = 0; i < n; i++) {\n      a += pow(s[i] - m, 2) \/ (double)n;\n    }\n    printf(\"%.8f\\n\", sqrt(a));\n  }\n  return 0;\n}\n","changed_src":"#include <cctype>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <sstream>\nusing namespace std;\n#define MPI 3.14159265358979323846\n\nint main() {\n  while (true) {\n    int n, s[1001], sum = 0;\n    double a = 0, m;\n    cin >> n;\n    if (n == 0)\n      break;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      sum += s[i];\n    }\n    m = (double)sum \/ (double)n;\n    for (int i = 0; i < n; i++) {\n      a += pow(s[i] - m, 2) \/ (double)n;\n    }\n    printf(\"%.8f\\n\", sqrt(a));\n  }\n  return 0;\n}\n","change":"replace","i1":11,"i2":12,"j1":11,"j2":12,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\nint main() {\n  int n, s[100];\n  while (1) {\n    double a = 0;\n    cin >> n;\n    if (n == 0)\n      break;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      a += s[i];\n    }\n    double b = a \/ n;\n    double c = 0;\n    for (int i = 0; i < n; i++) {\n      c += pow(b - s[i], 2.0);\n    }\n    double d = 0;\n    d = sqrt(c \/ n);\n    printf(\"%.8f\\n\", d);\n  }\n  return 0;\n}","changed_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\nint main() {\n  int n, s[1001];\n  while (1) {\n    double a = 0;\n    cin >> n;\n    if (n == 0)\n      break;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      a += s[i];\n    }\n    double b = a \/ n;\n    double c = 0;\n    for (int i = 0; i < n; i++) {\n      c += pow(b - s[i], 2.0);\n    }\n    double d = 0;\n    d = sqrt(c \/ n);\n    printf(\"%.8f\\n\", d);\n  }\n  return 0;\n}","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n  double s[101], sum, dist, m;\n\n  while (1) {\n    cin >> n;\n    sum = 0.0;\n    dist = 0.0;\n    if (n == 0)\n      break;\n\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n\n      sum += s[i];\n    }\n    m = sum \/ n;\n\n    for (int i = 0; i < n; i++) {\n      dist += pow(s[i] - m, 2);\n    }\n\n    printf(\"%lf\\n\", sqrt(dist \/ n));\n  }\n\n  return 0;\n}","changed_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n  double s[1000], sum, dist, m;\n\n  while (1) {\n    cin >> n;\n    sum = 0.0;\n    dist = 0.0;\n    if (n == 0)\n      break;\n\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n\n      sum += s[i];\n    }\n    m = sum \/ n;\n\n    for (int i = 0; i < n; i++) {\n      dist += pow(s[i] - m, 2);\n    }\n\n    printf(\"%lf\\n\", sqrt(dist \/ n));\n  }\n\n  return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cmath>\n#include <iostream>\nusing namespace std;\nint main() {\n  int time;\n  double m;\n  int s[100];\n  double apow;\n  while (true) {\n    cin >> time;\n    if (time == 0)\n      break;\n    apow = 0;\n    m = 0;\n    for (int i = 0; i < time; ++i) {\n      cin >> s[i];\n      m += s[i];\n    }\n    m \/= (double)time;\n    for (int i = 0; i < time; ++i) {\n      apow += pow((double)s[i] - m, 2.0);\n    }\n    cout << sqrt(apow \/ (double)time) << endl;\n  }\n  return 0;\n}","changed_src":"#include <cmath>\n#include <iostream>\nusing namespace std;\nint main() {\n  int time;\n  double m;\n  int s[1000];\n  double apow;\n  while (true) {\n    cin >> time;\n    if (time == 0)\n      break;\n    apow = 0;\n    m = 0;\n    for (int i = 0; i < time; ++i) {\n      cin >> s[i];\n      m += s[i];\n    }\n    m \/= (double)time;\n    for (int i = 0; i < time; ++i) {\n      apow += pow((double)s[i] - m, 2.0);\n    }\n    cout << sqrt(apow \/ (double)time) << endl;\n  }\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <iomanip>\n#include <iostream>\n#include <math.h>\n\n#define PI 3.14159265\n\ndouble standard_deviation(double *s, double m, double n) {\n  double sum_ = 0;\n  for (int i = 0; i < n; i++) {\n    sum_ += pow((s[i] - m), 2);\n  }\n  return sum_ \/ n;\n}\n\nint main() {\n  double n;\n  double s[100] = {0};\n  double m = 0;\n\n  while (true) {\n    m = 0;\n    std::cin >> n;\n    if (n == 0)\n      break;\n    for (int i = 0; i < n; i++) {\n      std::cin >> s[i];\n      m += s[i];\n    }\n    m \/= n;\n\n    std::cout << std::fixed << std::setprecision(8)\n              << sqrt(standard_deviation(s, m, n)) << std::endl;\n  }\n\n  return 0;\n}\n","changed_src":"#include <iomanip>\n#include <iostream>\n#include <math.h>\n\n#define PI 3.14159265\n\ndouble standard_deviation(double *s, double m, double n) {\n  double sum_ = 0;\n  for (int i = 0; i < n; i++) {\n    sum_ += pow((s[i] - m), 2);\n  }\n  return sum_ \/ n;\n}\n\nint main() {\n  double n;\n  double s[1000] = {0};\n  double m = 0;\n\n  while (true) {\n    m = 0;\n    std::cin >> n;\n    if (n == 0)\n      break;\n    for (int i = 0; i < n; i++) {\n      std::cin >> s[i];\n      m += s[i];\n    }\n    m \/= n;\n\n    std::cout << std::fixed << std::setprecision(8)\n              << sqrt(standard_deviation(s, m, n)) << std::endl;\n  }\n\n  return 0;\n}\n","change":"replace","i1":16,"i2":17,"j1":16,"j2":17,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <math.h>\n\n#define REP(i, a, b) for (i = a; i < b; i++)\n#define rep(i, n) REP(i, 0, n)\n\nusing namespace std;\n\nint main() {\n  int n, s[100], i;\n  double m, d;\n\n  cout.precision(8);\n  while (1) {\n    cin >> n;\n    if (n == 0)\n      break;\n    m = 0;\n    d = 0;\n    rep(i, n) {\n      cin >> s[i];\n      m += s[i];\n    }\n    m = m \/ n;\n    rep(i, n) d += pow(s[i] - m, 2.0);\n    d = sqrt(d \/ n);\n    cout << fixed << d << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\n#include <math.h>\n\n#define REP(i, a, b) for (i = a; i < b; i++)\n#define rep(i, n) REP(i, 0, n)\n\nusing namespace std;\n\nint main() {\n  int n, s[1000], i;\n  double m, d;\n\n  cout.precision(8);\n  while (1) {\n    cin >> n;\n    if (n == 0)\n      break;\n    m = 0;\n    d = 0;\n    rep(i, n) {\n      cin >> s[i];\n      m += s[i];\n    }\n    m = m \/ n;\n    rep(i, n) d += pow(s[i] - m, 2.0);\n    d = sqrt(d \/ n);\n    cout << fixed << d << endl;\n  }\n  return 0;\n}","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cctype>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int n;\n  int S[100];\n  double sum = 0;\n  double std = 0;\n  double deviate = 0;\n  while (1) {\n    cin >> n;\n    if (n == 0)\n      break;\n    for (int i = 0; i < n; i++)\n      cin >> S[i];\n    for (int i = 0; i < n; i++) {\n      sum += S[i];\n    }\n    for (int i = 0; i < n; i++) {\n      deviate += (S[i] - sum \/ n) * (S[i] - sum \/ n);\n    }\n\n    printf(\"%lf\\n\", sqrt(deviate \/ n));\n    sum = 0;\n    std = 0;\n    deviate = 0;\n  }\n\n  return 0;\n}","changed_src":"#include <cctype>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n  int n;\n  int S[1000];\n  double sum = 0;\n  double std = 0;\n  double deviate = 0;\n  while (1) {\n    cin >> n;\n    if (n == 0)\n      break;\n    for (int i = 0; i < n; i++)\n      cin >> S[i];\n    for (int i = 0; i < n; i++) {\n      sum += S[i];\n    }\n    for (int i = 0; i < n; i++) {\n      deviate += (S[i] - sum \/ n) * (S[i] - sum \/ n);\n    }\n\n    printf(\"%lf\\n\", sqrt(deviate \/ n));\n    sum = 0;\n    std = 0;\n    deviate = 0;\n  }\n\n  return 0;\n}","change":"replace","i1":10,"i2":11,"j1":10,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"\/\/ class point\t\u306e\u7df4\u7fd2\uff08\u30af\u30e9\u30b9\u306e\u9ad8\u5ea6\u306a\u5b9f\u88c5\uff09\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <vector>\n\ntypedef long long llong;\nusing namespace std;\n\nint main() {\n  int n;\n  int score[150];\n  double mean, var;\n  while (1) {\n    scanf(\"%d\", &n);\n    if (!n)\n      break;\n    mean = 0;\n    var = 0;\n    for (int i = 0; i < n; i++) {\n      scanf(\"%d\", &score[i]);\n      mean += (double)score[i];\n    }\n    mean \/= n;\n    for (int i = 0; i < n; i++) {\n      var += ((double)score[i] - mean) * ((double)score[i] - mean);\n    }\n    var \/= n;\n    cout << fixed << setprecision(10) << sqrt(var) << endl;\n  }\n  return 0;\n}\n","changed_src":"\/\/ class point\t\u306e\u7df4\u7fd2\uff08\u30af\u30e9\u30b9\u306e\u9ad8\u5ea6\u306a\u5b9f\u88c5\uff09\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <vector>\n\ntypedef long long llong;\nusing namespace std;\n\nint main() {\n  int n;\n  int score[1100];\n  double mean, var;\n  while (1) {\n    scanf(\"%d\", &n);\n    if (!n)\n      break;\n    mean = 0;\n    var = 0;\n    for (int i = 0; i < n; i++) {\n      scanf(\"%d\", &score[i]);\n      mean += (double)score[i];\n    }\n    mean \/= n;\n    for (int i = 0; i < n; i++) {\n      var += ((double)score[i] - mean) * ((double)score[i] - mean);\n    }\n    var \/= n;\n    cout << fixed << setprecision(10) << sqrt(var) << endl;\n  }\n  return 0;\n}\n","change":"replace","i1":14,"i2":15,"j1":14,"j2":15,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <queue>\n#include <stack>\n#include <stdio.h>\n#include <string.h>\n#include <string>\n#include <utility>\n#include <vector>\n\n#define FOR(i, a, b) for (int i = (a); i <= (b); i++)\n#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)\n#define MOD 1000000007\n#define INF 1000000000\n#define PI 3.14159265358979\n\nusing namespace std;\ntypedef pair<int, int> P;\n\nint main(void) {\n  int n;\n  while (cin >> n, n) {\n    int s[101];\n    double alpha = 0, ave = 0;\n    FOR(i, 1, n) {\n      cin >> s[i];\n      ave += s[i];\n    }\n    ave \/= n;\n    FOR(i, 1, n) { alpha += (s[i] - ave) * (s[i] - ave); }\n    alpha \/= n;\n    alpha = sqrt(alpha);\n    printf(\"%.10lf\\n\", alpha);\n  }\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <queue>\n#include <stack>\n#include <stdio.h>\n#include <string.h>\n#include <string>\n#include <utility>\n#include <vector>\n\n#define FOR(i, a, b) for (int i = (a); i <= (b); i++)\n#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)\n#define MOD 1000000007\n#define INF 1000000000\n#define PI 3.14159265358979\n\nusing namespace std;\ntypedef pair<int, int> P;\n\nint main(void) {\n  int n;\n  while (cin >> n, n) {\n    int s[1001];\n    double alpha = 0, ave = 0;\n    FOR(i, 1, n) {\n      cin >> s[i];\n      ave += s[i];\n    }\n    ave \/= n;\n    FOR(i, 1, n) { alpha += (s[i] - ave) * (s[i] - ave); }\n    alpha \/= n;\n    alpha = sqrt(alpha);\n    printf(\"%.10lf\\n\", alpha);\n  }\n  return 0;\n}\n","change":"replace","i1":26,"i2":27,"j1":26,"j2":27,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cmath>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <stdio.h>\n#include <string.h>\n#include <string>\n#include <time.h>\n#include <valarray>\n#include <vector>\n\nusing namespace std;\n\nint main(void) {\n  long double s[500], Hei, kari;\n\n  long int n;\n\n  for (long int A = 0; A < 1000; A++) {\n    cin >> n;\n\n    if (n == 0) {\n      break;\n    }\n\n    for (long int i = 0; i < n; i++) {\n      cin >> s[i];\n      Hei += s[i];\n    }\n\n    for (long int i = 0; i < n; i++) {\n      kari += (s[i] - Hei \/ n) * (s[i] - Hei \/ n);\n    }\n\n    cout << fixed << setprecision(8) << sqrt(kari \/ n) << endl;\n\n    Hei = 0;\n    kari = 0;\n  }\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <stdio.h>\n#include <string.h>\n#include <string>\n#include <time.h>\n#include <valarray>\n#include <vector>\n\nusing namespace std;\n\nint main(void) {\n  long double s[1000], Hei, kari;\n\n  long int n;\n\n  for (long int A = 0; A < 1000; A++) {\n    cin >> n;\n\n    if (n == 0) {\n      break;\n    }\n\n    for (long int i = 0; i < n; i++) {\n      cin >> s[i];\n      Hei += s[i];\n    }\n\n    for (long int i = 0; i < n; i++) {\n      kari += (s[i] - Hei \/ n) * (s[i] - Hei \/ n);\n    }\n\n    cout << fixed << setprecision(8) << sqrt(kari \/ n) << endl;\n\n    Hei = 0;\n    kari = 0;\n  }\n}","change":"replace","i1":16,"i2":17,"j1":16,"j2":17,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cctype>\n#include <math.h>\n#include <stdio.h>\n#include <string.h>\n\n#define PI 3.1415926\n\nint main() {\n  int n, s[101];\n  double sum = 0;\n  double a2 = 0;\n  while (1) {\n\n    scanf(\"%d\", &n);\n    if (n == 0) {\n      break;\n    }\n    for (int i = 1; i <= n; i++) {\n      scanf(\"%d\", &s[i]);\n      sum += s[i];\n    }\n\n    sum \/= n;\n\n    for (int i = 1; i <= n; i++) {\n      a2 += (s[i] - sum) * (s[i] - sum);\n    }\n    printf(\"%f\\n\", sqrt(a2 \/ n));\n    sum = 0;\n    a2 = 0;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cctype>\n#include <math.h>\n#include <stdio.h>\n#include <string.h>\n\n#define PI 3.1415926\n\nint main() {\n  int n, s[2000];\n  double sum = 0;\n  double a2 = 0;\n  while (1) {\n\n    scanf(\"%d\", &n);\n    if (n == 0) {\n      break;\n    }\n    for (int i = 1; i <= n; i++) {\n      scanf(\"%d\", &s[i]);\n      sum += s[i];\n    }\n\n    sum \/= n;\n\n    for (int i = 1; i <= n; i++) {\n      a2 += (s[i] - sum) * (s[i] - sum);\n    }\n    printf(\"%f\\n\", sqrt(a2 \/ n));\n    sum = 0;\n    a2 = 0;\n  }\n  return 0;\n}","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  \/\/ int n,vol,s[100];\n  double a, n, vol, s[100], avg;\n  while (true) {\n\n    cin >> n;\n    if (n == 0)\n      break;\n    vol = 0;\n    a = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      vol += s[i];\n    }\n    avg = vol \/ n;\n    for (int i = 0; i < n; i++) {\n      a += pow(s[i] - avg, 2.0);\n    }\n    a \/= n;\n    printf(\"%lf\\n\", sqrt(a));\n  }\n  return 0;\n}\n","changed_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  \/\/ int n,vol,s[100];\n  double a, n, vol, s[1000], avg;\n  while (true) {\n\n    cin >> n;\n    if (n == 0)\n      break;\n    vol = 0;\n    a = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      vol += s[i];\n    }\n    avg = vol \/ n;\n    for (int i = 0; i < n; i++) {\n      a += pow(s[i] - avg, 2.0);\n    }\n    a \/= n;\n    printf(\"%lf\\n\", sqrt(a));\n  }\n  return 0;\n}\n","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n  while (1) {\n    int n;\n    cin >> n;\n    if (n == 0) {\n      break;\n    }\n\n    int s[101];\n    double total = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      total += s[i];\n    }\n\n    double m = total \/ n;\n\n    double a_2 = 0;\n    for (int i = 0; i < n; i++) {\n      a_2 += (s[i] - m) * (s[i] - m) \/ n;\n    }\n\n    double a = sqrt(a_2);\n    printf(\"%.4f\\n\", a);\n  }\n\n  return 0;\n}","changed_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n  while (1) {\n    int n;\n    cin >> n;\n    if (n == 0) {\n      break;\n    }\n\n    int s[1000];\n    double total = 0;\n    for (int i = 0; i < n; i++) {\n      cin >> s[i];\n      total += s[i];\n    }\n\n    double m = total \/ n;\n\n    double a_2 = 0;\n    for (int i = 0; i < n; i++) {\n      a_2 += (s[i] - m) * (s[i] - m) \/ n;\n    }\n\n    double a = sqrt(a_2);\n    printf(\"%.4f\\n\", a);\n  }\n\n  return 0;\n}","change":"replace","i1":14,"i2":15,"j1":14,"j2":15,"error":"TLE","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n  const int max_n = 100;\n  double a[max_n];\n  while (cin >> n, n) {\n    double s = 0.0;\n    double sum = 0.0;\n    for (int i = 0; i < n; i++) {\n      cin >> a[i];\n      sum += a[i];\n    }\n    double m = sum \/ n;\n    for (int i = 0; i < n; i++) {\n      s += pow(a[i] - m, 2);\n    }\n    s \/= n;\n    s = sqrt(s);\n    printf(\"%.6f\\n\", s);\n  }\n  return 0;\n}","changed_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n  const int max_n = 1000;\n  double a[max_n];\n  while (cin >> n, n) {\n    double s = 0.0;\n    double sum = 0.0;\n    for (int i = 0; i < n; i++) {\n      cin >> a[i];\n      sum += a[i];\n    }\n    double m = sum \/ n;\n    for (int i = 0; i < n; i++) {\n      s += pow(a[i] - m, 2);\n    }\n    s \/= n;\n    s = sqrt(s);\n    printf(\"%.6f\\n\", s);\n  }\n  return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  while (1) {\n    long long n, sum = 0, s[101];\n    double sum2 = 0;\n\n    cin >> n;\n    if (n == 0)\n      break;\n\n    for (int i = 1; i <= n; i++) {\n      cin >> s[i];\n      sum += s[i];\n    }\n    double m = (double)sum \/ n;\n\n    for (int i = 1; i <= n; i++) {\n      sum2 += (s[i] - m) * (s[i] - m);\n    }\n    double a2 = (double)sum2 \/ n;\n\n    printf(\"%lf\\n\", sqrt(a2));\n  }\n\n  return 0;\n}","changed_src":"#include <cmath>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  while (1) {\n    long long n, sum = 0, s[1001];\n    double sum2 = 0;\n\n    cin >> n;\n    if (n == 0)\n      break;\n\n    for (int i = 1; i <= n; i++) {\n      cin >> s[i];\n      sum += s[i];\n    }\n    double m = (double)sum \/ n;\n\n    for (int i = 1; i <= n; i++) {\n      sum2 += (s[i] - m) * (s[i] - m);\n    }\n    double a2 = (double)sum2 \/ n;\n\n    printf(\"%lf\\n\", sqrt(a2));\n  }\n\n  return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02381","language":"C++","original_status":"Runtime Error","original_src":"#include <iomanip>\n#include <iostream>\n#include <math.h>\n\nusing namespace std;\n\nint main() {\n  double n, a[100], sum, sig;\n  while (1) {\n    sum = 0;\n    sig = 0;\n    cin >> n;\n    if (n == 0)\n      break;\n    for (int i = 0; i < n; i++) {\n      cin >> a[i];\n      sum += a[i];\n    }\n    for (int i = 0; i < n; i++) {\n      sig += pow(a[i] - sum \/ n, 2);\n    }\n    cout << fixed << setprecision(6) << sqrt(sig \/ n) << endl;\n  }\n  return 0;\n}","changed_src":"#include <iomanip>\n#include <iostream>\n#include <math.h>\n\nusing namespace std;\n\nint main() {\n  double n, a[1000], sum, sig;\n  while (1) {\n    sum = 0;\n    sig = 0;\n    cin >> n;\n    if (n == 0)\n      break;\n    for (int i = 0; i < n; i++) {\n      cin >> a[i];\n      sum += a[i];\n    }\n    for (int i = 0; i < n; i++) {\n      sig += pow(a[i] - sum \/ n, 2);\n    }\n    cout << fixed << setprecision(6) << sqrt(sig \/ n) << endl;\n  }\n  return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"x = input()\nprint(x**3)\n","changed_src":"x = input()\nx = int(x)\nprint(x**3)\n","change":"insert","i1":1,"i2":1,"j1":1,"j2":2,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s725747490.py\", line 2, in <module>\n    print(x**3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"x = input()\nprint(x**3)\n","changed_src":"x = int(input())\nprint(x**3)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s709080194.py\", line 2, in <module>\n    print(x**3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"n = input()\nprint(n * n * n)\n","changed_src":"s = input()\nn = int(s)\nprint(n**3)\n","change":"replace","i1":0,"i2":2,"j1":0,"j2":3,"error":"TypeError: can't multiply sequence by non-int of type 'str'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s234463127.py\", line 2, in <module>\n    print(n * n * n)\nTypeError: can't multiply sequence by non-int of type 'str'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"x = input()\nprint(x**3)\n","changed_src":"x = input()\nx = int(x)\nprint(x**3)\n","change":"insert","i1":1,"i2":1,"j1":1,"j2":2,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s056318749.py\", line 3, in <module>\n    print(x**3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"num = input()\n\nprint(num**3)\n","changed_src":"num_str = input()\nnum = int(num_str)\nprint(num**3)\n","change":"replace","i1":0,"i2":2,"j1":0,"j2":2,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s367615831.py\", line 3, in <module>\n    print(num ** 3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"print(input() ** 3)\n","changed_src":"i = int(input())\nprint(i**3)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":2,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s667447252.py\", line 1, in <module>\n    print(input()**3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"input = input()\nprint(input**3)\n","changed_src":"input = input()\nprint(int(input) ** 3)\n","change":"replace","i1":1,"i2":2,"j1":1,"j2":2,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s516531505.py\", line 2, in <module>\n    print(input**3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"print(input() ** 3)\n","changed_src":"print(int(input()) ** 3)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s557766359.py\", line 1, in <module>\n    print(input()**3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"x = input()\n\nprint(x**3)\n","changed_src":"x = int(input())\n\nprint(x**3)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s482874964.py\", line 3, in <module>\n    print(x**3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"print(input() ** 3)\n","changed_src":"print(int(input()) ** 3)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s627402686.py\", line 1, in <module>\n    print(input() ** 3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"N = input()\nprint(N**3)\n","changed_src":"N = int(input())\nprint(N**3)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s645472377.py\", line 2, in <module>\n    print(N**3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"x = input()\n\nans = x * x * x\n\nprint(ans)\n","changed_src":"x = int(input())\n\nans = x * x * x\n\nprint(ans)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: can't multiply sequence by non-int of type 'str'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s517488440.py\", line 3, in <module>\n    ans = x * x * x\nTypeError: can't multiply sequence by non-int of type 'str'\n"}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main(void) {\n  int x;\n  scanf(\"%d\", x);\n  printf(\"%d \\n\", x * x * x);\n\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint main(void) {\n  int x, xxx;\n  scanf(\"%d\", &x);\n  xxx = x * x * x;\n  printf(\"%d\\n\", xxx);\n\n  return 0;\n}","change":"replace","i1":3,"i2":6,"j1":3,"j2":7,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int x, sum;\n  do {\n    cin >> x;\n  } while (x < 1 || x > 10);\n  sum = x * x * x;\n  cout << sum << endl;\n\n  return 0;\n}\n","changed_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int x, sum;\n\n  cin >> x;\n\n  sum = x * x * x;\n  cout << sum << endl;\n\n  return 0;\n}\n","change":"replace","i1":6,"i2":9,"j1":6,"j2":9,"error":"TLE","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main(void) {\n  int x = 0;\n  scanf(\"%d\", x);\n  printf(\"%d\", x * x * x);\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main(void) {\n  int x = 0;\n  scanf(\"%d\", &x);\n  printf(\"%d\\n\", x * x * x);\n  return 0;\n}","change":"replace","i1":3,"i2":5,"j1":3,"j2":5,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int a;\n  scanf(\"%d\", a);\n  printf(\"%d\\n\", a * a * a);\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main() {\n  int a;\n  scanf(\"%d\", &a);\n  printf(\"%d\\n\", a * a * a);\n  return 0;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nint Cubic(int x) { return (x * x * x); }\n\nint main() {\n  int x;\n\n  cin >> x;\n\n  x = Cubic(x);\n\n  cout << x << endl;\n\n  while (1)\n    ;\n\n  return 0;\n}","changed_src":"#include <iostream>\n\nusing namespace std;\n\nint Cubic(int x) { return (x * x * x); }\n\nint main() {\n  int x;\n\n  cin >> x;\n\n  x = Cubic(x);\n\n  cout << x << endl;\n\n  \/\/ while(1);\n\n  return 0;\n}","change":"replace","i1":15,"i2":17,"j1":15,"j2":16,"error":"TLE","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int x;\n  scanf(\"%d\", x);\n  printf(\"%d\\n\", x * x * x);\n}","changed_src":"#include <stdio.h>\nint main() {\n  int x;\n  scanf(\"%d\", &x);\n  printf(\"%d\\n\", x * x * x);\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main(void) {\n  int a;\n  scanf(\"%d\", &a);\n  int b = a * a * a;\n  return (b);\n}","changed_src":"#include <stdio.h>\n\nint main(void) {\n  int a;\n  scanf(\"%d\", &a);\n  int b = a * a * a;\n  printf(\"%d\\n\", b);\n  return (0);\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":8,"error":"8","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n\nint main() {\n  int x;\n  std::cin >> x;\n  std::cout << x * x * x << std::endl;\n  return x;\n}","changed_src":"#include <iostream>\n\nint main() {\n  int x;\n  std::cin >> x;\n  std::cout << x * x * x << std::endl;\n}","change":"delete","i1":6,"i2":7,"j1":6,"j2":6,"error":"2","stderr":""}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"x = input()\nprint(x**3)\n","changed_src":"x = int(input())\nprint(x**3)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s996581497.py\", line 2, in <module>\n    print(x**3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"x = input(())\n\nprint(x**3)\n","changed_src":"x = int(input())\n\nprint(x**3)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s164445315.py\", line 4, in <module>\n    print(x**3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"print(int(input) ** 3)\n","changed_src":"print(int(input()) ** 3)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s322584303.py\", line 1, in <module>\n    print(int(input)**3)\nTypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"import sys\n\nargs = sys.argv\n\nnum = int(args[1])\nprint(str(num**3))\n","changed_src":"s = input()\nnum = int(s)\nprint(str(num**3))\n","change":"replace","i1":0,"i2":5,"j1":0,"j2":2,"error":"IndexError: list index out of range","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s550015206.py\", line 5, in <module>\n    num = int(args[1])\nIndexError: list index out of range\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"print(input() ** 3)\n","changed_src":"print(int(input()) ** 3)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s376152712.py\", line 1, in <module>\n    print(input() ** 3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"x = input()\n\nprint(x * x * x)\n","changed_src":"x = int(input())\nprint(x * x * x)\n","change":"replace","i1":0,"i2":2,"j1":0,"j2":1,"error":"TypeError: can't multiply sequence by non-int of type 'str'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s272745096.py\", line 3, in <module>\n    print(x * x * x)\nTypeError: can't multiply sequence by non-int of type 'str'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"x = input()\nprint(x**3)\n","changed_src":"input_1 = int(input())\ncal = (input_1) ** 3\nprint(cal)\n","change":"replace","i1":0,"i2":2,"j1":0,"j2":3,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s257611309.py\", line 2, in <module>\n    print(x**3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"x = input()\ny = x**3\nprint(y)\n","changed_src":"x = input()\nprint(x**3)\n","change":"replace","i1":1,"i2":3,"j1":1,"j2":2,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s666518215.py\", line 3, in <module>\n    y = x ** 3\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"print(input() ** 3)\n","changed_src":"print(int(input()) ** 3)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s844443016.py\", line 1, in <module>\n    print(input()**3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"x = int(input())\nprint(**3)\n","changed_src":"x = int(input())\nprint(x**3)\n","change":"replace","i1":1,"i2":2,"j1":1,"j2":2,"error":"TypeError: print() argument after ** must be a mapping, not int","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s451360688.py\", line 2, in <module>\n    print(**3)\nTypeError: print() argument after ** must be a mapping, not int\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"print(int(input) ** 3)\n","changed_src":"print(int(input()) ** 3)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s844330584.py\", line 1, in <module>\n    print(int(input)**3)\nTypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"print(int(input) ** 3)\n","changed_src":"print(int(input()) ** 3)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s120361537.py\", line 1, in <module>\n    print(int(input)**3)\nTypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"s = input(\"\")\nans = s * s * s\nprint(ans)\n","changed_src":"user = input(\"\")\nnum = int(user)\nans = num * num * num\nprint(ans)\n","change":"replace","i1":0,"i2":2,"j1":0,"j2":3,"error":"TypeError: can't multiply sequence by non-int of type 'str'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s469089457.py\", line 2, in <module>\n    ans = s * s * s\nTypeError: can't multiply sequence by non-int of type 'str'\n"}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main(void) {\n  int x;\n  scanf(\"%d\", x);\n  printf(\"%d\", x * 2);\n  return 0;\n}\n","changed_src":"#include <stdio.h>\n\nint main(void) {\n  int x;\n  scanf(\"%d\", &x);\n  x = x * x * x;\n  printf(\"%d\\n\", x);\n  return 0;\n}","change":"replace","i1":4,"i2":6,"j1":4,"j2":7,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main(int argc, char *argv[]) {\n  int x = scanf(\"%d\", argv[1]);\n  printf(\"%d\\n\", x * x * x);\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main(int argc, char *argv[]) {\n  int x;\n  scanf(\"%d\", &x);\n  printf(\"%d\\n\", x * x * x);\n  return 0;\n}","change":"replace","i1":2,"i2":3,"j1":2,"j2":4,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x;\n  cin >> x;\n  return x * x * x;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x;\n  cin >> x;\n  cout << x * x * x << endl;\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":8,"error":"8","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int a;\n  scanf(\"%d\", a);\n  printf(\"%d\", a * a * a);\n}\n","changed_src":"#include <stdio.h>\nint main() {\n  int a, b;\n  scanf(\"%d\", &a);\n  b = a * a * a;\n  printf(\"%d\\n\", b);\n}\n","change":"replace","i1":2,"i2":5,"j1":2,"j2":6,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main(void) {\n  int x;\n  scanf(\"%d\", &x);\n  return x * x * x;\n}","changed_src":"#include <stdio.h>\n\nint main(void) {\n  int x;\n  scanf(\"%d\", &x);\n  printf(\"%d\\n\", x * x * x);\n}","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"8","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main() {\n\n  int x;\n\n  scanf(\"%d\", x);\n\n  x = x * x * x;\n\n  printf(\"%d\\n\", x);\n}","changed_src":"#include <stdio.h>\n\nint main() {\n\n  int x;\n\n  scanf(\"%d\", &x);\n\n  x = x * x * x;\n\n  printf(\"%d\\n\", x);\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\n\nint main(int x) { return x * x * x; }","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x;\n  cin >> x;\n  cout << x * x * x << endl;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":8,"error":"1","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main(void) {\n  int x;\n\n  scanf(\"%d\", x);\n  printf(\"%d\", x * x * x);\n\n  return 0;\n}\n","changed_src":"#include <stdio.h>\n\nint main(void) {\n  int x;\n\n  scanf(\"%d\", &x);\n  printf(\"%d\\n\", x * x * x);\n\n  return 0;\n}\n","change":"replace","i1":5,"i2":7,"j1":5,"j2":7,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main(void) {\n  int x = 0;\n  scanf(\"%d\\n\", x);\n  printf(\"x\", x * x * x);\n  return 0;\n}\n","changed_src":"#include <stdio.h>\n\nint main(void) {\n  int a;\n  scanf(\"%d\\n\", &a);\n  printf(\"%d\\n\", a * a * a);\n  return 0;\n}\n","change":"replace","i1":3,"i2":6,"j1":3,"j2":6,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"number = input(int())\nprint(number**3)\n","changed_src":"number = int(input())\nprint(number**3)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s272552751.py\", line 2, in <module>\n    print(number**3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"print(int(input() ** 3))\n","changed_src":"print(int(input()) ** 3)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s690364339.py\", line 1, in <module>\n    print(int(input()**3))\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int x;\n\n  scanf(\"%d\", x);\n  printf(\"%d\", x * x * x);\n\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main() {\n  int x;\n\n  scanf(\"%d\", &x);\n\n  x = x * x * x;\n\n  printf(\"%d\\n\", x);\n\n  return 0;\n}","change":"replace","i1":4,"i2":6,"j1":4,"j2":9,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n\n#define OK 1;\nusing namespace std;\n\nint main(void) {\n  int x;\n\n  \/\/ scanf\n  cin >> x;\n\n  \/\/ printf\n  cout << x * x * x << endl;\n\n  return OK;\n}","changed_src":"#include <iostream>\n\n#define OK 0;\nusing namespace std;\n\nint main(void) {\n  int x;\n\n  \/\/ scanf\n  cin >> x;\n\n  \/\/ printf\n  cout << x * x * x << endl;\n\n  return OK;\n}","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"1","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main(void) {\n\n  int x = 5;\n  int sum = 1;\n  do {\n    cin >> x;\n  } while (1 <= x && x <= 1000);\n\n  for (int i = 0; i <= 2; i++) {\n    sum *= x;\n  }\n  cout << sum << endl;\n\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main(void) {\n\n  int x = 5;\n  int sum = 1;\n  cin >> x;\n\n  for (int i = 0; i <= 2; i++) {\n    sum *= x;\n  }\n  cout << sum << endl;\n\n  return 0;\n}","change":"replace","i1":7,"i2":10,"j1":7,"j2":8,"error":"TLE","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main() {\n  int x, ans;\n  scanf(\"%d\", x);\n\n  ans = x * x * x;\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint main() {\n  int x, ans;\n  scanf(\"%d\", &x);\n\n  ans = x * x * x;\n\n  printf(\"%d\\n\", ans);\n\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x;\n  do {\n    cin >> x;\n  } while (x >= 1 && x <= 100);\n  cout << (x * x * x) << endl;\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x;\n  cin >> x;\n  cout << x * x * x << endl;\n}","change":"replace","i1":5,"i2":10,"j1":5,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int x, ans = 0;\n  scanf(\"%d\", x);\n  ans = x * x * x;\n  printf(\"%d\\n\", ans);\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main() {\n  int x, ans = 0;\n  scanf(\"%d\", &x);\n  ans = x * x * x;\n  printf(\"%d\\n\", ans);\n  return 0;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main() {\n  int x = 0;\n  scanf(\"%d\", x);\n  printf(\"%d\\n\", x * x * x);\n  return 0;\n}\n","changed_src":"#include <stdio.h>\n\nint main() {\n  int x = 0;\n  scanf(\"%d\", &x);\n  printf(\"%d\\n\", x * x * x);\n  return 0;\n}\n","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int x = 0;\n  scanf(\"%d\", x);\n  printf(\"%d\\n\", &x);\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main() {\n  int x = 0;\n  scanf(\"%d\", &x);\n  printf(\"%d\\n\", x * x * x);\n  return 0;\n}","change":"replace","i1":3,"i2":5,"j1":3,"j2":5,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nusing namespace std;\nint main() {\n  int w = 0;\n  scanf(\"%d\", &w);\n  printf(\"%d\\n\", w * w * w);\n  return 8;\n}","changed_src":"#include <stdio.h>\nusing namespace std;\nint main() {\n  int w = 0;\n  scanf(\"%d\", &w);\n  printf(\"%d\\n\", w * w * w);\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"8","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <string>\nint main(int argc, char const *argv[]) {\n  std::string str;\n  int i, answer;\n  str += argv[1];\n  i = std::stoi(str);\n  answer = i * i * i;\n  std::cout << answer << std::endl;\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x;\n  cin >> x;\n  cout << x * x * x << endl;\n}","change":"replace","i1":1,"i2":10,"j1":1,"j2":7,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"Python","original_status":"Runtime Error","original_src":"x = input()\nprint(x**3)\n","changed_src":"x = int(input())\nprint(x**3)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02388\/Python\/s314503322.py\", line 2, in <module>\n    print(x**3)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <math.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string>\n\ndouble charToDouble(char *c) { return atof(c); }\n\nstd::string doubleToString(double x) {\n  char c[256] = {'\\0'};\n  sprintf(c, \"%.0f\", x);\n\n  return c;\n}\n\nint main(int argc, char *argv[]) {\n  double y = pow(charToDouble(argv[1]), 3);\n  std::cout << doubleToString(y) << std::endl;\n}","changed_src":"#include <iostream>\n#include <math.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string>\n\ndouble charToDouble(char *c) { return atof(c); }\n\nstd::string doubleToString(double x) {\n  char c[256] = {'\\0'};\n  sprintf(c, \"%.0f\", x);\n\n  return c;\n}\n\nint main() {\n  int x;\n  std::cin >> x;\n  double y = pow(double(x), 3);\n  std::cout << doubleToString(y) << std::endl;\n}","change":"replace","i1":15,"i2":17,"j1":15,"j2":19,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <cstdio>\nint main() {\n  int a, b;\n  scanf(\"%d\", a);\n  b = a * a * a;\n  printf(\"%d\\n\", b);\n  return 0;\n}","changed_src":"#include <cstdio>\nint main() {\n  int a, b;\n  scanf(\"%d\", &a);\n  b = a * a * a;\n  printf(\"%d\\n\", b);\n  return 0;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <cmath>\n#include <cstdlib>\n#include <iostream>\n\nusing namespace std;\n\nint main(int argc, char *argv[]) {\n  int n = 0, n2 = 0;\n  \/\/ cin >> n;\n  n = atoi(argv[1]);\n  if (n < 1 || n > 100) {\n    return 1;\n  }\n  n2 = pow(n, 3.0);\n  cout << n2 << endl;\n}\n","changed_src":"#include <cmath>\n#include <cstdlib>\n#include <iostream>\n\nusing namespace std;\n\nint main(int argc, char *argv[]) {\n  int n = 0, n2 = 0;\n  cin >> n;\n  \/\/ n = atoi(argv[1]);\n  if (n < 1 || n > 100) {\n    return 1;\n  }\n  n2 = pow(n, 3.0);\n  cout << n2 << endl;\n}\n","change":"replace","i1":8,"i2":10,"j1":8,"j2":10,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main(void) {\n  int x, y;\n  scanf(\"%d\", x);\n  y = x * x * x;\n  printf(\"%d\\n\", y);\n  return 0;\n}\n","changed_src":"#include <stdio.h>\nint main(void) {\n  int x, y;\n  scanf(\"%d\", &x);\n  y = x * x * x;\n  printf(\"%d\\n\", y);\n  return 0;\n}\n","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"-11","stderr":""}
-{"problem_id":"p02388","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int i;\n  for (;;) {\n    cin >> i;\n    cout << i * i * i << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int i;\n  cin >> i;\n  cout << i * i * i << endl;\n  return 0;\n}","change":"replace","i1":5,"i2":9,"j1":5,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p02389","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main(void) {\n  int a, b, menseki, syuu;\n  scanf(\"%d %d\", a, b);\n  menseki = a * b;\n  syuu = a * 2 + b * 2;\n  printf(\"%d %d\\n\", menseki, syuu);\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main(void) {\n  int a, b, menseki, syuu;\n  scanf(\"%d %d\", &a, &b);\n  menseki = a * b;\n  syuu = a * 2 + b * 2;\n  printf(\"%d %d\\n\", menseki, syuu);\n  return 0;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"-11","stderr":""}
-{"problem_id":"p02389","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main(void) {\n  int x, y;\n  scanf(\"%d %d\", x, y);\n  printf(\"%d %d\\n\", x * y, 2 * (x + y));\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint main(void) {\n  int x, y;\n  scanf(\"%d %d\", &x, &y);\n  int s = x * y;\n  int l = 2 * (x + y);\n  printf(\"%d %d\\n\", s, l);\n  return 0;\n}","change":"replace","i1":4,"i2":6,"j1":4,"j2":8,"error":"-11","stderr":""}
-{"problem_id":"p02389","language":"C++","original_status":"Runtime Error","original_src":"#include <cstdio>\n#include <iostream>\nusing namespace std;\nint main(void) {\n  int x = 0, y = 0;\n  scanf(\"%d %d\", x, y);\n  printf(\"%d %d\\n\", x * y, x * 2 + y * 2);\n  return 0;\n}\n","changed_src":"#include <cstdio>\n#include <iostream>\nusing namespace std;\nint main(void) {\n  int x = 0, y = 0;\n  scanf(\"%d %d\", &x, &y);\n  printf(\"%d %d\\n\", x * y, x * 2 + y * 2);\n  return 0;\n}\n","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"-11","stderr":""}
-{"problem_id":"p02389","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nusing namespace std;\nint main(void) {\n  \/\/ Your code here!\n  int a, b;\n  scanf(\"%d %d\", a, b);\n  printf(\"%d %d\\n\", 2 * (a + b), a * b);\n}\n","changed_src":"#include <stdio.h>\nusing namespace std;\nint main(void) {\n  \/\/ Your code here!\n  int a, b;\n  scanf(\"%d %d\", &a, &b);\n  printf(\"%d %d\\n\", a * b, 2 * (a + b));\n}\n","change":"replace","i1":5,"i2":7,"j1":5,"j2":7,"error":"-11","stderr":""}
-{"problem_id":"p02389","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main() {\n  int a, b;\n  scanf(\"%d %d\", a, &b);\n  printf(\"%d \", (a + b) * 2);\n  printf(\"%d\", a * b);\n}","changed_src":"#include <stdio.h>\n\nint main() {\n  int a, b;\n  scanf(\"%d %d\", &a, &b);\n  printf(\"%d \", a * b);\n  printf(\"%d\\n\", (a + b) * 2);\n}","change":"replace","i1":4,"i2":7,"j1":4,"j2":7,"error":"-11","stderr":""}
-{"problem_id":"p02389","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int a, b;\n  scanf(\"%d %d\", &a, b);\n  printf(\"%d %d\\n\", a * b, a + a + b + b);\n}","changed_src":"#include <stdio.h>\nint main() {\n  int a, b;\n  scanf(\"%d %d\", &a, &b);\n  printf(\"%d %d\\n\", a * b, a + a + b + b);\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"-11","stderr":""}
-{"problem_id":"p02389","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int a, b;\n  scanf(\"%d %d\", a, b);\n  printf(\"%d\\n\", a * b);\n  printf(\"%d\\n\", 2 * a + 2 * b);\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main() {\n  int a, b;\n  scanf(\"%d %d\", &a, &b);\n  printf(\"%d %d\\n\", a * b, 2 * a + 2 * b);\n  return 0;\n}","change":"replace","i1":3,"i2":6,"j1":3,"j2":5,"error":"-11","stderr":""}
-{"problem_id":"p02389","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main() {\n\n  int x, y, a, b;\n\n  scanf(\"%d\", x);\n  scanf(\"%d\", y);\n\n  a = x * y;\n  b = (x * 2) + (y * 2);\n\n  printf(\"%d %d\\n\", a, b);\n}","changed_src":"#include <stdio.h>\n\nint main() {\n\n  int x, y, a, b;\n\n  scanf(\"%d\", &x);\n  scanf(\"%d\", &y);\n\n  a = x * y;\n  b = (x * 2) + (y * 2);\n\n  printf(\"%d %d\\n\", a, b);\n}","change":"replace","i1":6,"i2":8,"j1":6,"j2":8,"error":"-11","stderr":""}
-{"problem_id":"p02389","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main(void) {\n  int a, b;\n  scanf(\"%d\", a);\n  scanf(\"%d\", b);\n  printf(\"%d\", a * b);\n\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint main(void) {\n  int a, b;\n  scanf(\"%d\", &a);\n  scanf(\"%d\", &b);\n  printf(\"%d %d\\n\", a * b, 2 * a + 2 * b);\n\n  return 0;\n}","change":"replace","i1":4,"i2":7,"j1":4,"j2":7,"error":"-11","stderr":""}
-{"problem_id":"p02389","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main() {\n\n  int angka1, angka2;\n  scanf(\"%d %d\", angka1, angka2);\n  printf(\"%d %d\\n\", angka1 * 3, (angka2 * 3) + 1);\n\n  return 0;\n}\n","changed_src":"#include <stdio.h>\n\nint main() {\n\n  int x1, x2, luas, luas1;\n  scanf(\"%d %d\", &x1, &x2);\n  luas = x1 * x2;\n  luas1 = (x1 + x2) * 2;\n  printf(\"%d %d\\n\", luas, luas1);\n\n  return 0;\n}\n","change":"replace","i1":4,"i2":7,"j1":4,"j2":9,"error":"-11","stderr":""}
-{"problem_id":"p02389","language":"Python","original_status":"Runtime Error","original_src":"a, b = [int(elem) for elem in input().split]\nprint(a * b, (a + b) * 2)\n","changed_src":"a, b = [int(elem) for elem in input().split()]\nprint(a * b, (a + b) * 2)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: 'builtin_function_or_method' object is not iterable","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02389\/Python\/s283815234.py\", line 1, in <module>\n    a, b = [int(elem) for elem in input().split]\nTypeError: 'builtin_function_or_method' object is not iterable\n"}
-{"problem_id":"p02389","language":"C++","original_status":"Runtime Error","original_src":"#include <cstdio>\n#include <cstdlib>\nint main(int argc, char *argv[]) {\n  int x = atoi(argv[1]);\n  int y = atoi(argv[2]);\n  printf(\"%d %d\\n\", x * y, 2 * (x + y));\n  return 0;\n}\n","changed_src":"#include <stdio.h>\n\nint main(void) {\n  int x, y;\n  scanf(\"%d %d\", &x, &y);\n  printf(\"%d %d\\n\", x * y, 2 * (x + y));\n  return 0;\n}\n","change":"replace","i1":0,"i2":5,"j1":0,"j2":5,"error":"-11","stderr":""}
-{"problem_id":"p02389","language":"Python","original_status":"Runtime Error","original_src":"nums = list(map(int, input().split(\" \")))\narea = nums[0] * nums[1]\nperimeter = nums[0] * 2 + nums[1] * 2\nprint(area + \" \" + perimeter)\n","changed_src":"nums = list(map(int, input().split(\" \")))\narea = nums[0] * nums[1]\nperimeter = nums[0] * 2 + nums[1] * 2\nprint(str(area) + \" \" + str(perimeter))\n","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"TypeError: unsupported operand type(s) for +: 'int' and 'str'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02389\/Python\/s255812565.py\", line 4, in <module>\n    print(area + \" \" + perimeter)\nTypeError: unsupported operand type(s) for +: 'int' and 'str'\n"}
-{"problem_id":"p02389","language":"Python","original_status":"Runtime Error","original_src":"line = int(input().split)\n\narea = line[0] * line[1] % 2\n\nperi = line[0] * 2 + line[1] * 2\n\nprint(area + \" \" + peri)\n","changed_src":"if __name__ == \"__main__\":\n    x = input()\n    a = int(x.split(\" \")[0])\n    b = int(x.split(\" \")[1])\n    print(a * b, (a + b) * 2)\n","change":"replace","i1":0,"i2":7,"j1":0,"j2":5,"error":"TypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02389\/Python\/s224773746.py\", line 2, in <module>\n    line = int(input().split)\nTypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'\n"}
-{"problem_id":"p02389","language":"Python","original_status":"Runtime Error","original_src":"nums = input().split()\nx = nums[0] * nums[1]\ny = nums[0] * 2 + nums[1] * 2\nprint(str(x) + \" \" + str(y))\n","changed_src":"nums = [int(e) for e in input().split()]\nx = nums[0] * nums[1]\ny = nums[0] * 2 + nums[1] * 2\nprint(str(x) + \" \" + str(y))\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: can't multiply sequence by non-int of type 'str'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02389\/Python\/s858282912.py\", line 2, in <module>\n    x = nums[0] * nums[1]\nTypeError: can't multiply sequence by non-int of type 'str'\n"}
-{"problem_id":"p02389","language":"Python","original_status":"Runtime Error","original_src":"a, b = [int(x) for x in input().split(\" \")]\n\nprint(\"{} {}\".format(a * b, 2 * a + 2 * b))\n","changed_src":"a, b = [int(x) for x in input().split()]\n\nprint(\"{} {}\".format(a * b, 2 * a + 2 * b))\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"0","stderr":""}
-{"problem_id":"p02389","language":"Python","original_status":"Runtime Error","original_src":"a, b = map(int, input().split())\nprint(a * b, 2(a + b))\n","changed_src":"a, b = map(int, input().split())\nprint(a * b, 2 * (a + b))\n","change":"replace","i1":1,"i2":2,"j1":1,"j2":2,"error":"TypeError: 'int' object is not callable","stderr":"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02389\/Python\/s046135584.py:2: SyntaxWarning: 'int' object is not callable; perhaps you missed a comma?\n  print(a * b, 2(a + b))\nTraceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02389\/Python\/s046135584.py\", line 2, in <module>\n    print(a * b, 2(a + b))\nTypeError: 'int' object is not callable\n"}
-{"problem_id":"p02389","language":"Python","original_status":"Runtime Error","original_src":"x = int(input().split(\" \"))\na = x[0] * x[1]\nb = x[0] + x[1] + x[0] + x[1]\nprint(str(a) + str(b))\n","changed_src":"x = input().split(\" \")\na = int(x[0]) * int(x[1])\nb = int(x[0]) + int(x[1]) + int(x[0]) + int(x[1])\nprint(str(a) + \" \" + str(b))\n","change":"replace","i1":0,"i2":4,"j1":0,"j2":4,"error":"TypeError: int() argument must be a string, a bytes-like object or a real number, not 'list'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02389\/Python\/s525009394.py\", line 1, in <module>\n    x = int(input().split(\" \"))\nTypeError: int() argument must be a string, a bytes-like object or a real number, not 'list'\n"}
-{"problem_id":"p02389","language":"Python","original_status":"Runtime Error","original_src":"a, b = map(int, input().splot())\nprint(str(a * b) + str(2 * a + 2 * b))\n","changed_src":"a, b = map(int, input().split())\nprint(str(a * b) + \" \" + str(2 * a + 2 * b))\n","change":"replace","i1":0,"i2":2,"j1":0,"j2":2,"error":"AttributeError: 'str' object has no attribute 'splot'. Did you mean: 'split'?","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02389\/Python\/s991335921.py\", line 1, in <module>\n    a, b = map(int, input().splot())\nAttributeError: 'str' object has no attribute 'splot'. Did you mean: 'split'?\n"}
-{"problem_id":"p02389","language":"Python","original_status":"Runtime Error","original_src":"n = input()\na, b = int(n.split())\nx = a * b\ny = 2 * (a + b)\nprint(x, y)\n","changed_src":"n = input()\na, b = n.split()\na = int(a)\nb = int(b)\nx = a * b\ny = 2 * (a + b)\nprint(x, y)\n","change":"replace","i1":1,"i2":2,"j1":1,"j2":4,"error":"TypeError: int() argument must be a string, a bytes-like object or a real number, not 'list'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02389\/Python\/s485129018.py\", line 2, in <module>\n    a, b = int(n.split())\nTypeError: int() argument must be a string, a bytes-like object or a real number, not 'list'\n"}
-{"problem_id":"p02389","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main(void) {\n  int x = 0;\n  int y = 0;\n  scanf(\"%d %d\", x, y);\n  printf(\"%d %d\", x * y, 2 * (x + y));\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main(void) {\n  int x = 0;\n  int y = 0;\n  scanf(\"%d %d\", &x, &y);\n  printf(\"%d %d\\n\", x * y, 2 * x + 2 * y);\n  return 0;\n}","change":"replace","i1":4,"i2":6,"j1":4,"j2":6,"error":"-11","stderr":""}
-{"problem_id":"p02390","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int S1, h, m, s;\n  cin >> S1;\n  h = S1 \/ 60 \/ 60;\n  m = h % h;\n  s = m % m;\n  cout << h << ':' << m << ':' << s << endl;\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int S1, h, m, s;\n  cin >> S1;\n  h = S1 \/ 3600;\n  m = S1 % 3600 \/ 60;\n  s = S1 % 60;\n  cout << h << ':' << m << ':' << s << endl;\n  return 0;\n}\n","change":"replace","i1":5,"i2":8,"j1":5,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02390","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nint main() {\n  int S, h = 0, m = 0;\n  std::cin >> S;\n  while (S \/ 3600 > 0) {\n    h++;\n    S = S - 3600;\n  }\n  while (S \/ 60 > 0) {\n    m++;\n    m = m - 60;\n  }\n  std::cout << h << \":\" << m << \":\" << S << std::endl;\n}","changed_src":"#include <iostream>\nint main() {\n  int S, h = 0, m = 0;\n  std::cin >> S;\n  h = S \/ 3600;\n  S = S % 3600;\n  m = S \/ 60;\n  S = S % 60;\n  std::cout << h << \":\" << m << \":\" << S << std::endl;\n}","change":"replace","i1":4,"i2":12,"j1":4,"j2":8,"error":"TLE","stderr":""}
-{"problem_id":"p02390","language":"Python","original_status":"Runtime Error","original_src":"sec = int(input())\ntmp = [sec \/\/ 3600, (sec \/\/ 60) % 60, sec % 60]\nprint(\":\".join(tmp))\n","changed_src":"sec = int(input())\ntmp = map(str, [sec \/\/ 3600, (sec \/\/ 60) % 60, sec % 60])\nprint(\":\".join(tmp))\n","change":"replace","i1":1,"i2":2,"j1":1,"j2":2,"error":"TypeError: sequence item 0: expected str instance, int found","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02390\/Python\/s175016753.py\", line 3, in <module>\n    print(':'.join(tmp))\nTypeError: sequence item 0: expected str instance, int found\n"}
-{"problem_id":"p02390","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main() {\n  int x, h, m, s;\n  scanf(\"%d\", x);\n\n  h = x \/ 3600;\n  m = x % 3600 \/ 60;\n  s = x % 60;\n\n  printf(\"%d:%d:%d\\n\", h, m, s);\n\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint main() {\n  int x, h, m, s;\n  scanf(\"%d\", &x);\n\n  h = x \/ 3600;\n  m = x % 3600 \/ 60;\n  s = x % 60;\n\n  printf(\"%d:%d:%d\\n\", h, m, s);\n\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"-11","stderr":""}
-{"problem_id":"p02390","language":"Python","original_status":"Runtime Error","original_src":"S = int(input())\nh = S \/\/ 3600\nm = (S % 3600) \/\/ 60\ns = (S % 3600) % 60\nprint(\":\".join[h, m, s])\n","changed_src":"S = int(input())\nh = S \/\/ 3600\nm = (S % 3600) \/\/ 60\ns = (S % 3600) % 60\nprint(str(h) + \":\" + str(m) + \":\" + str(s))\n","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"TypeError: 'builtin_function_or_method' object is not subscriptable","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02390\/Python\/s528957896.py\", line 5, in <module>\n    print(':'.join[h, m, s])\nTypeError: 'builtin_function_or_method' object is not subscriptable\n"}
-{"problem_id":"p02390","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int s, m, h;\n  scanf(\"%d\", s);\n  h = s \/ 3600;\n  m = (s - 3600 * h) \/ 60;\n  s -= 3600 * h + 60 * m;\n  printf(\"%d:%d:%d\\n\", h, m, s);\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main() {\n  int s, h, m;\n  scanf(\"%d\", &s);\n  h = (int)s \/ 3600;\n  m = (int)(s - 3600 * h) \/ 60;\n  s = s - (int)(3600 * h + 60 * m);\n  printf(\"%d:%d:%d\\n\", h, m, s);\n  return 0;\n}","change":"replace","i1":2,"i2":7,"j1":2,"j2":7,"error":"-11","stderr":""}
-{"problem_id":"p02390","language":"Python","original_status":"Runtime Error","original_src":"sho = int(input()) \/\/ 60\namari = int(input()) % 60\n\nh = sho \/\/ 60\nm = sho % 60\ns = amari\n\nprint(\"{}:{}:{}\".format(h, m, s))\n","changed_src":"sho, s = divmod(int(input()), 60)\nh, m = divmod(sho, 60)\nprint(\"{}:{}:{}\".format(h, m, s))\n","change":"replace","i1":0,"i2":7,"j1":0,"j2":2,"error":"EOFError: EOF when reading a line","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02390\/Python\/s320807078.py\", line 2, in <module>\n    amari = int(input()) % 60\nEOFError: EOF when reading a line\n"}
-{"problem_id":"p02390","language":"Python","original_status":"Runtime Error","original_src":"x = input()\ns = x % 60\nx \/\/= 60\nm = x % 60\nx \/\/= 60\nprint(\"{}:{}:{}\".format(x, m, s))\n","changed_src":"x = int(input())\ns = x % 60\nx \/\/= 60\nm = x % 60\nx \/\/= 60\nprint(\"{}:{}:{}\".format(x, m, s))\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: not all arguments converted during string formatting","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02390\/Python\/s450465833.py\", line 2, in <module>\n    s = x % 60\nTypeError: not all arguments converted during string formatting\n"}
-{"problem_id":"p02390","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <math.h>\n#include <stdio.h>\n\nusing namespace std;\n\nint h, m, s;\nint main() {\n  cin >> s;\n\n  h = s \/ 3600;\n  m = (s % 3600) \/ 60;\n  s = s % 60;\n\n  printf(\"%s:%s:%s\", h, m, s);\n\n  return 0;\n}","changed_src":"#include <iostream>\n#include <math.h>\n#include <stdio.h>\n\nusing namespace std;\n\nint h, m, s;\nint main() {\n  cin >> s;\n\n  h = s \/ 3600;\n  m = (s % 3600) \/ 60;\n  s = s % 60;\n\n  printf(\"%d:%d:%d\\n\", h, m, s);\n\n  return 0;\n}","change":"replace","i1":14,"i2":15,"j1":14,"j2":15,"error":"-11","stderr":""}
-{"problem_id":"p02391","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main() {\n  int a, b;\n\n  scanf(\"%d\", &a);\n  scanf(\"%d\", b);\n  if (a < b)\n    printf(\"a < b\\n\");\n  if (a > b)\n    printf(\"a > b\\n\");\n  if (a == b)\n    printf(\"a == b\\n\");\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint main() {\n  int a, b;\n\n  scanf(\"%d\", &a);\n  scanf(\"%d\", &b);\n  if (a < b)\n    printf(\"a < b\\n\");\n  if (a > b)\n    printf(\"a > b\\n\");\n  if (a == b)\n    printf(\"a == b\\n\");\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"-11","stderr":""}
-{"problem_id":"p02391","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main(void) {\n  int a, b;\n  scanf(\"%d %d\", a, b);\n  if (a < b) {\n    printf(\"a < b\\n\");\n  } else {\n    if (a > b) {\n      printf(\"a > b\\n\");\n    } else {\n      if (a == b) {\n        printf(\"a == b\\n\");\n      }\n    }\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint main(void) {\n  int a, b;\n  scanf(\"%d %d\", &a, &b);\n  if (a < b) {\n    printf(\"a < b\\n\");\n  } else {\n    if (a > b) {\n      printf(\"a > b\\n\");\n    } else {\n      if (a == b) {\n        printf(\"a == b\\n\");\n      }\n    }\n  }\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"-11","stderr":""}
-{"problem_id":"p02391","language":"Python","original_status":"Runtime Error","original_src":"string = input()\na, b = input().split(\" \")\nif a > b:\n    print(\"a > b\")\nelif a < b:\n    print(\"a < b\")\nelse:\n    print(\"a == b\")\n","changed_src":"string = input()\na, b = map(int, (string.split(\" \")))\nif a > b:\n    print(\"a > b\")\nelif a < b:\n    print(\"a < b\")\nelse:\n    print(\"a == b\")\n","change":"replace","i1":1,"i2":2,"j1":1,"j2":2,"error":"EOFError: EOF when reading a line","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02391\/Python\/s667691498.py\", line 2, in <module>\n    a, b = input().split(' ')\nEOFError: EOF when reading a line\n"}
-{"problem_id":"p02391","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main(void) {\n  int a, b;\n\n  scanf(\"%d %d\", a, b);\n\n  if (a > b) {\n    printf(\"a > b\\n\");\n  }\n\n  if (a < b) {\n    printf(\"a < b\\n\");\n  }\n\n  if (a == b) {\n    printf(\"a == b\\n\");\n  }\n\n  return 0;\n}\n","changed_src":"#include <stdio.h>\nint main(void) {\n  int a, b;\n\n  scanf(\"%d %d\\n\", &a, &b);\n\n  if (a > b) {\n    printf(\"a > b\\n\");\n  }\n\n  if (a < b) {\n    printf(\"a < b\\n\");\n  }\n\n  if (a == b) {\n    printf(\"a == b\\n\");\n  }\n\n  return 0;\n}\n","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"-11","stderr":""}
-{"problem_id":"p02391","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main(void) {\n  int a, b;\n  scanf(\"%d%d\", &a, &b);\n  char s;\n  if (a > b)\n    s = '>';\n  else if (a == b)\n    s = '=';\n  else\n    s = '<';\n  if (s != '=')\n    printf(\"a %s b\\n\", s);\n  else\n    printf(\"a == b\\n\");\n  return 0;\n}\n","changed_src":"#include <stdio.h>\n\nint main(void) {\n  int a, b;\n  scanf(\"%d%d\", &a, &b);\n  char s;\n  if (a > b)\n    s = '>';\n  else if (a == b)\n    s = '=';\n  else\n    s = '<';\n  if (s != '=')\n    printf(\"a %c b\\n\", s);\n  else\n    printf(\"a == b\\n\");\n  return 0;\n}\n","change":"replace","i1":13,"i2":14,"j1":13,"j2":14,"error":"-11","stderr":""}
-{"problem_id":"p02391","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\n\nint main() {\n\n  int a, b;\n  scanf(\"%d %d\", &a, &b);\n\n  printf(\"a %s b\\n\", a, (a < b) ? \"<\" : (a == b) ? \"==\" : \">\", b);\n}\n","changed_src":"#include <bits\/stdc++.h>\n\nint main() {\n\n  int a, b;\n  scanf(\"%d %d\", &a, &b);\n\n  printf(\"a %s b\\n\", (a < b) ? \"<\" : (a == b) ? \"==\" : \">\");\n}\n","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"-11","stderr":""}
-{"problem_id":"p02391","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int a, b;\n  for (;;) {\n    cin >> a >> b;\n    if (a < b) {\n      cout << \"a < b\" << endl;\n    } else if (a > b) {\n      cout << \"a > b\" << endl;\n    } else if (a == b) {\n      cout << \"a == b\" << endl;\n    }\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int a, b;\n  cin >> a >> b;\n  if (a < b) {\n    cout << \"a < b\" << endl;\n  } else if (a > b) {\n    cout << \"a > b\" << endl;\n  } else if (a == b) {\n    cout << \"a == b\" << endl;\n  }\n  return 0;\n}","change":"replace","i1":4,"i2":13,"j1":4,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p02391","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main(void) {\n  int a, b;\n  scanf(\"%d %d\", a, b);\n  if (a > b) {\n    printf(\"a>b\\n\");\n  } else if (a < b) {\n    printf(\"a<b\\n\");\n  } else {\n    printf(\"a==b\\n\");\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main(void) {\n  int a, b;\n  scanf(\"%d %d\", &a, &b);\n  if (a >= -1000 && a <= 1000 && b >= -1000 && b <= 1000) {\n    if (a > b) {\n      printf(\"a > b\\n\");\n    } else if (a < b) {\n      printf(\"a < b\\n\");\n    } else {\n      printf(\"a == b\\n\");\n    }\n  }\n  return 0;\n}","change":"replace","i1":3,"i2":10,"j1":3,"j2":12,"error":"-11","stderr":""}
-{"problem_id":"p02392","language":"Python","original_status":"Runtime Error","original_src":"a, b, c = map(int, input.split())\nif a < b < c:\n    print(\"Yes\")\nelse:\n    print(\"No\")\n","changed_src":"a, b, c = map(int, input().split())\nif a < b < c:\n    print(\"Yes\")\nelse:\n    print(\"No\")\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"AttributeError: 'builtin_function_or_method' object has no attribute 'split'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02392\/Python\/s498567988.py\", line 1, in <module>\n    a, b, c = map(int, input.split())\nAttributeError: 'builtin_function_or_method' object has no attribute 'split'\n"}
-{"problem_id":"p02392","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main(void) {\n  int a, b, c;\n  scanf(\"%d %d %d\", a, b, c);\n\n  if (a < b && b < c)\n\n  {\n    printf(\"Yes\\n\");\n  }\n\n  else {\n    printf(\"No\\n\");\n  }\n\n  return 0;\n}\n","changed_src":"#include <stdio.h>\nint main(void) {\n  int a, b, c;\n  scanf(\"%d %d %d\", &a, &b, &c);\n\n  if (a < b && b < c)\n\n  {\n    printf(\"Yes\\n\");\n  }\n\n  else {\n    printf(\"No\\n\");\n  }\n\n  return 0;\n}\n","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"-11","stderr":""}
-{"problem_id":"p02392","language":"Python","original_status":"Runtime Error","original_src":"d = input()\na, b, c = map(d.split())\n\nif (a < b) and (b < c):\n    print(\"Yes\")\nelse:\n    print(\"No\")\n","changed_src":"d = input()\na, b, c = map(int, d.split())\nif (a < b) and (b < c):\n    print(\"Yes\")\nelse:\n    print(\"No\")\n","change":"replace","i1":1,"i2":3,"j1":1,"j2":2,"error":"TypeError: map() must have at least two arguments.","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02392\/Python\/s458135705.py\", line 2, in <module>\n    a, b, c = map(d.split())\nTypeError: map() must have at least two arguments.\n"}
-{"problem_id":"p02392","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main() {\n\n  int a, b, c;\n  scanf(\"%d %d %d\", a, b, c);\n  if (a < b && a < c && b < c) {\n    printf(\"Yes\\n\");\n  } else {\n    printf(\"No\\n\");\n  }\n\n  return 0;\n}\n","changed_src":"#include <stdio.h>\n\nint main() {\n\n  int a, b, c;\n  scanf(\"%d %d %d\", &a, &b, &c);\n  if (a < b && a < c && b < c) {\n    printf(\"Yes\\n\");\n  } else {\n    printf(\"No\\n\");\n  }\n\n  return 0;\n}\n","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"-11","stderr":""}
-{"problem_id":"p02392","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main(void) {\n  int a, b, c;\n  scanf(\"%d %d %d\", a & a, &b, &c);\n  if (a < b && b < c)\n    printf(\"Yes\\n\");\n  else\n    printf(\"No\\n\");\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main(void) {\n  int a, b, c;\n  scanf(\"%d %d %d\", &a, &b, &c);\n  if (a < b && b < c)\n    printf(\"Yes\\n\");\n  else\n    printf(\"No\\n\");\n  return 0;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"-11","stderr":""}
-{"problem_id":"p02392","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int a, b, c;\n  scanf(\"%d %d %d\", a, b, c);\n  if (a < b && b < c) {\n    printf(\"Yes\\n\");\n  } else {\n    printf(\"No\\n\");\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main() {\n  int a, b, c;\n  scanf(\"%d %d %d\", &a, &b, &c);\n  if (a < b && b < c) {\n    printf(\"Yes\\n\");\n  } else {\n    printf(\"No\\n\");\n  }\n  return 0;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"-11","stderr":""}
-{"problem_id":"p02392","language":"C++","original_status":"Runtime Error","original_src":"#include <cstdio>\n\nint main() {\n  int a, b, c;\n  scanf(\"%d %d %d\", a, b, c);\n  if (a < b && b < c) {\n    printf(\"Yes\\n\");\n  } else {\n    printf(\"No\\n\");\n  }\n}","changed_src":"#include <cstdio>\n\nint main() {\n  int a, b, c;\n  scanf(\"%d %d %d\", &a, &b, &c);\n  if (a < b && b < c) {\n    printf(\"Yes\\n\");\n  } else {\n    printf(\"No\\n\");\n  }\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"-11","stderr":""}
-{"problem_id":"p02392","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int a, b, c;\n  scanf(\"%d\", a);\n  scanf(\"%d\", b);\n  scanf(\"%d\", c);\n  if (a < b && b < c)\n    printf(\"Yes\\n\");\n  else\n    printf(\"No\\n\");\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main() {\n  int a, b, c;\n  scanf(\"%d\", &a);\n  scanf(\"%d\", &b);\n  scanf(\"%d\", &c);\n  if (a < b && b < c)\n    printf(\"Yes\\n\");\n  else\n    printf(\"No\\n\");\n  return 0;\n}","change":"replace","i1":3,"i2":6,"j1":3,"j2":6,"error":"-11","stderr":""}
-{"problem_id":"p02392","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main(void) {\n  int a, b, c;\n  scanf(\"%d\", a);\n  scanf(\"%d\", b);\n  scanf(\"%d\", c);\n  if (a < b < c) {\n    printf(\"Yes\\n\");\n  } else {\n    printf(\"No\\n\");\n  }\n  return 0;\n}\n","changed_src":"#include <stdio.h>\nint main(void) {\n  int a, b, c;\n  scanf(\"%d\", &a);\n  scanf(\"%d\", &b);\n  scanf(\"%d\", &c);\n  if (a < b && b < c) {\n    printf(\"Yes\\n\");\n  } else {\n    printf(\"No\\n\");\n  }\n  return 0;\n}\n","change":"replace","i1":3,"i2":7,"j1":3,"j2":7,"error":"-11","stderr":""}
-{"problem_id":"p02392","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main() {\n\n  int a, b, c;\n\n  scanf(\"%d %d %d\", a, b, c);\n\n  if (a < b && b < c) {\n    printf(\"Yes\\n\");\n  } else {\n    printf(\"No\\n\");\n  }\n\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint main() {\n\n  int a, b, c;\n\n  scanf(\"%d %d %d\", &a, &b, &c);\n\n  if (a < b && b < c) {\n    printf(\"Yes\\n\");\n  } else {\n    printf(\"No\\n\");\n  }\n\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"-11","stderr":""}
-{"problem_id":"p02392","language":"C++","original_status":"Runtime Error","original_src":"#include <cstdio>\n\nint main() {\n  \/\/ \u5165\u529b\n  int a, b, c;\n  std::scanf(\"%d%d%d\", a, b, c);\n\n  if (a < b && b < c) {\n    std::printf(\"Yes\");\n  } else {\n    std::printf(\"No\");\n  }\n  std::printf(\"\\n\");\n\n  return 0;\n}\n","changed_src":"#include <cstdio>\n\nint main() {\n  \/\/ \u5165\u529b\n  int a, b, c;\n  std::scanf(\"%d%d%d\", &a, &b, &c);\n\n  if (a < b && b < c) {\n    std::printf(\"Yes\");\n  } else {\n    std::printf(\"No\");\n  }\n  std::printf(\"\\n\");\n\n  return 0;\n}\n","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"-11","stderr":""}
-{"problem_id":"p02392","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <stdlib.h>\nusing namespace std;\n\nint main(void) {\n\n  int a, b, c;\n  cin >> a >> b >> c;\n  if (a < b) {\n    if (b < c) {\n      cout << \"Yes\" << endl;\n      exit(1);\n    }\n  }\n  cout << \"No\" << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n#include <stdlib.h>\nusing namespace std;\n\nint main(void) {\n\n  int a, b, c;\n  cin >> a >> b >> c;\n  if (a < b) {\n    if (b < c) {\n      cout << \"Yes\" << endl;\n      return 0;\n    }\n  }\n  cout << \"No\" << endl;\n  return 0;\n}","change":"replace","i1":11,"i2":12,"j1":11,"j2":12,"error":"1","stderr":""}
-{"problem_id":"p02392","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int a, b, c;\n  scanf(\"%d %d %d\", a, b, c);\n  if (a < b && b < c)\n    printf(\"Yes\\n\");\n  else\n    printf(\"No\\n\");\n\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main() {\n  int a, b, c;\n  scanf(\"%d %d %d\", &a, &b, &c);\n  if (a < b && b < c)\n    printf(\"Yes\\n\");\n  else\n    printf(\"No\\n\");\n\n  return 0;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"-11","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b, c, tmp;\n  cin >> a >> b >> c;\n\n  while (!(a < b && b < c)) {\n    if (a > b) {\n      tmp = a;\n      a = b;\n      b = tmp;\n    }\n    if (b > c) {\n      tmp = b;\n      b = c;\n      c = tmp;\n    }\n  }\n\n  cout << a << \" \" << b << \" \" << c << endl;\n  ;\n\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b, c, tmp;\n  cin >> a >> b >> c;\n\n  while (!(a <= b && b <= c)) {\n    if (a > b) {\n      tmp = a;\n      a = b;\n      b = tmp;\n    }\n    if (b > c) {\n      tmp = b;\n      b = c;\n      c = tmp;\n    }\n  }\n\n  cout << a << \" \" << b << \" \" << c << endl;\n  ;\n\n  return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"TLE","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\n\/\/ \u30dd\u30a4\u30f3\u30bf\u6e21\u3057\u306b\u3088\u308b\u89e3\u6cd5\n\nvoid swap(int *a, int *b);\n\nint main() {\n\n  int a, b, c;\n\n  cin >> a >> b >> c;\n\n  if (a > b)\n    swap(&a, &b);\n  if (b > c)\n    swap(&b, &c);\n\n  if (a > b)\n    swap(&a, &b);\n\n  cout << a << \" \" << b << \" \" << c << endl;\n\n  while (1) {\n  }\n\n  return 0;\n}\n\nvoid swap(int *a, int *b) {\n\n  int temp = *a;\n  *a = *b;\n  *b = temp;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\n\n\/\/ \u30dd\u30a4\u30f3\u30bf\u6e21\u3057\u306b\u3088\u308b\u89e3\u6cd5\n\nvoid swap(int *a, int *b);\n\nint main() {\n\n  int a, b, c;\n\n  cin >> a >> b >> c;\n\n  if (a > b)\n    swap(&a, &b);\n  if (b > c)\n    swap(&b, &c);\n\n  if (a > b)\n    swap(&a, &b);\n\n  cout << a << \" \" << b << \" \" << c << endl;\n\n  return 0;\n}\n\nvoid swap(int *a, int *b) {\n\n  int temp = *a;\n  *a = *b;\n  *b = temp;\n}\n","change":"delete","i1":23,"i2":26,"j1":23,"j2":23,"error":"TLE","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n#include <string>\nusing namespace std;\nint main() {\n  int a, b, c;\n  cin >> a >> b >> c;\n  int t = 0;\nloop:;\n  t = 0;\n  if (a > b) {\n    t = t + 1;\n    swap(a, b);\n  }\n  if (b > c) {\n    t = t + 1;\n    swap(a, b);\n  }\n  if (t != 0) {\n    goto loop;\n  }\n  cout << a << \" \" << b << \" \" << c << endl;\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <iostream>\n#include <string>\nusing namespace std;\nint main() {\n  int a, b, c;\n  cin >> a >> b >> c;\n  int t = 0;\nloop:;\n  t = 0;\n  if (a > b) {\n    t = t + 1;\n    swap(a, b);\n  }\n  if (b > c) {\n    t = t + 1;\n    swap(b, c);\n  }\n  if (t != 0) {\n    goto loop;\n  }\n  cout << a << \" \" << b << \" \" << c << endl;\n  return 0;\n}\n","change":"replace","i1":16,"i2":17,"j1":16,"j2":17,"error":"TLE","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\n\nint main() {\n  int x, y, z;\n  scanf(\"%d %d %d\", &x, &y, &z);\n\n  int a[3] = {x, y, z}, buff = 0;\n\n  while (1) {\n    for (int i = 0; i < 3; i++) {\n      for (int j = i; j < 3; j++) {\n        if (a[i] > a[j]) {\n          buff = a[j];\n          a[j] = a[i];\n          a[i] = buff;\n        }\n      }\n    }\n    if (a[0] < a[1] && a[1] < a[2])\n      break;\n  }\n\n  printf(\"%d %d %d\\n\", a[0], a[1], a[2]);\n  return 0;\n}","changed_src":"#include <cstdio>\n\nint main() {\n  int x, y, z;\n  scanf(\"%d %d %d\", &x, &y, &z);\n\n  int a[3] = {x, y, z}, buff = 0;\n\n  while (1) {\n    for (int i = 0; i < 3; i++) {\n      for (int j = i; j < 3; j++) {\n        if (a[i] > a[j]) {\n          buff = a[j];\n          a[j] = a[i];\n          a[i] = buff;\n        }\n      }\n    }\n    if (a[0] <= a[1] && a[1] <= a[2])\n      break;\n  }\n\n  printf(\"%d %d %d\\n\", a[0], a[1], a[2]);\n  return 0;\n}","change":"replace","i1":18,"i2":19,"j1":18,"j2":19,"error":"TLE","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b, c, temp;\n\n  cin >> a >> b >> c;\n\n  while (1) {\n    if (a < b && b < c)\n      break;\n    else if (b < a) {\n      temp = b;\n      b = a;\n      a = temp;\n    } else if (c < b) {\n      temp = c;\n      c = b;\n      b = temp;\n    } else if (c < a) {\n      temp = c;\n      c = a;\n      a = temp;\n    }\n  }\n  cout << a << \" \" << b << \" \" << c << endl;\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b, c, temp;\n\n  cin >> a >> b >> c;\n\n  while (1) {\n    if ((a < b && b < c) || (a == b && b < c) || (a == b && b == c))\n      break;\n    else if (b < a) {\n      temp = b;\n      b = a;\n      a = temp;\n    } else if (c < b) {\n      temp = c;\n      c = b;\n      b = temp;\n    } else if (c < a) {\n      temp = c;\n      c = a;\n      a = temp;\n    }\n  }\n  cout << a << \" \" << b << \" \" << c << endl;\n  return 0;\n}","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  vector<int> a;\n\n  cin >> a[0] >> a[1] >> a[2];\n\n  sort(a.begin(), a.end());\n\n  cout << a[0] << \" \" << a[1] << \" \" << a[2] << endl;\n\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  vector<int> a(3);\n\n  cin >> a[0] >> a[1] >> a[2];\n\n  sort(a.begin(), a.end());\n\n  cout << a[0] << \" \" << a[1] << \" \" << a[2] << endl;\n\n  return 0;\n}\n","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"-11","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\nint main() {\n  int a[3];\n  for (int i = 0; i < 3; ++i) {\n    std::cin >> a[i];\n  }\n  std::sort(a, a + 3);\n  for (int i = 0; i < 3; --i) {\n    std::cout << a[i] << std::endl;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\nint main() {\n  int a[3];\n  for (int i = 0; i < 3; ++i) {\n    std::cin >> a[i];\n  }\n  std::sort(a, a + 3);\n  std::cout << a[0] << \" \" << a[1] << \" \" << a[2] << std::endl;\n  return 0;\n}","change":"replace","i1":8,"i2":11,"j1":8,"j2":9,"error":"TLE","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b, c;\n  int temp;\n  cin >> a >> b >> c;\n\n  while (1) {\n    if (a > b) {\n      temp = a;\n      a = b;\n      b = temp;\n    }\n    if (b > c) {\n      temp = b;\n      b = c;\n      c = temp;\n    }\n    if (a > b) {\n      temp = a;\n      a = b;\n      b = temp;\n    }\n\n    if (a < b && b < c) {\n      cout << a << \" \" << b << \" \" << c << endl;\n      return 0;\n    }\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b, c;\n  int temp;\n  cin >> a >> b >> c;\n\n  while (1) {\n    if (a > b) {\n      temp = a;\n      a = b;\n      b = temp;\n    }\n    if (b > c) {\n      temp = b;\n      b = c;\n      c = temp;\n    }\n    if (a > b) {\n      temp = a;\n      a = b;\n      b = temp;\n    }\n\n    if (a <= b && b <= c) {\n      cout << a << \" \" << b << \" \" << c << endl;\n      return 0;\n    }\n  }\n  return 0;\n}","change":"replace","i1":25,"i2":26,"j1":25,"j2":26,"error":"TLE","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main(void) {\n  int i, j, a[3];\n\n  scanf(\"%d %d %d\", a[0], a[1], a[2]);\n\n  for (i = 0; i < 2; i++) {\n    for (j = 2; j > i; j--) {\n      if (a[j - 1] > a[j]) {\n        int temp = a[j];\n        a[j] = a[j - 1];\n        a[j - 1] = temp;\n      }\n    }\n  }\n\n  printf(\"%d %d %d\\n\", a[0], a[1], a[2]);\n}","changed_src":"#include <stdio.h>\n\nint main(void) {\n  int i, j, a[3];\n\n  scanf(\"%d %d %d\", &a[0], &a[1], &a[2]);\n\n  for (i = 0; i < 2; i++) {\n    for (j = 2; j > i; j--) {\n      if (a[j - 1] > a[j]) {\n        int temp = a[j];\n        a[j] = a[j - 1];\n        a[j - 1] = temp;\n      }\n    }\n  }\n\n  printf(\"%d %d %d\\n\", a[0], a[1], a[2]);\n}","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"-11","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\n\nint main() {\n\n  int a, b, c, m;\n  scanf(\"%d%d%d\", &a, &b, &c);\n  while (1) {\n    if (a < b && b < c) {\n      break;\n    }\n    if (a > b) {\n      m = b;\n      b = a;\n      a = m;\n    }\n    if (b > c) {\n      m = c;\n      c = b;\n      b = m;\n    }\n    if (a > c) {\n      m = c;\n      c = a;\n      a = m;\n    }\n  }\n  printf(\"%d %d %d\\n\", a, b, c);\n  return 0;\n}\n","changed_src":"#include <stdio.h>\n\nint main() {\n\n  int a, b, c, m;\n  scanf(\"%d%d%d\", &a, &b, &c);\n  if (a > b) {\n    m = b;\n    b = a;\n    a = m;\n  }\n  if (b > c) {\n    m = c;\n    c = b;\n    b = m;\n  }\n  if (a > b) {\n    m = b;\n    b = a;\n    a = m;\n  }\n  printf(\"%d %d %d\\n\", a, b, c);\n  return 0;\n}\n","change":"replace","i1":6,"i2":25,"j1":6,"j2":20,"error":"TLE","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\ntypedef vector<int> VI;\ntypedef pair<int, int> PI;\n\nint main() {\n  int a[3];\n  for (int i = 0; i < 3; i++)\n    cin >> a[i];\n  sort(a, a + 3);\n  for (int e : a)\n    cout << e << \" \";\n  cout << endl;\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\ntypedef vector<int> VI;\ntypedef pair<int, int> PI;\n\nint main() {\n  int a[3];\n  for (int i = 0; i < 3; i++)\n    cin >> a[i];\n  sort(a, a + 3);\n  cout << a[0] << \" \" << a[1] << \" \" << a[2] << endl;\n  return 0;\n}\n","change":"replace","i1":13,"i2":16,"j1":13,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint main(void) {\n  int a, b, c, d;\n  cin >> a >> b >> c;\n  while (1) {\n    if (a < b && b < c && a < c)\n      break;\n    if (a > b) {\n      d = a;\n      a = b;\n      b = d;\n    }\n    if (b > c) {\n      d = b;\n      b = c;\n      c = d;\n    }\n    if (a > c) {\n      d = a;\n      a = c;\n      c = d;\n    }\n  }\n  cout << a << ' ' << b << ' ' << c << endl;\n\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint main(void) {\n  int a, b, c, d;\n  cin >> a >> b >> c;\n  while (1) {\n    if (a <= b && b <= c && a <= c)\n      break;\n    if (a > b) {\n      d = a;\n      a = b;\n      b = d;\n    }\n    if (b > c) {\n      d = b;\n      b = c;\n      c = d;\n    }\n    if (a > c) {\n      d = a;\n      a = c;\n      c = d;\n    }\n  }\n  cout << a << ' ' << b << ' ' << c << endl;\n\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cctype>\n#include <cmath>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nint main() {\n  int a, b, c, t;\n  scanf(\"%d %d %d\", &a, &b, &c);\n  for (;;) {\n    if (a < b && b < c) {\n      break;\n    }\n    if (a > b) {\n      t = a;\n      a = b;\n      b = t;\n    }\n    if (b > c) {\n      t = b;\n      b = c;\n      c = t;\n    }\n  }\n  printf(\"%d %d %d\\n\", a, b, c);\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cctype>\n#include <cmath>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nint main() {\n  int a, b, c, t;\n  scanf(\"%d %d %d\", &a, &b, &c);\n  for (;;) {\n    if (a <= b && b <= c) {\n      break;\n    }\n    if (a > b) {\n      t = a;\n      a = b;\n      b = t;\n    }\n    if (b > c) {\n      t = b;\n      b = c;\n      c = t;\n    }\n  }\n  printf(\"%d %d %d\\n\", a, b, c);\n  return 0;\n}","change":"replace","i1":11,"i2":12,"j1":11,"j2":12,"error":"TLE","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b, c, x, y;\n  cin >> a >> b >> c;\n  while (!(a < b && b < c)) {\n    if (a > b) {\n      x = a;\n      y = b;\n      a = y;\n      b = x;\n    }\n    if (b > c) {\n      x = b;\n      y = c;\n      b = y;\n      c = x;\n    }\n  }\n  cout << a << \" \" << b << \" \" << c << endl;\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b, c, x, y;\n  cin >> a >> b >> c;\n  while (!(a <= b && b <= c)) {\n    if (a > b) {\n      x = a;\n      y = b;\n      a = y;\n      b = x;\n    }\n    if (b > c) {\n      x = b;\n      y = c;\n      b = y;\n      c = x;\n    }\n  }\n  cout << a << \" \" << b << \" \" << c << endl;\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int a, b, c;\n  int temp;\n  cin >> a;\n  cin >> b;\n  cin >> c;\n  while (!(a < b && b < c)) {\n    if (a > b) {\n      temp = a;\n      a = b;\n      b = temp;\n    }\n    if (b > c) {\n      temp = b;\n      b = c;\n      c = temp;\n    }\n  }\n  cout << a << \" \" << b << \" \" << c << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int a, b, c;\n  int temp;\n  cin >> a;\n  cin >> b;\n  cin >> c;\n  while (!(a <= b && b <= c)) {\n    if (a > b) {\n      temp = a;\n      a = b;\n      b = temp;\n    }\n    if (b > c) {\n      temp = b;\n      b = c;\n      c = temp;\n    }\n  }\n  cout << a << \" \" << b << \" \" << c << endl;\n  return 0;\n}","change":"replace","i1":10,"i2":11,"j1":10,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main(void) {\n\n  int i, j;\n  int a[3];\n  int temp;\n\n  scanf(\"%d %d %d\", &a[0], &a[1], &a[2]);\n\n  for (i = 0; i < 3; i++) {\n    for (j = 2; j >= i; j--) {\n      if (a[j] < a[j - 1]) {\n        temp = a[j];\n        a[j] = a[j - 1];\n        a[j - 1] = temp;\n      }\n    }\n  }\n\n  printf(\"%d %d %d\\n\", a[0], a[1], a[2]);\n\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint main(void) {\n\n  int i, j;\n  int a[3];\n  int temp;\n\n  scanf(\"%d %d %d\", &a[0], &a[1], &a[2]);\n\n  for (i = 0; i < 3; i++) {\n    for (j = 2; j > i; j--) {\n      if (a[j] < a[j - 1]) {\n        temp = a[j];\n        a[j] = a[j - 1];\n        a[j - 1] = temp;\n      }\n    }\n  }\n\n  printf(\"%d %d %d\\n\", a[0], a[1], a[2]);\n\n  return 0;\n}","change":"replace","i1":11,"i2":12,"j1":11,"j2":12,"error":"0","stderr":""}
-{"problem_id":"p02393","language":"Python","original_status":"Runtime Error","original_src":"data = [int(i) for i in input.split()]\nout = \" \".join([str(i) for i in sorted(data)])\nprint(out)\n","changed_src":"data = [int(i) for i in input().split()]\nout = \" \".join([str(i) for i in sorted(data)])\nprint(out)\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"AttributeError: 'builtin_function_or_method' object has no attribute 'split'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02393\/Python\/s535290436.py\", line 1, in <module>\n    data = [int(i) for i in input.split()]\nAttributeError: 'builtin_function_or_method' object has no attribute 'split'\n"}
-{"problem_id":"p02393","language":"Python","original_status":"Runtime Error","original_src":"print(*sorted.map(int, input().split()))\n","changed_src":"print(*sorted(map(int, input().split())))\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"AttributeError: 'builtin_function_or_method' object has no attribute 'map'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02393\/Python\/s363098812.py\", line 1, in <module>\n    print(*sorted.map(int, input().split()))\nAttributeError: 'builtin_function_or_method' object has no attribute 'map'\n"}
-{"problem_id":"p02393","language":"Python","original_status":"Runtime Error","original_src":"num = list(map(int, input().split(\" \")))\nnum.sort()\nprint(\" \".join(map(int, num)))\n","changed_src":"num = list(map(int, input().split(\" \")))\nnum.sort()\nprint(\" \".join(map(str, num)))\n","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"TypeError: sequence item 0: expected str instance, int found","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02393\/Python\/s464700171.py\", line 3, in <module>\n    print(' '.join(map(int, num)))\nTypeError: sequence item 0: expected str instance, int found\n"}
-{"problem_id":"p02393","language":"Python","original_status":"Runtime Error","original_src":"array = input().split().sort()\n\nfor i in array:\n    print(i, end=\"\")\n","changed_src":"l = list(map(int, input().split()))\nl.sort()\nprint(l[0], l[1], l[2])\n","change":"replace","i1":0,"i2":4,"j1":0,"j2":3,"error":"TypeError: 'NoneType' object is not iterable","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02393\/Python\/s939623185.py\", line 3, in <module>\n    for i in array:\nTypeError: 'NoneType' object is not iterable\n"}
-{"problem_id":"p02393","language":"Python","original_status":"Runtime Error","original_src":"a = list(map(int, input().split()))\n[print(*i) for i in a.sort()]\n","changed_src":"a = list(map(int, input().split()))\na.sort()\nprint(\" \".join(map(str, a)))\n","change":"replace","i1":1,"i2":2,"j1":1,"j2":3,"error":"TypeError: 'NoneType' object is not iterable","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02393\/Python\/s980569282.py\", line 2, in <module>\n    [print(*i) for i in a.sort()]\nTypeError: 'NoneType' object is not iterable\n"}
-{"problem_id":"p02393","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\n\nint main() {\n  int a, b, c, t;\n  scanf(\"%d %d %d\", &a, &b, &c);\n\n  while (!(a < b && b < c)) {\n    if (a > b) {\n      t = a;\n      a = b;\n      b = t;\n    }\n    if (b > c) {\n      t = b;\n      b = c;\n      c = t;\n    }\n  }\n\n  printf(\"%d %d %d\\n\", a, b, c);\n  return 0;\n}","changed_src":"#include <cstdio>\n\nint main() {\n  int a, b, c, t;\n  scanf(\"%d %d %d\", &a, &b, &c);\n\n  if (a > b) {\n    t = a;\n    a = b;\n    b = t;\n  }\n  if (b > c) {\n    t = b;\n    b = c;\n    c = t;\n  }\n  if (a > b) {\n    t = a;\n    a = b;\n    b = t;\n  }\n\n  printf(\"%d %d %d\\n\", a, b, c);\n  return 0;\n}","change":"replace","i1":6,"i2":17,"j1":6,"j2":20,"error":"TLE","stderr":""}
-{"problem_id":"p02393","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n\nint main(void) {\n  int a, b, c, x;\n  scanf(\"%d%d%d\", a, b, c);\n  if (a > b) {\n    x = a;\n    a = b;\n    b = x;\n  }\n  if (b > c) {\n    x = b;\n    b = c;\n    c = x;\n  }\n  if (a > b) {\n    x = a;\n    a = b;\n    b = x;\n  }\n  printf(\"%d %d %d\\n\", a, b, c);\n  return 0;\n}","changed_src":"#include <iostream>\n\nint main(void) {\n  int a, b, c, x;\n  scanf(\"%d%d%d\", &a, &b, &c);\n  if (a > b) {\n    x = a;\n    a = b;\n    b = x;\n  }\n  if (b > c) {\n    x = b;\n    b = c;\n    c = x;\n  }\n  if (a > b) {\n    x = a;\n    a = b;\n    b = x;\n  }\n  printf(\"%d %d %d\\n\", a, b, c);\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"-11","stderr":""}
-{"problem_id":"p02393","language":"Python","original_status":"Runtime Error","original_src":"num_sorted = list(map(int, input().split()))\nprint(\n    \"{} {} {}\".format(num_sorted.sort()[0], num_sorted.sort()[1], num_sorted.sort()[2])\n)\n","changed_src":"num_sorted = list(map(int, input().split()))\nnum_sorted.sort()\nprint(\"{} {} {}\".format(num_sorted[0], num_sorted[1], num_sorted[2]))\n","change":"replace","i1":1,"i2":4,"j1":1,"j2":3,"error":"TypeError: 'NoneType' object is not subscriptable","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02393\/Python\/s171518153.py\", line 2, in <module>\n    print(\"{} {} {}\".format(num_sorted.sort()[0], num_sorted.sort()[1], num_sorted.sort()[2]))\nTypeError: 'NoneType' object is not subscriptable\n"}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"#include \"iostream\"\n#include \"string\"\n\nint main() {\n  int temp = 1;\n  int Num[512];\n  int i = 0;\n\n  while (temp != 0) {\n    std::cin >> temp;\n    Num[i] = temp;\n    i++;\n  }\n\n  i = 0;\n  while (Num[i] != 0) {\n    std::cout << \"Case \" << i + 1 << \": \" << Num[i] << std::endl;\n    i++;\n  }\n  return 0;\n}","changed_src":"#include \"iostream\"\n#include \"string\"\n\nint main() {\n  int temp = 1;\n  int Num[10240];\n  int i = 0;\n\n  while (temp != 0) {\n    std::cin >> temp;\n    Num[i] = temp;\n    i++;\n  }\n\n  i = 0;\n  while (Num[i] != 0) {\n    std::cout << \"Case \" << i + 1 << \": \" << Num[i] << std::endl;\n    i++;\n  }\n  return 0;\n}","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"0","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\n\nint main(void) {\n  int i, x;\n  for (i = 1;; i++) {\n    scanf(\"%5d\", &x);\n    printf(\"Case%d;%d\\n\", i, x);\n  }\n}\n","changed_src":"#include <stdio.h>\n\nint main(void) {\n  int i, x;\n  for (i = 1;; i++) {\n    scanf(\"%5d\", &x);\n    if (x == 0) {\n      break;\n    }\n    if (x > 1 && 10000 < x) {\n      break;\n    }\n    printf(\"Case %d: %d\\n\", i, x);\n  }\n}\n","change":"replace","i1":6,"i2":7,"j1":6,"j2":13,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <stdio.h>\n\nusing namespace std;\n\nint main() {\n  int i, in;\n  i = 0;\n  while (true) {\n    i++;\n    cin >> in;\n    if (i == 0)\n      break;\n    printf(\"Case %d: %d\\n\", i, in);\n  }\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <stdio.h>\n\nusing namespace std;\n\nint main() {\n  int i, in;\n  i = 0;\n  while (true) {\n    i++;\n    cin >> in;\n    if (in == 0)\n      break;\n    printf(\"Case %d: %d\\n\", i, in);\n  }\n\n  return 0;\n}","change":"replace","i1":13,"i2":14,"j1":13,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main(void) {\n  int i, a[7];\n  for (i = 0; i < 7; i++)\n    scanf(\"%d\", a[i]);\n  for (i = 0; i < 7; i++)\n    printf(\"Case %d: %d\", i + 1, a[i]);\n\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main(void) {\n  int i = 0, x;\n  scanf(\"%d\", &x);\n  while (x != 0) {\n    printf(\"Case %d: %d\\n\", i + 1, x);\n    scanf(\"%d\", &x);\n    i++;\n  }\n\n  return 0;\n}","change":"replace","i1":2,"i2":7,"j1":2,"j2":9,"error":"-11","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int i = 1, x;\n  cin >> x;\n  while (x != 0) {\n    cout << \"Case \" << i << \": \" << x << endl;\n    i++;\n  }\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int i = 1, x;\n  cin >> x;\n  while (x != 0) {\n    cout << \"Case\"\n         << \" \" << i++ << \":\"\n         << \" \" << x << endl;\n    cin >> x;\n  }\n  return 0;\n}\n","change":"replace","i1":6,"i2":8,"j1":6,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  vector<int> x(10000);\n  int idx = 0;\n  while (true) {\n    cin >> x.at(idx);\n    if (x.at(idx) == 0)\n      break;\n    idx++;\n  }\n  idx = 0;\n  while (x.at(idx) != 0) {\n    cout << \"Case \" << idx + 1 << \": \" << x.at(idx) << endl;\n    idx++;\n  }\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  vector<int> x(10001);\n  int idx = 0;\n  while (true) {\n    cin >> x.at(idx);\n    if (x.at(idx) == 0)\n      break;\n    idx++;\n  }\n  idx = 0;\n  while (x.at(idx) != 0) {\n    cout << \"Case \" << idx + 1 << \": \" << x.at(idx) << endl;\n    idx++;\n  }\n}\n","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n\nint main(void) {\n  int x[100], i = 0, j;\n\n  while (1) {\n    scanf(\"%d\", &x[i]);\n    if (x[i] == 0) {\n      break;\n    }\n    i++;\n  }\n\n  for (j = 1; j < i + 1; j++) {\n    printf(\"Case %d: %d\\n\", j, x[j - 1]);\n  }\n\n  return 0;\n}","changed_src":"#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n\nint main(void) {\n  int x[10000], i = 0, j;\n\n  while (1) {\n    scanf(\"%d\", &x[i]);\n    if (x[i] == 0) {\n      break;\n    }\n    i++;\n  }\n\n  for (j = 1; j < i + 1; j++) {\n    printf(\"Case %d: %d\\n\", j, x[j - 1]);\n  }\n\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"#include <cstdio>\nint main() {\n  int id, data;\n  id = 1;\n  while (true) {\n    scanf(\"%d\", data);\n    if (data == 0)\n      break;\n    printf(\"Case %d: %d\\n\", id, data);\n    ++id;\n  }\n  return 0;\n};\n","changed_src":"#include <cstdio>\nint main() {\n  int id, data;\n  id = 1;\n  while (true) {\n    scanf(\"%d\", &data);\n    if (data == 0)\n      break;\n    printf(\"Case %d: %d\\n\", id, data);\n    ++id;\n  }\n  return 0;\n};\n","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"-11","stderr":""}
-{"problem_id":"p02396","language":"Python","original_status":"Runtime Error","original_src":"i = 1\nwhile True:\n    x = int(input)\n    if x == 0:\n        break\n    print(f\"Case {i}: {x}\")\n    i += 1\n","changed_src":"i = 1\nwhile True:\n    x = int(input())\n    if x == 0:\n        break\n    print(f\"Case {i}: {x}\")\n    i += 1\n","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"TypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02396\/Python\/s606427724.py\", line 3, in <module>\n    x = int(input)\nTypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'\n"}
-{"problem_id":"p02396","language":"Python","original_status":"Runtime Error","original_src":"c = 1\nwhile True:\n    print(\"Case {0}: {1}\".format(c, input()))\n    c += 1\n","changed_src":"c = 1\nwhile True:\n    x = int(input())\n    if x == 0:\n        break\n    print(\"Case {0}: {1}\".format(c, x))\n    c += 1\n","change":"replace","i1":2,"i2":3,"j1":2,"j2":6,"error":"EOFError: EOF when reading a line","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02396\/Python\/s008264252.py\", line 3, in <module>\n    print(\"Case {0}: {1}\".format(c, input()))\nEOFError: EOF when reading a line\n"}
-{"problem_id":"p02396","language":"Python","original_status":"Runtime Error","original_src":"for i in range():\n    inpu = int(input())\n    if inpu == 0:\n        break\n    else:\n        print(\"Case %d: %d\" % (i, inpu))\n","changed_src":"for i in range(1, 10001):\n    inpu = int(input())\n    if inpu == 0:\n        break\n    else:\n        print(\"Case %d: %d\" % (i, inpu))\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"TypeError: range expected at least 1 argument, got 0","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02396\/Python\/s685911962.py\", line 1, in <module>\n    for i in range():\nTypeError: range expected at least 1 argument, got 0\n"}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\n#define CI cin >>\n#define CO cout <<\n#define E << endl;\n\nusing namespace std;\n\nint main(void) {\n  int x = 0;\n  int i = 1;\n  while (1) {\n    CI x;\n    CO \"case \" << i << \":\" << x E++ i;\n  }\n}","changed_src":"#include <iostream>\n\n#define CI cin >>\n#define CO cout <<\n#define E << endl;\n\nusing namespace std;\n\nint main(void) {\n  int x = 0;\n  int i = 1;\n  while (1) {\n    CI x;\n    if (x == 0) {\n      return 0;\n    }\n    CO \"Case \" << i << \": \" << x E++ i;\n  }\n}","change":"replace","i1":13,"i2":14,"j1":13,"j2":17,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int x, cnt = 0;\n  while (1) {\n    cin >> x;\n    if (x = 0) {\n      return 0;\n    }\n    cnt++;\n    cout << \"Case\"\n         << \" \" << cnt << \": \" << x << endl;\n  }\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int x, cnt = 0;\n  while (1) {\n    cin >> x;\n    if (x == 0) {\n      return 0;\n    }\n    cnt++;\n    cout << \"Case\"\n         << \" \" << cnt << \": \" << x << endl;\n  }\n}\n","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n  int a[10000];\n  int total = 0;\n  for (int i = 0; i <= 10000; i++) {\n    int tmp;\n    cin >> tmp;\n    if (tmp < 0 || tmp >= 10000)\n      return -1;\n    if (tmp == 0) {\n      break;\n    }\n    a[i] = tmp;\n    total++;\n  }\n\n  for (int j = 0; j <= total - 1; j++)\n    cout << \"Case \" << j + 1 << \": \" << a[j] << endl;\n\n  return 0;\n}\n","changed_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n  int a[10000];\n  int total = 0;\n  for (int i = 0; i <= 10000; i++) {\n    int tmp;\n    cin >> tmp;\n    \/\/        if(tmp < 0 || tmp >= 10000) return -1;\n    if (tmp == 0) {\n      break;\n    }\n    a[i] = tmp;\n    total++;\n  }\n\n  for (int j = 0; j <= total - 1; j++)\n    cout << \"Case \" << j + 1 << \": \" << a[j] << endl;\n\n  return 0;\n}\n","change":"replace","i1":10,"i2":12,"j1":10,"j2":11,"error":"0","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int x;\n  int i = 1;\n\n  while (1) {\n    cin >> x;\n    if (x = 0)\n      break;\n    cout << \"Case \" << i << \": \" << x << endl;\n    i++;\n  }\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int x;\n  int i = 1;\n\n  while (1) {\n    cin >> x;\n    if (x == 0)\n      break;\n    cout << \"Case \" << i << \": \" << x << endl;\n    i++;\n  }\n}\n","change":"replace","i1":8,"i2":9,"j1":8,"j2":9,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  int i = 0, Case[1000];\n  Case[0] = 1;\n  while (1) {\n    cin >> Case[i];\n    if (Case[i] == 0) {\n      break;\n    }\n    i++;\n  }\n  for (int j = 0; j <= i - 1; j++) {\n    cout << \"Case \" << j + 1 << \": \" << Case[j] << endl;\n  }\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  int i = 0, Case[10000];\n  Case[0] = 1;\n  while (1) {\n    cin >> Case[i];\n    if (Case[i] == 0) {\n      break;\n    }\n    i++;\n  }\n  for (int j = 0; j <= i - 1; j++) {\n    cout << \"Case \" << j + 1 << \": \" << Case[j] << endl;\n  }\n}\n","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"\/\/ ConsoleApplication3.cpp : \u30b3\u30f3\u30bd\u30fc\u30eb \u30a2\u30d7\u30ea\u30b1\u30fc\u30b7\u30e7\u30f3\u306e\u30a8\u30f3\u30c8\u30ea\n\/\/ \u30dd\u30a4\u30f3\u30c8\u3092\u5b9a\u7fa9\u3057\u307e\u3059\u3002\n\/\/\n\n\/\/ #include \"stdafx.h\"\n#include <iostream>\nusing namespace std;\nint main() {\n  int a, b;\n  b = 1;\n  while (1) {\n    cin >> a;\n    cout << \"Case \" << b << \": \" << a << endl;\n    b++;\n  }\n  return 0;\n}\n","changed_src":"\/\/ ConsoleApplication3.cpp : \u30b3\u30f3\u30bd\u30fc\u30eb \u30a2\u30d7\u30ea\u30b1\u30fc\u30b7\u30e7\u30f3\u306e\u30a8\u30f3\u30c8\u30ea\n\/\/ \u30dd\u30a4\u30f3\u30c8\u3092\u5b9a\u7fa9\u3057\u307e\u3059\u3002\n\/\/\n\n\/\/ #include \"stdafx.h\"\n#include <iostream>\nusing namespace std;\nint main() {\n  int a, b;\n  b = 1;\n  while (1) {\n    cin >> a;\n    if (a == 0) {\n      break;\n    } else {\n      cout << \"Case \" << b << \": \" << a << endl;\n      b++;\n    }\n  }\n  return 0;\n}\n","change":"replace","i1":12,"i2":14,"j1":12,"j2":18,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <math.h>\n#include <queue>\n#include <set>\n#include <string>\n#include <vector>\n#define INF 100000000\n\n#define MAX_N 10000\n#define MAX_M 100\n\ntypedef long long int ll;\nusing namespace std;\n\nint main() {\n\n  int x;\n  int i = 0;\n  while (true) {\n\n    scanf(\"%d\", &x);\n    if (x != 0) {\n      i++;\n      printf(\"Case %s: %d\\n\", i, x);\n    } else\n      break;\n  }\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <math.h>\n#include <queue>\n#include <set>\n#include <string>\n#include <vector>\n#define INF 100000000\n\n#define MAX_N 10000\n#define MAX_M 100\n\ntypedef long long int ll;\nusing namespace std;\n\nint main() {\n\n  int x;\n  int i = 0;\n  while (true) {\n\n    scanf(\"%d\", &x);\n    if (x != 0) {\n      i++;\n      printf(\"Case %d: %d\\n\", i, x);\n    } else\n      break;\n  }\n\n  return 0;\n}","change":"replace","i1":25,"i2":26,"j1":25,"j2":26,"error":"-11","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cstdio>\n\nusing namespace std;\n\nint main() {\n  int N[100];\n  int i = 0;\n  while (true) {\n    scanf(\"%d\", &N[i]);\n    if (N[i] == 0)\n      break;\n    i++;\n  }\n\n  for (int j = 0; j < i; j++) {\n    printf(\"Case %d: %d\\n\", j + 1, N[j]);\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cstdio>\n\nusing namespace std;\n\nint main() {\n  int N[65535];\n  int i = 0;\n  while (true) {\n    scanf(\"%d\", &N[i]);\n    if (N[i] == 0)\n      break;\n    i++;\n  }\n\n  for (int j = 0; j < i; j++) {\n    printf(\"Case %d: %d\\n\", j + 1, N[j]);\n  }\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"0","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"\/*\n * taete.cpp\n *\n *  Created on: 2018\/04\/26\n *      Author: J01003\n *\/\n#include <iostream>\nusing namespace std;\n\nint main() {\n\n  int s, t;\n  s = 1;\n  while (s > 0) {\n    cin >> t;\n    if (t = 0)\n      break;\n    cout << \"Case\"\n         << \" \" << s << \": \" << t << endl;\n    s = s + 1;\n  }\n\n  return 0;\n}\n","changed_src":"\/*\n * taete.cpp\n *\n *  Created on: 2018\/04\/26\n *      Author: J01003\n *\/\n#include <iostream>\nusing namespace std;\n\nint main() {\n\n  int s, t;\n  s = 1;\n  while (s > 0) {\n    cin >> t;\n    if (t == 0)\n      break;\n    cout << \"Case\"\n         << \" \" << s << \": \" << t << endl;\n    s = s + 1;\n  }\n\n  return 0;\n}\n","change":"replace","i1":15,"i2":16,"j1":15,"j2":16,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\n#include <iostream>\n\nusing namespace std;\n\nint main(void) {\n  int x;\n  int i = 0;\n  while ((scanf(\"%d\", &x)) != 0) {\n    i++;\n    printf(\"Case %d: %d\\n\", i, x);\n  }\n  return 0;\n}","changed_src":"#include <cstdio>\n#include <iostream>\n\nusing namespace std;\n\nint main(void) {\n  int x;\n  int i = 0;\n  while (cin >> x) {\n    if (x == 0)\n      break;\n    i++;\n    printf(\"Case %d: %d\\n\", i, x);\n  }\n  return 0;\n}","change":"replace","i1":8,"i2":9,"j1":8,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\nint main() {\n  for (int i = 1;; i++) {\n    int x;\n    scanf(\"%d\", &x);\n    printf(\"Case %d: %d\\n\", i, x);\n  };\n  return 0;\n}\n","changed_src":"#include <cstdio>\nint main() {\n  for (int i = 1;; i++) {\n    int x;\n    scanf(\"%d\", &x);\n    if (x == 0) {\n      break;\n    }\n    printf(\"Case %d: %d\\n\", i, x);\n  };\n  return 0;\n}\n","change":"insert","i1":5,"i2":5,"j1":5,"j2":8,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\nint main() {\n  int a, b, c, d, i = 0;\n  while (1) {\n    scanf(\"%d\", &a);\n    i++;\n    printf(\"Case %d: %d\\n\", i, a);\n  }\n}\n","changed_src":"#include <stdio.h>\nint main() {\n  int a, b, c, d, i = 0;\n  while (1) {\n    scanf(\"%d\", &a);\n    i++;\n    if (a == 0)\n      break;\n    printf(\"Case %d: %d\\n\", i, a);\n  }\n}\n","change":"insert","i1":6,"i2":6,"j1":6,"j2":8,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n\n  int x, i;\n  while (true) {\n    i++;\n    cin >> x;\n\n    if (x = 0)\n      break;\n\n    cout << \"Case \" << i << \": \" << x << \"\\n\";\n  }\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n\n  int x, i;\n  while (true) {\n    i++;\n    cin >> x;\n\n    if (x == 0)\n      break;\n\n    cout << \"Case \" << i << \": \" << x << \"\\n\";\n  }\n}","change":"replace","i1":10,"i2":11,"j1":10,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n  int a;\n  int x = 0;\n  while (1) {\n    cin >> a;\n    x = x + 1;\n    if (a > 0) {\n      cout << \"Case \" << x << \": \" << a << endl;\n    }\n  }\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n  int a;\n  int x = 0;\n  while (1) {\n    cin >> a;\n    x = x + 1;\n    if (a > 0) {\n      cout << \"Case \" << x << \": \" << a << endl;\n    }\n    if (a == 0) {\n      break;\n    }\n  }\n}\n","change":"insert","i1":11,"i2":11,"j1":11,"j2":14,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"\/\/ Copyright 2015 KanatoNagayama\n#include <iostream>\n#include <vector>\nusing std ::cin;\nusing std ::cout;\nusing std ::endl;\nusing std ::vector;\nint main() {\n  vector<int> v(1);\n  int i = 0;\n  while (true) {\n    cin >> v[i];\n    if (v[i] == 0)\n      break;\n    i++;\n  }\n  for (int k = 0; k < i; k++) {\n    cout << \"Case \" << k + 1 << \": \" << v[k] << endl;\n  }\n  return 0;\n}","changed_src":"\/\/ Copyright 2015 KanatoNagayama\n#include <iostream>\n#include <vector>\nusing std ::cin;\nusing std ::cout;\nusing std ::endl;\nusing std ::vector;\nint main() {\n  vector<int> v(10000);\n  int i = 0;\n  while (true) {\n    cin >> v[i];\n    if (v[i] == 0)\n      break;\n    i++;\n  }\n  for (int k = 0; k < i; k++) {\n    cout << \"Case \" << k + 1 << \": \" << v[k] << endl;\n  }\n  return 0;\n}","change":"replace","i1":8,"i2":9,"j1":8,"j2":9,"error":"0","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\nint main() {\n  int x;\n  int i = 1;\n  while (1) {\n    scanf(\"%d\", &x);\n    if (x = 0)\n      break;\n    printf(\"Case %d: %d\\n\", i, x);\n    i++;\n  }\n  return 0;\n}\n","changed_src":"#include <cstdio>\nint main() {\n  int x;\n  int i = 1;\n  while (1) {\n    scanf(\"%d\", &x);\n    if (x == 0)\n      break;\n    printf(\"Case %d: %d\\n\", i, x);\n    i++;\n  }\n  return 0;\n}\n","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int suuji;\n  int i = 1;\n  while (true) {\n    cin >> suuji;\n    if (suuji != 0) {\n      cout << \"Case \" << i << \": \" << suuji;\n    }\n    i++;\n  }\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int suuji;\n  int i = 1;\n  while (true) {\n    cin >> suuji;\n    if (suuji == 0)\n      break;\n    cout << \"Case \" << i << \": \" << suuji << endl;\n    i++;\n  }\n  return 0;\n}","change":"replace","i1":9,"i2":12,"j1":9,"j2":12,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x[100] = {1};\n  int i = 0;\n  for (i = 0; i < 100; i++) {\n    x[i] = 1;\n  }\n  i = 1;\n  while (x[i - 1] != 0) {\n    cin >> x[i];\n    i++;\n  }\n  i = 1;\n  while (x[i] != 0) {\n    cout << \"Case \" << i << \": \" << x[i] << endl;\n    i++;\n  }\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x[25565];\n  x[0] = 1;\n  int i = 1;\n  while (x[i - 1] != 0) {\n    cin >> x[i];\n    i++;\n  }\n  i = 1;\n  while (x[i] != 0) {\n    cout << \"Case \" << i << \": \" << x[i] << endl;\n    i++;\n  }\n}","change":"replace","i1":4,"i2":10,"j1":4,"j2":7,"error":"0","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x[1000];\n  x[0] = 1;\n  for (int i = 1; x[i - 1] != 0; i++) {\n    cin >> x[i];\n    cout << \"Case \" << i << \": \" << x[i] << endl;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x;\n  for (int i = 1;; i++) {\n    cin >> x;\n    if (x == 0)\n      break;\n    cout << \"Case \" << i << \": \" << x << endl;\n  }\n  return 0;\n}","change":"replace","i1":4,"i2":9,"j1":4,"j2":10,"error":"0","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int x, i = 1;\n  cin >> x;\n  while (true) {\n    cout << \"Case\"\n         << \" \" << i << \":\"\n         << \" \" << x << endl;\n    i = i + 1;\n    if (x == 0)\n      break;\n  }\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int x, i = 1;\n  cin >> x;\n  while (true) {\n    cout << \"Case\"\n         << \" \" << i << \":\"\n         << \" \" << x << endl;\n    i = i + 1;\n    cin >> x;\n    if (x == 0)\n      break;\n  }\n}\n","change":"insert","i1":10,"i2":10,"j1":10,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int buffer, i = 1;\n  cin >> buffer;\n  while (buffer != 0) {\n    cout << \"Case \" << i << \": \" << buffer << endl;\n    i++;\n  }\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int buffer, i = 1;\n  cin >> buffer;\n  while (buffer != 0) {\n    cout << \"Case \" << i << \": \" << buffer << endl;\n    cin >> buffer;\n    i++;\n  }\n  return 0;\n}\n","change":"insert","i1":8,"i2":8,"j1":8,"j2":9,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main(void) {\n  int x, i = 0;\n\n  while (1) {\n    cin >> x;\n    if (x != 0) {\n      cout << \"Case \" << ++i << \": \" << x << endl;\n    }\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main(void) {\n  int x, i = 0;\n\n  while (1) {\n    cin >> x;\n    if (x != 0) {\n      cout << \"Case \" << ++i << \": \" << x << endl;\n    } else {\n      break;\n    }\n  }\n  return 0;\n}","change":"insert","i1":10,"i2":10,"j1":10,"j2":12,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n  for (int i = 1;; i++) {\n    int x;\n    cin >> x;\n\n    cout << \"Case \" << i << \": \" << x << endl;\n  }\n}","changed_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n  for (int i = 1;; i++) {\n    int x;\n    cin >> x;\n    if (x == 0)\n      break;\n\n    cout << \"Case \" << i << \": \" << x << endl;\n  }\n}","change":"insert","i1":9,"i2":9,"j1":9,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x[10000];\n\n  int n = 0;\n  while (true) {\n    if (n > 9999)\n      return -1;\n\n    cin >> x[n];\n\n    if (x[n] == 0)\n      break;\n\n    ++n;\n  }\n\n  for (int i = 0; i < n; ++i) {\n    cout << \"Case \" << i + 1 << \": \" << x[i] << endl;\n  }\n\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x[10000];\n\n  int n = 0;\n  while (true) {\n    \/\/ if (n>9999) return -1;\n\n    cin >> x[n];\n\n    if (x[n] == 0)\n      break;\n\n    ++n;\n  }\n\n  for (int i = 0; i < n; ++i) {\n    cout << \"Case \" << i + 1 << \": \" << x[i] << endl;\n  }\n\n  return 0;\n}\n","change":"replace","i1":8,"i2":10,"j1":8,"j2":9,"error":"0","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n\n  int x[1000], i = 0;\n  do {\n    cin >> x[i];\n  } while (x[i++] != 0);\n\n  int k = 0;\n  while (k < i - 1) {\n    cout << \"Case \" << k + 1 << \": \" << x[k] << endl;\n    k++;\n  }\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n\n  int x[10000], i = 0;\n  do {\n    cin >> x[i];\n  } while (x[i++] != 0);\n\n  int k = 0;\n  while (k < i - 1) {\n    cout << \"Case \" << k + 1 << \": \" << x[k] << endl;\n    k++;\n  }\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int x, i = 1;\n  while (1) {\n    cin >> x;\n    cout << \"Case\"\n         << \" \" << i << \":\"\n         << \" \" << x << endl;\n    i++;\n  }\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int x, i = 1;\n  while (1) {\n    cin >> x;\n    if (x == 0) {\n      break;\n    }\n    cout << \"Case\"\n         << \" \" << i << \":\"\n         << \" \" << x << endl;\n    i++;\n  }\n  return 0;\n}\n","change":"insert","i1":6,"i2":6,"j1":6,"j2":9,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  for (int x, i = 1;; i++) {\n    cin >> x;\n    cout << \"Case \" << i << \": \" << x << endl;\n  }\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  for (int x, i = 1;; i++) {\n    cin >> x;\n    if (x == 0)\n      break;\n    cout << \"Case \" << i << \": \" << x << endl;\n  }\n  return 0;\n}\n","change":"insert","i1":5,"i2":5,"j1":5,"j2":7,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <stdio.h>\nusing namespace std;\n\nint main() {\n  int i, x;\n\n  for (i = 1;; i++) {\n    cin >> x;\n    if (x = 0)\n      break;\n    cout << \"Case \" << i << \": \" << x << endl;\n  }\n\n  return 0;\n}","changed_src":"#include <iostream>\n#include <stdio.h>\nusing namespace std;\n\nint main() {\n  int i, x;\n\n  for (i = 1;; i++) {\n    cin >> x;\n    if (x == 0)\n      break;\n    cout << \"Case \" << i << \": \" << x << endl;\n  }\n\n  return 0;\n}","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x, i = 1;\n  for (cin >> x; x > 0; i = i + 1) {\n    cout << \"case \" << i << \": \" << x << endl;\n  }\n}\n","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x, i = 1;\n  cin >> x;\n  while (x > 0) {\n    cout << \"Case \" << i << \": \" << x << endl;\n    i++;\n    cin >> x;\n  }\n}\n","change":"replace","i1":5,"i2":7,"j1":5,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  for (int count = 1;; ++count) {\n    int input;\n    cin >> input;\n    cout << \"Case \" << count << \":\"\n         << \" \" << input << endl;\n  }\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  for (int count = 1;; ++count) {\n    int input;\n    cin >> input;\n    if (input == 0) {\n      break;\n    }\n    cout << \"Case \" << count << \":\"\n         << \" \" << input << endl;\n  }\n  return 0;\n}\n","change":"insert","i1":6,"i2":6,"j1":6,"j2":9,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  for (int i = 1;; ++i) {\n    int x;\n    cin >> x;\n    cout << \"Case \" << i << \": \" << x;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  for (int i = 1;; ++i) {\n    int x;\n    cin >> x;\n    if (x == 0)\n      break;\n    cout << \"Case \" << i << \": \" << x << endl;\n  }\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":9,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\n\nint main() {\n  int i = 1;\n  int x;\n  while (1) {\n    if (scanf(\"%d\", &x) == 0)\n      break;\n    printf(\"Case %d: %d\\n\", i, x);\n    i++;\n  }\n}\n","changed_src":"#include <stdio.h>\n\nint main() {\n  int i = 1;\n  int x;\n  while (1) {\n    scanf(\"%d\", &x);\n    if (x == 0)\n      break;\n    printf(\"Case %d: %d\\n\", i, x);\n    i++;\n  }\n}\n","change":"replace","i1":6,"i2":7,"j1":6,"j2":8,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int num[10000], n;\n  n = 0;\n  while (1) {\n    scanf(\"%d\", &num[n]);\n    if (num[n] == 0)\n      break;\n    n = n + 1;\n  }\n  while (num[n] != 0, n++) {\n    printf(\"Case %d: %d\\n\", n, num[n]);\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main() {\n  int num[10000], n;\n  n = 0;\n  while (1) {\n    scanf(\"%d\", &num[n]);\n    if (num[n] == 0)\n      break;\n    n = n + 1;\n  }\n  n = 0;\n  while (num[n] != 0) {\n    printf(\"Case %d: %d\\n\", n + 1, num[n]);\n    n = n + 1;\n  }\n  return 0;\n}","change":"replace","i1":10,"i2":12,"j1":10,"j2":14,"error":"-11","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x;\n  int count = 1;\n  cin >> x;\n  while (x != 0) {\n    cout << \"Case \" << count << \":\" << x << endl;\n    count++;\n  }\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x;\n  int count = 1;\n  cin >> x;\n  while (x != 0) {\n    cout << \"Case \" << count << \": \" << x << endl;\n    cin >> x;\n    count++;\n  }\n  return 0;\n}","change":"replace","i1":8,"i2":9,"j1":8,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n  vector<int> x(1000);\n  int i = 0;\n  while (1) {\n    int flag = 1;\n    cin >> x[i];\n    if (x[i] == 0) {\n      break;\n    }\n    i++;\n  }\n  for (int t = 0; t < i; t++) {\n    cout << \"Case \" << t + 1 << \": \" << x[t] << endl;\n  }\n  return 0;\n}\n","changed_src":"#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n  vector<int> x(10000);\n  int i = 0;\n  while (1) {\n    int flag = 1;\n    cin >> x[i];\n    if (x[i] == 0) {\n      break;\n    }\n    i++;\n  }\n  for (int t = 0; t < i; t++) {\n    cout << \"Case \" << t + 1 << \": \" << x[t] << endl;\n  }\n  return 0;\n}\n","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"0","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int a[100], aa = 0, i;\n  for (i = 0; aa < 1; i++) {\n    scanf(\"%d\", &a[i]);\n    if (a[i] == 0) {\n      aa = 2;\n    }\n  }\n  for (int j = 1; j < i; j++) {\n    printf(\"Case %d: %d\\n\", j, a[j - 1]);\n  }\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main() {\n  int a[1000000], aa = 0, i;\n  for (i = 0; aa < 1; i++) {\n    scanf(\"%d\", &a[i]);\n    if (a[i] == 0) {\n      aa = 2;\n    }\n  }\n  for (int j = 1; j < i; j++) {\n    printf(\"Case %d: %d\\n\", j, a[j - 1]);\n  }\n  return 0;\n}","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int x;\n  cin >> x;\n  int i = 1;\n  while (x != 0) {\n    cout << \"Case \" << i << \": \" << x << endl;\n    i++;\n  }\n  return 0;\n}\n","changed_src":"#include <iostream>\n\nusing namespace std;\n\nint main() {\n  int x;\n  cin >> x;\n  int i = 1;\n  while (x != 0) {\n    cout << \"Case \" << i << \": \" << x << endl;\n    cin >> x;\n    i++;\n  }\n  return 0;\n}\n","change":"insert","i1":10,"i2":10,"j1":10,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n\n  int a = 1, b;\n\n  while (true) {\n\n    cin >> b;\n\n    if (b = 0)\n      break;\n\n    cout << \"Case \" << a << \": \" << b << endl;\n\n    a++;\n  }\n\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n\n  int a = 1, b;\n\n  while (true) {\n\n    cin >> b;\n\n    if (b == 0)\n      break;\n\n    cout << \"Case \" << a << \": \" << b << endl;\n\n    a++;\n  }\n\n  return 0;\n}","change":"replace","i1":11,"i2":12,"j1":11,"j2":12,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int x, i = 1;\n  cin >> x;\n  while (x != 0) {\n    cout << \"Case\" << i << \":\" << x << \"\\n\";\n    i++;\n  }\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\n\nint main() {\n  int n;\n  for (int i = 1; i >= 0; i++) {\n    cin >> n;\n    if (n == 0)\n      break;\n    cout << \"Case \" << i << \": \" << n << \"\\n\";\n  }\n  return 0;\n}","change":"replace","i1":4,"i2":9,"j1":4,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nsigned main() {\n  int a;\n  for (int b = 1; scanf(\"%d\", &a); b++) {\n    printf(\"Case %d: %d\\n\", b, a);\n  }\n}","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nsigned main() {\n  int a;\n  for (int b = 1; scanf(\"%d\", &a), a; b++) {\n    printf(\"Case %d: %d\\n\", b, a);\n  }\n}","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"TLE","stderr":""}
-{"problem_id":"p02396","language":"C++","original_status":"Runtime Error","original_src":"\/\/ Copyright 2015 KanatoNagayama\n#include <iostream>\n#include <vector>\nusing std ::cin;\nusing std ::cout;\nusing std ::endl;\nusing std ::vector;\nint main() {\n  vector<int> v(5000);\n  int i = 0;\n  while (true) {\n    cin >> v[i];\n    if (v[i] == 0)\n      break;\n    i++;\n  }\n  for (int k = 0; k < i; k++) {\n    cout << \"Case \" << k + 1 << \": \" << v[k] << endl;\n  }\n  return 0;\n}","changed_src":"\/\/ Copyright 2015 KanatoNagayama\n#include <iostream>\n#include <vector>\nusing std ::cin;\nusing std ::cout;\nusing std ::endl;\nusing std ::vector;\nint main() {\n  vector<int> v(100000);\n  int i = 0;\n  while (true) {\n    cin >> v[i];\n    if (v[i] == 0)\n      break;\n    i++;\n  }\n  for (int k = 0; k < i; k++) {\n    cout << \"Case \" << k + 1 << \": \" << v[k] << endl;\n  }\n  return 0;\n}","change":"replace","i1":8,"i2":9,"j1":8,"j2":9,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"import math\n\nr = int(input())\nprint(math.pi * r * r, 2 * math.pi * r)\n","changed_src":"import math\n\nr = float(input())\nprint(math.pi * r * r, 2 * math.pi * r)\n","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"Pi = 3.14159265\nR = int(input())\nM = 2 * R * Pi\nE = R**2 * Pi\n\"\"\"\nprint(\"{:.10}\".format(M))\nprint(\"{:.10}\".format(E))\n\"\"\"\nprint(M)\nprint(E)\n","changed_src":"import math\n\nr = float(input())\nprint(\"{} {}\".format(r**2 * math.pi, r * 2 * math.pi))\n","change":"replace","i1":0,"i2":10,"j1":0,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"pi = 3.14159265359\nr = int(input())\n\nprint(f\"{r*r*pi:.6f} {2*r*pi:.6f}\")\n","changed_src":"pi = 3.14159265359\nr = float(input())\n\nprint(f\"{r*r*pi:.6f} {2*r*pi:.6f}\")\n","change":"replace","i1":1,"i2":2,"j1":1,"j2":2,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"import math\n\na = int(input())\nprint(\n    str(\"{0:.6f}\".format((a * a) * math.pi))\n    + \" \"\n    + str(\"{0:.5f}\".format((a + a) * math.pi))\n)\n","changed_src":"import math\n\na = float(input())\nprint(\n    str(\"{0:.6f}\".format((a * a) * math.pi))\n    + \" \"\n    + str(\"{0:.5f}\".format((a + a) * math.pi))\n)\n","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"import math\n\np = input()\nr = int(p)\narea = math.pi * r**2\nlength = 2 * math.pi * r\nprint(f\"{area:.6f} {length:.6f}\")\n","changed_src":"import math\n\nr = float(input())\narea = math.pi * r**2\nlength = 2 * math.pi * r\nprint(f\"{area:.6f} {length:.6f}\")\n","change":"replace","i1":2,"i2":4,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"r = int(input())\npi = 3.141592653589793238\nprint(pi * r * r, 2 * pi * r)\n","changed_src":"r = float(input())\npi = 3.1415926535897932384626\nprint(pi * r * r, 2 * pi * r)\n","change":"replace","i1":0,"i2":2,"j1":0,"j2":2,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"import math\n\nr = int(input())\nprint(f\"{r**2*math.pi:.8f}\")\n","changed_src":"import math\n\nr = float(input())\nprint(f\"{r**2*math.pi:.8f} {math.pi*r*2:.8f}\")\n","change":"replace","i1":2,"i2":4,"j1":2,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"pi = 3.141592653589793\n\nr = int(input())\nprint(\"%.6f %.6f\" % (pi * r**2, 2 * pi * r))\n","changed_src":"pi = 3.141592653589793\n\nr = float(input())\nprint(\"%.6f %.6f\" % (pi * r**2, 2 * pi * r))\n","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"r = int(input())\npi = 3.141592653589\nprint(\"{:.10f} {:.10f}\".format(r**2 * pi, 2 * r * pi))\n","changed_src":"r = float(input())\npi = 3.141592653589\nprint(\"{:.10f} {:.10f}\".format(r**2 * pi, 2 * r * pi))\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"C++","original_status":"Runtime Error","original_src":"#include <iomanip>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  int a, b, d;\n  cin >> a >> b;\n  d = a \/ b;\n  cout << d << \" \" << a - b * d << \" \" << fixed << setprecision(5)\n       << (double)a \/ b << endl;\n  return 0;\n}","changed_src":"#include <iomanip>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  double pi = 3.141592653589793;\n  double r, pir;\n  cin >> r;\n  pir = pi * r;\n  cout << fixed << setprecision(5) << pir * r << \" \" << pir * 2 << endl;\n  return 0;\n}","change":"replace","i1":5,"i2":10,"j1":5,"j2":10,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"r = int(input())\npi = 3.141592653589793\narea = pi * r * r\ncircum = 2 * pi * r\nprint(str(\"{0:.6f}\".format(area)) + \" \" + str(\"{0:.6f}\".format(circum)))\n","changed_src":"import math\n\nr = float(input())\n\narea = math.pi * r * r\ncircum = 2 * math.pi * r\nprint(str(\"{0:.6f}\".format(area)) + \" \" + str(\"{0:.6f}\".format(circum)))\n","change":"replace","i1":0,"i2":4,"j1":0,"j2":6,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"C++","original_status":"Runtime Error","original_src":"#include <cstdio>\nint main() {\n  int a, b;\n  scanf(\"%d %d\", &a, &b);\n  printf(\"%d %d %lf\\n\", a \/ b, a % b, (double)a \/ b);\n  return 0;\n}","changed_src":"#include <cstdio>\nint main() {\n  double r, pi = 3.141592653589;\n  scanf(\"%lf\", &r);\n  printf(\"%lf %lf\\n\", r * r * pi, 2 * r * pi);\n  return 0;\n}","change":"replace","i1":2,"i2":5,"j1":2,"j2":5,"error":"-8","stderr":""}
-{"problem_id":"p02400","language":"C++","original_status":"Runtime Error","original_src":"#include <cassert>\n#include <cmath>\n#include <iostream>\n\/\/ #define NDEBUG\nint main(void) {\n  using namespace std;\n  static const int INPUT_R_MAX = 10000;\n  static const int INPUT_R_MIN = 1;\n  double input_r = 0;\n  double area = 0;          \/* \u9762\u7a4d *\/\n  double circumference = 0; \/* \u5186\u5468 *\/\n\n  cin >> input_r; \/* \u534a\u5f84 *\/\n\n  \/* \u5165\u529b\u5024\u306e\u524d\u63d0\u6761\u4ef6 *\/\n  assert(INPUT_R_MIN <= input_r && input_r <= INPUT_R_MAX);\n\n  \/* Calculation *\/\n  area = input_r * input_r * M_PI;\n  circumference = input_r * 2 * M_PI;\n\n  \/* Output *\/\n  cout << fixed << area << \" \" << circumference << endl;\n  return 0;\n}\n","changed_src":"#include <cassert>\n#include <cmath>\n#include <iostream>\n\/\/ #define NDEBUG\nint main(void) {\n  using namespace std;\n  static const int INPUT_R_MAX = 10000;\n  static const int INPUT_R_MIN = 0;\n  double input_r = 0;\n  double area = 0;          \/* \u9762\u7a4d *\/\n  double circumference = 0; \/* \u5186\u5468 *\/\n\n  cin >> input_r; \/* \u534a\u5f84 *\/\n\n  \/* \u5165\u529b\u5024\u306e\u524d\u63d0\u6761\u4ef6 *\/\n  assert(INPUT_R_MIN <= input_r && input_r <= INPUT_R_MAX);\n\n  \/* Calculation *\/\n  area = input_r * input_r * M_PI;\n  circumference = input_r * 2 * M_PI;\n\n  \/* Output *\/\n  cout << fixed << area << \" \" << circumference << endl;\n  return 0;\n}\n","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  cout << fixed << setprecision(12);\n  int a, b;\n  cin >> a >> b;\n  cout << a \/ b << \" \" << a % b << \" \" << (double)a \/ b << endl;\n\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  cout << fixed << setprecision(6);\n  double a;\n  cin >> a;\n  cout << a * a * acos(-1) << \" \" << 2 * a * acos(-1) << endl;\n\n  return 0;\n}\n","change":"replace","i1":4,"i2":8,"j1":4,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"import math\n\nr = input()\nprint(r**2 * math.pi, r * 2 * math.pi)\n","changed_src":"import math\n\nr = float(input())\nprint(float(r**2 * math.pi), float(r * 2 * math.pi))\n","change":"replace","i1":2,"i2":4,"j1":2,"j2":4,"error":"TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02400\/Python\/s075858822.py\", line 4, in <module>\n    print(r ** 2 * math.pi, r * 2 * math.pi)\nTypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'\n"}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"from math import pi\n\nr = int(input())\nprint(r**2 * pi, 2 * r * pi)\n","changed_src":"from math import pi\n\nr = float(input())\nprint(r**2 * pi, 2 * r * pi)\n","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"import math\n\nr = int(input())\n\nprint(f\"{math.pi * r ** 2} {2 * math.pi * r}\")\n","changed_src":"import math\n\nr = float(input())\n\nprint(f\"{math.pi * r ** 2} {2 * math.pi * r}\")\n","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"r = int(input())\nprint(r * r * 3.14159265359, 2 * r * 3.14159265359)\n","changed_src":"r = float(input())\nprint(\"{:.6f} {:.6f}\".format(r * r * 3.14159265359, 2 * r * 3.14159265359))\n","change":"replace","i1":0,"i2":2,"j1":0,"j2":2,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\nint main() {\n  int a, b, d = 0, r = 0;\n  double f = 0.0;\n  scanf(\"%d%d\", &a, &b);\n  d = a \/ b;\n  r = a % b;\n  f = (double)a \/ b;\n  printf(\"%d %d %f\\n\", d, r, f);\n  return 0;\n}","changed_src":"#include <stdio.h>\nint main() {\n  double r;\n  double S = 0.0, L = 0.0, pi = 3.14159265359;\n  scanf(\"%lf\", &r);\n  S = r * r * pi;\n  L = 2 * r * pi;\n  printf(\"%.6lf %.6lf\\n\", S, L);\n  return 0;\n}","change":"replace","i1":2,"i2":9,"j1":2,"j2":8,"error":"-8","stderr":""}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"import math\n\nr = int(input())\nprint(round(r**2 * math.pi, 6), round(r * 2 * math.pi, 6))\n","changed_src":"import math\n\nr = float(input())\nprint(round(r**2 * math.pi, 6), round(r * 2 * math.pi, 6))\n","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"from math import pi\n\nr = int(input())\n\n# \u9762\u7a4d\ncircle_area = r * r * pi\n# \u5186\u5468\ncircumference = 2.0 * r * pi\n\nprint(\"{} {}\".format(circle_area, circumference))\n","changed_src":"from math import pi\n\nr = float(input())\nprint(\"{} {}\".format(r * r * pi, 2 * pi * r))\n","change":"replace","i1":2,"i2":10,"j1":2,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02400","language":"Python","original_status":"Runtime Error","original_src":"r = int(input())\npi = 3.141592653589793\nA = float(pow(r, 2) * pi)\nS = float(2 * pi * r)\nprint(\"{0:.8f}\".format(A) + \" \" + \"{0:.8f}\".format(S))\n","changed_src":"r = float(input())\npi = 3.141592653589793\nA = float(pow(r, 2) * pi)\nS = float(2 * pi * r)\nprint(\"{0:.8f}\".format(A) + \" \" + \"{0:.8f}\".format(S))\n","change":"replace","i1":0,"i2":1,"j1":0,"j2":1,"error":"0","stderr":""}
-{"problem_id":"p02402","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int n, i, max, min;\n  long long sum = 0;\n  int a[i];\n  cin >> n;\n  for (i = 1; i <= n; i++) {\n    cin >> a[i];\n    sum = sum + a[i];\n    if (i == 1) {\n      max = a[i];\n      min = a[i];\n    } else {\n      if (max < a[i]) {\n        max = a[i];\n      }\n      if (min > a[i]) {\n        min = a[i];\n      }\n    }\n  }\n  cout << min << \" \" << max << \" \" << sum << endl;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int n, i, max, min;\n  long long sum = 0;\n  int a[100000];\n  cin >> n;\n  for (i = 1; i <= n; i++) {\n    cin >> a[i];\n    sum = sum + a[i];\n    if (i == 1) {\n      max = a[i];\n      min = a[i];\n    } else {\n      if (max < a[i]) {\n        max = a[i];\n      }\n      if (min > a[i]) {\n        min = a[i];\n      }\n    }\n  }\n  cout << min << \" \" << max << \" \" << sum << endl;\n}\n","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"0","stderr":""}
-{"problem_id":"p02402","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int n, i, max, min;\n  long long sum = 0;\n  int a[i];\n  cin >> n;\n  for (i = 1; i <= n; i++) {\n    cin >> a[i];\n    sum = sum + a[i];\n    if (i == 1) {\n      max = a[i];\n      min = a[i];\n    } else {\n      if (max < a[i]) {\n        max = a[i];\n      }\n      if (min > a[i]) {\n        min = a[i];\n      }\n    }\n  }\n  cout << min << \" \" << max << \" \" << sum << endl;\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int n, i, max, min;\n  long long sum = 0;\n  int a[100000];\n  cin >> n;\n  for (i = 1; i <= n; i++) {\n    cin >> a[i];\n    sum = sum + a[i];\n    if (i == 1) {\n      max = a[i];\n      min = a[i];\n    } else {\n      if (max < a[i]) {\n        max = a[i];\n      }\n      if (min > a[i]) {\n        min = a[i];\n      }\n    }\n  }\n  cout << min << \" \" << max << \" \" << sum << endl;\n  return 0;\n}\n","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"0","stderr":""}
-{"problem_id":"p02402","language":"Python","original_status":"Runtime Error","original_src":"input()\nli = map(int, input().split())\nprint(min(li), max(li), sum(li))\n","changed_src":"input()\nli = list(map(int, input().split()))\nprint(min(li), max(li), sum(li))\n","change":"replace","i1":1,"i2":2,"j1":1,"j2":2,"error":"ValueError: max() arg is an empty sequence","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02402\/Python\/s227796707.py\", line 3, in <module>\n    print(min(li), max(li), sum(li))\nValueError: max() arg is an empty sequence\n"}
-{"problem_id":"p02402","language":"Python","original_status":"Runtime Error","original_src":"n = int(input())\na = map(int, input().split())\nprint(min(a), max(a), sum(a))\n","changed_src":"n = int(input())\na = list(map(int, input().split()))\nprint(min(a), max(a), sum(a))\n","change":"replace","i1":1,"i2":2,"j1":1,"j2":2,"error":"ValueError: max() arg is an empty sequence","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02402\/Python\/s610106422.py\", line 3, in <module>\n    print(min(a), max(a), sum(a))\nValueError: max() arg is an empty sequence\n"}
-{"problem_id":"p02402","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <cmath>\n#include <iomanip>\n#include <iostream>\n#include <string>\nusing namespace std;\nint main() {\n  long long a, n, max;\n  long long goukei = 0;\n  long long min = 999999999;\n  long long array[9999999];\n  cin >> n;\n  for (;;) {\n    for (a = 0; a < n; a++)\n      cin >> array[a];\n    int max = array[0];\n    for (a = 0; a < n; a++)\n      if (array[a] > max)\n        max = array[a];\n    for (a = 0; a < n; a++)\n      if (array[a] < min)\n        min = array[a];\n    for (a = 0; a < n; a++)\n      goukei += array[a];\n\n    cout << min << \" \" << max << \" \" << goukei << endl;\n    break;\n  }\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <cmath>\n#include <iomanip>\n#include <iostream>\n#include <string>\nusing namespace std;\nint main() {\n  long long a, n, max;\n  long long goukei = 0;\n  long long min = 999999999;\n  long long array[1000000];\n  cin >> n;\n  for (;;) {\n    for (a = 0; a < n; a++)\n      cin >> array[a];\n    int max = array[0];\n    for (a = 0; a < n; a++)\n      if (array[a] > max)\n        max = array[a];\n    for (a = 0; a < n; a++)\n      if (array[a] < min)\n        min = array[a];\n    for (a = 0; a < n; a++)\n      goukei += array[a];\n\n    cout << min << \" \" << max << \" \" << goukei << endl;\n    break;\n  }\n\n  return 0;\n}","change":"replace","i1":10,"i2":11,"j1":10,"j2":11,"error":"-11","stderr":""}
-{"problem_id":"p02402","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int n, i, max, min;\n  long long sum = 0;\n  int a[100];\n  cin >> n;\n  for (i = 1; i <= n; i++) {\n    cin >> a[i];\n    sum = sum + a[i];\n    if (i == 1) {\n      max = a[i];\n      min = a[i];\n    } else {\n      if (max < a[i]) {\n        max = a[i];\n      }\n      if (min > a[i]) {\n        min = a[i];\n      }\n    }\n  }\n  cout << min << \" \" << max << \" \" << sum << endl;\n  return 0;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int n, i, max, min;\n  long long sum = 0;\n  int a[10000];\n  cin >> n;\n  for (i = 1; i <= n; i++) {\n    cin >> a[i];\n    sum = sum + a[i];\n    if (i == 1) {\n      max = a[i];\n      min = a[i];\n    } else {\n      if (max < a[i]) {\n        max = a[i];\n      }\n      if (min > a[i]) {\n        min = a[i];\n      }\n    }\n  }\n  cout << min << \" \" << max << \" \" << sum << endl;\n  return 0;\n}\n","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"0","stderr":""}
-{"problem_id":"p02402","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int n, i, a[1000], b, c, d, min = 1000000, max = -1000000, sum = 0;\n  cin >> n;\n  for (i = 0; i < n; i++) {\n    cin >> a[i];\n    if (a[i] < min) {\n      min = a[i];\n    }\n    if (a[i] > max) {\n      max = a[i];\n    }\n    sum += a[i];\n  }\n  cout << min << \" \" << max << \" \" << sum << endl;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  long long n, i, a[10000], min = 1000000, max = -1000000, sum = 0;\n  cin >> n;\n  for (i = 0; i < n; i++) {\n    cin >> a[i];\n    if (a[i] < min) {\n      min = a[i];\n    }\n    if (a[i] > max) {\n      max = a[i];\n    }\n    sum += a[i];\n  }\n  cout << min << \" \" << max << \" \" << sum << endl;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02402","language":"C++","original_status":"Runtime Error","original_src":"#include <cstdio>\n#include <iostream>\n#include <stdio.h>\nusing namespace std;\n\nint main() {\n  long a, b[100000000];\n  long max, min, sum = 0;\n\n  cin >> a;\n\n  for (int i = 0; i < a; i++) {\n    cin >> b[i];\n    if (i == 0) {\n      min = b[i];\n      max = b[i];\n    }\n\n    if (b[i] < min) {\n      min = b[i];\n    } else if (max < b[i]) {\n      max = b[i];\n    }\n\n    sum += b[i];\n  }\n  cout << min << \" \" << max << \" \" << sum << endl;\n\n  return 0;\n}\n","changed_src":"#include <cstdio>\n#include <iostream>\n#include <stdio.h>\nusing namespace std;\n\nint main() {\n  int a, b[10001];\n  long long int max, min, sum = 0;\n\n  cin >> a;\n\n  for (int i = 0; i < a; i++) {\n    cin >> b[i];\n    if (i == 0) {\n      min = b[i];\n      max = b[i];\n    }\n\n    if (b[i] < min) {\n      min = b[i];\n    } else if (max < b[i]) {\n      max = b[i];\n    }\n\n    sum += b[i];\n  }\n  cout << min << \" \" << max << \" \" << sum << endl;\n\n  return 0;\n}\n","change":"replace","i1":6,"i2":8,"j1":6,"j2":8,"error":"-11","stderr":""}
-{"problem_id":"p02402","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  long sum = 0;\n  long fra[10000];\n  int n;\n\n  \/\/ \u4e0a\u9650'n'\u306e\u5165\u529b\n  cin >> n;\n\n  \/\/ \u914d\u5217fra[]\u306b\u5024\u3092\u4ee3\u5165\u3001\u5408\u8a08\u5024sum\u306b\u52a0\u7b97\n  for (int i = 0; i < n; i++) {\n    cin >> fra[i];\n    sum = sum + fra[i];\n  }\n\n  while (1) {\n    int flag = 0;\n    \/\/ \u30bd\u30fc\u30c8\u672c\u4f53\n    for (int i = 0; i < n; i++) {\n      if (fra[i - 1] > fra[i] && i > 0 && i < n) {\n        swap(fra[i - 1], fra[i]);\n      }\n    }\n    \/\/ \u30bd\u30fc\u30c8\u5224\u5b9a\n    int count = 0;\n    for (int i = 0; i < n; i++) {\n      if (fra[i - 1] < fra[i] && i > 0) {\n        count++;\n      }\n      if (count == n - 1) {\n        flag = 1;\n      }\n    }\n\n    if (flag == 1)\n      break;\n  }\n\n  cout << fra[0] << \" \" << fra[n - 1] << \" \" << sum << endl;\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint main() {\n  long sum = 0;\n  long fra[10000];\n  int n;\n\n  \/\/ \u4e0a\u9650'n'\u306e\u5165\u529b\n  cin >> n;\n\n  \/\/ \u914d\u5217fra[]\u306b\u5024\u3092\u4ee3\u5165\u3001\u5408\u8a08\u5024sum\u306b\u52a0\u7b97\n  for (int i = 0; i < n; i++) {\n    cin >> fra[i];\n    sum = sum + fra[i];\n  }\n\n  while (1) {\n    int flag = 0;\n    \/\/ \u30bd\u30fc\u30c8\u672c\u4f53\n    for (int i = 0; i < n; i++) {\n      if (fra[i - 1] > fra[i] && i > 0 && i < n) {\n        swap(fra[i - 1], fra[i]);\n      }\n    }\n    \/\/ \u30bd\u30fc\u30c8\u5224\u5b9a\n    int count = 0;\n    for (int i = 0; i < n; i++) {\n      if (fra[i - 1] <= fra[i] && i > 0) {\n        count++;\n      }\n      if (count == n - 1) {\n        flag = 1;\n      }\n    }\n\n    if (flag == 1)\n      break;\n  }\n\n  cout << fra[0] << \" \" << fra[n - 1] << \" \" << sum << endl;\n\n  return 0;\n}","change":"replace","i1":29,"i2":30,"j1":29,"j2":30,"error":"TLE","stderr":""}
-{"problem_id":"p02402","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n\n  int n;\n  cin >> n;\n\n  int a[10000];\n  for (int i = 0; 1 < n; i++)\n    cin >> a[i];\n\n  int mn = a[0], mx = a[0];\n  long long sum = 0;\n  for (int i = 0; i < n; i++) {\n    mn = min(mn, a[i]);\n    mx = max(mx, a[i]);\n    sum += a[i];\n  }\n\n  cout << mn << \" \" << mx << \" \" << sum << endl;\n\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n\n  int n;\n  cin >> n;\n\n  int a[10000];\n  for (int i = 0; i < n; i++)\n    cin >> a[i];\n\n  int mn = a[0], mx = a[0];\n  long long sum = 0;\n  for (int i = 0; i < n; i++) {\n    mn = min(mn, a[i]);\n    mx = max(mx, a[i]);\n    sum += a[i];\n  }\n\n  cout << mn << \" \" << mx << \" \" << sum << endl;\n\n  return 0;\n}\n","change":"replace","i1":9,"i2":10,"j1":9,"j2":10,"error":"TLE","stderr":""}
-{"problem_id":"p02402","language":"C++","original_status":"Time Limit Exceeded","original_src":"\n#include <iomanip>\n#include <iostream>\n\nusing namespace std;\n\nlong long a, n, smallest, biggest, sum;\nchar op;\n\nint main() {\n\n  cin >> n;\n\n  smallest = 0;\n  biggest = 0;\n  sum = 0;\n\n  for (int i = 0; i + 1 <= n; i++) {\n\n    cin >> a;\n\n    if (i == 0 || a < smallest) {\n      smallest = a;\n    }\n    if (i = 0 || a > biggest) {\n      biggest = a;\n    }\n\n    sum += a;\n  }\n\n  cout << smallest << \" \" << biggest << \" \" << sum << endl;\n\n  return 0;\n}\n","changed_src":"\n#include <iomanip>\n#include <iostream>\n\nusing namespace std;\n\nlong long a, n, smallest, biggest, sum;\nchar op;\n\nint main() {\n\n  cin >> n;\n\n  smallest = 0;\n  biggest = 0;\n  sum = 0;\n\n  for (int i = 0; i + 1 <= n; i++) {\n\n    cin >> a;\n\n    if (i == 0 || a < smallest) {\n      smallest = a;\n    }\n    if (i == 0 || a > biggest) {\n      biggest = a;\n    }\n\n    sum += a;\n  }\n\n  cout << smallest << \" \" << biggest << \" \" << sum << endl;\n\n  return 0;\n}\n","change":"replace","i1":24,"i2":25,"j1":24,"j2":25,"error":"TLE","stderr":""}
-{"problem_id":"p02402","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int n, a[100], i, x, sum = 0, max = 0, min = 10000;\n  cin >> n;\n  for (i = 0; i < n; i++) {\n    cin >> a[i];\n    sum += a[i];\n    if (a[i] > max) {\n      max = a[i];\n    }\n    if (a[i] < min) {\n      min = a[i];\n    }\n  }\n  cout << min << \" \" << max << \" \" << sum << endl;\n  \/\/ What Japanese people!?\n\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int n, a[10000], i, x;\n  long long sum = 0, max = -1000000, min = 1000000;\n  cin >> n;\n  for (i = 0; i < n; i++) {\n    cin >> a[i];\n    sum += a[i];\n    if (a[i] > max) {\n      max = a[i];\n    }\n    if (a[i] < min) {\n      min = a[i];\n    }\n  }\n  cout << min << \" \" << max << \" \" << sum << endl;\n  \/\/ What Japanese people!?\n\n  return 0;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02402","language":"Python","original_status":"Runtime Error","original_src":"input()\n\na = list(map(int, input().split()))\n\ns = 0\n\nfor i in len(a):\n    s = s + i\n\nprint(min(a), max(a), s)\n","changed_src":"input()\n\na = list(map(int, input().split()))\n\ns = 0\n\nfor i in a:\n    s = s + i\n\nprint(min(a), max(a), s)\n","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"TypeError: 'int' object is not iterable","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02402\/Python\/s130438338.py\", line 7, in <module>\n    for i in len(a):\nTypeError: 'int' object is not iterable\n"}
-{"problem_id":"p02402","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\nint main(void) {\n  long long a[1000] = {0};\n  int n;\n  long long min;\n  long long max;\n  int i;\n  long long sum = 0;\n  cin >> n;\n  for (i = 0; i < n; i++) {\n    cin >> a[i];\n  }\n  min = a[0];\n  for (i = 0; i < n; i++) {\n    if (min > a[i])\n      min = a[i];\n  }\n  for (i = 0; i < n; i++) {\n    cin >> a[i];\n  }\n  max = a[0];\n  for (i = 0; i < n; i++) {\n    if (max < a[i])\n      max = a[i];\n  }\n  for (i = 0; i < n; i++)\n    sum = sum + a[i];\n  cout << min;\n  cout << \" \";\n  cout << max;\n  cout << \" \";\n  cout << sum;\n  cout << endl;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nint main(void) {\n  long long a[10001] = {0};\n  int n;\n  long long min;\n  long long max;\n  int i;\n  long long sum = 0;\n  cin >> n;\n  for (i = 0; i < n; i++) {\n    cin >> a[i];\n  }\n  min = a[0];\n  for (i = 0; i < n; i++) {\n    if (min > a[i])\n      min = a[i];\n  }\n  for (i = 0; i < n; i++) {\n    cin >> a[i];\n  }\n  max = a[0];\n  for (i = 0; i < n; i++) {\n    if (max < a[i])\n      max = a[i];\n  }\n  for (i = 0; i < n; i++)\n    sum = sum + a[i];\n  cout << min;\n  cout << \" \";\n  cout << max;\n  cout << \" \";\n  cout << sum;\n  cout << endl;\n}\n","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02402","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\n\nint main(void) {\n  int n, i, a[1000], max, min, sum;\n\n  cin >> n;\n  for (i = 1; i <= n; i++) {\n    cin >> a[i];\n  }\n  sum = a[1];\n  min = a[1];\n  max = a[1];\n  for (i = 2; i <= n; i++) {\n    sum = sum + a[i];\n    if (a[i] < min)\n      min = a[i];\n    if (a[i] > max)\n      max = a[i];\n  };\n  cout << min << \" \" << max << \" \" << sum << endl;\n\n  return 0;\n}","changed_src":"#include <iostream>\nusing namespace std;\n\nint main(void) {\n  long n, i, a[10001], max, min, sum;\n\n  cin >> n;\n  for (i = 1; i <= n; i++) {\n    cin >> a[i];\n  }\n  sum = a[1];\n  min = a[1];\n  max = a[1];\n  for (i = 2; i <= n; i++) {\n    sum = sum + a[i];\n    if (a[i] < min)\n      min = a[i];\n    if (a[i] > max)\n      max = a[i];\n  };\n  cout << min << \" \" << max << \" \" << sum << endl;\n\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"0","stderr":""}
-{"problem_id":"p02402","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define shosu(n) setprecision(n)\nusing namespace std;\nint main() {\n  int n, sum = 0, a[100000000];\n  cin >> n;\n  rep(i, n) {\n    cin >> a[i];\n    sum += a[i];\n  }\n  sort(a, a + n);\n  cout << a[0] << ' ' << a[n - 1] << ' ' << sum << endl;\n  return 0;\n}","changed_src":"#include <bits\/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define shosu(n) setprecision(n)\nusing namespace std;\nint main() {\n  long long n, sum = 0, a[10000];\n  cin >> n;\n  rep(i, n) {\n    cin >> a[i];\n    sum += a[i];\n  }\n  sort(a, a + n);\n  cout << a[0] << ' ' << a[n - 1] << ' ' << sum << endl;\n  return 0;\n}","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"-11","stderr":""}
-{"problem_id":"p02402","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int a[1000];\n  for (int i = 0; i < n; i++)\n    cin >> a[i];\n  int mn = a[0];\n  int mx = a[0];\n  long long sum = 0;\n  for (int i = 0; i < n; i++) {\n    mn = min(mn, a[i]);\n    mx = max(mx, a[i]);\n    sum += a[i];\n  }\n  cout << mn << \" \" << mx << \" \" << sum << endl;\n  return 0;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int a[10000];\n  for (int i = 0; i < n; i++)\n    cin >> a[i];\n  int mn = a[0];\n  int mx = a[0];\n  long long sum = 0;\n  for (int i = 0; i < n; i++) {\n    mn = min(mn, a[i]);\n    mx = max(mx, a[i]);\n    sum += a[i];\n  }\n  cout << mn << \" \" << mx << \" \" << sum << endl;\n  return 0;\n}\n","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"0","stderr":""}
-{"problem_id":"p02402","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int n, max, min;\n  long long sum = 0;\n  int a[1000];\n  cin >> n;\n  for (int i = 1; i <= n; i++) {\n    cin >> a[i];\n    sum = sum + a[i];\n    if (i == 1) {\n      max = a[i];\n      min = a[i];\n    } else {\n      if (max < a[i]) {\n        max = a[i];\n      }\n      if (min > a[i]) {\n        min = a[i];\n      }\n    }\n  }\n  cout << min << \" \" << max << \" \" << sum << endl;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nint main() {\n  int n, max, min;\n  long long sum = 0;\n  int a[10001];\n  cin >> n;\n  for (int i = 1; i <= n; i++) {\n    cin >> a[i];\n    sum = sum + a[i];\n    if (i == 1) {\n      max = a[i];\n      min = a[i];\n    } else {\n      if (max < a[i]) {\n        max = a[i];\n      }\n      if (min > a[i]) {\n        min = a[i];\n      }\n    }\n  }\n  cout << min << \" \" << max << \" \" << sum << endl;\n}\n","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"0","stderr":""}
-{"problem_id":"p02407","language":"Python","original_status":"Runtime Error","original_src":"n = int(input)\nlst = list(map(int, input().split()))\nprint(\" \".join(lst[::-1]))\n","changed_src":"input()\nprint(\" \".join(input().split()[::-1]))\n","change":"replace","i1":0,"i2":3,"j1":0,"j2":2,"error":"TypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02407\/Python\/s871236231.py\", line 1, in <module>\n    n = int(input)\nTypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'\n"}
-{"problem_id":"p02407","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <algorithm>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <stdlib.h>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint main() {\n  int n, m;\n  int maximum;\n  int a[1000];\n  while (true) {\n    cin >> n >> m;\n    if (n == 0 && m == 0)\n      break;\n    maximum = 0;\n    for (int j = 0; j < n; j++) {\n      cin >> a[j];\n    }\n    for (int j = 0; j < n - 1; j++) {\n      for (int t = j + 1; t < n; t++) {\n        if (a[j] + a[t] <= m) {\n          maximum = max(maximum, a[j] + a[t]);\n        }\n      }\n    }\n    if (maximum == 0) {\n      cout << \"NONE\" << endl;\n    } else {\n      cout << maximum << endl;\n    }\n  }\n}\n","changed_src":"#include <algorithm>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <stdlib.h>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  vector<int> a(n);\n  for (int i = 0; i < n; i++)\n    cin >> a[i];\n  for (int i = n - 1; 0 < i; i--)\n    cout << a[i] << \" \";\n  cout << a[0] << endl;\n}\n","change":"replace","i1":12,"i2":36,"j1":12,"j2":20,"error":"TLE","stderr":""}
-{"problem_id":"p02407","language":"C++","original_status":"Runtime Error","original_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint a[105];\nint main() {\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> a[i];\n  for (int i = n - 1; i > 0; i++)\n    cout << a[i] << \" \";\n  cout << a[0] << endl;\n}\n","changed_src":"#include <bits\/stdc++.h>\nusing namespace std;\nint a[105];\nint main() {\n  int n;\n  cin >> n;\n  for (int i = 0; i < n; i++)\n    cin >> a[i];\n  for (int i = n - 1; i > 0; i--)\n    cout << a[i] << \" \";\n  cout << a[0] << endl;\n}\n","change":"replace","i1":8,"i2":9,"j1":8,"j2":9,"error":"-11","stderr":""}
-{"problem_id":"p02407","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <vector>\n#define loop(i, a, b) for (int i = a; i < b; i++)\n#define rep(i, a) loop(i, 0, a)\nusing namespace std;\nint main() {\n  int n;\n  vector<int> in(n);\n  rep(i, n) cin >> in[i];\n  rep(i, n - 1) cout << in[n - i - 1] << \" \";\n  cout << in[0] << endl;\n}","changed_src":"#include <iostream>\n#include <vector>\n#define loop(i, a, b) for (int i = a; i < b; i++)\n#define rep(i, a) loop(i, 0, a)\nusing namespace std;\nint main() {\n  int n;\n  cin >> n;\n  vector<int> in(n);\n  rep(i, n) cin >> in[i];\n  rep(i, n - 1) cout << in[n - i - 1] << \" \";\n  cout << in[0] << endl;\n}","change":"insert","i1":7,"i2":7,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02407","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\nusing namespace std;\nint main(void) {\n  int n, a[5] = {0};\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> a[i];\n  }\n  for (int i = n - 1; i >= 0; i--) {\n    if (i == n - 1) {\n      cout << a[i];\n    } else {\n      cout << \" \" << a[i];\n    }\n  }\n  cout << endl;\n}\n","changed_src":"#include <iostream>\nusing namespace std;\nint main(void) {\n  int n, a[100] = {0};\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n    cin >> a[i];\n  }\n  for (int i = n - 1; i >= 0; i--) {\n    if (i == n - 1) {\n      cout << a[i];\n    } else {\n      cout << \" \" << a[i];\n    }\n  }\n  cout << endl;\n}\n","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"0","stderr":""}
-{"problem_id":"p02407","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  vector<int> numbers(n - 1);\n  for (int i = 0; i < n; i++) {\n    cin >> numbers[i];\n  }\n  for (int i = n; i > 1; i--) {\n    cout << numbers[i - 1] << ' ';\n  }\n  cout << numbers[0] << endl;\n\n  return 0;\n}","changed_src":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  vector<int> numbers(n);\n  for (int i = 0; i < n; i++) {\n    cin >> numbers[i];\n  }\n  for (int i = n; i > 1; i--) {\n    cout << numbers[i - 1] << ' ';\n  }\n  cout << numbers[0] << endl;\n\n  return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"0","stderr":""}
-{"problem_id":"p02407","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <iostream>\n#include <stdio.h>\n\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int a[100];\n  for (int i = 0; i < n; i++) {\n    cin >> a[i];\n    if (i == n - 1) {\n      cout << a[i];\n      for (i = n - 2; i >= 0; i--) {\n        cout << \" \" << a[i];\n      }\n    }\n  }\n  return 0;\n}\n","changed_src":"#include <iostream>\n#include <stdio.h>\n\nusing namespace std;\n\nint main() {\n  int n;\n  cin >> n;\n  int a[100];\n  for (int i = 0; i < n; i++) {\n    cin >> a[i];\n    if (i == n - 1) {\n      cout << a[i];\n      for (i = n - 2; i >= 0; i--) {\n        cout << \" \" << a[i];\n      }\n      cout << endl;\n      break;\n    }\n  }\n  return 0;\n}\n","change":"insert","i1":16,"i2":16,"j1":16,"j2":18,"error":"TLE","stderr":""}
-{"problem_id":"p02407","language":"Python","original_status":"Runtime Error","original_src":"n = int(input())\na = list(map(int, input().split()))\na.reverse()\nprint(\" \".join(a))\n","changed_src":"n = int(input())\na = list(input().split())\na.reverse()\nprint(\" \".join(a))\n","change":"replace","i1":1,"i2":2,"j1":1,"j2":2,"error":"TypeError: sequence item 0: expected str instance, int found","stderr":"Traceback (most recent call last):\n  File \"\/home\/alex\/Documents\/bug-detection\/input\/Project_CodeNet\/data\/p02407\/Python\/s100431651.py\", line 4, in <module>\n    print(' '.join(a))\nTypeError: sequence item 0: expected str instance, int found\n"}
-{"problem_id":"p02407","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <cstdio>\n#include <iostream>\nusing namespace std;\n#define MAX 100\n\nint main(void) {\n  int n, a[MAX], i = 0;\n  do {\n    cin >> n;\n  } while (n > MAX || n < 0);\n\n  for (int i = 0; i < n; i++) {\n    cin >> a[i];\n  }\n\n  while (1) {\n    printf(\"%d\", a[n - i]);\n    if (i == n)\n      break;\n    printf(\" \");\n  }\n  printf(\"\\n\");\n  return 0;\n}","changed_src":"#include <cstdio>\n#include <iostream>\nusing namespace std;\n#define MAX 100\n\nint main(void) {\n  int n, a[MAX], i = 0;\n  do {\n    cin >> n;\n  } while (n > MAX || n < 0);\n\n  for (int i = 0; i < n; i++) {\n    cin >> a[i];\n  }\n\n  while (1) {\n    printf(\"%d\", a[n - i - 1]);\n    if (i++ == n - 1)\n      break;\n    printf(\" \");\n  }\n  printf(\"\\n\");\n  return 0;\n}","change":"replace","i1":16,"i2":18,"j1":16,"j2":18,"error":"TLE","stderr":""}
-{"problem_id":"p02407","language":"C++","original_status":"Runtime Error","original_src":"#include <iostream>\n\/\/ #include <stdio.h>\nusing namespace std;\n\nint main() {\n  int n, m;\n  int a[10];\n  cin >> n;\n  \/\/ a = (int *)malloc(sizeof(int) * n);\n\n  for (int i = 0; i < n; i++) {\n    cin >> m;\n    a[i] = m;\n  }\n\n  for (int i = n - 1; i > 0; i--) {\n    cout << a[i] << \" \";\n  }\n  cout << a[0];\n  cout << endl;\n  return 0;\n}","changed_src":"#include <iostream>\n\/\/ #include <stdio.h>\nusing namespace std;\n\nint main() {\n  int n, m;\n  int a[1000];\n  cin >> n;\n  \/\/ a = (int *)malloc(sizeof(int) * n);\n\n  for (int i = 0; i < n; i++) {\n    cin >> m;\n    a[i] = m;\n  }\n\n  for (int i = n - 1; i > 0; i--) {\n    cout << a[i] << \" \";\n  }\n  cout << a[0];\n  cout << endl;\n  return 0;\n}","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"0","stderr":""}
-{"problem_id":"p02407","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main(void) {\n  int i, n;\n  int arr[] = {};\n\n  scanf(\"%d\", &n);\n\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\", &arr[i]);\n  }\n\n  for (i = 0; i < (n \/ 2); i++) {\n    int temp = arr[i];\n    arr[i] = arr[(n - 1) - i];\n    arr[(n - 1) - i] = temp;\n  }\n\n  for (i = 0; i < n; i++) {\n    if (i) {\n      printf(\" \");\n    }\n    printf(\"%d\", arr[i]);\n  }\n  printf(\"\\n\");\n  return 0;\n}","changed_src":"#include <stdio.h>\n\nint main(void) {\n  int i, n;\n  int arr[100] = {0};\n\n  scanf(\"%d\", &n);\n\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\", &arr[i]);\n  }\n\n  for (i = 0; i < (n \/ 2); i++) {\n    int temp = arr[i];\n    arr[i] = arr[(n - 1) - i];\n    arr[(n - 1) - i] = temp;\n  }\n\n  for (i = 0; i < n; i++) {\n    if (i) {\n      printf(\" \");\n    }\n    printf(\"%d\", arr[i]);\n  }\n  printf(\"\\n\");\n  return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"-6","stderr":"*** stack smashing detected ***: terminated\n"}
-{"problem_id":"p02407","language":"C++","original_status":"Runtime Error","original_src":"#define _USE_MATH_DEFINES\n\n#include <algorithm>\n#include <climits>\n#include <cmath>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <stdio.h>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n#define ll long long\nconst int MOD = 1000000007; \/\/ 10^9+7\nconst string SPACE = \" \";\n\nll max(ll a, ll b) {\n\n  if (a > b)\n    return a;\n  else\n    return b;\n}\ndouble max(double a, double b) {\n\n  if (a > b)\n    return a;\n  else\n    return b;\n}\n\/\/ a??\u00a8b?????\u00a7?????????\n\nll min(ll a, ll b) {\n\n  if (a < b)\n    return a;\n  else\n    return b;\n}\n\/\/ a??\u00a8b????\u00b0??????????\n\nll avd_i(ll a, ll b) {\n\n  if (a > b)\n    return a - b;\n  else\n    return b - a;\n}\ndouble avd_d(double a, double b) {\n\n  double re;\n  if (a > b)\n    re = a - b;\n  else\n    re = b - a;\n  return re;\n}\n\/\/ a??\u00a8b???????????\u00b6??????\n\nll powsur(ll a, ll b, ll p) {\n\n  if (b == 0) {\n\n    return 1;\n\n  } else if (b % 2 == 0) {\n\n    ll d = powsur(a, b \/ 2, p);\n    return ((d % p) * (d % p)) % p;\n\n  } else {\n\n    return ((a % p) * powsur(a, b - 1, p) % p) % p;\n  }\n}\n\/\/ p????\u00b4???\u00b0,a???b??????p??\u00a7?????\u00a3?????????\n\nll CMOD(ll n, ll r, ll p) {\n\n  ll a = 1, b = 1, c = 1, re;\n  for (int i = 1; i <= n; i++) {\n\n    a *= i;\n    a = a % p;\n  }\n  for (int i = 1; i <= r; i++) {\n\n    b *= i;\n    b = b % p;\n  }\n  for (int i = 1; i <= n - r; i++) {\n\n    c *= i;\n    c = c % p;\n  }\n  b = powsur(b, p - 2, p);\n  c = powsur(c, p - 2, p);\n  re = ((a % p) * (b % p)) % p;\n  re = ((re % p) * c % p) % p;\n\n  return re;\n}\n\/\/ p????\u00b4???\u00b0,(nCr)%p\n\nll gcd(ll a, ll b) {\n\n  if (a > b) {\n\n    ll tmp = a;\n    a = b;\n    b = tmp;\n  }\n  ll r;\n  r = b % a;\n  if (r == 0)\n    return a;\n  else\n    return gcd(r, a);\n}\n\/\/?????\u00a7??\u00ac?\u00b4???\u00b0\n\nll lcm(ll a, ll b) { return (a \/ gcd(a, b)) * b; }\n\/\/????\u00b0???\u00ac?????\u00b0\n\nint main() {\n\n  int n, a[105];\n\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n\n    cin >> a[i];\n  }\n  for (int i = n - 1; i >= 1; i++) {\n\n    cout << a[i] << \" \";\n  }\n  cout << a[0] << endl;\n\n  return 0;\n}","changed_src":"#define _USE_MATH_DEFINES\n\n#include <algorithm>\n#include <climits>\n#include <cmath>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <stdio.h>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n#define ll long long\nconst int MOD = 1000000007; \/\/ 10^9+7\nconst string SPACE = \" \";\n\nll max(ll a, ll b) {\n\n  if (a > b)\n    return a;\n  else\n    return b;\n}\ndouble max(double a, double b) {\n\n  if (a > b)\n    return a;\n  else\n    return b;\n}\n\/\/ a??\u00a8b?????\u00a7?????????\n\nll min(ll a, ll b) {\n\n  if (a < b)\n    return a;\n  else\n    return b;\n}\n\/\/ a??\u00a8b????\u00b0??????????\n\nll avd_i(ll a, ll b) {\n\n  if (a > b)\n    return a - b;\n  else\n    return b - a;\n}\ndouble avd_d(double a, double b) {\n\n  double re;\n  if (a > b)\n    re = a - b;\n  else\n    re = b - a;\n  return re;\n}\n\/\/ a??\u00a8b???????????\u00b6??????\n\nll powsur(ll a, ll b, ll p) {\n\n  if (b == 0) {\n\n    return 1;\n\n  } else if (b % 2 == 0) {\n\n    ll d = powsur(a, b \/ 2, p);\n    return ((d % p) * (d % p)) % p;\n\n  } else {\n\n    return ((a % p) * powsur(a, b - 1, p) % p) % p;\n  }\n}\n\/\/ p????\u00b4???\u00b0,a???b??????p??\u00a7?????\u00a3?????????\n\nll CMOD(ll n, ll r, ll p) {\n\n  ll a = 1, b = 1, c = 1, re;\n  for (int i = 1; i <= n; i++) {\n\n    a *= i;\n    a = a % p;\n  }\n  for (int i = 1; i <= r; i++) {\n\n    b *= i;\n    b = b % p;\n  }\n  for (int i = 1; i <= n - r; i++) {\n\n    c *= i;\n    c = c % p;\n  }\n  b = powsur(b, p - 2, p);\n  c = powsur(c, p - 2, p);\n  re = ((a % p) * (b % p)) % p;\n  re = ((re % p) * c % p) % p;\n\n  return re;\n}\n\/\/ p????\u00b4???\u00b0,(nCr)%p\n\nll gcd(ll a, ll b) {\n\n  if (a > b) {\n\n    ll tmp = a;\n    a = b;\n    b = tmp;\n  }\n  ll r;\n  r = b % a;\n  if (r == 0)\n    return a;\n  else\n    return gcd(r, a);\n}\n\/\/?????\u00a7??\u00ac?\u00b4???\u00b0\n\nll lcm(ll a, ll b) { return (a \/ gcd(a, b)) * b; }\n\/\/????\u00b0???\u00ac?????\u00b0\n\nint main() {\n\n  int n, a[105];\n\n  cin >> n;\n  for (int i = 0; i < n; i++) {\n\n    cin >> a[i];\n  }\n  for (int i = n - 1; i >= 1; i--) {\n\n    cout << a[i] << \" \";\n  }\n  cout << a[0] << endl;\n\n  return 0;\n}","change":"replace","i1":135,"i2":136,"j1":135,"j2":136,"error":"-11","stderr":""}
-{"problem_id":"p02407","language":"C++","original_status":"Runtime Error","original_src":"#include <stdio.h>\n\nint main(void) {\n  int i, n;\n  scanf(\"%d\", &n);\n  int a[n];\n  for (i = 0; i < n; ++i)\n    scanf(\"%d\", a[i]);\n  for (i = n - 1; i >= 0; --i) {\n    if (i)\n      printf(\"%d \", a[i]);\n    else\n      printf(\"%d\\n\", a[i]);\n  }\n  return 0;\n}\n","changed_src":"#include <stdio.h>\n\nint main(void) {\n  int i, n;\n  scanf(\"%d\", &n);\n  int a[n];\n  for (i = 0; i < n; ++i)\n    scanf(\"%d\", &a[i]);\n  for (i = n - 1; i >= 0; --i) {\n    if (i)\n      printf(\"%d \", a[i]);\n    else\n      printf(\"%d\\n\", a[i]);\n  }\n  return 0;\n}\n","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"-11","stderr":""}
-{"problem_id":"p02407","language":"C++","original_status":"Runtime Error","original_src":"#include <algorithm>\n#include <iostream>\n#define _USE_MATH_DEFINES\n#include <functional>\n#include <math.h>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\n\nint n;\nvector<int> v;\nint main() {\n  cin >> n;\n\n  for (int i = 0; i < n; ++i) {\n    int buf;\n    cin >> buf;\n    v.push_back(buf);\n  }\n\n  \/\/ sort(v.begin(), v.end(), greater<int>());\n\n  vector<int>::reverse_iterator it, end;\n  for (it = v.rbegin(), end = v.rend(); it != end; --it) {\n    cout << (*it) << \" \";\n  }\n  cout << endl;\n\n  return 0;\n}","changed_src":"#include <algorithm>\n#include <iostream>\n#define _USE_MATH_DEFINES\n#include <functional>\n#include <math.h>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\n\nint n;\nvector<int> v;\nint main() {\n  cin >> n;\n\n  for (int i = 0; i < n; ++i) {\n    int buf;\n    cin >> buf;\n    v.push_back(buf);\n  }\n\n  \/\/ sort(v.begin(), v.end(), greater<int>());\n\n  vector<int>::reverse_iterator it, end;\n  for (it = v.rbegin(), end = v.rend(); it != end; ++it) {\n    if (it == v.rbegin())\n      cout << (*it);\n    else\n      cout << \" \" << (*it);\n  }\n  cout << endl;\n\n  return 0;\n}","change":"replace","i1":23,"i2":25,"j1":23,"j2":28,"error":"-11","stderr":""}
-{"problem_id":"p02407","language":"C++","original_status":"Time Limit Exceeded","original_src":"#include <stdio.h>\n\nint main() {\n\n  int n = 0;\n  scanf(\"%d\", &n);\n  int a[n + 1];\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &a[i]);\n  }\n  for (int i = n - 1; i = 1; i--) {\n    printf(\"%d \", a[i]);\n  }\n  printf(\"%d\\n\", a[0]);\n  return 0;\n}\n","changed_src":"#include <stdio.h>\n\nint main() {\n\n  int n = 0;\n  scanf(\"%d\", &n);\n  int a[n + 1];\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &a[i]);\n  }\n  for (int i = n - 1; i >= 1; i--) {\n    printf(\"%d \", a[i]);\n  }\n  printf(\"%d\\n\", a[0]);\n  return 0;\n}\n","change":"replace","i1":10,"i2":11,"j1":10,"j2":11,"error":"TLE","stderr":""}
-{"problem_id":"p02407","language":"C++","original_status":"Runtime Error","original_src":"#include <cstdio>\nint main(void) {\n  int n;\n  int a[1000];\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &a[i]);\n  }\n  for (int i = n - 1; i > 0; i++) {\n    printf(\"%d \", a[i]);\n  }\n  printf(\"%d\\n\", a[0]);\n  return 0;\n}","changed_src":"#include <cstdio>\nint main(void) {\n  int n;\n  int a[1000];\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &a[i]);\n  }\n  for (int i = n - 1; i > 0; i--) {\n    printf(\"%d \", a[i]);\n  }\n  printf(\"%d\\n\", a[0]);\n  return 0;\n}","change":"replace","i1":8,"i2":9,"j1":8,"j2":9,"error":"-11","stderr":""}