submission_id,user_id,create_at,language,score,problem_set_problem_id,problem_id,skill_id,code,response,time_consume,memory_consume 1591379913255489536,6b4eaa97216e02028f283e6f19b6da71a3dab4858a74a3d7c87c9eff0a0d594e,2022-11-12 18:38:32,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include\nusing namespace std;\nstruct lieBa {\n int a;\n int b;\n}n[20000];\nint cmp(lieBa a,lieBa b) {\n return max(a.a,a.b) < max(b.a,b.b);\n}\nint main() {\n int nn;\n cin >> nn;\n for (int j = 0; j < nn; ++j) {\n int t;\n cin >> t;\n for (int i = 0; i < t; ++i) {\n int a,b;\n cin >> a >> b;\n n[i].a = a;\n n[i].b = b;\n }\n sort(n,n+t, cmp);\n int c = max(n[t-1].a,n[t-1].b)*2;\n for (int i = 0; i < t; ++i) {\n c+= min(n[i].a,n[i].b)*2;\n }\n cout << c;\n if (j != nn-1) cout << endl;\n }\n}",SEGMENTATION_FAULT,83,572 1591380679429001216,10d28f6be496080e4eb23b771679102afdc2b3cca7767b6ef339880698606900,2022-11-12 18:41:35,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n while(t--){\n int n;\n cin>>n;int a,b;int sum=0;int Max=0;\n for(int i=0;i>a>>b;int A,B;\n B=max(a,b);A=min(a,b);\n sum+=A;\n if(B>=Max)Max=B;\n }\n cout<\nusing namespace std;\nstruct lieBa {\n int a;\n int b;\n}n[200010];\nint cmp(lieBa a,lieBa b) {\n return max(a.a,a.b) < max(b.a,b.b);\n}\nint main() {\n int nn;\n scanf(\""%d\"",&nn);\n for (int j = 0; j < nn; ++j) {\n int t;\n scanf(\""%d\"",&t);\n for (int i = 0; i < t; ++i) {\n int a,b;\n scanf(\""%d %d\"",&a,&b);\n n[i].a = a;\n n[i].b = b;\n }\n sort(n,n+t, cmp);\n int c = max(n[t-1].a,n[t-1].b)*2;\n for (int i = 0; i < t; ++i) {\n c+=min(n[i].a,n[i].b)*2;\n }\n cout << c;\n if (j != nn-1) cout << endl;\n }\n}",WRONG_ANSWER,85,708 1591388740235362304,10d28f6be496080e4eb23b771679102afdc2b3cca7767b6ef339880698606900,2022-11-12 19:13:36,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n while(t--){\n int n;\n cin>>n;int a,b;int sum=0;int Max=0;\n for(int i=0;i>a>>b;int A,B;\n B=max(a,b);A=min(a,b);\n sum+=A;\n if(B>=Max){Max=B;}\n }\n cout<\nint main()\n{\n int t,n,a,b,max,sum,l;\n scanf(\""%d\\n\"",&t);\n for(int i=1;i<=t;i++)\n {\n scanf(\""%d\\n\"",&n);\n for(int x=1;x<=n;x++)\n {\n scanf(\""%d %d\"",&a,&b);\n if(a>=b&&x==1)\n {\n max=a;\n sum=b;\n }\n else if(a=b&&x!=1)\n {\n if(max\nusing namespace std;\nstruct lieBa {\n long long a;\n long long b;\n}n[200010];\nint cmp(lieBa a,lieBa b) {\n return max(a.a,a.b) < max(b.a,b.b);\n}\nint main() {\n int nn;\n scanf(\""%d\"",&nn);\n for (int j = 0; j < nn; ++j) {\n int t;\n scanf(\""%d\"",&t);\n for (int i = 0; i < t; ++i) {\n long long a,b;\n scanf(\""%lld %lld\"",&a,&b);\n n[i].a = a;\n n[i].b = b;\n }\n sort(n,n+t, cmp);\n long long c = max(n[t-1].a,n[t-1].b)*2;\n for (int i = 0; i < t; ++i) {\n c+=min(n[i].a,n[i].b)*2;\n }\n cout << c;\n if (j != nn-1) cout << endl;\n }\n}",ACCEPTED,711,3676 1591390462794076160,8f29d14aa54232b8b515a237e62fc00c3615b2c1ed4ce93ffb0623870454ff2b,2022-11-12 19:20:27,C,300.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include\nint main()\n{\n long long t,n,a,b,max,sum,l;\n scanf(\""%lld\\n\"",&t);\n for(int i=1;i<=t;i++)\n {\n scanf(\""%lld\\n\"",&n);\n for(int x=1;x<=n;x++)\n {\n scanf(\""%lld %lld\"",&a,&b);\n if(a>=b&&x==1)\n {\n max=a;\n sum=b;\n }\n else if(a=b&&x!=1)\n {\n if(max\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n while(t--){\n int n;\n cin>>n;int a,b;int long long sum=0;int Max=0;\n for(int i=0;i>a>>b;int A,B;\n B=max(a,b);A=min(a,b);\n sum+=A;\n if(B>=Max){Max=B;}\n }\n cout<\nint main()\n{\n int a,b,frr[5];\n printf(\""5\\n\"")\n for(a=0;a<=4;a++)\n scanf(\""%d\\n\"",&frr[a]);\n for(a=3;a>=0;a--)\n {\n for(b=0;b<=a;b++)\n {\n if(frr[b]>=frr[b+1])\n frr[b+1]=frr[b];\n }\n }\n \n for(i=0;i<=4;i++)\n printf(\""%d\""frr[i]);\n}",COMPILE_ERROR,0,0 1591392503650123776,b0897bd5fbc1a9b89fde103eb4a6c3125364f387b3ff1186b70a0798d23bfe87,2022-11-12 19:28:34,C,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include\nint m(int a,int b)\n{\n int z;\n if(amax)\n {\n max=a[i];\n z=i;\n }\n if(b[i]>max)\n {\n max=b[i];\n z=i;\n }\n }\n long l=0;\n for(i=1;i<=n;i++)\n {\n if(i==z){l=l+a[i]+b[i];}\n else{l=l+m(a[i],b[i]);}\n }\n l=l*2;\n printf(\""%ld\"",l);\n }\n }\n return 0;\n }\n",PRESENTATION_ERROR,24,456 1591392556330582016,b0897bd5fbc1a9b89fde103eb4a6c3125364f387b3ff1186b70a0798d23bfe87,2022-11-12 19:28:46,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include\nint m(int a,int b)\n{\n int z;\n if(amax)\n {\n max=a[i];\n z=i;\n }\n if(b[i]>max)\n {\n max=b[i];\n z=i;\n }\n }\n long l=0;\n for(i=1;i<=n;i++)\n {\n if(i==z){l=l+a[i]+b[i];}\n else{l=l+m(a[i],b[i]);}\n }\n l=l*2;\n printf(\""%ld\"",l);\n }\n }\n return 0;\n }\n",PRESENTATION_ERROR,27,456 1591392812703199232,b0897bd5fbc1a9b89fde103eb4a6c3125364f387b3ff1186b70a0798d23bfe87,2022-11-12 19:29:47,C++,300.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include\nint m(int a,int b)\n{\n int z;\n if(amax)\n {\n max=a[i];\n z=i;\n }\n if(b[i]>max)\n {\n max=b[i];\n z=i;\n }\n }\n long l=0;\n for(i=1;i<=n;i++)\n {\n if(i==z){l=l+a[i]+b[i];}\n else{l=l+m(a[i],b[i]);}\n }\n l=l*2;\n printf(\""%ld\\n\"",l);\n }\n }\n return 0;\n }\n",ACCEPTED,497,3532 1591396309586718720,5caf8795b4da029378fb939c42e9bb42a3f9f3506b053c6a84d74c4d311ff4ef,2022-11-12 19:43:41,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\nint n;\nint l[100000], s[100000];\nint main()\n{\n cin >> n;\n while (n--)\n {\n int x, a, b;\n cin >> x;\n for (int i = 0; i < x; i++)\n {\n cin >> a >> b;\n s[i] = max(a,b);\n l[i] = min(a,b);\n }\n int max = 0, key = 0;\n for (int i = 0; i < x; i++)\n {\n if (s[i] > max)max = s[i];\n }\n long sum = 0;\n for (int i = 0; i < x; i++)\n {\n sum += l[i] * 2;\n }\n cout << sum + max * 2;\n if ( n != 0) cout << endl;\n }\n}",SEGMENTATION_FAULT,206,1092 1591396360321019904,5caf8795b4da029378fb939c42e9bb42a3f9f3506b053c6a84d74c4d311ff4ef,2022-11-12 19:43:53,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\nint n;\nint l[100000], s[100000];\nint main()\n{\n cin >> n;\n while (n--)\n {\n int x, a, b;\n cin >> x;\n for (int i = 0; i < x; i++)\n {\n cin >> a >> b;\n s[i] = max(a,b);\n l[i] = min(a,b);\n }\n int max = 0, key;\n for (int i = 0; i < x; i++)\n {\n if (s[i] > max)max = s[i];\n }\n long sum = 0;\n for (int i = 0; i < x; i++)\n {\n sum += l[i] * 2;\n }\n cout << sum + max * 2;\n if ( n != 0) cout << endl;\n }\n}",SEGMENTATION_FAULT,192,1056 1591396446878892032,5caf8795b4da029378fb939c42e9bb42a3f9f3506b053c6a84d74c4d311ff4ef,2022-11-12 19:44:14,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\nint n;\nint l[100000], s[100000];\nint main()\n{\n cin >> n;\n while (n--)\n {\n int x, a, b;\n cin >> x;\n for (int i = 0; i < x; i++)\n {\n cin >> a >> b;\n s[i] = max(a,b);\n l[i] = min(a,b);\n }\n int max = 0;\n for (int i = 0; i < x; i++)\n {\n if (s[i] > max)max = s[i];\n }\n long sum = 0;\n for (int i = 0; i < x; i++)\n {\n sum += l[i] * 2;\n }\n cout << sum + max * 2;\n if ( n != 0) cout << endl;\n }\n}",SEGMENTATION_FAULT,196,1084 1591397334896934912,5caf8795b4da029378fb939c42e9bb42a3f9f3506b053c6a84d74c4d311ff4ef,2022-11-12 19:47:46,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\nint n;\nint l[100000], s[100000];\nint main()\n{\n cin >> n;\n while (n--)\n {\n int x, a, b;\n cin >> x;\n for (int i = 0; i < x; i++)\n {\n cin >> a >> b;\n s[i] = max(a,b);\n l[i] = min(a,b);\n }\n int max = 0;\n for ( int i = 0; i < x; i ++)if ( s[i] > max ) max = s[i];\n int sum = 0;\n for (int i = 0; i < x; i++)\n {\n sum += l[i] * 2;\n }\n cout << sum + max * 2;\n if ( n != 0) cout << endl;\n }\n}",WRONG_ANSWER,129,768 1591397444544409600,5caf8795b4da029378fb939c42e9bb42a3f9f3506b053c6a84d74c4d311ff4ef,2022-11-12 19:48:12,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\nint n;\nint l[100000], s[100000];\nint main()\n{\n cin >> n;\n while (n--)\n {\n int x, a, b;\n cin >> x;\n for (int i = 0; i < x; i++)\n {\n cin >> a >> b;\n s[i] = max(a,b);\n l[i] = min(a,b);\n }\n int max = 0;\n for ( int i = 0; i < x; i ++)if ( s[i] > max ) max = s[i];\n long sum = 0;\n for (int i = 0; i < x; i++)\n {\n sum += l[i] * 2;\n }\n cout <<(long) sum + max * 2;\n if ( n != 0) cout << endl;\n }\n}",SEGMENTATION_FAULT,195,1080 1591398255215312896,5caf8795b4da029378fb939c42e9bb42a3f9f3506b053c6a84d74c4d311ff4ef,2022-11-12 19:51:25,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\nint n;\nint l[100000], s[100000];\nint main()\n{\n cin >> n;\n while (n--)\n {\n int x, a, b;\n cin >> x;\n for (int i = 0; i < x; i++)\n {\n cin >> a >> b;\n s[i] = max(a,b);\n l[i] = min(a,b);\n }\n long long max = 0;\n for ( int i = 0; i < x; i ++)if ( s[i] > max ) max = s[i];\n long long sum = 0;\n for (int i = 0; i < x; i++)\n {\n sum += (long long)l[i] * 2;\n }\n cout << (long long )sum + max * 2;\n if ( n != 0) cout << endl;\n }\n}",SEGMENTATION_FAULT,192,1096 1591398998634725376,87f5e64bac88f3c073d19ad7453c7cd213e16799a4851c9f0a1d3409b08e9283,2022-11-12 19:54:22,C,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include\nint main()\n{\n int leng[20000],wide[20000];\n int a;\n int max=0,sum=0;\n scanf(\""%d\"",&a);\n for(int i=0;imax)max=leng[i];\n }\n for(int j=0;j\nusing namespace std;\nstruct number {\n string s;\n int i = 0;\n int max = 0;\n int min = 0;\n}s[2000010];\nvoid work(number &num) {\n int i = 0;\n int mx = 0;\n int mn = 9;\n for (auto c:num.s) {\n i*=10;\n i+=c-'0';\n if (c-'0' > mx) {\n mx = c - '0';\n }\n if (c-'0' < mn) {\n mn = c - '0';\n }\n }\n num.i = i;\n num.max = mx;\n num.min = mn;\n}\nint cmp(const number& a,const number& b) {\n if (a.i%10 == b.i%10) {\n if (a.max == b.max) {\n if (a.min == b.min) {\n return a.i < b.i;\n }else return a.min < b.min;\n }else return a.max < b.max;\n }else return a.i%10 < b.i%10;\n}\nint main() {\n int N;\n cin >> N;\n for (int i = 0; i < N; ++i) {\n string ss;\n cin >> ss;\n s[i].s = ss;\n work(s[i]);\n }\n sort(s,s+N,cmp);\n for (int i = 0; i < N; ++i) {\n cout << s[i].s;\n }\n cout << endl;\n}\n",WRONG_ANSWER,180,94388 1591399279544020992,5caf8795b4da029378fb939c42e9bb42a3f9f3506b053c6a84d74c4d311ff4ef,2022-11-12 19:55:29,C++,300.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\nint n;\nint l[200000], s[200000];\nint main()\n{\n cin >> n;\n while (n--)\n {\n int x, a, b;\n cin >> x;\n for (int i = 0; i < x; i++)\n {\n cin >> a >> b;\n s[i] = max(a, b);\n l[i] = min(a, b);\n }\n long long max = 0;\n for (int i = 0; i < x; i++)if (s[i] > max) max = s[i];\n long long sum = 0;\n for (int i = 0; i < x; i++)\n {\n sum = (long long)(l[i] * 2) + sum;\n }\n cout << (long long)sum + (long long)max * 2;\n if (n != 0) cout << endl;\n }\n}",ACCEPTED,1279,2132 1591428672416952320,c36ea7d9e957ce3370f27377098e7df658ca94cf45e1472d0a09c2d0a3a757b1,2022-11-12 21:52:17,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\n\nint min(int a, int b)\n{\n\tint c;\n\tc = a < b ? a : b;\n\treturn c;\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tint x;\n\t\tcin >> x;\n\t\tint sum = 0;\n\t\tint max = 0;\n\t\tint c = 0;\n\t\tfor (int i = 0; i < x; i++)\n\t\t{\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tif (a > max)\n\t\t\t{\n\t\t\t\tmax = a;\n\t\t\t}\n\t\t\tif (b > max)\n\t\t\t{\n\t\t\t\tmax = b;\n\t\t\t}\n\t\t\tc = min(a, b);\n\t\t\tsum += c;\n\t\t}\n\t\tint e;\n\t\te = 2 * sum + 2 * max;\n\t\tcout << e << endl;\n\t}\n\n\n\treturn 0;\n}",WRONG_ANSWER,129,480 1591428712380301312,c36ea7d9e957ce3370f27377098e7df658ca94cf45e1472d0a09c2d0a3a757b1,2022-11-12 21:52:27,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\n\nint min(int a, int b)\n{\n\tint c;\n\tc = a < b ? a : b;\n\treturn c;\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tint x;\n\t\tcin >> x;\n\t\tint sum = 0;\n\t\tint max = 0;\n\t\tint c = 0;\n\t\tfor (int i = 0; i < x; i++)\n\t\t{\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tif (a > max)\n\t\t\t{\n\t\t\t\tmax = a;\n\t\t\t}\n\t\t\tif (b > max)\n\t\t\t{\n\t\t\t\tmax = b;\n\t\t\t}\n\t\t\tc = min(a, b);\n\t\t\tsum += c;\n\t\t}\n\t\tint e;\n\t\te = 2 * sum + 2 * max;\n\t\tcout << e << endl;\n\t}\n\n\n\treturn 0;\n}",WRONG_ANSWER,123,504 1591428733486039040,c36ea7d9e957ce3370f27377098e7df658ca94cf45e1472d0a09c2d0a3a757b1,2022-11-12 21:52:32,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\n\nint min(int a, int b)\n{\n\tint c;\n\tc = a < b ? a : b;\n\treturn c;\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tint x;\n\t\tcin >> x;\n\t\tint sum = 0;\n\t\tint max = 0;\n\t\tint c = 0;\n\t\tfor (int i = 0; i < x; i++)\n\t\t{\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tif (a > max)\n\t\t\t{\n\t\t\t\tmax = a;\n\t\t\t}\n\t\t\tif (b > max)\n\t\t\t{\n\t\t\t\tmax = b;\n\t\t\t}\n\t\t\tc = min(a, b);\n\t\t\tsum += c;\n\t\t}\n\t\tint e;\n\t\te = 2 * sum + 2 * max;\n\t\tcout << e << endl;\n\t}\n\n\n\treturn 0;\n}",WRONG_ANSWER,127,740 1591428743346851840,c36ea7d9e957ce3370f27377098e7df658ca94cf45e1472d0a09c2d0a3a757b1,2022-11-12 21:52:34,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\n\nint min(int a, int b)\n{\n\tint c;\n\tc = a < b ? a : b;\n\treturn c;\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tint x;\n\t\tcin >> x;\n\t\tint sum = 0;\n\t\tint max = 0;\n\t\tint c = 0;\n\t\tfor (int i = 0; i < x; i++)\n\t\t{\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tif (a > max)\n\t\t\t{\n\t\t\t\tmax = a;\n\t\t\t}\n\t\t\tif (b > max)\n\t\t\t{\n\t\t\t\tmax = b;\n\t\t\t}\n\t\t\tc = min(a, b);\n\t\t\tsum += c;\n\t\t}\n\t\tint e;\n\t\te = 2 * sum + 2 * max;\n\t\tcout << e << endl;\n\t}\n\n\n\treturn 0;\n}",WRONG_ANSWER,129,456 1591429056283869184,c36ea7d9e957ce3370f27377098e7df658ca94cf45e1472d0a09c2d0a3a757b1,2022-11-12 21:53:48,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\n\nint min(int a, int b)\n{\n\tint c;\n\tc = a < b ? a : b;\n\treturn c;\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tint x;\n\t\tcin >> x;\n\t\tint sum = 0;\n\t\tint max = 0;\n\t\tint c = 0;\n\t\tfor (int i = 0; i < x; i++)\n\t\t{\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tif (a > max)\n\t\t\t{\n\t\t\t\tmax = a;\n\t\t\t}\n\t\t\tif (b > max)\n\t\t\t{\n\t\t\t\tmax = b;\n\t\t\t}\n\t\t\tc = min(a, b);\n\t\t\tsum += c;\n\t\t}\n\t\tint e;\n\t\te = 2 * sum + 2 * max;\n\t\tcout << e << endl;\n\t}\n\n\n\treturn 0;\n}",WRONG_ANSWER,135,468 1591429065138049024,c36ea7d9e957ce3370f27377098e7df658ca94cf45e1472d0a09c2d0a3a757b1,2022-11-12 21:53:51,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\n\nint min(int a, int b)\n{\n\tint c;\n\tc = a < b ? a : b;\n\treturn c;\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tint x;\n\t\tcin >> x;\n\t\tint sum = 0;\n\t\tint max = 0;\n\t\tint c = 0;\n\t\tfor (int i = 0; i < x; i++)\n\t\t{\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tif (a > max)\n\t\t\t{\n\t\t\t\tmax = a;\n\t\t\t}\n\t\t\tif (b > max)\n\t\t\t{\n\t\t\t\tmax = b;\n\t\t\t}\n\t\t\tc = min(a, b);\n\t\t\tsum += c;\n\t\t}\n\t\tint e;\n\t\te = 2 * sum + 2 * max;\n\t\tcout << e << endl;\n\t}\n\n\n\treturn 0;\n}",WRONG_ANSWER,136,716 1591429139393982464,c36ea7d9e957ce3370f27377098e7df658ca94cf45e1472d0a09c2d0a3a757b1,2022-11-12 21:54:08,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\n\nint min(int a, int b)\n{\n\tint c;\n\tc = a < b ? a : b;\n\treturn c;\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tint x;\n\t\tcin >> x;\n\t\tint sum = 0;\n\t\tint max = 0;\n\t\tint c = 0;\n\t\tfor (int i = 0; i < x; i++)\n\t\t{\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tif (a > max)\n\t\t\t{\n\t\t\t\tmax = a;\n\t\t\t}\n\t\t\tif (b > max)\n\t\t\t{\n\t\t\t\tmax = b;\n\t\t\t}\n\t\t\tc = min(a, b);\n\t\t\tsum += c;\n\t\t}\n\t\tint e;\n\t\te = 2 * sum + 2 * max;\n\t\tcout << e << endl;\n\t}\n\n\n\treturn 0;\n}",WRONG_ANSWER,130,452 1591429617880207360,c36ea7d9e957ce3370f27377098e7df658ca94cf45e1472d0a09c2d0a3a757b1,2022-11-12 21:56:02,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\n\nint min(int a, int b)\n{\n\tint c;\n\tc = a < b ? a : b;\n\treturn c;\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tint x;\n\t\tcin >> x;\n\t\tint sum = 0;\n\t\tint max = 0;\n\t\tint c = 0;\n\t\tfor (int i = 0; i < x; i++)\n\t\t{\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tif (a > max)\n\t\t\t{\n\t\t\t\tmax = a;\n\t\t\t}\n\t\t\tif (b > max)\n\t\t\t{\n\t\t\t\tmax = b;\n\t\t\t}\n\t\t\tc = min(a, b);\n\t\t\tsum += c;\n\t\t}\n\t\tint e;\n\t\te = 2 * sum + 2 * max;\n\t\tcout << e << endl;\n\t}\n\n\n\treturn 0;\n}",WRONG_ANSWER,124,512 1591433486148349952,c36ea7d9e957ce3370f27377098e7df658ca94cf45e1472d0a09c2d0a3a757b1,2022-11-12 22:11:25,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\n\nint min(int a, int b)\n{\n\tint c;\n\tc = a < b ? a : b;\n\treturn c;\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tint x;\n\t\tcin >> x;\n\t\tint sum = 0;\n\t\tint max = 0;\n\t\tint c = 0;\n\t\tfor (int i = 0; i < x; i++)\n\t\t{\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tif (a > max)\n\t\t\t{\n\t\t\t\tmax = a;\n\t\t\t}\n\t\t\tif (b > max)\n\t\t\t{\n\t\t\t\tmax = b;\n\t\t\t}\n\t\t\tc = min(a, b);\n\t\t\tsum += c;\n\t\t}\n\t\tint e;\n\t\te = 2 * sum + 2 * max;\n\t\tcout << e << endl;\n\t}\n\n\n\treturn 0;\n}",WRONG_ANSWER,123,460 1591433508319465472,c36ea7d9e957ce3370f27377098e7df658ca94cf45e1472d0a09c2d0a3a757b1,2022-11-12 22:11:30,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\n\nint min(int a, int b)\n{\n\tint c;\n\tc = a < b ? a : b;\n\treturn c;\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tint x;\n\t\tcin >> x;\n\t\tint sum = 0;\n\t\tint max = 0;\n\t\tint c = 0;\n\t\tfor (int i = 0; i < x; i++)\n\t\t{\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tif (a > max)\n\t\t\t{\n\t\t\t\tmax = a;\n\t\t\t}\n\t\t\tif (b > max)\n\t\t\t{\n\t\t\t\tmax = b;\n\t\t\t}\n\t\t\tc = min(a, b);\n\t\t\tsum += c;\n\t\t}\n\t\tint e;\n\t\te = 2 * sum + 2 * max;\n\t\tcout << e << endl;\n\t}\n\n\n\treturn 0;\n}",WRONG_ANSWER,127,504 1591433531639795712,c36ea7d9e957ce3370f27377098e7df658ca94cf45e1472d0a09c2d0a3a757b1,2022-11-12 22:11:36,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\n\nint min(int a, int b)\n{\n\tint c;\n\tc = a < b ? a : b;\n\treturn c;\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tint x;\n\t\tcin >> x;\n\t\tint sum = 0;\n\t\tint max = 0;\n\t\tint c = 0;\n\t\tfor (int i = 0; i < x; i++)\n\t\t{\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tif (a > max)\n\t\t\t{\n\t\t\t\tmax = a;\n\t\t\t}\n\t\t\tif (b > max)\n\t\t\t{\n\t\t\t\tmax = b;\n\t\t\t}\n\t\t\tc = min(a, b);\n\t\t\tsum += c;\n\t\t}\n\t\tint e;\n\t\te = 2 * sum + 2 * max;\n\t\tcout << e << endl;\n\t}\n\n\n\treturn 0;\n}",WRONG_ANSWER,131,712 1591436707948462080,0201f94ac00f40ebaf13f04978faf1e529b01b2d37f62703893bc20f876dbe9f,2022-11-12 22:24:13,C,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include\nint main()\n{\n int t;\n scanf(\""%d\"", &t);\n while (t--)\n {\n int n;\n scanf(\""%d\"", &n);\n int ch[10010];\n int sum = 0;\n for (int i = 0; i < n; i++)\n {\n int a, b;\n scanf(\""%d %d\"", &a, &b);\n if (a > b)\n {\n sum += b;\n ch[i] = a;\n }\n else\n {\n sum += a;\n ch[i] = b;\n }\n }\n sum = sum * 2;\n for (int i = 0; i < n - 1; i++)\n {\n for (int j = 0; j < n - 1 - j; j++)\n {\n if (ch[j] < ch[j + 1])\n {\n int tmp = ch[j];\n ch[j] = ch[j + 1];\n ch[j + 1] = tmp;\n }\n }\n }\n sum += ch[0] * 2;\n printf(\""%d\\n\"", sum);\n }\n return 0;\n}",WRONG_ANSWER,26,496 1591438493174247424,0201f94ac00f40ebaf13f04978faf1e529b01b2d37f62703893bc20f876dbe9f,2022-11-12 22:31:18,C,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include\nint main()\n{\n int t;\n while(scanf(\""%d\"", &t)!=EOF)\n {\n while (t--)\n {\n int n;\n scanf(\""%d\"", &n);\n int ch[10010];\n int sum = 0;\n for (int i = 0; i < n; i++)\n {\n int a, b;\n scanf(\""%d %d\"", &a, &b);\n if (a > b)\n {\n sum += b;\n ch[i] = a;\n }\n else\n {\n sum += a;\n ch[i] = b;\n }\n }\n sum = sum * 2;\n for (int i = 0; i < n - 1; i++)\n {\n for (int j = 0; j < n - 1 - j; j++)\n {\n if (ch[j] < ch[j + 1])\n {\n int tmp = ch[j];\n ch[j] = ch[j + 1];\n ch[j + 1] = tmp;\n }\n }\n }\n sum += ch[0] * 2;\n printf(\""%d\\n\"", sum);\n }\n }\n return 0;\n}",WRONG_ANSWER,26,512 1591600688688541696,c36ea7d9e957ce3370f27377098e7df658ca94cf45e1472d0a09c2d0a3a757b1,2022-11-13 09:15:49,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\n\nint min(int a, int b)\n{\n\tint c;\n\tc = a < b ? a : b;\n\treturn c;\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tint x;\n\t\tcin >> x;\n\t\tint sum = 0;\n\t\tint max = 0;\n\t\tint c = 0;\n\t\tfor (int i = 0; i < x; i++)\n\t\t{\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tif (a > max)\n\t\t\t{\n\t\t\t\tmax = a;\n\t\t\t}\n\t\t\tif (b > max)\n\t\t\t{\n\t\t\t\tmax = b;\n\t\t\t}\n\t\t\tc = min(a, b);\n\t\t\tsum += c;\n\t\t}\n\t\tint e;\n\t\te = 2 * sum + 2 * max;\n\t\tcout << e << endl;\n\t}\n\n\n\treturn 0;\n}",WRONG_ANSWER,126,604 1591600968566071296,c36ea7d9e957ce3370f27377098e7df658ca94cf45e1472d0a09c2d0a3a757b1,2022-11-13 09:16:56,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\n\nint min(int a, int b)\n{\n\tint c;\n\tc = a < b ? a : b;\n\treturn c;\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tint x;\n\t\tcin >> x;\n\t\tlong sum = 0;\n\t\tint max = 0;\n\t\tint c = 0;\n\t\tfor (int i = 0; i < x; i++)\n\t\t{\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tif (a > max)\n\t\t\t{\n\t\t\t\tmax = a;\n\t\t\t}\n\t\t\tif (b > max)\n\t\t\t{\n\t\t\t\tmax = b;\n\t\t\t}\n\t\t\tc = min(a, b);\n\t\t\tsum += c;\n\t\t}\n\t\tint e;\n\t\te = 2 * sum + 2 * max;\n\t\tcout << e << endl;\n\t}\n\n\n\treturn 0;\n}",WRONG_ANSWER,126,472 1591601540115476480,c36ea7d9e957ce3370f27377098e7df658ca94cf45e1472d0a09c2d0a3a757b1,2022-11-13 09:19:12,C,300.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include\nint m(int a,int b)\n{\n int z;\n if(amax)\n {\n max=a[i];\n z=i;\n }\n if(b[i]>max)\n {\n max=b[i];\n z=i;\n }\n }\n long l=0;\n for(i=1;i<=n;i++)\n {\n if(i==z){l=l+a[i]+b[i];}\n else{l=l+m(a[i],b[i]);}\n }\n l=l*2;\n printf(\""%ld\\n\"",l);\n }\n }\n return 0;\n }",ACCEPTED,490,3524 1591601895331082240,c36ea7d9e957ce3370f27377098e7df658ca94cf45e1472d0a09c2d0a3a757b1,2022-11-13 09:20:37,C++,300.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\n\nlong min(long a, long b)\n{\n\tlong c;\n\tc = a < b ? a : b;\n\treturn c;\n}\nint main()\n{\n\tlong n;\n\tcin >> n;\n\tfor (long i = 0; i < n; i++)\n\t{\n\t\tlong x;\n\t\tcin >> x;\n\t\tlong sum = 0;\n\t\tlong max = 0;\n\t\tlong c = 0;\n\t\tfor (long i = 0; i < x; i++)\n\t\t{\n\t\t\tlong a, b;\n\t\t\tcin >> a >> b;\n\t\t\tif (a > max)\n\t\t\t{\n\t\t\t\tmax = a;\n\t\t\t}\n\t\t\tif (b > max)\n\t\t\t{\n\t\t\t\tmax = b;\n\t\t\t}\n\t\t\tc = min(a, b);\n\t\t\tsum += c;\n\t\t}\n\t\tlong e;\n\t\te = 2 * sum + 2 * max;\n\t\tcout << e << endl;\n\t}\n\n\n\treturn 0;\n}",ACCEPTED,1230,580 1591619958784929792,0201f94ac00f40ebaf13f04978faf1e529b01b2d37f62703893bc20f876dbe9f,2022-11-13 10:32:23,C,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include\nlong long ch[10010];\nint main()\n{\n int t;\n while (scanf(\""%d\"", &t) != EOF)\n {\n int count = t;\n while (t--)\n {\n int n;\n scanf(\""%d\"", &n);\n long long sum = 0;\n for (int i = 0; i < n; i++)\n {\n long long a, b;\n scanf(\""%lld %lld\"", &a, &b);\n if (a > b)\n {\n sum += b;\n ch[i] = a;\n }\n else\n {\n sum += a;\n ch[i] = b;\n }\n }\n sum = sum * 2;\n for (int i = 0; i < n - 1; i++)\n {\n for (int j = 0; j < n - 1 - j; j++)\n {\n if (ch[j] < ch[j + 1])\n {\n long long tmp = ch[j];\n ch[j] = ch[j + 1];\n ch[j + 1] = tmp;\n }\n }\n }\n sum += ch[0] * 2;\n if (count == t + 1)\n {\n printf(\""%lld\"", sum);\n }\n else\n {\n printf(\""\\n%lld\"", sum);\n }\n }\n }\n return 0;\n}",WRONG_ANSWER,23,328 1591632076972285952,6b4eaa97216e02028f283e6f19b6da71a3dab4858a74a3d7c87c9eff0a0d594e,2022-11-13 11:20:32,C++,0.0,1591319522529894406,1589624286195773440,1039132139089612800,"#include \nusing namespace std;\nstruct number {\n string s;\n long long i = 0;\n}s[2000010];\nvoid work(number &num) {\n long long i = 0;\n for (auto c:num.s) {\n i*=10;\n i+=c-'0';\n }\n num.i = i;\n}\nint cmp(const number& a,const number& b) {\n return a.i* pow(10,b.s.size())+b.i < b.i* pow(10,a.s.size())+a.i;\n}\nint main() {\n int N;\n cin >> N;\n for (int i = 0; i < N; ++i) {\n string ss;\n cin >> ss;\n s[i].s = ss;\n work(s[i]);\n }\n sort(s,s+N,cmp);\n for (int i = 0; i < N; ++i) {\n cout << s[i].s;\n }\n cout << endl;\n}",WRONG_ANSWER,158,78808 1591635283257647104,5caf8795b4da029378fb939c42e9bb42a3f9f3506b053c6a84d74c4d311ff4ef,2022-11-13 11:33:17,C++,300.0,1591319522529894406,1589624286195773440,1039132139089612800,"#include \nusing namespace std;\nconst int N = 2e6 + 10;\nstring num[N];\nint n, l;\nbool cmp( string s1, string s2)\n{\n if ( s1.size() == s2.size() ) return s1 < s2;\n else \n return s1 + s2 < s2 + s1;\n}\nint main()\n{\n \n cin >> n;\n for ( int i = 0; i < n; i ++ ) cin >> num[i];\n sort(num, num + n, cmp);\n for ( int i = 0; i < n; i ++) cout << num[i];\n cout << endl;\n}",ACCEPTED,20415,160948 1591646468061278208,6b4eaa97216e02028f283e6f19b6da71a3dab4858a74a3d7c87c9eff0a0d594e,2022-11-13 12:17:44,C++,0.0,1591319522529894406,1589624286195773440,1039132139089612800,"#include \nusing namespace std;\nstring s[2000010];\nint cmp(const string& a,const string& b) {\n if (a.size() == b.size()) return a < b;\n return a+b < b+a;\n}\nint main() {\n int N;\n cin >> N;\n for (int i = 0; i < N; ++i) {\n string ss;\n cin >> ss;\n }\n sort(s,s+N,cmp);\n for (int i = 0; i < N; ++i) {\n cout << s[i];\n }\n cout << endl;\n}",WRONG_ANSWER,44,63048 1591646926427414528,6b4eaa97216e02028f283e6f19b6da71a3dab4858a74a3d7c87c9eff0a0d594e,2022-11-13 12:19:33,C++,0.0,1591319522529894406,1589624286195773440,1039132139089612800,"#include \nusing namespace std;\nstring s[2e6+10];\nint cmp(const string& a,const string& b) {\n if (a.size() == b.size()) return a < b;\n return a+b < b+a;\n}\nint main() {\n int N;\n cin >> N;\n for (int i = 0; i < N; ++i) {\n string ss;\n cin >> ss;\n }\n sort(s,s+N,cmp);\n for (int i = 0; i < N; ++i) {\n cout << s[i];\n }\n cout << endl;\n}",COMPILE_ERROR,0,0 1591647076084375552,6b4eaa97216e02028f283e6f19b6da71a3dab4858a74a3d7c87c9eff0a0d594e,2022-11-13 12:20:08,C++,0.0,1591319522529894406,1589624286195773440,1039132139089612800,"#include \nusing namespace std;\nconst int nn = 2e6+10;\nstring s[nn];\nint cmp(const string& a,const string& b) {\n if (a.size() == b.size()) return a < b;\n return a+b < b+a;\n}\nint main() {\n int N;\n cin >> N;\n for (int i = 0; i < N; ++i) {\n string ss;\n cin >> ss;\n }\n sort(s,s+N,cmp);\n for (int i = 0; i < N; ++i) {\n cout << s[i];\n }\n cout << endl;\n}",WRONG_ANSWER,42,63104 1591648176694898688,6b4eaa97216e02028f283e6f19b6da71a3dab4858a74a3d7c87c9eff0a0d594e,2022-11-13 12:24:31,C++,300.0,1591319522529894406,1589624286195773440,1039132139089612800,"#include \nusing namespace std;\nconst int N = 2e6+10;\nstring num[N];\nint n;\nint cmp(string a,string b) {\n if (a.size() == b.size()) {\n return a < b;\n }else {\n return a+b < b+a;\n }\n}\nint main() {\n cin >> n;\n for (int i = 0; i < n; ++i) cin >> num[i];\n sort(num, num + n, cmp);\n for (int i = 0; i \nusing namespace std;\n#define int long long\nint ch[200010];\nsigned main()\n{\n int t;\n cin >> t;\n for (int i = 0; i < t; i++) {\n int n;\n scanf(\""%lld\"", &n);\n int sum=0;\n for (int i = 0; i < n; i++)\n {\n int a, b;\n scanf(\""%lld %lld\"", &a, &b);\n if (a > b)\n {\n sum += b;\n ch[i] = a;\n }\n else\n {\n sum += a;\n ch[i] = b;\n }\n }\n sum = sum * 2;\n for (int i = 0; i < n - 1; i++)\n {\n for (int j = 0; j < n - 1 - i; j++)\n {\n if (ch[j] < ch[j + 1])\n {\n int tmp = ch[j];\n ch[j] = ch[j + 1];\n ch[j + 1] = tmp;\n }\n }\n }\n sum = sum + 2 * ch[0];\n if (i == 0)\n {\n printf(\""%lld\"", sum);\n }\n else\n {\n printf(\""\\n%lld\"", sum);\n }\n }\n return 0;\n}",TIME_LIMIT_EXCEEDED,425,732 1591681015037583360,94f17f422718058303e961dec073555d6326c8efc04296206e0c7fcf5735751e,2022-11-13 14:35:00,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\nconst long N = 1e7 + 10;\nint l[N],s[N];\nint main()\n{\n int n,m;\n int a,b,c=0;\n cin>>n;\n int sum=0;\n for(int i=0;i>m;\n for(int j=0;jc)\n {\n c=l[j];\n }\n }\n cout<\nusing namespace std;\nconst long N = 1e9 + 10,F=1e6;\nint l[F],s[F];\nint main()\n{\n int n,m;\n int a,b,c=0;\n cin>>n;\n int sum=0;\n for(int i=0;i>m;\n for(int j=0;jc)\n {\n c=l[j];\n }\n }\n cout<\nusing namespace std;\nconst int N = 2010;\nint t;\n\nint main()\n{\n while (scanf(\""%d\"", &t) != EOF){\n int count=t;\n while (t--)\n {\n int n;\n scanf(\""%d\"", &n);\n long long kuan = 0;\n int gao = 0;\n for (int i = 0; i < n; i++)\n {\n int a, b;\n scanf(\""%d%d\"", &a, &b);\n kuan += min(a, b);\n gao = max(gao, max(a, b));\n }\n if(count==t+1)\n {\n printf(\""%lld\"", 2 * (kuan + gao));\n }\n else\n printf(\""\\n%lld\"", 2 * (kuan + gao));\n }\n }\n return 0;\n}",ACCEPTED,469,636 1591682440408870912,94f17f422718058303e961dec073555d6326c8efc04296206e0c7fcf5735751e,2022-11-13 14:40:40,C++,0.0,1591319522529894403,1589619118607724544,1039132139089612800,"#include \nusing namespace std;\nconst long N = 1e9 + 10,F=1e6;\nint l[F],s[F];\nint main()\n{\n int n,m;\n int a,b,c=0;\n cin>>n;\n while(cin>>n)\n {\n int sum=0;\n for(int i=0;i>m;\n for(int j=0;jc)\n {\n c=l[j];\n }\n }\n cout<\nusing namespace std;\nconst long N = 1e9 + 10,F=1e6;\nint l[F],s[F];\nint main()\n{\n int n,m;\n int a,b,c=0;\n while(cin>>n)\n {\n int sum=0;\n for(int i=0;i>m;\n for(int j=0;jc)\n {\n c=l[j];\n }\n }\n cout<\nusing namespace std;\nconst long N = 1e9 + 10,F=1e6;\nint l[F],s[F];\nint main()\n{\n int n,m;\n int a,b,c=0;\n while(cin>>n)\n {\n long long sum=0;\n for(int i=0;i>m;\n for(int j=0;jc)\n {\n c=l[j];\n }\n }\n cout<<(long long)sum+c*2<\nusing namespace std;\nint n,l;string num[2000010];\nbool cmp( string s1,string s2){\n if(s1.size()==s2.size())return s1>n;\n for(int i=0;i>num[i];\n sort(num,num+n,cmp);\n for(int i=0;i\nusing namespace std;\nint main()\n{\n int n;\n cin>>n;\n string s[n];\n string a=0;\n for(int i=0;i>s[i];\n }\n for(int i=0;i s[j] ) swap(s[i], s[j]);\n } \n }\n for(int i=0;i\nusing namespace std;\nbool cmp(string a,string b)\n{\n if(a.size()==b.size()) return a>n;\n string s[n];\n for(int i=0;i>s[i];\n }\n sort(s,s+n,cmp);\n for(int i=0;i\nusing namespace std;\nstring s[1000001];\nbool cmp(string a,string b)\n{\n if(a.size()==b.size()) return a>n;\n for(int i=0;i>s[i];\n }\n sort(s,s+n,cmp);\n for(int i=0;i\nusing namespace std;\nstring s[2000001];\nbool cmp(string a,string b)\n{\n if(a.size()==b.size()) return a>n;\n for(int i=0;i>s[i];\n }\n sort(s,s+n,cmp);\n for(int i=0;i\n#include\n#include\n#include\n#include\n#include \nusing namespace std;\nint main(){\n int n; cin>>n;\n n%=212;\n if(n%2){\n cout<\n#include\n#include\n#include\n#include\n#include \nusing namespace std;\nint main(){\n int n; cin>>n;\n n%=212;\n if(n%2){\n cout<\n#include\n#include\n#include\n#include\n#include \nusing namespace std;\nint main(){\n string s; cin>>s;\n for(int i=2;i=0;--j){\n if(s[j]!=0){\n ans+=(s[j]-'0')*cal;\n }\n cal*=10;\n }\n ans%=212;\n s[i-2]=ans/100+'0';\n s[i-1]=(ans%100)/10+'0';\n s[i]=ans%10+'0';\n ans=0;\n }\n int res=(s[s.size()-3]-'0')*100+(s[s.size()-2]-'0')*10+s[s.size()-1]-'0';\n if(res%2==0){\n cout<\n#include\n#include\n#include\n#include\n#include \nusing namespace std;\nint main(){\n string s; cin>>s;\n for(int i=2;i=0;--j){\n if(s[j]!=0){\n ans+=(s[j]-'0')*cal;\n }\n cal*=10;\n }\n ans%=212;\n s[i-2]=ans/100+'0';\n s[i-1]=(ans%100)/10+'0';\n s[i]=ans%10+'0';\n ans=0;\n }\n int res=(s[s.size()-3]-'0')*100+(s[s.size()-2]-'0')*10+s[s.size()-1]-'0';\n if(res%2==1){\n cout<\n#include\n#include\n#include\nusing namespace std;\n//compare比较函数：相等返回0，大于返回1，小于返回-1\nint compare(string str1,string str2)\n{\n if(str1.length()>str2.length()) return 1;\n else if(str1.length()=0;i--)\n {\n temp=str1[i]-'0'+str2[i]-'0'+cf;\n cf=temp/10;\n temp%=10;\n str=char(temp+'0')+str;\n }\n if(cf!=0) str=char(cf+'0')+str;\n return str;\n}\n//高精度减法\n//只能是两个正数相减，而且要大减小\nstring sub(string str1,string str2)//高精度减法\n{\n string str;\n int tmp=str1.length()-str2.length();\n int cf=0;\n for(int i=str2.length()-1;i>=0;i--)\n {\n if(str1[tmp+i]=0;i--)\n {\n if(str1[i]-cf>='0')\n {\n str=char(str1[i]-cf)+str;\n cf=0;\n }\n else\n {\n str=char(str1[i]-cf+10)+str;\n cf=1;\n }\n }\n str.erase(0,str.find_first_not_of('0'));//去除结果中多余的前导0\n return str;\n}\n//高精度乘法\n//只能是两个正数相乘\nstring mul(string str1,string str2)\n{\n string str;\n int len1=str1.length();\n int len2=str2.length();\n string tempstr;\n for(int i=len2-1;i>=0;i--)\n {\n tempstr=\""\"";\n int temp=str2[i]-'0';\n int t=0;\n int cf=0;\n if(temp!=0)\n {\n for(int j=1;j<=len2-1-i;j++)\n tempstr+=\""0\"";\n for(int j=len1-1;j>=0;j--)\n {\n t=(temp*(str1[j]-'0')+cf)%10;\n cf=(temp*(str1[j]-'0')+cf)/10;\n tempstr=char(t+'0')+tempstr;\n }\n if(cf!=0) tempstr=char(cf+'0')+tempstr;\n }\n str=add(str,tempstr);\n }\n str.erase(0,str.find_first_not_of('0'));\n return str;\n}\n//高精度除法\n//两个正数相除，商为quotient,余数为residue\n//需要高精度减法和乘法\nvoid div(string str1,string str2,string "ient,string &residue)\n{\n quotient=residue=\""\"";//清空\n if(str2==\""0\"")//判断除数是否为0\n {\n quotient=residue=\""ERROR\"";\n return;\n }\n if(str1==\""0\"")//判断被除数是否为0\n {\n quotient=residue=\""0\"";\n return;\n }\n int res=compare(str1,str2);\n if(res<0)\n {\n quotient=\""0\"";\n residue=str1;\n return;\n }\n else if(res==0)\n {\n quotient=\""1\"";\n residue=\""0\"";\n return;\n }\n else\n {\n int len1=str1.length();\n int len2=str2.length();\n string tempstr;\n tempstr.append(str1,0,len2-1);\n for(int i=len2-1;i='0';ch--)//试商\n {\n string str,tmp;\n str=str+ch;\n tmp=mul(str2,str);\n if(compare(tmp,tempstr)<=0)//试商成功\n {\n quotient=quotient+ch;\n tempstr=sub(tempstr,tmp);\n break;\n }\n }\n }\n residue=tempstr;\n }\n quotient.erase(0,quotient.find_first_not_of('0'));\n if(quotient.empty()) quotient=\""0\"";\n}\n\n\nint main(){\n string str1,str2,str3,str4;\n cin>>str1;\n div(str1,\""212\"",str3,str4);\n\tcout<\n#include\n#include\n#include\n#include\n#include \nusing namespace std;\nint res;\nint main(){\n //int n; cin>>n;\n cout<<1234%212<>s;\n if(s.size()==1){\n res = s[0]-'0';\n }\n else if(s.size()==2){\n res =(s[0]-'0')*10+s[1]-'0';\n }\n else {\n for(int i=2;i=0;--j){\n if(s[j]!='0'){\n ans+=(s[j]-'0')*cal;\n }\n cal*=10;\n }\n ans%=212;\n for(int k=i-3;k>=0;--k) s[k]='0';\n s[i-2]=ans/100+'0';\n s[i-1]=(ans%100)/10+'0';\n s[i]=ans%10+'0';\n ans=0;\n }\n res=(s[s.size()-3]-'0')*100+(s[s.size()-2]-'0')*10+s[s.size()-1]-'0';\n }\n if(res%2==1){\n cout<\n#include\n#include\n#include\n#include\n#include \nusing namespace std;\nint res;\nint main(){\n //int n; cin>>n;\n //cout<<1234%212<>s;\n if(s.size()==1){\n res = s[0]-'0';\n }\n else if(s.size()==2){\n res =(s[0]-'0')*10+s[1]-'0';\n }\n else {\n for(int i=2;i=0;--j){\n if(s[j]!='0'){\n ans+=(s[j]-'0')*cal;\n }\n cal*=10;\n }\n ans%=212;\n for(int k=i-3;k>=0;--k) s[k]='0';\n s[i-2]=ans/100+'0';\n s[i-1]=(ans%100)/10+'0';\n s[i]=ans%10+'0';\n ans=0;\n }\n res=(s[s.size()-3]-'0')*100+(s[s.size()-2]-'0')*10+s[s.size()-1]-'0';\n }\n if(res%2==1){\n cout<\nusing namespace std;\nint mod(string a,int b){\n int tmp=0;\n for(int i=0;i>a;\n ans=mod(a,b);\n cout<\nusing namespace std;\nint mod(string a,int b){\n int tmp=0;\n for(int i=0;i\n#include\n#include\n#include\n#include\nusing namespace std;\nstring str;\nchar ch[] ={'0','2','1','2'};\nint f[] = {0,2,1,2};\nint pan(int now){\n\tfor(int i = 0;i<4;i++){\n\t\tif(ch[i]>str[i+now]){\n//\t\t\tcout<=0;i--){\n\t\tint t = str[i+now] - '0';\n\t\tt -= f[i] + flag;\n\t\tflag = 0;\n\t\twhile(t<0){\n\t\t\tt +=10;\n\t\t\tflag ++;\n\t\t}\n\t\tstr[i+now] = t +'0';\n\t}\n}\nint main(){\n\tcin>>str;\n\tstr = \""0\"" + str;\n\tfor(int i = 0;i\n#include\n#include\n#include\n#include\nusing namespace std;\nstring str;\nchar ch[] ={'0','2','1','2'};\nint f[] = {0,2,1,2};\nint pan(int now){\n\tfor(int i = 0;i<4;i++){\n\t\tif(ch[i]>str[i+now]){\n//\t\t\tcout<=0;i--){\n\t\tint t = str[i+now] - '0';\n\t\tt -= f[i] + flag;\n\t\tflag = 0;\n\t\twhile(t<0){\n\t\t\tt +=10;\n\t\t\tflag ++;\n\t\t}\n\t\tstr[i+now] = t +'0';\n\t}\n}\nint main(){\n\tcin>>str;\n\tstr = \""0\"" + str;\n\tfor(int i = 0;i\n#include\n#include\n#include\n#include\nusing namespace std;\nstring str;\nchar ch[] ={'0','2','1','2'};\nint f[] = {0,2,1,2};\nint pan(int now){\n\tfor(int i = 0;i<4;i++){\n\t\tif(ch[i]>str[i+now]){\n//\t\t\tcout<=0;i--){\n\t\tint t = str[i+now] - '0';\n\t\tt -= f[i] + flag;\n\t\tflag = 0;\n\t\twhile(t<0){\n\t\t\tt +=10;\n\t\t\tflag ++;\n\t\t}\n\t\tstr[i+now] = t +'0';\n\t}\n}\nint main(){\n\tcin>>str;\n\tstr = \""0\"" + str;\n\tfor(int i = 0;i\n#include\n#include\n#include\n#include\nusing namespace std;\nstring str;\nchar ch[] ={'0','2','1','2'};\nint f[] = {0,2,1,2};\nint pan(int now){\n\tfor(int i = 0;i<4;i++){\n\t\tif(ch[i]>str[i+now]){\n//\t\t\tcout<=0;i--){\n\t\tint t = str[i+now] - '0';\n\t\tt -= f[i] + flag;\n\t\tflag = 0;\n\t\twhile(t<0){\n\t\t\tt +=10;\n\t\t\tflag ++;\n\t\t}\n\t\tstr[i+now] = t +'0';\n\t}\n}\nint main(){\n\tcin>>str;\n\tstr = \""0\"" + str;\n\tint t = 0;\n\tif(str.size()<5){\n\t\tfor(int i = 0;i\n#include\n#include\n#include\n#include\nusing namespace std;\nstring str;\nchar ch[] ={'0','2','1','2'};\nint f[] = {0,2,1,2};\nint pan(int now){\n\tfor(int i = 0;i<4;i++){\n\t\tif(ch[i]>str[i+now]){\n//\t\t\tcout<=0;i--){\n\t\tint t = str[i+now] - '0';\n\t\tt -= f[i] + flag;\n\t\tflag = 0;\n\t\twhile(t<0){\n\t\t\tt +=10;\n\t\t\tflag ++;\n\t\t}\n\t\tstr[i+now] = t +'0';\n\t}\n}\nint main(){\n\tcin>>str;\n\tstr = \""0\"" + str;\n\tint t = 0;\n\tif(str.size()<5){\n\t\tfor(int i = 0;i\n#include\nusing namespace std;\nint strmod(string s,int mod)\n{\n int result=0;\n for(int i=0;i>s;\n int mod=strmod(s,212);\n cout<\nusing namespace std;\nint main(){\n\tint n;\n\tcin>>n;\n\tint m=n%212;\n\tcout<\nusing namespace std;\nint main(){\n\tlong long int n;\n\tcin>>n;\n\tint m=n%212;\n\tcout<\n#include\nusing namespace std;\n\nint main(){\n\tstring strs;\n\tcin>>strs;\n\tint ans=0;\n\tfor(int i = 0 ; i < strs.size() ; i++){\n\t\tans=(ans*10+strs[i]-'0')%212;\n\t}\n\tcout<\nusing namespace std;\n\nint main(){\n\tstring str;\n\tgetline(cin,str);\n\tint t = 0;\n\tfor(int i = 0;i < str.size();++i){\n\t\tt = t*10+str[i]-48;\n\t\tt = t%212;\n\t}\n\tcout << t << endl;\n\tif(t%2 == 0){\n\t\tcout << \""偶数\"" << endl;\n\t}else{\n\t\tcout << \""奇数\"" << endl;\n\t}\n\t\t\n\treturn 0; \n}",ACCEPTED,40,460 1330151251571929088,657492ed89030ec2368cd3a37c0d43d8ec037c002e981c45c58fecc992be8cc0,2020-11-21 22:09:06,C++,4.0,1329802938704252928,1318384390343954432,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n int n;cin>>n;\n cout<\n#include\n#include\n#include\nusing namespace std;\nint main()\n{\n vector num;\n string str;\n cin>>str;\n int len=str.length();\n for(int i=0;i\n#include\n#include\n#include\nusing namespace std;\nint main()\n{\n string str;\n cin>>str;\n int len=str.length();\n int res=0,t=0;\n for(int i=0;i\nusing namespace std;\nint n;\nint main() {\n\tcin>>n;\n\tint x=n%212;\n\tcout<\nusing namespace std;\nstring str;\nint main() {\n\tint ans=0,tq;\n\tcin>>str;\n\tfor(int i=0;i\n#include\nusing namespace std;\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tn=n%212;\n\tprintf(\""%d\\n\"",n);\n\tif(n%2==0) printf(\""偶数\"");\n\telse printf(\""奇数\"");\n\treturn 0;\n}",PARTIAL_ACCEPTED,39,336 1330357476867739648,2e47339411ce60285c6e45370712ff46447928439f8b58d538ffd2b1e53213d4,2020-11-22 11:48:34,C++,9.0,1329802938704252928,1318384390343954432,1039131349729988608,"#include\n#include\nusing namespace std;\nint main(){\n\tstring s;\n\tcin>>s;\n\tint num,k,ch;\n\tnum=(s[0]-'0')*10+(s[1]-'0');\n\tfor(int i=2;i\n#include\nusing namespace std;\nint main(){\n\tstring s;\n\tcin>>s;\n\tint num,k,ch;\n\tif(s.length()<3){\n\t\tcout<\nusing namespace std;\n#define ms(a, b) memset(a, b, sizeof a)\n#define rep(i, a, b) for (int i = a; i <= b; i++)\n#define per(i, a, b) for (int i = a; i >= b; i--)\nusing ll = long long;\nconst int INF = 0x7f7f7f7f;\nconst int MAXN = 1e5 + 5;\nconst int MOD = 1e9 + 7;\n\nint main()\n{\n string s;\n cin >> s;\n int num = atoi(s.substr(0, 3).c_str());\n int res = num % 212;\n for (int i = 3; s[i]; i--)\n {\n string tmp = \""\"";\n tmp = tmp + to_string(res) + s[i];\n num = atoi(tmp.c_str());\n res = num % 212;\n }\n cout << res << endl;\n if (res & 1)\n cout << \""奇数\"";\n else\n cout << \""偶数\"";\n return 0;\n}",PARTIAL_ACCEPTED,170,344 1330390864999780352,e7ffb779736fefa035b7ca0e1596970361f46f9c78c49b632d42c184a19d4b3f,2020-11-22 14:01:14,C++,10.0,1329802938704252928,1318384390343954432,1039131349729988608,"#include \nusing namespace std;\n#define ms(a, b) memset(a, b, sizeof a)\n#define rep(i, a, b) for (int i = a; i <= b; i++)\n#define per(i, a, b) for (int i = a; i >= b; i--)\nusing ll = long long;\nconst int INF = 0x7f7f7f7f;\nconst int MAXN = 1e5 + 5;\nconst int MOD = 1e9 + 7;\n\nint main()\n{\n string s;\n cin >> s;\n int num = atoi(s.substr(0, 3).c_str());\n int res = num % 212;\n for (int i = 3; s[i]; i++)\n {\n // cout << res << endl;\n string tmp = \""\"";\n tmp = tmp + to_string(res) + s[i];\n // cout << tmp << \"" \"";\n num = atoi(tmp.c_str());\n res = num % 212;\n }\n cout << res << endl;\n if (res & 1)\n cout << \""奇数\"";\n else\n cout << \""偶数\"";\n return 0;\n}",ACCEPTED,50,376 1330433268918284288,581f31b464a917754b72732babf5f516c82fd0f5a5c120c90d66b0ca142327ca,2020-11-22 16:49:44,C++,4.0,1329802938704252928,1318384390343954432,1039131349729988608,"#include\nusing namespace std;\nint main(){\n\tint n;\n\tcin>>n; \n\tint k=n%212;\n if(k%2==0){\n \tcout<\nusing namespace std;\nint main(){\n\tchar a[1010];\n\tint sum=0; \n\tcin.getline(a,1010); \n\tfor(int i=0;i=212){\n\t\t\tsum=sum%212; \n\t\t} \n\t} \n\tint k=sum; \n if(k%2==0){\n \tcout<\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n cout<\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n cout<\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n cout<\nusing namespace std;\nint main(){\n long long n;\n cin>>n;\n cout<\nusing namespace std;\nint main(){\n long long n;\n cin>>n;\n cout<\nusing namespace std;\nint main(){\n long long n;\n cin>>n;\n cout<\nint main()\n{\n int x,y;\n scanf(\""%d\"",&x);\n if(x%2==1)\n printf(\""1\\n奇数\\n\"");\n else\n printf(\""0\\n偶数\\n\"");\n return 0;\n}",PARTIAL_ACCEPTED,79,216 1333058917357088768,5133e290ee0a54fd0d3f70f4540fde86351cda611ceb300aab61da2d876638d1,2020-11-29 22:43:07,C,2.0,1330784538023735297,1318384390343954432,1039131349729988608,"#include\nint main()\n{\n int x,y;\n scanf(\""%d\"",&x);\n if(x%2==1)\n printf(\""1\\n奇数\\n\"");\n if(x%2==0)\n printf(\""0\\n偶数\\n\"");\n return 0;\n}",PARTIAL_ACCEPTED,30,340 1333059057472008192,5133e290ee0a54fd0d3f70f4540fde86351cda611ceb300aab61da2d876638d1,2020-11-29 22:43:41,C,2.0,1330784538023735297,1318384390343954432,1039131349729988608,"#include\nint main()\n{\n int x,y;\n scanf(\""%d\"",&x);\n if(x%2==1)\n printf(\""1\\n奇数\\n\"");\n if(x%2==0)\n printf(\""0\\n偶数\\n\"");\n return 0;\n}",PARTIAL_ACCEPTED,25,376 1333059123192557568,5133e290ee0a54fd0d3f70f4540fde86351cda611ceb300aab61da2d876638d1,2020-11-29 22:43:56,C,2.0,1330784538023735297,1318384390343954432,1039131349729988608,"#include\nint main()\n{\n int x;\n scanf(\""%d\"",&x);\n if(x%2==1)\n printf(\""1\\n奇数\\n\"");\n if(x%2==0)\n printf(\""0\\n偶数\\n\"");\n return 0;\n}",PARTIAL_ACCEPTED,36,336 1587822192556027904,c118bc60f6aa49b2ae77c64b87adb687330801c4a5b233efbad5ab3653a60ab2,2022-11-02 23:01:25,C,20.0,1587320129925447681,1313471683597295616,1039132196031492096,"#include \n//f(n)=2^n-1\nint a[2000] = {0};\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint i,j;\n\ta[0]=1;\n\tfor(i = 0;i < n;i++)\n\t{\n\t\tfor(j = 0;j < 2000;j++)\n\t\t{\n\t\t\ta[j] *= 2;\n\t\t}\n\t\tfor(j = 0;j < 2000;j++)\n\t\t{\n\t\t\tif(a[j] > 9)\n\t\t\t{\n\t\t\t\ta[j+1]++;\n\t\t\t\ta[j] %= 10;\n\t\t\t}\n\t\t}\n\t}\n\tint *p;\n\tp = &a[1999];\n\tint len = 2000;\n\twhile(*p==0)\n\t{\n\t\tlen--;\n\t\tp--;\n\t}\n\tfor(i = len-1;i > 0;i--)\n\t{\n\t\tprintf(\""%d\"",a[i]);\n\t}\n\tprintf(\""%d\"",a[0]-1);\n\treturn 0;\n}",ACCEPTED,46,308 1588059378987634688,9dd0e53cbfe17a25e54d43ad4fe4f5a10179c96ea1862f8c94547c0a4622eaa4,2022-11-03 14:43:55,C++,20.0,1587320129925447681,1313471683597295616,1039132196031492096,"#include\n\n#include\nusing namespace std;\nint a[5000000];\nint main() {\n\tint n;\n\tcin >> n;\n\ta[1] = 1;\n\tint x = 0, k = 1; \n\tfor (int i = 1; i <= n; i++) {\n\t\tint x = 0;\n\t\tfor (int j = 1; j <= k; j++) {\n\t\t\ta[j] = a[j] * 2 + x;\n\t\t\tx = a[j] / 10;\n\t\t\ta[j] %= 10;\n\t\t\tif (x != 0 && j == k) \n\t\t\t\tk++;\n\t\t}\n\t}\n\tfor (int i = k; i >= 1; i--) {\n\t\tif (i != 1)printf(\""%d\"", a[i]);\n\t\tif (i == 1)printf(\""%d\"", a[i] - 1);\n\t}\n\treturn 0;\n}\n",ACCEPTED,44,604 1425014445461393408,bce18b980054449b232d2fa761b847d3df8da636fa0fe21c9b3885aee555be5f,2021-08-10 16:41:33,Python,15.0,1424560832154693633,1313471683597295616,1039132196031492096,n=int(input())\ndef func(n):\n if n == 0:\n return 0\n return 2*func(n-1) + 1\nprint(func(n)),PARTIAL_ACCEPTED,100,3896 1425015346913792000,bce18b980054449b232d2fa761b847d3df8da636fa0fe21c9b3885aee555be5f,2021-08-10 16:45:08,C,0.0,1424560832154693633,1313471683597295616,1039132196031492096,"#include\nint main(){\ndef func(n):\n if n == 0:\n return 0;\n return 2*func(n-1) + 1;\nint n;\nscanf(\""%d\"",&n);\nprintf('%d',%func(n));\n return 0\n}",COMPILE_ERROR,0,0 1425016312253808640,bce18b980054449b232d2fa761b847d3df8da636fa0fe21c9b3885aee555be5f,2021-08-10 16:48:59,Python,15.0,1424560832154693633,1313471683597295616,1039132196031492096,def func(n):\n if n==0:\n return 0\n return 2*func(n-1)+1\nn=int(input())\nprint(func(n)),PARTIAL_ACCEPTED,98,3888 1425306808821981184,b595e421831b7e5db829e1fc2f14751cb8723bf1d4e0ce4a4aec2c01d117c27e,2021-08-11 12:03:18,C++,0.0,1424560832154693633,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nlong long int cnt=0;\nvoid hanio(int n,char x,char y,char z){\n\tif(n==1)cnt++;\n\telse{\n\t\thanio(n-1,x,z,y);\n\t\tcnt++;\n\t\thanio(n-1,y,x,z);\n\t}\n}\nint main()\n{\n\tchar a='A';\n\tchar b='B';\n\tchar c='C';\n\tint n;cin>>n;\n\thanio(n,'A','B','C');\n\tcout<\n#include\nusing namespace std;\nint main()\n{\n int n;cin>>n;\n cout<\n#include\nusing namespace std;\nint main()\n{\n int n;cin>>n;\n cout<\nusing namespace std; \nconst int N=1000;\nint n,ans[N],j;\nint main()\n{\n\tcin>>n;\n memset(ans,-1,sizeof(ans)); \n ans[0]=2; \n for(int i=0;i=10&&ans[j+1]==-1)ans[j+1]=0;\n ans[j+1]+=ans[j]/10;\n ans[j]%=10;\n j++;\n }\n }\n for(int i=j-1;i>=0;i--){\n \tif(i==0)ans[i]--;\n cout<\nusing namespace std; \nconst int N=2500;\nint n,ans[N],j;\nint main()\n{\n\tcin>>n;\n memset(ans,-1,sizeof(ans)); \n ans[0]=2; \n for(int i=0;i=10&&ans[j+1]==-1)ans[j+1]=0;\n ans[j+1]+=ans[j]/10;\n ans[j]%=10;\n j++;\n }\n }\n for(int i=j-1;i>=0;i--){\n \tif(i==0)ans[i]--;\n cout<\nusing namespace std;\n\ndouble ans=0;\n\nvoid hnooi(int n){\n\tif(n==1){\n\t\tans++;\n\t\treturn;\n\t}else{\n\t\thnooi(n-1);\n\t\tans++;\n\t\thnooi(n-1);\n\t}\n}\nint main(){\n\tint n;\n\tcin>>n;\n\thnooi(n);\n\tcout<\n#include \n#include \n#include \n\nusing namespace std;\n\nvector mul(vector a, int b)\n{\n\tvector c;\n\treverse(a.begin(), a.end());\n\tfor (int i = 0, t = 0; i < a.size() || t; i ++ )\n\t{\n\t\tif (i < a.size()) t += a[i] * b;\n\t\tc.push_back(t % 10);\n\t\tt /= 10;\n\t}\n\t\n\twhile (c.size() > 1 && c.back() == 0) c.pop_back();\n\treverse(c.begin(), c.end());\n\treturn c;\n}\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\t\n\tvector ans;\n\tans.push_back(1);\n\tfor (int i = 0; i < n; i ++ )\n\t\tans = mul(ans, 2);\n\t\n\tans[ans.size() - 1] --;\n\tfor (int i = 0; i < ans.size(); i ++ )\n\t\tcout << ans[i];\n\tcout << endl;\n\t\n\treturn 0;\n}",ACCEPTED,68,452 1425744631350456320,c82db3810f34321115978934f386ca35b798b059a195e5661bc2b664dd04b5ad,2021-08-12 17:03:03,C++,20.0,1424560832154693633,1313471683597295616,1039132196031492096,#include\nusing namespace std;\nvectorq;\nvoid f(){\n\tfor(int i=0;i=10)\n\t\tq[i+1]++;\n\t\tq[i]%=10;\n\t}\n\tif(q[q.size()-1]>=10){\n\t\tq[q.size()-1]%=10;\n\t\tq.push_back(1);\n\t}\n}\nint main(){\n\tint n;\n\tcin>>n;\n\tq.push_back(1);\n\tfor(int i=1;i=0;i--)\n\tcout<\nusing namespace std;\nint main(){\n double n;\n cin>>n;\n double ans=0;\n ans=pow(2,n)-1;\n cout<\nusing namespace std;\nint main(){\n long long n;\n cin>>n;\n long long ans=0;\n ans=pow(2,n)-1;\n cout<\nusing namespace std;\nint hanoi(int n, char x, char y, char z,int sum)\n{\n\tif (n == 1) \n\t return sum;\n\telse\n\t{\n\t\thanoi(n - 1, x, z, y,sum+1); \n\t\tsum+=1;\n\t\thanoi(n - 1, y, x, z,sum+1); \n\t}\n}\n\nint main()\n{\n\tint n;\n\tcin>>n;\n\tcout <\nusing namespace std;\nint hanoi(int n)\n{\n\tif (n==0){\n\t\treturn 0;\n\t}\n\telse{\n\t\treturn hanoi(n-1)+1+hanoi(n-1);\n\t}\n}\n\nint main()\n{\n\tint n;\n\tcin>>n;\n\tcout <\n#include \n#include \nusing namespace std;\nint main()\n{\n\tint n;\n\tcin>>n;\n\tcout <\n#include \n#include \nusing namespace std;\nint main()\n{\n\tint n;\n\tcin>>n;\n\tcout <\n#include\nusing namespace std;\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint s = pow(2,n) - 1; \n\tprintf(\""%d\"",s);\n} ",WRONG_ANSWER,26,452 1426534881266061312,209a67e3434cef57fbcf301e9430b136a5c2bd890c13ff684c32d34d0a66b2ed,2021-08-14 21:23:14,C++,0.0,1424560832154693633,1313471683597295616,1039132196031492096,"#include\n#include\nusing namespace std;\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tlong long s = pow(2,n) - 1; \n\tprintf(\""%lld\"",s);\n} ",WRONG_ANSWER,23,448 1426537498365034496,209a67e3434cef57fbcf301e9430b136a5c2bd890c13ff684c32d34d0a66b2ed,2021-08-14 21:33:38,C++,0.0,1424560832154693633,1313471683597295616,1039132196031492096,"#include\n#include\nusing namespace std;\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tunsigned long long s = pow(2,n) - 1; \n\tprintf(\""%lld\"",s);\n} ",WRONG_ANSWER,35,320 1426552691669237760,209a67e3434cef57fbcf301e9430b136a5c2bd890c13ff684c32d34d0a66b2ed,2021-08-14 22:34:00,C++,17.0,1424560832154693633,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nint a[100];\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint l = 1;\n\ta[1] = 1;\n\tfor(int i = 0; i < n; i++){\n\t\tfor(int j = 1; j <= l; j++)a[j]*=2;\n\t\tfor(int j = 1; j <= l; j++){\n\t\t\tif(a[j] > 9){\n\t\t\t\ta[j+1]++;\n\t\t\t\ta[j] -= 10;\n\t\t\t\t}\n\t\t\t\tif(a[l+1]>0)l++;\n\t\t\t}\n\t\t}\n\t\tfor(int i = l; i > 1; i--){\n\t\t\tprintf(\""%d\"",a[i]);\n\t\t}\n\t\tprintf(\""%d\"",a[1]-1);\n\t}",PARTIAL_ACCEPTED,38,452 1426552869314711552,209a67e3434cef57fbcf301e9430b136a5c2bd890c13ff684c32d34d0a66b2ed,2021-08-14 22:34:42,C++,17.0,1424560832154693633,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nint a[1000];\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint l = 1;\n\ta[1] = 1;\n\tfor(int i = 0; i < n; i++){\n\t\tfor(int j = 1; j <= l; j++)a[j]*=2;\n\t\tfor(int j = 1; j <= l; j++){\n\t\t\tif(a[j] > 9){\n\t\t\t\ta[j+1]++;\n\t\t\t\ta[j] -= 10;\n\t\t\t\t}\n\t\t\t\tif(a[l+1]>0)l++;\n\t\t\t}\n\t\t}\n\t\tfor(int i = l; i > 1; i--){\n\t\t\tprintf(\""%d\"",a[i]);\n\t\t}\n\t\tprintf(\""%d\"",a[1]-1);\n\t}",PARTIAL_ACCEPTED,42,452 1426552988613300224,209a67e3434cef57fbcf301e9430b136a5c2bd890c13ff684c32d34d0a66b2ed,2021-08-14 22:35:11,C++,17.0,1424560832154693633,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nint a[1000];\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint l = 1;\n\ta[1] = 1;\n\tfor(int i = 0; i < n; i++){\n\t\tfor(int j = 1; j <= l; j++)a[j]*=2;\n\t\tfor(int j = 1; j <= l; j++){\n\t\t\tif(a[j] > 9){\n\t\t\t\ta[j+1]++;\n\t\t\t\ta[j] -= 10;\n\t\t\t\t}\n\t\t\t\tif(a[l+1]>0)l++;\n\t\t\t}\n\t\t}\n\t\tfor(int i = l; i > 1; i--){\n\t\t\tprintf(\""%d\"",a[i]);\n\t\t}\n\t\tprintf(\""%d\"",a[1]-1);\n\t}",PARTIAL_ACCEPTED,35,328 1426553512196734976,209a67e3434cef57fbcf301e9430b136a5c2bd890c13ff684c32d34d0a66b2ed,2021-08-14 22:37:16,C++,0.0,1424560832154693633,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nint a[1000];\t\t\nvoid p(){\n for(int i = 1; i <= l; i++)a[i]*=2;\n\t\tfor(int i = 1; i <= l; i++){if(a[i] > 9){\n\t\t\t\ta[i+1]++;\n\t\t\t\ta[i] -= 10;\n\t\t\t\t}\n\t\t\t\tif(a[l+1]>0)l++;\n\t\t\t}\n }\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint l = 1;\n\ta[1] = 1;\n\tfor(int i = 0; i < n; i++)p();\n\t\tfor(int i = l; i > 1; i--){\n\t\t\tprintf(\""%d\"",a[i]);\n\t\t}\n\t\tprintf(\""%d\"",a[1]-1);\n\t}",COMPILE_ERROR,0,0 1426553670468718592,209a67e3434cef57fbcf301e9430b136a5c2bd890c13ff684c32d34d0a66b2ed,2021-08-14 22:37:53,C++,17.0,1424560832154693633,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nint a[1000];\nint l = 1;\t\t\nvoid p(){\n for(int i = 1; i <= l; i++)a[i]*=2;\n\t\tfor(int i = 1; i <= l; i++){if(a[i] > 9){\n\t\t\t\ta[i+1]++;\n\t\t\t\ta[i] -= 10;\n\t\t\t\t}\n\t\t\t\tif(a[l+1]>0)l++;\n\t\t\t}\n }\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\n\ta[1] = 1;\n\tfor(int i = 0; i < n; i++)p();\n\t\tfor(int i = l; i > 1; i--){\n\t\t\tprintf(\""%d\"",a[i]);\n\t\t}\n\t\tprintf(\""%d\"",a[1]-1);\n\t}",PARTIAL_ACCEPTED,33,440 1426553708959924224,209a67e3434cef57fbcf301e9430b136a5c2bd890c13ff684c32d34d0a66b2ed,2021-08-14 22:38:02,C++,20.0,1424560832154693633,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nint a[10000];\nint l = 1;\t\t\nvoid p(){\n for(int i = 1; i <= l; i++)a[i]*=2;\n\t\tfor(int i = 1; i <= l; i++){if(a[i] > 9){\n\t\t\t\ta[i+1]++;\n\t\t\t\ta[i] -= 10;\n\t\t\t\t}\n\t\t\t\tif(a[l+1]>0)l++;\n\t\t\t}\n }\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\n\ta[1] = 1;\n\tfor(int i = 0; i < n; i++)p();\n\t\tfor(int i = l; i > 1; i--){\n\t\t\tprintf(\""%d\"",a[i]);\n\t\t}\n\t\tprintf(\""%d\"",a[1]-1);\n\t}",ACCEPTED,47,448 1426835100797198336,b5c0a45ccf220bd9ed01235fe52342c5c5978d19925d8d84be614331d7af8b4c,2021-08-15 17:16:12,Python,15.0,1424560832154693633,1313471683597295616,1039132196031492096,def f(x):\n if x==0:\n return 0\n return f(x-1)*2+1\nx=int(input())\nprint(f(x))\n,PARTIAL_ACCEPTED,115,4028 1379967214926290944,9d1ebdeebc2c0799468756ae22ebc35a8379f76949899ad8c00ad4d3f8b50427,2021-04-08 09:19:57,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,"def factorial_1(n):\n if n<1:\n return 1\n res = 2\n for i in range(1, n):\n res *= 2\n return res\nn = (int(input()))\nprint(factorial_1(n)-1)",ACCEPTED,227,3136 1380118109554221056,9d1ebdeebc2c0799468756ae22ebc35a8379f76949899ad8c00ad4d3f8b50427,2021-04-08 19:19:33,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,"n = int (input())\nprint(2**n-1,end=\""\"")",ACCEPTED,122,3128 1380118311283466240,9d1ebdeebc2c0799468756ae22ebc35a8379f76949899ad8c00ad4d3f8b50427,2021-04-08 19:20:21,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,103,3136 1381163895247425536,abbf00b8683ffc13772e32b948dc570b73ae29172aeb67f12acce3713a52968b,2021-04-11 16:35:08,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\n#define ll long long\nusing namespace std;\nll sum=0;\nvoid hanoi(int n,char a,char b,char c)\n{\n if(n==0) return ;\n hanoi(n-1,a,c,b);\n sum++;\n hanoi(n-1,b,a,c);\n}\nint main()\n{\n int n;\n cin>>n;\n hanoi(n,'a','b','c');\n cout<\nusing namespace std;\n\nint n,cou=0;\n\nvoid hanio(int n,char a,char b,char c)\t//b为中间\n{\n\tcou++;\n\tif(n==1)\n\t{\n //printf(\""%c-->%c\\n\"",a,c);\n return;\n\t}\n\telse\n {\n hanio(n-1,a,c,b);\n\t\t//printf(\""%c-->%c\\n\"",a,c);\n\t\thanio(n-1,b,a,c);\n\n }\n}\n\nint main()\n{\n\n\tcin>>n;\n\thanio(n,'A','B','C');\n\tprintf(\""%d\\n\"",cou);\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1384660738606301184,d063cc7c40c619b8b3d44ba7942a5e454bb24229fa7dbc20fd034c22d9d1a3db,2021-04-21 08:10:20,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\n#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);\nusing namespace std;\nint n,cou=0;\nvoid hanio(int n,char a,char b,char c)\t//b为中间\n{\n\tcou++;\n\tif(n==1)\n\t{\n\t\t//cout<\""<\""<>n;\n\thanio(n,'A','B','C');\n\tcout<\n#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);\nusing namespace std;\nint n,cou=0;\nvoid hanio(int n,char a,char b,char c)\t//b为中间 \n{\n\tcou++;\n\tif(n==1)\n\t{\n\t\tcout<\""<\""<>n;\n\thanio(n,'A','B','C');\n\tcout<\n#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);\nusing namespace std;\nint n,cou=0;\nvoid hanio(int n,char a,char b,char c)\t//b为中间 \n{\n\tcou++;\n\tif(n==1)\n\t{\n\t\tcout<\""<\""<>n;\n\thanio(n,'A','B','C');\n\tcout<\n#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);\nusing namespace std;\nint n,cou=0;\nvoid hanio(int n,char a,char b,char c)\t//b为中间 \n{\n\tcou++;\n\tif(n==1)\n\t{\n\t\tcout<\""<\""<>n;\n\thanio(n,'A','B','C');\n\tcout<\n\nusing namespace std;\n\nint ans = 0;\n\nlong long hanoi(int n)\n{\n if(n==0)\n return 0;\n if(n==1)\n return 2;\n return 3*hanoi(n-1)+2;\n}\n\nint n;\n\nint main()\n{\n while(scanf(\""%d\"",&n)!=EOF)\n {\n printf(\""%lld\\n\"",hanoi(n));\n }\n}\n",WRONG_ANSWER,25,316 1385045177664471040,c9a3d99112de4f3eb5fe1caba0b9742e941e3f7da5ef553ede680c32b5988e7e,2021-04-22 09:37:57,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t/*这里抽象的很，需要理解为将n个盘子从one座移到three座(借助two座)的过程【其中one、two、three只是个形式位置】 \n\t\t\t\t\t\t\t\t\t\t\t\t\t----后面的hanoi(n-1,one,three,two)其实看成开头的定义hanoi(int n,char one,char two,char three)的形式样子 \n\t\t\t\t\t\t\t\t\t\t\t\t\t也就是one(实际位置如A)借助three(实际位置如C)移动到two(实际位置如B).下面的(3)其实和上面介绍的方法一样 \n\t\t\t\t\t\t\t\t\t\t\t\t\tone、two、three只是个形式位置，但A、B、C才是实际位置*/\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tprintf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""The step to move %d diskes:\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""The total number of times is %d\"",i-1);\n\treturn 0;\n}\n————————————————\n版权声明：本文为CSDN博主「重剑DS」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。\n原文链接：https://blog.csdn.net/qq_45732909/article/details/103552632",COMPILE_ERROR,0,0 1385406657807187968,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-04-23 09:34:21,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \nstatic int i=0;\t\n\nvoid hanoi(int n, char chufadi, char jiezhudian, char mudidi)\t \n{\t\t\t\t\t\t\t\t\t\t\t\t//假设一开始针对n曾盘子chufadi为A,jiezhudian为B(jiezhudian像跳台或者辅助器一样),mudidi为C \n\tvoid move(char chufadi, char mudidi);\t\t// ^\n\t if(n<=0)\t\t\t\t//防止n为0的情况\t// |\n\treturn ;\t\t\t\t\t\t\t\t\t// |\n\t \t\t\t\t\t\t\t\t\t\t\t// |\n\tif(n==1)\t\t\t\t\t\t\t\t\t// |\n\tmove( chufadi, mudidi);\t\t\t\t\t\t// |\n\telse{\t\t\t\t\t\t\t\t\t\t// |\n\t\t\t\t\t\t\t\t\t\t\t\t// |\n\thanoi(n-1, chufadi, mudidi, jiezhudian);\t// 这时候针对n-1层盘子,chufadi还是原来的chufadi(A)，但是jiezhudian由原来的jiezhudian(B)变为了原来的mudidi(C) \n\tmove( chufadi, mudidi);\t\t\t\t\t\t//这时候需要将第n层盘子就从原来的chufadi(A)移到mudidi(C) \n\thanoi(n-1, jiezhudian, chufadi, mudidi);\t//这时候针对n-1层已经移到B的盘子其实移动的方法和第15行几乎一样 \n\t\n\t}\n}\n\nvoid move(char chufadi, char mudidi)\n{\n\tprintf(\""%c-->%c\\n\"",chufadi,mudidi);\n\ti++;\n}\n\nint main(int argc,char const *argv[])\n{\n\tint n;\n\t//选择在A上的盘子个数\n\tscanf(\""%d\"",&n);\n\tprintf(\""\\n\"");\n\thanoi(n,'A','B','C');\n //需要移动盘子的总次数\n\tprintf(\""%d\"",i);\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1385407116362055680,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-04-23 09:36:10,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \nstatic int i=0;\t\n\nvoid hanoi(int n, char chufadi, char jiezhudian, char mudidi)\t \n{\t\t\t\t\t\t\t\t\t\t\t\t//假设一开始针对n曾盘子chufadi为A,jiezhudian为B(jiezhudian像跳台或者辅助器一样),mudidi为C \n\tvoid move(char chufadi, char mudidi);\t\t// ^\n\t if(n<=0)\t\t\t\t//防止n为0的情况\t// |\n\treturn ;\t\t\t\t\t\t\t\t\t// |\n\t \t\t\t\t\t\t\t\t\t\t\t// |\n\tif(n==1)\t\t\t\t\t\t\t\t\t// |\n\tmove( chufadi, mudidi);\t\t\t\t\t\t// |\n\telse{\t\t\t\t\t\t\t\t\t\t// |\n\t\t\t\t\t\t\t\t\t\t\t\t// |\n\thanoi(n-1, chufadi, mudidi, jiezhudian);\t// 这时候针对n-1层盘子,chufadi还是原来的chufadi(A)，但是jiezhudian由原来的jiezhudian(B)变为了原来的mudidi(C) \n\tmove( chufadi, mudidi);\t\t\t\t\t\t//这时候需要将第n层盘子就从原来的chufadi(A)移到mudidi(C) \n\thanoi(n-1, jiezhudian, chufadi, mudidi);\t//这时候针对n-1层已经移到B的盘子其实移动的方法和第15行几乎一样 \n\t\n\t}\n}\n\nvoid move(char chufadi, char mudidi)\n{\n\t//printf(\""%c-->%c\\n\"",chufadi,mudidi);\n\ti++;\n}\n\nint main()\n{\n\tint n;\n\t//选择在A上的盘子个数\n\tscanf(\""%d\"",&n);\n\tprintf(\""\\n\"");\n\thanoi(n,'A','B','C');\n //需要移动盘子的总次数\n\tprintf(\""%d\"",i);\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1385407750335299584,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-04-23 09:38:41,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t/*这里抽象的很，需要理解为将n个盘子从one座移到three座(借助two座)的过程【其中one、two、three只是个形式位置】 \n\t\t\t\t\t\t\t\t\t\t\t\t\t----后面的hanoi(n-1,one,three,two)其实看成开头的定义hanoi(int n,char one,char two,char three)的形式样子 \n\t\t\t\t\t\t\t\t\t\t\t\t\t也就是one(实际位置如A)借助three(实际位置如C)移动到two(实际位置如B).下面的(3)其实和上面介绍的方法一样 \n\t\t\t\t\t\t\t\t\t\t\t\t\tone、two、three只是个形式位置，但A、B、C才是实际位置*/\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\t//printf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\t//printf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""%d\"",i-1);\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1385407897152716800,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-04-23 09:39:16,C,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t/*这里抽象的很，需要理解为将n个盘子从one座移到three座(借助two座)的过程【其中one、two、three只是个形式位置】 \n\t\t\t\t\t\t\t\t\t\t\t\t\t----后面的hanoi(n-1,one,three,two)其实看成开头的定义hanoi(int n,char one,char two,char three)的形式样子 \n\t\t\t\t\t\t\t\t\t\t\t\t\t也就是one(实际位置如A)借助three(实际位置如C)移动到two(实际位置如B).下面的(3)其实和上面介绍的方法一样 \n\t\t\t\t\t\t\t\t\t\t\t\t\tone、two、three只是个形式位置，但A、B、C才是实际位置*/\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\t//printf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\t//printf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""%d\"",i-1);\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1385409161580183552,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-04-23 09:44:18,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"/*#include \n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\t//printf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\t//printf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""%d\"",i-1);\n\treturn 0;\n}*/\n#include\nstatic int i=1;\nint hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n}\nint main(){\n int n;\n scanf(\""%d\"",&n);\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n cout<\n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\t//printf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\t//printf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""%d\"",i-1);\n\treturn 0;\n}*/\n#include\nstatic int i=1;\nint hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n}\nint main(){\n int n;\n scanf(\""%d\"",&n);\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n printf(\""%d\"",i-1);\n return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1387209948363005952,9d8f61aeb4ee0ca082331f56f551d492b92e980eae7610439db0ea884d72b307,2021-04-28 08:59:59,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \n\nusing namespace std;\n\nint main()\n{\n int n;\n cin>> n;\n cout<< pow(2,(n-1)/2)-1<< endl;\n return 0;\n}\n",WRONG_ANSWER,167,564 1390097923493519360,f3fdc43fbc67054d99874af3a8f1a5a35e63f6b68b54ef00d1a161c9cacbd1f9,2021-05-06 08:15:46,C,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",COMPILE_ERROR,0,0 1390097955290537984,f3fdc43fbc67054d99874af3a8f1a5a35e63f6b68b54ef00d1a161c9cacbd1f9,2021-05-06 08:15:53,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",WRONG_ANSWER,21,452 1390101020194299904,abbf00b8683ffc13772e32b948dc570b73ae29172aeb67f12acce3713a52968b,2021-05-06 08:28:04,C++,3.0,1379951400336728064,1313471683597295616,1039132196031492096,#include\n#define ll unsigned long long\nusing namespace std;\nll sum=0;\nvoid hanoi(int n)\n{\n if(n==0)\n {\n \treturn ;\n\t}\n\telse \n\t{\n\t\thanoi(n-1);\n\t\tsum=sum*2+1;\n\t}\n}\nint main()\n{\n int n;\n cin>>n;\n hanoi(n);\n cout<\n#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);\nusing namespace std;\nint n,cou=0;\nvoid hanio(int n,char a,char b,char c)\t//b为中间 \n{\n\tcou++;\n\tif(n==1)\n\t{\n\t\tcout<\""<\""<>n;\n\thanio(n,'A','B','C');\n\tcout<\nvoid hanoi(int x,char a[],char b[],char c[]){//汉诺塔函数\n if(x==1)//当x=1时，意味着只有一个盘子，此时的方法就是直接从a移到c\n printf(\""%s->%s\\n\"",a,c);\n else{//x不是1\n hanoi(x-1,a,c,b);//把除了最底层盘子上的（x-1）个盘子从a移到b\n printf(\""%s->%s\\n\"",a,c);//把最底层的盘子移到c\n hanoi(x-1,b,a,c);//把（x-1）个盘子从b移到c\n }\n}\nint main()\n{\n int n;\n scanf(\""%d\"",&n);//输入盘子个数\n char m=getchar();//得到输入时的回车\n char a[100];\n char b[100];\n char c[100];\n gets(a);//输入a\n gets(b);//输入b\n gets(c);//输入c\n hanoi(n,a,b,c);//调用函数\n\treturn 0;\n}",COMPILE_ERROR,0,0 1390107448812429312,abbf00b8683ffc13772e32b948dc570b73ae29172aeb67f12acce3713a52968b,2021-05-06 08:53:37,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\n#define MAXNUM 6000\nint arr[MAXNUM];\nint main()\n{\n int n,index,i;\n cin>>n;\n index=0;\n memset(arr,0,sizeof(arr));\n arr[0]=2;\n for( i=1; i=10)\n {\n jinwei=1;\n }\n }\n else\n {\n temp=arr[j]*2;\n if(jinwei==1)\n {\n temp=temp+1;\n }\n if(temp>=10)\n {\n jinwei=1;\n }\n else\n {\n jinwei=0;\n }\n }\n arr[j]=temp%10;\n }\n if(jinwei==1)\n {\n index++;\n arr[index]=1;\n }\n }\n for( i=index; i>=0; i--)\n {\n cout<\nusing namespace std;\n#define MAXNUM 6000\nint arr[MAXNUM];\nint main()\n{\n int n,index,i;\n cin>>n;\n index=0;\n memset(arr,0,sizeof(arr));\n arr[0]=2;\n for( i=1; i=10)\n {\n jinwei=1;\n }\n }\n else\n {\n temp=arr[j]*2;\n if(jinwei==1)\n {\n temp=temp+1;\n }\n if(temp>=10)\n {\n jinwei=1;\n }\n else\n {\n jinwei=0;\n }\n }\n arr[j]=temp%10;\n }\n if(jinwei==1)\n {\n index++;\n arr[index]=1;\n }\n }\n for( i=index; i>0; i--)\n {\n cout<\n\nusing namespace std;\n\nint main()\n{\n int n;\n cin>>n;\n cout << pow(2, n-1) << endl;\n return 0;\n}\n",WRONG_ANSWER,29,444 1390112549069316096,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-05-06 09:13:53,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"/*#include \n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\t//printf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\t//printf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""%d\"",i-1);\n\treturn 0;\n}*/\n#include\nstatic int i=1;\nint hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n}\nint main(){\n int n;\n scanf(\""%d\"",&n);\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n printf(\""%d\"",i-1);\n return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1390114199557259264,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-05-06 09:20:26,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main{\nstatic int i=1;\nint hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n}}\n\n\tpublic static void main(String args[]) {\n int n;\n scanf(\""%d\"",&n);\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n printf(\""%d\"",i-1);\n return 0;\n}\n",COMPILE_ERROR,0,0 1390114343677739008,8dd2a555e9b120b52f7a02bdffe2f120ca4cafa3f47478437e532f230b3daad9,2021-05-06 09:21:01,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\n#include\nint MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tprintf(\""请输入您要设置的圆盘数：>\\n\"");\n\tscanf(\""%d\"", &n);\n\tint ret = MathMove(n);\n\tprintf(\""从A柱移动到C柱需要移动%d次。\\n\"", ret);\n\tsystem(\""pause\"");\n\treturn 0;\n}",COMPILE_ERROR,0,0 1390114381040599040,8dd2a555e9b120b52f7a02bdffe2f120ca4cafa3f47478437e532f230b3daad9,2021-05-06 09:21:10,C,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\n#include\nint MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tprintf(\""请输入您要设置的圆盘数：>\\n\"");\n\tscanf(\""%d\"", &n);\n\tint ret = MathMove(n);\n\tprintf(\""从A柱移动到C柱需要移动%d次。\\n\"", ret);\n\tsystem(\""pause\"");\n\treturn 0;\n}",COMPILE_ERROR,0,0 1390114485097086976,8dd2a555e9b120b52f7a02bdffe2f120ca4cafa3f47478437e532f230b3daad9,2021-05-06 09:21:34,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\n#include\nint MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tprintf(\""请输入您要设置的圆盘数：>\\n\"");\n\tscanf(\""%d\"", &n);\n\tint ret = MathMove(n);\n\tprintf(\""从A柱移动到C柱需要移动%d次。\\n\"", ret);\n\tsystem(\""pause\"");\n\treturn 0;\n}",COMPILE_ERROR,0,0 1390114524011839488,8dd2a555e9b120b52f7a02bdffe2f120ca4cafa3f47478437e532f230b3daad9,2021-05-06 09:21:44,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\n#include\nint MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tprintf(\""请输入您要设置的圆盘数：>\\n\"");\n\tscanf(\""%d\"", &n);\n\tint ret = MathMove(n);\n\tprintf(\""从A柱移动到C柱需要移动%d次。\\n\"", ret);\n\tsystem(\""pause\"");\n\treturn 0;\n}",COMPILE_ERROR,0,0 1390114691247128576,8dd2a555e9b120b52f7a02bdffe2f120ca4cafa3f47478437e532f230b3daad9,2021-05-06 09:22:24,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\n#include\nint MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tprintf(\""请输入您要设置的圆盘数：>\\n\"");\n\tscanf(\""%d\"", &n);\n\tint ret = MathMove(n);\n\tprintf(\""从A柱移动到C柱需要移动%d次。\\n\"", ret);\n\tsystem(\""pause\"");\n\treturn 0;\n}",COMPILE_ERROR,0,0 1390115074677858304,9d8f61aeb4ee0ca082331f56f551d492b92e980eae7610439db0ea884d72b307,2021-05-06 09:23:55,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \n\nusing namespace std;\n\nint a[1000];\nvoid jia1();\nvoid cheng();\nvoid print();\n\nint main()\n{\n int n;\n cin >> n;\n a[0] = 1;\n a[1] = 2;\n for (int i = 2; i <= n; i++)\n {\n jia1();\n cheng();\n }\n print();\n}\nvoid jia1()\n{\n int i=1;\n int jw = 0;\n a[1]++;\n\n do\n {\n a[i] = a[i] + jw;\n jw = a[i] / 10;\n a[i] %= 10;\n i++;\n }\n while (jw);\n if (a[a[0] + 1])\n a[0]++;\n\n}\nvoid cheng()\n{\n int i, jw;\n for (i = 1, jw = 0; i <= a[0]; i ++ )\n {\n a[i] = a[i] * 2 + jw;\n jw = a[i] / 10;\n a[i] %= 10;\n }\n if (jw)\n {\n a[i] = jw;\n a[0] = i;\n }\n}\nvoid print()\n{\n for (int i = a[0]; i >= 1; i--)\n {\n cout << a[i];\n }\n}\n",WRONG_ANSWER,36,440 1390115254433144832,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-05-06 09:24:38,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main{\nstatic int i=1;\nint hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n}}\n\n\tpublic static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextLine();\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n System.put.println(i-1);\n return 0;\n}\n",COMPILE_ERROR,0,0 1390115354236608512,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-05-06 09:25:02,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main{\nstatic int i=1;\nint hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n}}\n\n\tpublic static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextLine();\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n System.put.println(i-1);\n return 0;\n}\n",COMPILE_ERROR,0,0 1390116135274733568,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-05-06 09:28:08,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main{\nstatic int i=1;\nint hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n}}\n\n\tpublic static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n System.out.println(i-1);\n return 0;\n}\n",COMPILE_ERROR,0,0 1390116495850618880,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-05-06 09:29:34,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main{\nstatic BigInteger i=1;\nint hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n}}\n\n\tpublic static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n System.out.println(i-1);\n return 0;\n}\n",COMPILE_ERROR,0,0 1390116659743047680,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-05-06 09:30:13,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.*;\nimport java.util.Scanner;\n\npublic class Main{\nstatic BigInteger i=1;\nint hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n}}\n\n\tpublic static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n System.out.println(i-1);\n return 0;\n}\n",COMPILE_ERROR,0,0 1390117002883293184,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-05-06 09:31:35,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.*;\nimport java.util.Scanner;\n\n\nstatic BigInteger i=1;\npublic class hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n}\n\n\tpublic static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n System.out.println(i-1);\n return 0;\n}\n",COMPILE_ERROR,0,0 1390117153328783360,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-05-06 09:32:11,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.*;\nimport java.util.Scanner;\n\nstatic BigInteger i=1;\npublic class hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n\n\n\tpublic static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n System.out.println(i-1);\n return 0;\n}}\n",COMPILE_ERROR,0,0 1390118261942050816,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-05-06 09:36:35,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.*;\nimport java.util.Scanner;\npublic class Main{\nstatic BigInteger i=1;\npublic class hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n\n\n\tpublic static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n System.out.println(i-1);\n return 0;\n}\n}\n",COMPILE_ERROR,0,0 1390118317923426304,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-05-06 09:36:48,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.*;\nimport java.util.Scanner;\npublic class Main{\nstatic BigInteger i=1;\npublic class hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n\n\n\tpublic static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int n = in.nextInt();\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n System.out.println(i-1);\n return 0;\n}\n}\n",COMPILE_ERROR,0,0 1390118634723360768,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-05-06 09:38:04,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.*;\nimport java.util.Scanner;\npublic class Main{\nstatic BigInteger i=1;\npublic class hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n}\n\n\tpublic static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int n = in.nextInt();\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n System.out.println(i-1);\n return 0;\n}\n}\n",COMPILE_ERROR,0,0 1390118879435874304,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-05-06 09:39:02,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"package BigInteger;\nimport java.math.*;\nimport java.util.Scanner;\npublic class Main{\nstatic BigInteger i=1;\npublic class hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n}\n\n\tpublic static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int n = in.nextInt();\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n System.out.println(i-1);\n return 0;\n}\n}\n",COMPILE_ERROR,0,0 1390119256432459776,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-05-06 09:40:32,Java,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.*;\nimport java.util.Scanner;\npublic class Main{\nstatic BigInteger i=1;\npublic class hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n}\n\n\tpublic static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int n = in.nextInt();\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n System.out.println(i-1);\n return 0;\n}\n}\n",COMPILE_ERROR,0,0 1390119544602157056,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-05-06 09:41:41,Java,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.*;\nimport java.util.Scanner;\npublic class Main{\nstatic BigInteger i=1;\npublic class hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n}\n\n\tpublic static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int n = in.nextInt();\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n System.out.println(i-1);\n return 0;\n}\n}\n",COMPILE_ERROR,0,0 1393827016769597440,ae72e71f9d4be6632fe10166d2270bcde2d73604c8cc0390cb2bc32df472b6bc,2021-05-16 15:13:51,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nchar a='a',b='b',c='c';\nlong int sum=0;\nvoid hanuoyi(int n,char a,char b,char c)\n{\n if(n<=0) return ;\n hanuoyi(n-1,a,c,b);\n sum++;\n hanuoyi(n-1,c,b,a);\n}\nint main()\n{\n int n;\n cin>>n;\n hanuoyi(n,a,b,c);\n cout<\nusing namespace std;\nint main()\n{\n int n;\n cin>>n;\n unsigned int sum = 1;\n for(int i =0;i < n;i ++)\n {\n sum*=2;\n }\n cout<\nusing namespace std;\nint main()\n{\n int n;\n cin>>n;\n unsigned int sum = 1;\n for(int i =0;i < n;i ++)\n {\n sum*=2;\n }\n cout<\nusing namespace std;\nint main()\n{\n int n;\n cin>>n;\n long long int sum = 1;\n for(int i =0;i < n;i ++)\n {\n sum*=2;\n }\n cout<\nusing namespace std;\nint hanuoyi(int n)\n{\n if(n==1) return 1;\n else return 2*hanuoyi(n-1) + 1;\n}\nint main()\n{\n int n;\n cin>>n;\n long long int sum;\n sum = hanuoyi(n);\n cout<\nusing namespace std;\nint hanuoyi(int n)\n{\n if(n==1) return 1;\n else return 2*hanuoyi(n-1) + 1;\n}\nint main()\n{\n int n;\n cin>>n;\n unsigned long long int sum;\n sum = hanuoyi(n);\n cout<\nusing namespace std;\nint main()\n{\n int n;\n cin>>n;\n unsigned long long int sum = 1;\n for(int i =0;i < n;i ++)\n {\n sum*=2;\n cout<\nusing namespace std;\n#define MAXNUM 6000\nint arr[MAXNUM];\nint main()\n{\n int n,index,i;\n cin>>n;\n index=0;\n memset(arr,0,sizeof(arr));\n arr[0]=2;\n for( i=1; i=10)\n {\n jinwei=1;\n }\n }\n else\n {\n temp=arr[j]*2;\n if(jinwei==1)\n {\n temp=temp+1;\n }\n if(temp>=10)\n {\n jinwei=1;\n }\n else\n {\n jinwei=0;\n }\n }\n arr[j]=temp%10;\n }\n if(jinwei==1)\n {\n index++;\n arr[index]=1;\n }\n }\n for( i=index; i>0; i--)\n {\n cout<\n#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);\nusing namespace std;\nint n,cou=0;\nvoid hanio(int n,char a,char b,char c)\t//b为中间 \n{\n\tcou++;\n\tif(n==1)\n\t{\n\t\tcout<\""<\""<>n;\n\thanio(n,'A','B','C');\n\tcout<\n#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);\nusing namespace std;\nint n,cou=0;\nvoid hanio(int n,char a,char b,char c)\t//b为中间 \n{\n\tcou++;\n\tif(n==1)\n\t{\n\t\tcout<\""<\""<>n;\n\thanio(n,'A','B','C');\n\tcout<\n#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);\nusing namespace std;\nint n,cou=0;\nvoid hanio(int n,char a,char b,char c)\t//b为中间 \n{\n\tcou++;\n\tif(n==1)\n\t{\n\t\tcout<\""<\""<>n;\n\thanio(n,'A','B','C');\n\tcout<\n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",WRONG_ANSWER,110,564 1395179635526311936,5217244af6fc32d6e3c621e3af60ab33ec53590a62a586f50f6803fab08eecf4,2021-05-20 08:48:40,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#define _CRT_SECURE_NO_WARNINGS\n#include \nint i = 0;\nvoid move(int n, char from, char to)\n{\n\ti++;\n}\n \nHanoi(int n, char A, char B, char C)\n{\n\tif (n == 1)\n\t{\n\t\tmove(n, A, C);\n\t}\n\telse\n\t{\n\t\tHanoi(n - 1, A, C, B);\n\t\tmove(n, A, C);\n\t\tHanoi(n - 1, B, A, C);\n\t}\n}\n \nint main()\n{\n\tint n = 0;\n\tscanf(\""%d\"", &n);\n\tHanoi(n, 'A', 'B', 'C');\n\tprintf(\""%d\\n\"", i);\n\treturn 0; \n}\n",COMPILE_ERROR,0,0 1400242065941209088,ed99014c1005e46c67f15a91708561ec7446d39f053047c382f5d6fc77f52bda,2021-06-03 08:04:58,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = input()\nprint(2**n-1),ACCEPTED,111,3140 1400247829669642240,4ea51d4012f69afaefcb94a0a31945972003108b7d4c967b52d3df971cd934fe,2021-06-03 08:27:52,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nvoid move(int n, char a, char b, char c);\nint i = 1;\nint main()\n{\n int num;\n cout << \""请输入圆盘的个数\"";\n cin >> num;\n move(num, 'A', 'B', 'C');\n system(\""pause\"");\n return 0;\n}\nvoid move(int n, char a, char b, char c)//中间盘永远时中转盘\n{\n if (n == 1)\n {\n cout << \""第\"" << i++ << \""步，将第\"" << n << \""个从\"" << a << \""移动到\"" << c << endl;\n }\n else\n {\n move(n - 1, a, c, b);\n cout << \""第\"" << i++ << \""步，将第\"" << n << \""个从\"" << a << \""移动到\"" << c << endl;\n move(n - 1, b, a, c);\n }\n}\n",TIME_LIMIT_EXCEEDED,0,0 1400248561626259456,4ea51d4012f69afaefcb94a0a31945972003108b7d4c967b52d3df971cd934fe,2021-06-03 08:30:47,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"public class Hano {\n public static void main(String[] args) {\n ArrayStack begin=new ArrayStack<>(); //第一个杆\n ArrayStack mid=new ArrayStack<>(); //第二个杆\n ArrayStack end=new ArrayStack<>(); //第三个杆\n for(int i=3;i>0;i--){ //先在第一个杆上放三个盘子\n begin.push(i);\n\n }\n hano(3,begin,end,mid); //调用函数\n System.out.println(end);\n\n }\n public static void hano(int count, Stack begin, Stack end, Stack mid){\n if(count==1){\n end.push(begin.pop()); //只有一个盘子的时候\n }else{\n hano(count-1,begin,mid,end); //将上一层的盘子从第一个杆借助第三杆移动到第二个杆\n end.push(begin.pop()); //将第一个杆取出的盘子放在第三个杆\n hano(count-1,mid,end,begin); //将上一层的盘子从第二个杆借助借助第一个杆移动到最后一个杆\n }\n }\n}\n",COMPILE_ERROR,0,0 1400248635022385152,4ea51d4012f69afaefcb94a0a31945972003108b7d4c967b52d3df971cd934fe,2021-06-03 08:31:04,Java,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"public class Hano {\n public static void main(String[] args) {\n ArrayStack begin=new ArrayStack<>(); //第一个杆\n ArrayStack mid=new ArrayStack<>(); //第二个杆\n ArrayStack end=new ArrayStack<>(); //第三个杆\n for(int i=3;i>0;i--){ //先在第一个杆上放三个盘子\n begin.push(i);\n\n }\n hano(3,begin,end,mid); //调用函数\n System.out.println(end);\n\n }\n public static void hano(int count, Stack begin, Stack end, Stack mid){\n if(count==1){\n end.push(begin.pop()); //只有一个盘子的时候\n }else{\n hano(count-1,begin,mid,end); //将上一层的盘子从第一个杆借助第三杆移动到第二个杆\n end.push(begin.pop()); //将第一个杆取出的盘子放在第三个杆\n hano(count-1,mid,end,begin); //将上一层的盘子从第二个杆借助借助第一个杆移动到最后一个杆\n }\n }\n}\n",COMPILE_ERROR,0,0 1400248700033859584,4ea51d4012f69afaefcb94a0a31945972003108b7d4c967b52d3df971cd934fe,2021-06-03 08:31:20,nodejs,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"public class Hano {\n public static void main(String[] args) {\n ArrayStack begin=new ArrayStack<>(); //第一个杆\n ArrayStack mid=new ArrayStack<>(); //第二个杆\n ArrayStack end=new ArrayStack<>(); //第三个杆\n for(int i=3;i>0;i--){ //先在第一个杆上放三个盘子\n begin.push(i);\n\n }\n hano(3,begin,end,mid); //调用函数\n System.out.println(end);\n\n }\n public static void hano(int count, Stack begin, Stack end, Stack mid){\n if(count==1){\n end.push(begin.pop()); //只有一个盘子的时候\n }else{\n hano(count-1,begin,mid,end); //将上一层的盘子从第一个杆借助第三杆移动到第二个杆\n end.push(begin.pop()); //将第一个杆取出的盘子放在第三个杆\n hano(count-1,mid,end,begin); //将上一层的盘子从第二个杆借助借助第一个杆移动到最后一个杆\n }\n }\n}\n",MULTIPLE_ERROR,252,6592 1400248734485872640,4ea51d4012f69afaefcb94a0a31945972003108b7d4c967b52d3df971cd934fe,2021-06-03 08:31:28,nodejs,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"public class Hano {\n public static void main(String[] args) {\n ArrayStack begin=new ArrayStack<>(); //第一个杆\n ArrayStack mid=new ArrayStack<>(); //第二个杆\n ArrayStack end=new ArrayStack<>(); //第三个杆\n for(int i=3;i>0;i--){ //先在第一个杆上放三个盘子\n begin.push(i);\n\n }\n hano(3,begin,end,mid); //调用函数\n System.out.println(end);\n\n }\n public static void hano(int count, Stack begin, Stack end, Stack mid){\n if(count==1){\n end.push(begin.pop()); //只有一个盘子的时候\n }else{\n hano(count-1,begin,mid,end); //将上一层的盘子从第一个杆借助第三杆移动到第二个杆\n end.push(begin.pop()); //将第一个杆取出的盘子放在第三个杆\n hano(count-1,mid,end,begin); //将上一层的盘子从第二个杆借助借助第一个杆移动到最后一个杆\n }\n }\n}\n",MULTIPLE_ERROR,271,6688 1400248886755885056,4ea51d4012f69afaefcb94a0a31945972003108b7d4c967b52d3df971cd934fe,2021-06-03 08:32:04,nodejs,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"class Hano{\n public static void main(String[] args){\n //盘子的个数、起始点、终点、借助点\n hano(3,\""A\"",\""C\"",\""B\"");\n }\n public static void hano(int num,String begin,String end,String mid){\n if(num==1){\n System.out.println(begin+\"" -> \""+end);\n }else{\n hano(num-1,begin,mid,end);\n System.out.println(begin+\"" -> \""+end);\n hano(num-1,mid,end,begin);\n }\n }\n}\n",NON_ZERO_EXIT_CODE,251,6672 1400251036760547328,93cd79b7f3c490f7cca04ec419546cc1a4a1cf9f68797d376b22d80bad0a4856,2021-06-03 08:40:37,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",WRONG_ANSWER,21,456 1400251403141152768,8314ed43ccc223cd5d3690a9a3eb1ee3fcec502952bab3838cb6e0c010cdcd4c,2021-06-03 08:42:04,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nvoid hanoi(int n,char A,char B,char C)\n{\n if(n==1)//只有一个盘子，就把它直接搬到C\n printf(\""Move sheet %d from %c to %c\\n\"",n,A,C);\n else{//盘子数超过2个，每次处理两个盘子，A->B,A->C,B->C\n hanoi(n-1,A,C,B);\n printf(\""Move sheet %d from %c to %c\\n\"",n,A,C);\n hanoi(n-1,B,A,C);\n }\n}\nint main()\n{\n\tios::sync_with_stdio(false);\n\tint n;\n\tcin>>n;\n\thanoi(n,'A','B','C');\n\treturn 0;\n }",TIME_LIMIT_EXCEEDED,0,0 1400251435273715712,8314ed43ccc223cd5d3690a9a3eb1ee3fcec502952bab3838cb6e0c010cdcd4c,2021-06-03 08:42:12,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nvoid hanoi(int n,char A,char B,char C)\n{\n if(n==1)//只有一个盘子，就把它直接搬到C\n printf(\""Move sheet %d from %c to %c\\n\"",n,A,C);\n else{//盘子数超过2个，每次处理两个盘子，A->B,A->C,B->C\n hanoi(n-1,A,C,B);\n printf(\""Move sheet %d from %c to %c\\n\"",n,A,C);\n hanoi(n-1,B,A,C);\n }\n}\nint main()\n{\n\tios::sync_with_stdio(false);\n\tint n;\n\tcin>>n;\n\thanoi(n,'A','B','C');\n\treturn 0;\n }",TIME_LIMIT_EXCEEDED,0,0 1400251537056890880,8314ed43ccc223cd5d3690a9a3eb1ee3fcec502952bab3838cb6e0c010cdcd4c,2021-06-03 08:42:36,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"\n#include\nusing namespace std;\nvoid hanoi(int n,char A,char B,char C)\n{\n if(n==1)//只有一个盘子，就把它直接搬到C\n printf(\""Move sheet %d from %c to %c\\n\"",n,A,C);\n else{//盘子数超过2个，每次处理两个盘子，A->B,A->C,B->C\n hanoi(n-1,A,C,B);\n printf(\""Move sheet %d from %c to %c\\n\"",n,A,C);\n hanoi(n-1,B,A,C);\n }\n}\nint main()\n{\n\tios::sync_with_stdio(false);\n\tint n;\n\tcin>>n;\n\thanoi(n,'A','B','C');\n\treturn 0;\n }\n",TIME_LIMIT_EXCEEDED,0,0 1400263365707202560,894e41101a09850d5a743504ea44e97c01c5592642838d813697f2366facd40c,2021-06-03 09:29:36,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nvoid move(int n, char a, char b, char c);\nint i = 1;\nint main()\n{\n int n;\n cin >> n;\n move(n, 'A', 'B', 'C');\n cout<\nusing namespace std;\nlong long count=0;\nvoid move(char x,char y)\n{\n count++;\n}\nvoid hanoi(int n,char a,char b,char c)\n{\n if(n==1)\n {\n move(a,c);\n }else\n {\n hanoi(n-1,a,b,c);\n move(a,c);\n hanoi(n-1,b,c,a);\n }\n}\nint main()\n{\n int n;\n cin>>n;\n char a='a';\n char b='b';\n char c='c';\n hanoi(n,a,b,c);\n cout<\n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",WRONG_ANSWER,28,456 1400426542185324544,93cd79b7f3c490f7cca04ec419546cc1a4a1cf9f68797d376b22d80bad0a4856,2021-06-03 20:18:00,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF&n<5000){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",WRONG_ANSWER,21,328 1403684453109121024,8314ed43ccc223cd5d3690a9a3eb1ee3fcec502952bab3838cb6e0c010cdcd4c,2021-06-12 20:03:47,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = input()\nprint(2**n-1)\n,ACCEPTED,81,3024 1404966943655690240,c2c6dc8c40c4a2a22a6819f20d238a011242997c8a9f97faf7865a051d61954d,2021-06-16 08:59:57,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),COMPILE_ERROR,0,0 1404966983820345344,c2c6dc8c40c4a2a22a6819f20d238a011242997c8a9f97faf7865a051d61954d,2021-06-16 09:00:06,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,134,3252 1405311020389658624,894e41101a09850d5a743504ea44e97c01c5592642838d813697f2366facd40c,2021-06-17 07:47:11,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nvoid move(int n, char a, char b, char c);\nint i = 1;\nint main()\n{\n int n;\n cin >> n;\n move(n, 'A', 'B', 'C');\n cout<\n#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);\nusing namespace std;\nint n,cou=0;\nvoid hanio(int n,char a,char b,char c)\t//b为中间 \n{\n\tcou++;\n\tif(n==1)\n\t{\n\t\tcout<\""<\""<>n;\n\thanio(n,'A','B','C');\n\tcout<\n#define IOS ios::sync_with_stdio(0);\ncin.tie(0);\ncout.tie(0);\nusing namespace std;\nint n,cou=0;\nvoid hanio(int n,char a,char b,char c)\t//b为中间 \n{\n\tcou++;\n\tif(n==1)\n\t{\n\t\tcout<\""<\""<>n;\n\thanio(n,'A','B','C');\n\tcout<\n\n#include\n#define IOS ios::sync_with_stdio(0);\n\nusing namespace std;\nint n,cou=0;\nvoid hanio(int n,char a,char b,char c)\t//b为中间\n{\n\tcou++;\n\tif(n==1)\n\t{\n\t\tcout<\""<\""<>n;\n\thanio(n,'A','B','C');\n\tcout<\n\n#include\n#define IOS ios::sync_with_stdio(0);\n\nusing namespace std;\nint n,cou=0;\nvoid hanio(int n,char a,char b,char c)\t//b为中间\n{\n\tcou++;\n\tif(n==1)\n\t{\n\t\tcout<\""<\""<>n;\n\thanio(n,'A','B','C');\n\tcout<\nusing namespace std;\n \nint n,cou=0;\n \nvoid hanio(int n,char a,char b,char c)\t//b为中间 \n{\n\tcou++;\n\tif(n==1)\n\t{\n\t\tprintf(\""%c-->%c\\n\"",a,c);\n\t}\n\telse\n\t{\n\t\thanio(n-1,a,c,b);\n\t\tprintf(\""%c-->%c\\n\"",a,c);\n\t\thanio(n-1,b,a,c);\n\t}\n}\n \nint main()\n{\n \n\tcin>>n;\n\thanio(n,'A','B','C');\n\tprintf(\""%d\\n\"",cou);\n\treturn 0;\n}\n \n",COMPILE_ERROR,0,0 1405321531202236416,3d2d34d79fe398bb06eb3c60dd64ebb7c43281ccfe6856a03525efb77105a717,2021-06-17 08:28:57,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \nusing namespace std;\n\nlong long int count = 0;\n//将 n 个盘子从 x 借助 y 移动到 z\nint move(int n,char x,char y,char z)\n{\n\tif(n==1){\n\t\tcount++; //将最下面的盘子，从x移动到z\n\t\t//cout << x << \""->\"" << z << endl;\n\t}\n\telse{\n\t\tmove(n-1, x, z, y); //将n-1个盘子，借助z从x移动到y\n\t\t//cout << x << \""->\"" << z << endl;\n\t\tmove(n-1, y, x, z); //将n-1个盘子，借助x从y移动到z\n\t\tcount++;\n\t}\n\treturn count;\n}\n\nint main()\n{\n\tint n;\n\t//cout << \""请输入汉诺塔层数：\"";\n cin >> n;\n\tmove(n,'X','Y','Z'); // X,Y,Z分别表示3个柱子\n\tcout << count << endl;\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1405323626844286976,08fc30247b48359db78195079fbeb6b55a1108c20a69be9089257fd66d189480,2021-06-17 08:37:16,Java,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"public class Hano {\n public static void main(String[] args) {\n ArrayStack begin=new ArrayStack<>(); //第一个杆\n ArrayStack mid=new ArrayStack<>(); //第二个杆\n ArrayStack end=new ArrayStack<>(); //第三个杆\n for(int i=3;i>0;i--){ //先在第一个杆上放三个盘子\n begin.push(i);\n\n }\n hano(3,begin,end,mid); //调用函数\n System.out.println(end);\n\n }\n public static void hano(int count, Stack begin, Stack end, Stack mid){\n if(count==1){\n end.push(begin.pop()); //只有一个盘子的时候\n }else{\n hano(count-1,begin,mid,end); //将上一层的盘子从第一个杆借助第三杆移动到第二个杆\n end.push(begin.pop()); //将第一个杆取出的盘子放在第三个杆\n hano(count-1,mid,end,begin); //将上一层的盘子从第二个杆借助借助第一个杆移动到最后一个杆\n }\n }\n}\n",COMPILE_ERROR,0,0 1405323843186487296,08fc30247b48359db78195079fbeb6b55a1108c20a69be9089257fd66d189480,2021-06-17 08:38:08,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nvoid hanoi(int n,char A,char B,char C)\n{\n if(n==1)//只有一个盘子，就把它直接搬到C\n printf(\""Move sheet %d from %c to %c\\n\"",n,A,C);\n else{//盘子数超过2个，每次处理两个盘子，A->B,A->C,B->C\n hanoi(n-1,A,C,B);\n printf(\""Move sheet %d from %c to %c\\n\"",n,A,C);\n hanoi(n-1,B,A,C);\n }\n}\nint main()\n{\n\tios::sync_with_stdio(false);\n\tint n;\n\tcin>>n;\n\thanoi(n,'A','B','C');\n\treturn 0;\n }\n",TIME_LIMIT_EXCEEDED,0,0 1405323929505263616,08fc30247b48359db78195079fbeb6b55a1108c20a69be9089257fd66d189480,2021-06-17 08:38:29,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\ntypedef long long ll;\nll hanoi(int n,int k)\n{\n if(n==k)//最大的盘子只移动一次\n return 1;\n if(n==1)//只有一个盘子，不需要移动\n return 0;\n return 2*hanoi(n-1,k);//上面n-1层移动两次\n }\nint main()\n{\n ios::sync_with_stdio(false);\n int n,k,t;\n cin>>t;\n while(t--){\n cin>>n>>k;\n cout<\n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t/*这里抽象的很，需要理解为将n个盘子从one座移到three座(借助two座)的过程【其中one、two、three只是个形式位置】 \n\t\t\t\t\t\t\t\t\t\t\t\t\t----后面的hanoi(n-1,one,three,two)其实看成开头的定义hanoi(int n,char one,char two,char three)的形式样子 \n\t\t\t\t\t\t\t\t\t\t\t\t\t也就是one(实际位置如A)借助three(实际位置如C)移动到two(实际位置如B).下面的(3)其实和上面介绍的方法一样 \n\t\t\t\t\t\t\t\t\t\t\t\t\tone、two、three只是个形式位置，但A、B、C才是实际位置*/\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tprintf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""The step to move %d diskes:\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""The total number of times is %d\"",i-1);\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1405324138540986368,08fc30247b48359db78195079fbeb6b55a1108c20a69be9089257fd66d189480,2021-06-17 08:39:18,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nstruct node {\n\tint n;\n\tchar one, two, three;\n}temp, temp2;\nstack st;\n\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\ttemp.n = n;\n\ttemp.one = 'a';\n\ttemp.two = 'b';\n\ttemp.three = 'c';\n\tst.push(temp);\n\twhile (!st.empty()) {\n\t\twhile (!st.empty() && st.top().n > 1) {\n\t\t\ttemp = st.top();\n\t\t\tst.pop();\n\t\t\t\n\t\t\ttemp2.n = temp.n-1;\n\t\t\ttemp2.one = temp.two;\n\t\t\ttemp2.two = temp.one;\n\t\t\ttemp2.three = temp.three;\n\t\t\tst.push(temp2);\n\t\t\t\n\t\t\ttemp2.n = 1;\n\t\t\ttemp2.one = temp.one;\n\t\t\ttemp2.two = temp.two;\n\t\t\ttemp2.three = temp.three;\n\t\t\tst.push(temp2);\n\t\t\t\n\t\t\ttemp2.n = temp.n-1;\n\t\t\ttemp2.one = temp.one;\n\t\t\ttemp2.two = temp.three;\n\t\t\ttemp2.three = temp.two;\n\t\t\tst.push(temp2);\n\t\t}\n\t\t\n\t\ttemp = st.top();\n\t\tst.pop();\n\t\tprintf(\""%c -> %c\\n\"", temp.one, temp.three);\n\t}\n\t\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1405324179724857344,d625f0cef128eefa01cf993045f3ea098cc87fe575646b726729020aa28e2755,2021-06-17 08:39:28,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\n#include \n#define MaxSize 100\ntypedef struct{\n int N;\n char A; //起始柱\n char B; //借助柱\n char C; //目标柱\n}ElementType;\ntypedef struct {\n ElementType Data[MaxSize];\n int top;\n}Stack;//汉诺塔问题的结构类型\nvoid Push(Stack *PtrS, ElementType item){\n //入栈操作\n if (PtrS->top == MaxSize)\n {\n printf(\""The stack is full!\\n\"");\n return;\n }\n else\n {\n PtrS->Data[++(PtrS->top)] = item;\n return;\n }\n}\nElementType Pop(Stack *PtrS){\n if (PtrS->top == -1)\n {\n printf(\""The stack is empty!\\n\"");\n exit(1); //直接终止程序，一般不会出现这个错误\n }\n else\n {\n PtrS->top--;\n return (PtrS->Data[PtrS->top + 1]); //或者是return PtrS->Data[PtrS->top--];\n }\n}\n//借助栈的非递归实现\n void Hanoi(int n){\n ElementType P, toPush;\n Stack S;\n \n P.N = n; P.A = 'a'; P.B = 'b'; P.C = 'c';\n S.top = -1;\n\n Push(&S, P);\n while (S.top != -1) //当堆栈不为空时\n {\n P = Pop(&S);//出栈\n if (P.N == 1)//当只剩一个盘子时，直接由当前柱移动到目的柱\n printf(\""%c -> %c\\n\"", P.A, P.C);\n else\n {\n toPush.N = P.N - 1;\n toPush.A = P.B; toPush.B = P.A; toPush.C = P.C;\n Push(&S, toPush); //将第三步(n - 1, b, a, c)入栈\n toPush.N = 1;\n toPush.A = P.A; toPush.B = P.B; toPush.C = P.C;\n Push(&S, toPush); //将第二步1, a, b, c)入栈\n toPush.N = P.N - 1;\n toPush.A = P.A; toPush.B = P.C; toPush.C = P.B;\n Push(&S, toPush); //将第一步(n - 1, a, c, b)入栈\n }\n }\n }\nint main(){\n int n;\n scanf(\""%d\"", &n);\n if (n <= 0)return 0;\n else Hanoi(n);\n}\n",TIME_LIMIT_EXCEEDED,0,0 1405324212449202176,d625f0cef128eefa01cf993045f3ea098cc87fe575646b726729020aa28e2755,2021-06-17 08:39:36,C,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\n#include \n#define MaxSize 100\ntypedef struct{\n int N;\n char A; //起始柱\n char B; //借助柱\n char C; //目标柱\n}ElementType;\ntypedef struct {\n ElementType Data[MaxSize];\n int top;\n}Stack;//汉诺塔问题的结构类型\nvoid Push(Stack *PtrS, ElementType item){\n //入栈操作\n if (PtrS->top == MaxSize)\n {\n printf(\""The stack is full!\\n\"");\n return;\n }\n else\n {\n PtrS->Data[++(PtrS->top)] = item;\n return;\n }\n}\nElementType Pop(Stack *PtrS){\n if (PtrS->top == -1)\n {\n printf(\""The stack is empty!\\n\"");\n exit(1); //直接终止程序，一般不会出现这个错误\n }\n else\n {\n PtrS->top--;\n return (PtrS->Data[PtrS->top + 1]); //或者是return PtrS->Data[PtrS->top--];\n }\n}\n//借助栈的非递归实现\n void Hanoi(int n){\n ElementType P, toPush;\n Stack S;\n \n P.N = n; P.A = 'a'; P.B = 'b'; P.C = 'c';\n S.top = -1;\n\n Push(&S, P);\n while (S.top != -1) //当堆栈不为空时\n {\n P = Pop(&S);//出栈\n if (P.N == 1)//当只剩一个盘子时，直接由当前柱移动到目的柱\n printf(\""%c -> %c\\n\"", P.A, P.C);\n else\n {\n toPush.N = P.N - 1;\n toPush.A = P.B; toPush.B = P.A; toPush.C = P.C;\n Push(&S, toPush); //将第三步(n - 1, b, a, c)入栈\n toPush.N = 1;\n toPush.A = P.A; toPush.B = P.B; toPush.C = P.C;\n Push(&S, toPush); //将第二步1, a, b, c)入栈\n toPush.N = P.N - 1;\n toPush.A = P.A; toPush.B = P.C; toPush.C = P.B;\n Push(&S, toPush); //将第一步(n - 1, a, c, b)入栈\n }\n }\n }\nint main(){\n int n;\n scanf(\""%d\"", &n);\n if (n <= 0)return 0;\n else Hanoi(n);\n}\n",TIME_LIMIT_EXCEEDED,0,0 1405324235559817216,0400652d4eca3dbe369abf65a8aeedce6292dba02a63f8ebc32ed2095ad72bcc,2021-06-17 08:39:42,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = input()\nprint(2**n-1)\n,ACCEPTED,122,3140 1405324447828963328,d625f0cef128eefa01cf993045f3ea098cc87fe575646b726729020aa28e2755,2021-06-17 08:40:32,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"public class Hano {\n public static void main(String[] args) {\n ArrayStack begin=new ArrayStack<>(); //第一个杆\n ArrayStack mid=new ArrayStack<>(); //第二个杆\n ArrayStack end=new ArrayStack<>(); //第三个杆\n for(int i=3;i>0;i--){ //先在第一个杆上放三个盘子\n begin.push(i);\n\n }\n hano(3,begin,end,mid); //调用函数\n System.out.println(end);\n\n }\n public static void hano(int count, Stack begin, Stack end, Stack mid){\n if(count==1){\n end.push(begin.pop()); //只有一个盘子的时候\n }else{\n hano(count-1,begin,mid,end); //将上一层的盘子从第一个杆借助第三杆移动到第二个杆\n end.push(begin.pop()); //将第一个杆取出的盘子放在第三个杆\n hano(count-1,mid,end,begin); //将上一层的盘子从第二个杆借助借助第一个杆移动到最后一个杆\n }\n }\n}",COMPILE_ERROR,0,0 1405324485062184960,d625f0cef128eefa01cf993045f3ea098cc87fe575646b726729020aa28e2755,2021-06-17 08:40:41,Java,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"public class Hano {\n public static void main(String[] args) {\n ArrayStack begin=new ArrayStack<>(); //第一个杆\n ArrayStack mid=new ArrayStack<>(); //第二个杆\n ArrayStack end=new ArrayStack<>(); //第三个杆\n for(int i=3;i>0;i--){ //先在第一个杆上放三个盘子\n begin.push(i);\n\n }\n hano(3,begin,end,mid); //调用函数\n System.out.println(end);\n\n }\n public static void hano(int count, Stack begin, Stack end, Stack mid){\n if(count==1){\n end.push(begin.pop()); //只有一个盘子的时候\n }else{\n hano(count-1,begin,mid,end); //将上一层的盘子从第一个杆借助第三杆移动到第二个杆\n end.push(begin.pop()); //将第一个杆取出的盘子放在第三个杆\n hano(count-1,mid,end,begin); //将上一层的盘子从第二个杆借助借助第一个杆移动到最后一个杆\n }\n }\n}",COMPILE_ERROR,0,0 1405324684911996928,d625f0cef128eefa01cf993045f3ea098cc87fe575646b726729020aa28e2755,2021-06-17 08:41:29,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \nusing namespace std;\n \nint count = 0;\n//将 n 个盘子从 x 借助 y 移动到 z\nint move(int n,char x,char y,char z)\n{\n\tif(1 == n){\n\t\tcount++; //将最下面的盘子，从x移动到z\n\t\tcout << x << \""->\"" << z << endl;\n\t}\n\telse{\n\t\tmove(n-1, x, z, y); //将n-1个盘子，借助z从x移动到y\n\t\tcout << x << \""->\"" << z << endl;\n\t\tmove(n-1, y, x, z); //将n-1个盘子，借助x从y移动到z\n\t\tcount++;\n\t}\n\treturn count;\n}\n \nint main()\n{\n\tint n;\n\tcout << \""请输入汉诺塔层数：\"";\n cin >> n;\n\tmove(n,'X','Y','Z'); // X,Y,Z分别表示3个柱子\n\tcout << \""共需要移动：\"" << count << \""次\"" << endl;\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1405324922703867904,08fc30247b48359db78195079fbeb6b55a1108c20a69be9089257fd66d189480,2021-06-17 08:42:25,Python,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"\ndef move(n, a, b, c):\n if n == 1:\n print('move', a, '-->', c)\n else:\n move(n-1, a, c, b)\n move(1, a, b, c)\n move(n-1, b, a, c)\n \nmove(4, 'A', 'B', 'C')\n",WRONG_ANSWER,84,3012 1405324946544676864,d625f0cef128eefa01cf993045f3ea098cc87fe575646b726729020aa28e2755,2021-06-17 08:42:31,C,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \n#include \n\nvoid move(int n,char x,char y,char z) //将n个盘子从x借助y移动到z\n{ \n if(1 == n) \n { \n printf(\""%c-->%c\\n\"",x,z); \n } \n else \n { \n move(n-1,x,z,y); //将n-1个盘子从x借助z移动到y\n printf(\""%c-->%c\\n\"",x,z); //将第n个盘子从x移动到z\n move(n-1,y,x,z); //将n-1个盘子从y借助x移动到z\n } \n} \n\nint main(int argc,char **argv)\n{\n int ch;\n int num;\n\n struct option opts[] = {\n {\""number\"",required_argument,NULL,'n'},\n {NULL,0,NULL,0}\n };\n\n while((ch = getopt_long(argc,argv,\""n:\"",opts,NULL)) != -1) //通过命令行传参指定金盘个数\n {\n switch(ch)\n {\n case 'n':\n num = atoi(optarg);\n break;\n\n default:\n break;\n\n }\n }\n\n printf(\""移动步骤如下:\\n\"");\n move(num,'X','Y','Z');\n\n return 0;\n}\n————————————————\n版权声明：本文为CSDN博主「梦小羊」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。\n原文链接：https://blog.csdn.net/weixin_45121946/article/details/106883755",COMPILE_ERROR,0,0 1405324960163581952,08fc30247b48359db78195079fbeb6b55a1108c20a69be9089257fd66d189480,2021-06-17 08:42:34,Python,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"\ndef move(n, a, b, c):\n if n == 1:\n print('move', a, '-->', c)\n else:\n move(n-1, a, c, b)\n move(1, a, b, c)\n move(n-1, b, a, c)\n \nmove(4, 'A', 'B', 'C')\n",WRONG_ANSWER,111,3132 1405324996758499328,d625f0cef128eefa01cf993045f3ea098cc87fe575646b726729020aa28e2755,2021-06-17 08:42:43,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \n#include \n\nvoid move(int n,char x,char y,char z) //将n个盘子从x借助y移动到z\n{ \n if(1 == n) \n { \n printf(\""%c-->%c\\n\"",x,z); \n } \n else \n { \n move(n-1,x,z,y); //将n-1个盘子从x借助z移动到y\n printf(\""%c-->%c\\n\"",x,z); //将第n个盘子从x移动到z\n move(n-1,y,x,z); //将n-1个盘子从y借助x移动到z\n } \n} \n\nint main(int argc,char **argv)\n{\n int ch;\n int num;\n\n struct option opts[] = {\n {\""number\"",required_argument,NULL,'n'},\n {NULL,0,NULL,0}\n };\n\n while((ch = getopt_long(argc,argv,\""n:\"",opts,NULL)) != -1) //通过命令行传参指定金盘个数\n {\n switch(ch)\n {\n case 'n':\n num = atoi(optarg);\n break;\n\n default:\n break;\n\n }\n }\n\n printf(\""移动步骤如下:\\n\"");\n move(num,'X','Y','Z');\n\n return 0;\n}\n————————————————\n版权声明：本文为CSDN博主「梦小羊」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。\n原文链接：https://blog.csdn.net/weixin_45121946/article/details/106883755",COMPILE_ERROR,0,0 1405325920302297088,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-06-17 08:46:23,Java,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.*;\nimport java.util.Scanner;\npublic class Main{\nstatic BigInteger i=1;\npublic class hanoi(int n,char a,char b,char c){\n if(n==1){\n \ti++;////这里是奇数开始和结束都是a-->b； \n \treturn 0;\n\t}\n\thanoi(n-1,a,c,b);\n i++;\n //printf(\""%c-->%c\\n\"",a,b);//如果是偶数，那么就是n==1时是a-->c开始；\n\thanoi(n-1,c,b,a);\n i++;\n}\n\n\tpublic static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int n = in.nextInt();\n hanoi(n,'a','b','c');//有n个盘子，a，b，c分别表示三个座\n System.out.println(i-1);\n return 0;\n}\n}\n",COMPILE_ERROR,0,0 1405326082857127936,08fc30247b48359db78195079fbeb6b55a1108c20a69be9089257fd66d189480,2021-06-17 08:47:02,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,161,3232 1405327520899420160,6e1207a3f874550fc56776afb6a71fd83f4a2fc460e6cf2f4b7604e6483bf122,2021-06-17 08:52:45,Java,20.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n\n}\n",ACCEPTED,882,16624 1405330460011425792,9deb2a12b4aa43019364acccdb9e96021bc2d2770cc3340909170d67741c5f46,2021-06-17 09:04:26,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"public class Hano {\n public static void main(String[] args) {\n ArrayStack begin=new ArrayStack<>(); //第一个杆\n ArrayStack mid=new ArrayStack<>(); //第二个杆\n ArrayStack end=new ArrayStack<>(); //第三个杆\n for(int i=3;i>0;i--){ //先在第一个杆上放三个盘子\n begin.push(i);\n\n }\n hano(3,begin,end,mid); //调用函数\n System.out.println(end);\n\n }\n public static void hano(int count, Stack begin, Stack end, Stack mid){\n if(count==1){\n end.push(begin.pop()); //只有一个盘子的时候\n }else{\n hano(count-1,begin,mid,end); //将上一层的盘子从第一个杆借助第三杆移动到第二个杆\n end.push(begin.pop()); //将第一个杆取出的盘子放在第三个杆\n hano(count-1,mid,end,begin); //将上一层的盘子从第二个杆借助借助第一个杆移动到最后一个杆\n }\n }\n}\n\n",COMPILE_ERROR,0,0 1405330958886522880,c9a3d99112de4f3eb5fe1caba0b9742e941e3f7da5ef553ede680c32b5988e7e,2021-06-17 09:06:25,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t/*这里抽象的很，需要理解为将n个盘子从one座移到three座(借助two座)的过程【其中one、two、three只是个形式位置】 \n\t\t\t\t\t\t\t\t\t\t\t\t\t----后面的hanoi(n-1,one,three,two)其实看成开头的定义hanoi(int n,char one,char two,char three)的形式样子 \n\t\t\t\t\t\t\t\t\t\t\t\t\t也就是one(实际位置如A)借助three(实际位置如C)移动到two(实际位置如B).下面的(3)其实和上面介绍的方法一样 \n\t\t\t\t\t\t\t\t\t\t\t\t\tone、two、three只是个形式位置，但A、B、C才是实际位置*/\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tprintf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""The step to move %d diskes:\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""The total number of times is %d\"",i-1);\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1408312720886394880,4290a1ad2df136d6567da2da78c0ca3815abd9627bada869e3244768c7341f70,2021-06-25 14:34:52,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,#include \n#define maxvalue 0x3f3f3f3f\n// 0x3f3f3f3f是个好东西，有兴趣的可以网上查查，也可以看看我的链接\n//http://blog.csdn.net/u011361880/article/details/77511559\nint main(void)\n{\n int n;\n while(std::cin >> n)\n {\n int *a = new int[n];\n int *step = new int[2*n];\n for(int i=0; i<2*n; ++i)\n {\n if(i> a[i];\n if(i==0)\n step[i] = 0;\n else\n step[i] = maxvalue;\n }\n\n for(int i=0; i step[i+j] ? \\\n step[i+j]:step[i]+1);\n }\n if(step[n] >= maxvalue)\n std::cout << -1 << std::endl;\n else\n std::cout << step[n] << std::endl;\n delete []a;\n delete []step;\n //delete销毁对象要常记\n }\n return 0;\n}\n,WRONG_ANSWER,35,444 1408693681331560448,239f7a073339684eeef0f2da5610edf6c64e3c74bdb1b4cd2d8f91ca10ded5a8,2021-06-26 15:48:40,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nint n;\ncin>>n;\ncout<\nusing namespace std;\nint n;\ncin>>n;\ncout<\n#include\nusing namespace std;\nint n;\nint main(){\ncin>>n;\ncout<\n#include\nusing namespace std;\nint n;\nint main(){\ncin>>n;\ncout<\n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",WRONG_ANSWER,23,432 1410971050537521152,f209127654e540ce77aef646a9f0349ad7f4e51b4b88e1dea4ed985fe8016c60,2021-07-02 22:38:07,Java,20.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n\n}\n",ACCEPTED,781,16892 1410988345821368320,3d2d34d79fe398bb06eb3c60dd64ebb7c43281ccfe6856a03525efb77105a717,2021-07-02 23:46:51,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \nusing namespace std;\nvoid hanoi(int n,char a,char b,char c)\n{\n if(n == 1){\n cout << a << \""-->\"" << c << endl;\n }else{\n \n hanoi(n - 1,a,c,b);\n cout << a << \""-->\"" << c << endl;\n hanoi(n - 1,b,a,c);\n }\n\n \n}\nint main()\n{\n int n;\n cin >> n;\n char a = 'a',b = 'c',c = 'b';\n hanoi(n,a,b,c);\n return 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1410988469578674176,3d2d34d79fe398bb06eb3c60dd64ebb7c43281ccfe6856a03525efb77105a717,2021-07-02 23:47:20,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \nusing namespace std;\n\nlong long int count = 0;\n//将 n 个盘子从 x 借助 y 移动到 z\nint move(int n,char x,char y,char z)\n{\n\tif(n==1){\n\t\tcount++; //将最下面的盘子，从x移动到z\n\t\t//cout << x << \""->\"" << z << endl;\n\t}\n\telse{\n\t\tmove(n-1, x, z, y); //将n-1个盘子，借助z从x移动到y\n\t\t//cout << x << \""->\"" << z << endl;\n\t\tmove(n-1, y, x, z); //将n-1个盘子，借助x从y移动到z\n\t\tcount++;\n\t}\n\treturn count;\n}\n\nint main()\n{\n\tint n;\n\t//cout << \""请输入汉诺塔层数：\"";\n cin >> n;\n\tmove(n,'X','Y','Z'); // X,Y,Z分别表示3个柱子\n\tcout << count << endl;\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1411298847437348864,05d831db9455a0185be7d02ab1ead4bfd3e9b9f11ce3fb4517932a898e9cd35f,2021-07-03 20:20:40,C++,20.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\n#define MAXNUM 6000\nint arr[MAXNUM];\nint main()\n{\n int n,index,i;\n cin>>n;\n index=0;\n memset(arr,0,sizeof(arr));\n arr[0]=2;\n for( i=1; i=10)\n {\n jinwei=1;\n }\n }\n else\n {\n temp=arr[j]*2;\n if(jinwei==1)\n {\n temp=temp+1;\n }\n if(temp>=10)\n {\n jinwei=1;\n }\n else\n {\n jinwei=0;\n }\n }\n arr[j]=temp%10;\n }\n if(jinwei==1)\n {\n index++;\n arr[index]=1;\n }\n }\n for( i=index; i>0; i--)\n {\n cout<\n#include\nusing namespace std;\nlong long count=0;\nint main()\n{\n int n;\n cin>>n;\n cout=pow(2,n)-1;\n cout<\n#include \n#include \nusing namespace std;\nlong long count=0;\nint main()\n{\n int n;\n cin>>n;\n cout=pow(2,n)-1;\n cout<\n#include \n#include \nusing namespace std;\nint main()\n{\n int n;\n cin>>n;\n long long count=0;\n cout=pow(2,n)-1;\n cout<\n#include \n#include \nusing namespace std;\nint main()\n{\n int n;\n cin>>n;\n long long count=0;\n count=pow(2,n)-1;\n cout<\n#include \n#include \n#include \n#include \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",WRONG_ANSWER,29,328 1412755625492938752,9deb2a12b4aa43019364acccdb9e96021bc2d2770cc3340909170d67741c5f46,2021-07-07 20:49:23,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),COMPILE_ERROR,0,0 1412755650574860288,9deb2a12b4aa43019364acccdb9e96021bc2d2770cc3340909170d67741c5f46,2021-07-07 20:49:29,C,0.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),COMPILE_ERROR,0,0 1412755700470308864,9deb2a12b4aa43019364acccdb9e96021bc2d2770cc3340909170d67741c5f46,2021-07-07 20:49:41,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,112,3252 1412778926076387328,1bfebae5761d3e4e5bc3a416dc3df30ef8aa32d90b4d8567bcba03a2dd7936c6,2021-07-07 22:21:58,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),COMPILE_ERROR,0,0 1412779004853796864,1bfebae5761d3e4e5bc3a416dc3df30ef8aa32d90b4d8567bcba03a2dd7936c6,2021-07-07 22:22:17,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,108,3244 1412953947034013696,8dd2a555e9b120b52f7a02bdffe2f120ca4cafa3f47478437e532f230b3daad9,2021-07-08 09:57:27,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,159,3132 1412966034066018304,42627a0cf55a0b4381476e6dfb5a2d336bd684bc99360659dbcfd03483193be5,2021-07-08 10:45:28,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,82,2888 1413079241120190464,b2fa9f7c4dafd838b82b45c15e81c0c9fadd67a896acff952732fcceba5cec02,2021-07-08 18:15:19,C++,20.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\n#define MAXNUM 6000\nint arr[MAXNUM];\nint main()\n{\n int n,index,i;\n cin>>n;\n index=0;\n memset(arr,0,sizeof(arr));\n arr[0]=2;\n for( i=1; i=10)\n {\n jinwei=1;\n }\n }\n else\n {\n temp=arr[j]*2;\n if(jinwei==1)\n {\n temp=temp+1;\n }\n if(temp>=10)\n {\n jinwei=1;\n }\n else\n {\n jinwei=0;\n }\n }\n arr[j]=temp%10;\n }\n if(jinwei==1)\n {\n index++;\n arr[index]=1;\n }\n }\n for( i=index; i>0; i--)\n {\n cout<\nusing namespace std;\ntypedef long long ll;\nll hanoi(int n,int k)\n{\n if(n==k)//最大的盘子只移动一次\n return 1;\n if(n==1)//只有一个盘子，不需要移动\n return 0;\n return 2*hanoi(n-1,k);//上面n-1层移动两次\n }\nint main()\n{\n ios::sync_with_stdio(false);\n int n,k,t;\n cin>>t;\n while(t--){\n cin>>n>>k;\n cout<\nusing namespace std;\ntypedef long long ll;\nll hanoi(int n,int k)\n{\n if(n==k)//最大的盘子只移动一次\n return 1;\n if(n==1)//只有一个盘子，不需要移动\n return 0;\n return 2*hanoi(n-1,k);//上面n-1层移动两次\n }\nint main()\n{\n ios::sync_with_stdio(false);\n int n,k,t;\n cin>>t;\n while(t--){\n cin>>n>>k;\n cout<\n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",WRONG_ANSWER,66,456 1413679214098944000,b5a2eca5a4b855fc198fc36d09381b45d71d94248b41c9a7cd434dfcd953d85b,2021-07-10 09:59:24,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,#include\n#include\nusing namespace std;\nint n;\nint h[110];\nint hnt(int n){\n\th[1]=1;\n\th[2]=3;\n\tfor(int i=3;i<=n;++i) h[i]=2*h[i-1]+1;\n\treturn h[n];\n}\nint main()\n{\n\tcin>>n;\n\tcout<\n#include \nusing namespace std;\n\n//level: 当前要移动的汉诺塔是第level层，最上一层为第一层 \nint move(int level, char start, char end){\n\treturn 1;\n}\nint hanio_3(int n, char a, char b, char c){\n\tif(n == 1) return 1;\n\tint x1 = hanio_3(n - 1, a, c, b);\n\tint x2 = move(n, a, c);\n\tint x3 = hanio_3(n - 1, b, a, c);\n\treturn x1 + x2 + x3;\n}\nint main(){\n\tfor(int i =1; i <= 12; i++){\n\t\tint x = hanio_3(i, 'A', 'B', 'C', 'D');\n\t\tcout<> s >> w;\n HT[i].ch = s[0];\n HT[i].weight = w;\n HT[i].parent = HT[i].lchild = HT[i].rchild = 0;\n }\n for(int i = n + 1;i <= 2*n-1; ++ i) {\n int s1, s2;\n Select(HT, i - 1, s1, s2);\n HT[s1].parent = i;\n HT[s2].parent = i;\n HT[i].weight = HT[s1].weight + HT[s2].weight;\n HT[i].lchild = s1;\n HT[i].rchild = s2;\n }\n}\n",COMPILE_ERROR,0,0 1414787694757830656,1b2f853cd7c57b57341fb28264d6d4cd34830a79da2472591a4d02b4a73661c3,2021-07-13 11:24:06,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"void Select(HuffmanTree HT,int len,int &s1,int &s2)\n{\n int m1 = 1e9, m2 = 1e9;\n for(int i = 1;i <= len; ++ i) {\n if(HT[i].weight < m1 && HT[i].parent == 0) {\n m1 = HT[i].weight;\n s1 = i;\n }\n }\n for(int i = 1;i <= len; ++ i) {\n if(HT[i].weight < m2 && s1 != i && HT[i].parent == 0) {\n m2 = HT[i].weight;\n s2 = i;\n }\n }\n}\nvoid CreatHuffmanTree(HuffmanTree &HT,int n)\n{\n//2*n - 1 \n HT = new HTNode[2*n+1];\n char s[2];\n int w;\n for(int i = 1;i <= n; ++ i) {\n cin >> s >> w;\n HT[i].ch = s[0];\n HT[i].weight = w;\n HT[i].parent = HT[i].lchild = HT[i].rchild = 0;\n }\n for(int i = n + 1;i <= 2*n-1; ++ i) {\n int s1, s2;\n Select(HT, i - 1, s1, s2);\n HT[s1].parent = i;\n HT[s2].parent = i;\n HT[i].weight = HT[s1].weight + HT[s2].weight;\n HT[i].lchild = s1;\n HT[i].rchild = s2;\n }\n}\nvoid CreatHuffmanCode(HuffmanTree HT,HuffmanCode &HC,int n)\n{\n char tmp[n+100];\n for(int i = 1;i <= n; ++ i) {\n HC[i] = new char[n+100];\n int tot = n, fa = HT[i].parent, cur = i;\n tmp[tot] = 0;\n\n while(fa) {\n if(cur == HT[fa].lchild) tmp[--tot] = '0';\n else tmp[--tot] = '1';\n fa = HT[HT[cur].parent].parent;\n cur = HT[cur].parent; \n }\n for(int j = 0;j <= n; ++ j) HC[i][j] = 0;\n for(int j = 0, k = tot;j < n&&k <= n && tmp[k] != 0; ++ j, ++ k) {\n HC[i][j] = tmp[k];\n }\n\n}\n}\n",COMPILE_ERROR,0,0 1414788584316243968,1b2f853cd7c57b57341fb28264d6d4cd34830a79da2472591a4d02b4a73661c3,2021-07-13 11:27:38,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1)\n,COMPILE_ERROR,0,0 1414789588260655104,1b2f853cd7c57b57341fb28264d6d4cd34830a79da2472591a4d02b4a73661c3,2021-07-13 11:31:38,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1)\n,ACCEPTED,133,3140 1414909477305606144,124809a343cbcf17400c07d12a25d1692e367a8c87723a0ba62716eb55b57d95,2021-07-13 19:28:01,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n}",COMPILE_ERROR,0,0 1414909506506350592,124809a343cbcf17400c07d12a25d1692e367a8c87723a0ba62716eb55b57d95,2021-07-13 19:28:08,Java,20.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n}",ACCEPTED,780,16872 1414968970275098624,7c2d53bb37784f5bb30bef5e6ed6756142252368642e30f0a86209cddedbaaa5,2021-07-13 23:24:26,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \nusing namespace std;\nconst int N = 5010;\nchar s1[N], s2[N];\nint n, m, dp[N][N], res;\nint main()\n{\n\tscanf(\""%d%d\"", &n, &m);\n\tscanf(\""%s%s\"",s1+1, s2+1);\n\tfor(int i = 1;i <= n; ++ i) {\n\t\tfor(int j = 1;j <= m; ++ j) {\n\t\t\tif(s1[i] == s2[j]) {\n\t\t\t\tdp[i][j] = max(dp[i][j], dp[i-1][j-1] + 2);\n\t\t\t}else {\n\t\t\t\tdp[i][j] = max(dp[i-1][j], dp[i][j-1]) - 1;\n\t\t\t}\n\t\t\tif(dp[i][j] < 0) dp[i][j] = 0;\n\t\t\tres = max(res, dp[i][j]);\n\t\t}\n\t}\n\tcout << res << \""\\n\"";\n}",WRONG_ANSWER,27,376 1414969024255791104,7c2d53bb37784f5bb30bef5e6ed6756142252368642e30f0a86209cddedbaaa5,2021-07-13 23:24:38,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \nusing namespace std;\nconst int N = 5010;\nchar s1[N], s2[N];\nint n, m, dp[N][N], res;\nint main()\n{\n\tscanf(\""%d%d\"", &n, &m);\n\tscanf(\""%s%s\"",s1+1, s2+1);\n\tfor(int i = 1;i <= n; ++ i) {\n\t\tfor(int j = 1import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n};j <= m; ++ j) {\n\t\t\tif(s1[i] == s2[j]) {\n\t\t\t\tdp[i][j] = max(dp[i][j], dp[i-1][j-1] + 2);\n\t\t\t}else {\n\t\t\t\tdp[i][j] = max(dp[i-1][j], dp[i][j-1]) - 1;\n\t\t\t}\n\t\t\tif(dp[i][j] < 0) dp[i][j] = 0;\n\t\t\tres = max(res, dp[i][j]);\n\t\t}\n\t}\n\tcout << res << \""\\n\"";\n}",COMPILE_ERROR,0,0 1414969050431381504,7c2d53bb37784f5bb30bef5e6ed6756142252368642e30f0a86209cddedbaaa5,2021-07-13 23:24:45,C,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \nusing namespace std;\nconst int N = 5010;\nchar s1[N], s2[N];\nint n, m, dp[N][N], res;\nint main()\n{\n\tscanf(\""%d%d\"", &n, &m);\n\tscanf(\""%s%s\"",s1+1, s2+1);\n\tfor(int i = 1;i <= n; ++ i) {\n\t\tfor(int j = 1import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n};j <= m; ++ j) {\n\t\t\tif(s1[i] == s2[j]) {\n\t\t\t\tdp[i][j] = max(dp[i][j], dp[i-1][j-1] + 2);\n\t\t\t}else {\n\t\t\t\tdp[i][j] = max(dp[i-1][j], dp[i][j-1]) - 1;\n\t\t\t}\n\t\t\tif(dp[i][j] < 0) dp[i][j] = 0;\n\t\t\tres = max(res, dp[i][j]);\n\t\t}\n\t}\n\tcout << res << \""\\n\"";\n}",COMPILE_ERROR,0,0 1414969091124518912,7c2d53bb37784f5bb30bef5e6ed6756142252368642e30f0a86209cddedbaaa5,2021-07-13 23:24:54,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include \nusing namespace std;\nconst int N = 5010;\nchar s1[N], s2[N];\nint n, m, dp[N][N], res;\nint main()\n{\n\tscanf(\""%d%d\"", &n, &m);\n\tscanf(\""%s%s\"",s1+1, s2+1);\n\tfor(int i = 1;i <= n; ++ i) {\n\t\tfor(int j = 1import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n};j <= m; ++ j) {\n\t\t\tif(s1[i] == s2[j]) {\n\t\t\t\tdp[i][j] = max(dp[i][j], dp[i-1][j-1] + 2);\n\t\t\t}else {\n\t\t\t\tdp[i][j] = max(dp[i-1][j], dp[i][j-1]) - 1;\n\t\t\t}\n\t\t\tif(dp[i][j] < 0) dp[i][j] = 0;\n\t\t\tres = max(res, dp[i][j]);\n\t\t}\n\t}\n\tcout << res << \""\\n\"";\n}",COMPILE_ERROR,0,0 1414969248943595520,7c2d53bb37784f5bb30bef5e6ed6756142252368642e30f0a86209cddedbaaa5,2021-07-13 23:25:32,Java,20.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n}",ACCEPTED,793,16840 1415134742640500736,68e36bdd2d70a7f3e92d0a58ac743599e242ad8000e40ba49f310073ffd1604f,2021-07-14 10:23:09,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),COMPILE_ERROR,0,0 1415134792041013248,68e36bdd2d70a7f3e92d0a58ac743599e242ad8000e40ba49f310073ffd1604f,2021-07-14 10:23:21,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,110,3132 1415160581046312960,1582093208633858b7316bfdb557e169121e7723dedc5a57537c54d80d1cc505,2021-07-14 12:05:49,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),COMPILE_ERROR,0,0 1415160631554121728,1582093208633858b7316bfdb557e169121e7723dedc5a57537c54d80d1cc505,2021-07-14 12:06:01,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,96,2996 1415186595474481152,2f115508126cd1d58ee7ceb739cba99ade1cf3bc7c3c37a77355015aa3a3a3df,2021-07-14 13:49:11,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n}",COMPILE_ERROR,0,0 1415186619910496256,2f115508126cd1d58ee7ceb739cba99ade1cf3bc7c3c37a77355015aa3a3a3df,2021-07-14 13:49:17,C,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n}",COMPILE_ERROR,0,0 1415186704861929472,2f115508126cd1d58ee7ceb739cba99ade1cf3bc7c3c37a77355015aa3a3a3df,2021-07-14 13:49:37,Java,20.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n}",ACCEPTED,743,16904 1415191728623099904,7473e82cf4f37384bcbdc4608e550e331bcdad108fae040cf0e8003e2b6e8805,2021-07-14 14:09:35,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,99,3140 1415195320155283456,93cd79b7f3c490f7cca04ec419546cc1a4a1cf9f68797d376b22d80bad0a4856,2021-07-14 14:23:52,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = input()\nprint(2**n-1),ACCEPTED,80,3016 1415202002025209856,894e41101a09850d5a743504ea44e97c01c5592642838d813697f2366facd40c,2021-07-14 14:50:25,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,97,3132 1415204037881651200,f3fdc43fbc67054d99874af3a8f1a5a35e63f6b68b54ef00d1a161c9cacbd1f9,2021-07-14 14:58:30,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),COMPILE_ERROR,0,0 1415204077777870848,f3fdc43fbc67054d99874af3a8f1a5a35e63f6b68b54ef00d1a161c9cacbd1f9,2021-07-14 14:58:40,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,124,3140 1415215404605153280,3121815fa792ca671a96a327d01c2faf097711310c4107211d8f6706b76b4faf,2021-07-14 15:43:40,Java,20.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n}",ACCEPTED,766,16608 1415223297186095104,c9a3d99112de4f3eb5fe1caba0b9742e941e3f7da5ef553ede680c32b5988e7e,2021-07-14 16:15:02,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),COMPILE_ERROR,0,0 1415223320724529152,c9a3d99112de4f3eb5fe1caba0b9742e941e3f7da5ef553ede680c32b5988e7e,2021-07-14 16:15:07,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,94,3252 1415244886225084416,5217244af6fc32d6e3c621e3af60ab33ec53590a62a586f50f6803fab08eecf4,2021-07-14 17:40:49,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,69,3016 1415250698179862528,4ea51d4012f69afaefcb94a0a31945972003108b7d4c967b52d3df971cd934fe,2021-07-14 18:03:55,nodejs,0.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1)\n,NON_ZERO_EXIT_CODE,236,6776 1415253909494472704,5de2431ce5fe393b4680ac9627514e8749bff89831165d0c2f884a274b284ff8,2021-07-14 18:16:40,Python,0.0,1379951400336728064,1313471683597295616,1039132196031492096,//Python\nn = int(input())\nprint(2**n-1)\n,NON_ZERO_EXIT_CODE,79,3012 1415253944575352832,5de2431ce5fe393b4680ac9627514e8749bff89831165d0c2f884a274b284ff8,2021-07-14 18:16:49,Python,0.0,1379951400336728064,1313471683597295616,1039132196031492096,//Python\nn = int(input())\nprint(2**n-1)\n,NON_ZERO_EXIT_CODE,92,3116 1415255186911698944,5de2431ce5fe393b4680ac9627514e8749bff89831165d0c2f884a274b284ff8,2021-07-14 18:21:45,C,0.0,1379951400336728064,1313471683597295616,1039132196031492096,//Python\nn = int(input())\nprint(2**n-1)\n,COMPILE_ERROR,0,0 1415255261087686656,5de2431ce5fe393b4680ac9627514e8749bff89831165d0c2f884a274b284ff8,2021-07-14 18:22:03,Python,0.0,1379951400336728064,1313471683597295616,1039132196031492096,//Python\nn = int(input())\nprint(2**n-1)\n,NON_ZERO_EXIT_CODE,121,2964 1415255361243750400,5de2431ce5fe393b4680ac9627514e8749bff89831165d0c2f884a274b284ff8,2021-07-14 18:22:26,Python,0.0,1379951400336728064,1313471683597295616,1039132196031492096,/*Python*/\nn = int(input())\nprint(2**n-1)\n,NON_ZERO_EXIT_CODE,82,2884 1415255707420631040,5de2431ce5fe393b4680ac9627514e8749bff89831165d0c2f884a274b284ff8,2021-07-14 18:23:49,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,\nn = int(input())\nprint(2**n-1)\n,ACCEPTED,104,3124 1415256360364433408,450481621303844ba3b95ae06368a4e1b38c338347d6f13b82e439aeab42b5a6,2021-07-14 18:26:25,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),COMPILE_ERROR,0,0 1415256427162918912,450481621303844ba3b95ae06368a4e1b38c338347d6f13b82e439aeab42b5a6,2021-07-14 18:26:41,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,150,3128 1415269342398291968,c2c6dc8c40c4a2a22a6819f20d238a011242997c8a9f97faf7865a051d61954d,2021-07-14 19:18:00,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,129,3132 1415269759957753856,b5a2eca5a4b855fc198fc36d09381b45d71d94248b41c9a7cd434dfcd953d85b,2021-07-14 19:19:39,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,107,3132 1415271146854981632,ae46fa86a01f70b251f4b49b850c725dac3b7d5c7ff5913e3bad8bd957e373e4,2021-07-14 19:25:10,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,78,2876 1415289714455781376,98762ee77685116c1a11cc5ccc0f95a97f1fcfb3d27db0196fc5c04b2360fd7a,2021-07-14 20:38:57,Java,20.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n}",ACCEPTED,752,16420 1415291166397997056,59bd789fd165ae06e2d20896ce4d8f333f43dd390990c572fea3c4b1d357de03,2021-07-14 20:44:43,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n}",COMPILE_ERROR,0,0 1415291241849331712,59bd789fd165ae06e2d20896ce4d8f333f43dd390990c572fea3c4b1d357de03,2021-07-14 20:45:01,Java,20.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n}",ACCEPTED,773,16716 1415294163362144256,654bcb5512144d0e212795b09f883fccc040d52895daac18eee65339cd9868c0,2021-07-14 20:56:38,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n}",COMPILE_ERROR,0,0 1415294256463110144,654bcb5512144d0e212795b09f883fccc040d52895daac18eee65339cd9868c0,2021-07-14 20:57:00,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n}",COMPILE_ERROR,0,0 1415294279913463808,654bcb5512144d0e212795b09f883fccc040d52895daac18eee65339cd9868c0,2021-07-14 20:57:05,Java,20.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n}",ACCEPTED,743,16720 1415297572131725312,a2e31f121e4406a39b2465e17dc2c78cb337311da52fa65709419af15d9c9b3c,2021-07-14 21:10:10,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n}",COMPILE_ERROR,0,0 1415297971853090816,a2e31f121e4406a39b2465e17dc2c78cb337311da52fa65709419af15d9c9b3c,2021-07-14 21:11:46,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n}",COMPILE_ERROR,0,0 1415298005348802560,a2e31f121e4406a39b2465e17dc2c78cb337311da52fa65709419af15d9c9b3c,2021-07-14 21:11:54,Java,20.0,1379951400336728064,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t public static void main(String[] args) {\n\t BigInteger a = BigInteger.ONE;\n\t BigInteger b = new BigInteger(\""2\"");\n\t \n\t Scanner sc = new Scanner(System.in);\n\t int n= sc.nextInt();\n\t for(int i = 1;i <=n;i++)\n\t a = a.multiply(b);\n\t a = a.subtract(BigInteger.ONE);\n\t System.out.println(a);\n\t }\n}",ACCEPTED,713,16936 1415302833328529408,ff823534e3162961b09eb3f7ef6e8e0d042498f2eba83781cae25b9c1fad6a5d,2021-07-14 21:31:05,C++,0.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),COMPILE_ERROR,0,0 1415302909698138112,0984049ce406e586bc5736b464c97e45752ec7a6e67857344dd70ee7bc873745,2021-07-14 21:31:23,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,190,3168 1415302996772167680,ff823534e3162961b09eb3f7ef6e8e0d042498f2eba83781cae25b9c1fad6a5d,2021-07-14 21:31:44,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,97,3132 1415322205522665472,b5a2eca5a4b855fc198fc36d09381b45d71d94248b41c9a7cd434dfcd953d85b,2021-07-14 22:48:03,Python,0.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2*n-1),WRONG_ANSWER,117,3136 1415322237080330240,b5a2eca5a4b855fc198fc36d09381b45d71d94248b41c9a7cd434dfcd953d85b,2021-07-14 22:48:11,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,132,3244 1415341253685846016,2547cbc36565312c72f867da2de23e8155b675d8f3452bf33f40d887cb49e90b,2021-07-15 00:03:45,Python,20.0,1379951400336728064,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1)\n,ACCEPTED,115,3132 1415350552226848768,03f3e76ca46862302076beaa3212fe3e0c42d25d8aec765e08770dc964b656f4,2021-07-15 00:40:42,C++,20.0,1379951400336728064,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\n#define MAXNUM 6000\nint arr[MAXNUM];\nint main()\n{\n int n,index,i;\n cin>>n;\n index=0;\n memset(arr,0,sizeof(arr));\n arr[0]=2;\n for( i=1; i=10)\n {\n jinwei=1;\n }\n }\n else\n {\n temp=arr[j]*2;\n if(jinwei==1)\n {\n temp=temp+1;\n }\n if(temp>=10)\n {\n jinwei=1;\n }\n else\n {\n jinwei=0;\n }\n }\n arr[j]=temp%10;\n }\n if(jinwei==1)\n {\n index++;\n arr[index]=1;\n }\n }\n for( i=index; i>0; i--)\n {\n cout<\nusing namespace std;\n#define MAXNUM 6000\nint arr[MAXNUM];\nint main()\n{\n int n,index,i;\n cin>>n;\n index=0;\n memset(arr,0,sizeof(arr));\n arr[0]=2;\n for( i=1; i=10)\n {\n jinwei=1;\n }\n }\n else\n {\n temp=arr[j]*2;\n if(jinwei==1)\n {\n temp=temp+1;\n }\n if(temp>=10)\n {\n jinwei=1;\n }\n else\n {\n jinwei=0;\n }\n }\n arr[j]=temp%10;\n }\n if(jinwei==1)\n {\n index++;\n arr[index]=1;\n }\n }\n for( i=index; i>0; i--)\n {\n cout<\nusing namespace std;\nvoid rev(char x[]) \n{\n\tint i,n=strlen(x);\n\tchar t;\n\tfor(i=0;i\nusing namespace std;\nvoid reverse(char x[10])\n{\n\tint i,n=strlen(x);\n\tchar t;\n\tfor(i=0;i>x;\n s[0]='2';\n reverse(s);\n for(i=0;i\n#include\nusing namespace std;\nvoid rev(char x[])\n{\n\tint i,n=strlen(x);\n\tchar s;\n\tfor(i=0;i=0&&x[i]=='0';i--);\n\tx[i+1]=0;\n\trev(x);\n}\nint main()\n{\n\tchar s[6000];\n\tint n;\n\twhile(cin>>n)\n\t{\n\t\tpow2(n,s);\n\t\tsub1(s);\n\t\tcout<\nusing namespace std;\nvoid rev(char x[])\n{\n\tint i,n=strlen(x);\n\tchar s;\n\tfor(i=0;i=0&&x[i]=='0';i--);\n\tx[i+1]=0;\n\trev(x);\n}\nint main()\n{\n\tchar s[6000];\n\tint n;\n\twhile(cin>>n)\n\t{\n\t\tpow2(n,s);\n\t\tsub1(s);\n\t\tcout<\n#include\nusing namespace std;\nvoid rev(char x[])\n{\n\tint i,n=strlen(x);\n\tchar s;\n\tfor(i=0;i=0&&x[i]=='0';i--);\n\tx[i+1]=0;\n\trev(x);\n}\nint main()\n{\n\tchar s[6000];\n\tint n;\n\twhile(cin>>n)\n\t{\n\t\tpow2(n,s);\n\t\tsub1(s);\n\t\tcout<\n#include\nusing namespace std;\nvoid rev(char x[])\n{\n\tint i,n=strlen(x);\n\tchar s;\n\tfor(i=0;i=0&&x[i]=='0';i--);\n\tx[i+1]=0;\n\trev(x);\n}\nint main()\n{\n\tchar s[6000];\n\tint n;\n\twhile(cin>>n)\n\t{\n\t\tpow2(n,s);\n\t\tsub1(s);\n\t\tcout<\n#include\nusing namespace std;\nvoid rev(char x[])\n{\n\tint i,n=strlen(x);\n\tchar s;\n\tfor(i=0;i=0&&x[i]=='0';i--);\n\tx[i+1]=0;\n\trev(x);\n}\nint main()\n{\n\tchar s[6000];\n\tint n;\n\twhile(cin>>n)\n\t{\n\t\tpow2(n,s);\n\t\tsub1(s);\n\t\tcout<\nusing namespace std;\ntypedef long long ll;\nll hanoi(int n,int k){\n if(n==k)return 1;\n if(n==1)return 0;\n return 2*hanoi(n-1,k);\n}\nint main(){\n ios::sync_with_stdio(false);\n int n;\n cin>>n;\n cout<\nusing namespace std;\ntypedef unsigned long long ll;\nll hanoi(int n,int k){\n if(n==k)return 1;\n if(n==1)return 0;\n return 2*hanoi(n-1,k);\n}\nint main(){\n ios::sync_with_stdio(false);\n int n;\n cin>>n;\n cout<\nusing namespace std;\ntypedef float ll;\nll hanoi(int n,int k){\n if(n==k)return 1;\n if(n==1)return 0;\n return 2*hanoi(n-1,k);\n}\nint main(){\n ios::sync_with_stdio(false);\n int n;\n cin>>n;\n cout<\nint read(){\n int n=0;char c=getchar();bool f=0;\n while(c!='-'&&(c<'0'||c>'9'))c=getchar();\n if(c=='-'){f=1;c=getchar();}\n while(c>='0'&&c<='9'){n=n*10+c-'0';c=getchar();}\n if(f)return -n;\n return n;\n}\nint n;\nint ls[5000];\nint len=1;\nint main(){\n n=read();\n ls[0]=1;\n for(int i=1;i<=n;i++){\n for(int j=0;j=10){\n ls[j]-=10;\n ls[j+1]++;\n }\n }\n if(ls[len])len++;\n }\n ls[0]--;\n for(int j=len-1;j>=0;j--){\n putchar('0'+ls[j]);\n }\n putchar('\\n');\n},ACCEPTED,93,384 1378159495948599296,4dad150b49966f918e36e6b82af0e8b31a1eeea303b65259cd73cbef03c1eac5,2021-04-03 09:36:43,C++,20.0,1375314185281409024,1313471683597295616,1039132196031492096,"#include\n#include\n#include\n#include\nusing namespace std;\ntypedef long long ll;\nstring han[5050];\nstring ad(string a, string b)\n{string c = \""\"";\n int add = 0;\n reverse(a.begin(), a.end());\n reverse(b.begin(), b.end());\n for(int i = 0; i < b.size(); i++)\n {\n int x = a[i] - '0';\n int y = b[i] - '0';\n c += ((x + y + add) % 10 + '0');\n add = (x + y + add) / 10;\n\n }\n for(int i = b.size(); i < a.size(); i++)\n {\n int x = a[i] - '0';\n int y = 0;\n c += ((x + y + add) % 10 + '0');\n add = (x + y + add) / 10;\n\n }\n if(add)\n {\n c += (add + '0');\n }\n reverse(c.begin(), c.end());\n return c;\n}\nint main()\n{\n int n;\n cin >>n;\n han[1] = \""1\"";\n for(int i = 2; i <= n ;i++)\n {\n han[i] =ad(ad(han[i-1], han[i -1]), \""1\"");\n }\n\n cout << han[n];\n return 0;\n}\n",ACCEPTED,63,5056 1380183685312028672,ac1a0407c2564cde80cdf586d009daa9e9994785f5e276249eb3405f68b9d82e,2021-04-08 23:40:07,C++,20.0,1375314185281409024,1313471683597295616,1039132196031492096,"#include\nint c[5000],len;\nvoid mult(){\n for(register int i=1;i<=len;++i){\n c[i]<<=1;\n }\n for(register int i=1;i<=len;++i){\n if(c[i]>=10)c[i+1]+=c[i]/10;\n c[i]%=10;\n }\n if(c[len+1]!=0)++len;\n}\nint main(){\n int n;\n scanf(\""%d\"",&n);\n c[1]=1,len=1;\n for(register int i=1;i<=n;++i)mult();\n c[1]--;\n for(register int i=len;i>=1;--i)printf(\""%d\"",c[i]);\n \n return 0;\n}",ACCEPTED,59,324 1380778343415238656,c3cdf811e2a845d374d310fe52efc5a68ea3506551425554305e0e51d55bbc0a,2021-04-10 15:03:05,C++,20.0,1375314185281409024,1313471683597295616,1039132196031492096,"#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#define ll long long\n#define inf 0x3f3f3f3f\nusing namespace std;\ninline int read()\n{\n int x=0,fu=1;char o=getchar();\n while(o>'9'||o<'0'){if(o=='-')fu=-1;o=getchar();}\n while(o>='0'&&o<='9'){x=(x<<3)+(x<<1)+(o^48);o=getchar();}\n return x*fu;\n}\nint n,a[100010],b[100010];\nvoid write(int* a)\n{\n for(int i=a[0];i>=1;i--)\n printf(\""%d\"",a[i]);\n printf(\""\\n\"");\n}\nvoid multiply(int* a,int b,int* c)\n{\n int k=0;\n c[0]=a[0];\n for(int i=1;i<=c[0];i++)\n {\n c[i]=a[i]*b+k;\n k=c[i]/10;\n c[i]%=10;\n }\n while(k){c[0]++;c[c[0]]+=(k%10);k/=10;}\n}\nvoid subtract(int* a,int* b,int* c)\n{\n int k=0;\n if(b[0]>a[0])swap(a,b); \n c[0]=a[0];\n for(int i=1;i<=c[0];i++)\n {\n c[i]=a[i]-b[i]-k;\n k=0;\n if(c[i]<0)c[i]+=10,k++;\n }\n while(!c[c[0]])c[0]--;\n}\nint main()\n{\n\tn=read();a[0]=b[0]=a[1]=b[1]=1;\n\twhile(n--)multiply(a,2,a);\n\tsubtract(a,b,a);\n\twrite(a);\n\treturn 0;\n}",ACCEPTED,39,376 1380790471199178753,89e14e9d63617842f1d2d2c4fdcdbf870f5c02adc48a316fd04093d851b43273,2021-04-10 15:51:16,C++,17.0,1375314185281409024,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nstring gaojin(string a,string b){\n int k=0;\n int res;\n string c;\n int l1=a.length();\n for(int i=l1-1;i>=0;i--){\n res=(a[i]-'0')+(b[i]-'0')+k;\n k=res/10;\n res=res%10;\n c=char(res+'0')+c;\n }\n if(k!=0)c=char(k+'0')+c;\n return c;\n}\nstring sub(string str1,string str2)//高精度减法\n{\n string str;\n int tmp=str1.length()-str2.length();\n int cf=0;\n for(int i=str2.length()-1;i>=0;i--)\n {\n if(str1[tmp+i]=0;i--)\n {\n if(str1[i]-cf>='0')\n {\n str=char(str1[i]-cf)+str;\n cf=0;\n }\n else\n {\n str=char(str1[i]-cf+10)+str;\n cf=1;\n }\n }\n str.erase(0,str.find_first_not_of('0'));//去除结果中多余的前导0\n return str;\n}\nint main(){\n int n;\n cin>>n;\n string c=\""1\"";\n while(n--){\n c=gaojin(c,c);\n }\n string d=\""1\"";\n c=sub(c,d);\n cout<\nusing namespace std;\nstring gaojin(string a,string b){\n int k=0;\n int res;\n string c;\n int l1=a.length();\n for(int i=l1-1;i>=0;i--){\n res=(a[i]-'0')+(b[i]-'0')+k;\n k=res/10;\n res=res%10;\n c=char(res+'0')+c;\n }\n if(k!=0)c=char(k+'0')+c;\n return c;\n}\nstring sub(string str1)\n{\n int l1=str1.length();\n int a=(str1[l1-1]-'0')-1;\n str1.erase(l1-1,1);\n str1=str1+char(a+'0');\n return str1;\n}\nint main(){\n int n;\n cin>>n;\n string c=\""1\"";\n while(n--){\n c=gaojin(c,c);\n }\n string d=\""1\"";\n c=sub(c);\n cout<\nusing namespace std;\nstring gaojin(string a){\n int k=0;\n int qq;\n int l1=a.length();\n string res;\n for(int i=l1-1;i>=0;i--){\n qq=(a[i]-'0')*2+k;\n k=qq/10;\n qq=qq%10;\n res=char(qq+'0')+res;\n }\n if(k!=0)res=char(k+'0')+res;\n return res;\n}\nstring sub(string str1)\n{\n int l1=str1.length();\n int a=(str1[l1-1]-'0')-1;\n str1.erase(l1-1,1);\n str1=str1+char(a+'0');\n return str1;\n}\nint main(){\n int n;\n cin>>n;\n string c=\""1\"";\n while(n--){\n c=gaojin(c);\n }\n string d=\""1\"";\n c=sub(c);\n cout<\n#include \n#include \nusing namespace std;\n\n#define MAXN 9999\n#define MAXSIZE 500 //最大长度\n#define DLEN 4\n\nclass BigNum\n{\nprivate:\n int a[210]; //控制大数的位数\n int len; //长度\npublic:\n BigNum() { len = 1; memset(a, 0, sizeof(a)); } //构造函数\n void XD();\n BigNum(const int);\n BigNum(const long long int);\n BigNum(const char*);\n BigNum(const string&);\n BigNum(const BigNum&); //拷贝构造函数\n BigNum& operator = (const BigNum&); //重载赋值运算符\n BigNum& operator = (const int&);\n BigNum& operator = (const long long int&);\n\n friend istream& operator >> (istream&, BigNum&); //重载输入运算符\n friend ostream& operator << (ostream&, BigNum&); //重载输出运算符\n\n template BigNum operator << (const T&) const;\n template BigNum operator >> (const T&) const;\n\n BigNum operator + (const BigNum&) const; //重载加法运算符，大数加大数\n BigNum operator - (const BigNum&) const; //重载减法运算符，大数减大数\n BigNum operator * (const BigNum&) const; //重载乘法运算符，大数乘大数\n bool operator > (const BigNum& b)const; //重载大于\n bool operator < (const BigNum& b) const; //重载小于\n bool operator == (const BigNum& b) const; //重载等于符号\n template BigNum operator / (const T&) const; //重载除法运算符，大数除整数\n template BigNum operator ^ (const T&) const; //大数的n次方\n template T operator % (const T&) const; //大数对int取模\n\n template BigNum operator + (const T& b) const { BigNum t = b; t = *this + t; return t; }\n template BigNum operator - (const T& b) const { BigNum t = b; t = *this - t; return t; }\n template BigNum operator * (const T& b) const { BigNum t = b; t = (*this) * t; return t; }\n template bool operator < (const T& b) const { BigNum t = b; return ((*this) < t); }\n template bool operator > (const T& b) const { BigNum t = b; return ((*this) > t); }\n template bool operator == (const T& b) const { BigNum t = b; return ((*this) == t); }\n\n bool operator <= (const BigNum& b) const { return (*this) < b || (*this) == b; }\n bool operator >= (const BigNum& b) const { return (*this) > b || (*this) == b; }\n bool operator != (const BigNum& b) const { return !((*this) == b); }\n\n template bool operator >= (const T& b) const { BigNum t = b; return !((*this) < t); }\n template bool operator <= (const T& b) const { BigNum t = b; return !((*this) > t); }\n template bool operator != (const T& b) const { BigNum t = b; return !((*this) == t); }\n\n BigNum& operator += (const BigNum& b) { *this = *this + b; return *this; }\n BigNum& operator -= (const BigNum& b) { *this = *this - b; return *this; }\n BigNum& operator *= (const BigNum& b) { *this = *this * b; return *this; }\n template BigNum& operator /= (const T& b) { *this = *this / b; return *this; }\n template BigNum& operator %= (const T& b) { *this = *this % b; return *this; }\n template BigNum& operator += (const T& b) { *this = *this + b; return *this; }\n template BigNum& operator -= (const T& b) { *this = *this - b; return *this; }\n template BigNum& operator *= (const T& b) { *this = *this * b; return *this; }\n template BigNum& operator ^= (const T& b) { *this = *this ^ b; return *this; }\n\n BigNum operator ++ (int) { BigNum t = *this; *this += 1; return t; }\n BigNum operator -- (int) { BigNum t = *this; *this -= 1; return t; }\n BigNum& operator -- () { *this -= 1; return *this; }\n BigNum& operator ++ () { *this += 1; return *this; }\n\n template BigNum& operator <<= (const T& b) { *this = *this << b; return *this; }\n template BigNum& operator >>= (const T& b) { *this = *this >> b; return *this; }\n\n template BigNum friend operator + (const T& a, const BigNum& b) { BigNum t = a; t = t + a; return t; }\n template BigNum friend operator - (const T& a, const BigNum& b) { BigNum t = a; t = t - b; return t; }\n template BigNum friend operator * (const T& a, const BigNum& b) { BigNum t = a; t = t * b; return t; }\n template friend bool operator < (const T& a, const BigNum& b) { return b > a; }\n template friend bool operator > (const T& a, const BigNum& b) { return b < a; }\n template friend bool operator <= (const T& a, const BigNum& b) { return b >= a; }\n template friend bool operator >= (const T& a, const BigNum& b) { return b <= a; }\n template friend bool operator == (const T& a, const BigNum& b) { return b == a; }\n template friend bool operator != (const T& a, const BigNum& b) { return b != a; }\n\n void print(); //输出大数\n int Size(); //返回大数长度\n int the_first(); //返回第一个数字\n int the_last(); //返回最后一位数字\n int to_int(); //转化为整数\n long long int to_long();\n string to_String(); //转化为string类型\n //char* to_char();\n};\n\nBigNum::BigNum(const int b) //将一个int类型的变量转化为大数\n{\n int c, d = b;\n len = 0;\n memset(a, 0, sizeof(a));\n while (d > MAXN) {\n c = d - (d / (MAXN + 1)) * (MAXN + 1);\n d = d / (MAXN + 1);\n a[len++] = c;\n }\n a[len++] = d;\n}\nBigNum::BigNum(const long long int b)\n{\n long long int c, d = b;\n len = 0;\n memset(a, 0, sizeof(a));\n while (d > MAXN) {\n c = d - (d / (MAXN + 1)) * (MAXN + 1);\n d = d / (MAXN + 1);\n a[len++] = c;\n }\n a[len++] = d;\n}\nBigNum::BigNum(const string& s)\n{\n int t, k, index, l, i;\n memset(a, 0, sizeof(a));\n l = s.size();\n len = l / DLEN;\n if (l % DLEN)\n len++;\n index = 0;\n for (i = l - 1; i >= 0; i -= DLEN) {\n t = 0;\n k = i - DLEN + 1;\n if (k < 0) k = 0;\n for (int j = k; j <= i; j++)\n t = t * 10 + s[j] - '0';\n a[index++] = t;\n }\n}\nBigNum::BigNum(const char* s) //将一个字符串类型的变量转化为大数\n{\n int t, k, index, l, i;\n memset(a, 0, sizeof(a));\n l = strlen(s);\n len = l / DLEN;\n if (l % DLEN)\n len++;\n index = 0;\n for (i = l - 1; i >= 0; i -= DLEN) {\n t = 0;\n k = i - DLEN + 1;\n if (k < 0) k = 0;\n for (int j = k; j <= i; j++)\n t = t * 10 + s[j] - '0';\n a[index++] = t;\n }\n}\nBigNum::BigNum(const BigNum& b) : len(b.len) //拷贝构造函数\n{\n memset(a, 0, sizeof(a));\n for (int i = 0; i < len; i++)\n a[i] = b.a[i];\n}\nBigNum& BigNum::operator = (const BigNum& n) //重载赋值运算符，大数之间进行赋值运算\n{\n len = n.len;\n memset(a, 0, sizeof(a));\n for (int i = 0; i < len; i++)\n a[i] = n.a[i];\n return *this;\n}\nBigNum& BigNum::operator = (const int& num)\n{\n BigNum t(num);\n *this = t;\n return *this;\n}\nBigNum& BigNum::operator = (const long long int& num)\n{\n BigNum t(num);\n *this = t;\n return *this;\n}\nvoid XD()\n{\n cout << \""A hidden egg! Good luck for u!\"" << endl;\n}\nistream& operator >> (istream& in, BigNum& b) //重载输入运算符\n{\n char ch[MAXSIZE * 4];\n int i = -1;\n in >> ch;\n int l = strlen(ch);\n int cnt = 0, sum = 0;\n for (i = l - 1; i >= 0; ) {\n sum = 0;\n int t = 1;\n for (int j = 0; j < 4 && i >= 0; j++, i--, t *= 10)\n sum += (ch[i] - '0') * t;\n b.a[cnt] = sum;\n cnt++;\n }\n b.len = cnt++;\n return in;\n\n}\nostream& operator << (ostream& out, BigNum& b) //重载输出运算符\n{\n int i;\n cout << b.a[b.len - 1];\n for (i = b.len - 2; i >= 0; i--) {\n cout.width(DLEN);\n cout.fill('0');\n cout << b.a[i];\n }\n return out;\n}\n\ntemplate BigNum BigNum::operator << (const T& b) const\n{\n T temp = 1;\n for (int i = 0; i < b; i++)\n temp *= 2;\n BigNum t = (*this) * temp;\n return t;\n}\ntemplate BigNum BigNum::operator >> (const T& b) const\n{\n T temp = 1;\n for (int i = 0; i < b; i++)\n temp *= 2;\n BigNum t = (*this) / temp;\n return t;\n}\n\nBigNum BigNum::operator + (const BigNum& b) const //两个大数之间的相加运算\n{\n BigNum t(*this);\n int i, big;\n big = b.len > len ? b.len : len;\n for (i = 0; i < big; i++) {\n t.a[i] += b.a[i];\n if (t.a[i] > MAXN) {\n t.a[i + 1]++;\n t.a[i] -= MAXN + 1;\n }\n }\n if (t.a[big] != 0)\n t.len = big + 1;\n else\n t.len = big;\n return t;\n}\nBigNum BigNum::operator - (const BigNum& b) const //两个大数之间的相减运算\n{\n int i, j, big;\n bool flag;\n BigNum t1, t2;\n if (*this > b) {\n t1 = *this;\n t2 = b;\n flag = 0;\n }\n else {\n t1 = b;\n t2 = *this;\n flag = 1;\n }\n big = t1.len;\n for (i = 0; i < big; i++) {\n if (t1.a[i] < t2.a[i]) {\n j = i + 1;\n while (t1.a[j] == 0)\n j++;\n t1.a[j--]--;\n while (j > i)\n t1.a[j--] += MAXN;\n t1.a[i] += MAXN + 1 - t2.a[i];\n }\n else\n t1.a[i] -= t2.a[i];\n }\n t1.len = big;\n while (t1.a[t1.len - 1] == 0 && t1.len > 1) {\n t1.len--;\n big--;\n }\n if (flag)\n t1.a[big - 1] = 0 - t1.a[big - 1];\n return t1;\n}\n\nBigNum BigNum::operator * (const BigNum& b) const //两个大数之间的相乘运算\n{\n BigNum ret;\n int i, j, up;\n int temp, temp1;\n for (i = 0; i < len; i++) {\n up = 0;\n for (j = 0; j < b.len; j++) {\n temp = a[i] * b.a[j] + ret.a[i + j] + up;\n if (temp > MAXN) {\n temp1 = temp - temp / (MAXN + 1) * (MAXN + 1);\n up = temp / (MAXN + 1);\n ret.a[i + j] = temp1;\n }\n else {\n up = 0;\n ret.a[i + j] = temp;\n }\n }\n if (up != 0) ret.a[i + j] = up;\n }\n ret.len = i + j;\n while (ret.a[ret.len - 1] == 0 && ret.len > 1)\n ret.len--;\n return ret;\n}\ntemplate BigNum BigNum::operator / (const T& b) const\n{\n BigNum ret;\n T i, down = 0;\n for (i = len - 1; i >= 0; i--) {\n ret.a[i] = (a[i] + down * (MAXN + 1)) / b;\n down = a[i] + down * (MAXN + 1) - ret.a[i] * b;\n }\n ret.len = len;\n while (ret.a[ret.len - 1] == 0 && ret.len > 1)\n ret.len--;\n return ret;\n}\ntemplate T BigNum::operator % (const T& b) const\n{\n T i, d = 0;\n for (i = len - 1; i >= 0; i--) {\n d = ((d * (MAXN + 1)) % b + a[i]) % b;\n }\n return d;\n}\n\n\ntemplate BigNum BigNum::operator^(const T& n) const //大数的n次方运算\n{\n BigNum t, ret(1);\n int i;\n if (n < 0) return 0;\n if (n == 0)\n return 1;\n if (n == 1)\n return *this;\n int m = n;\n while (m > 1) {\n t = *this;\n for (i = 1; (i << 1) <= m; i <<= 1)\n t = t * t;\n m -= i;\n ret = ret * t;\n if (m == 1) ret = ret * (*this);\n }\n return ret;\n}\n\nbool BigNum::operator > (const BigNum& b) const //大数和另一个大数的大小比较\n{\n int tot;\n if (len > b.len)\n return true;\n else if (len == b.len) {\n tot = len - 1;\n while (a[tot] == b.a[tot] && tot >= 0)\n tot--;\n if (tot >= 0 && a[tot] > b.a[tot])\n return true;\n else\n return false;\n }\n else\n return false;\n}\n\nbool BigNum::operator < (const BigNum& b) const\n{\n int tot;\n if (len > b.len)\n return false;\n else if (len == b.len) {\n tot = len - 1;\n while (a[tot] == b.a[tot] && tot >= 0)\n tot--;\n if (tot >= 0 && a[tot] > b.a[tot])\n return false;\n else\n return false;\n }\n else\n return true;\n}\n\nbool BigNum::operator == (const BigNum& b) const\n{\n int tot = len - 1;\n if (len != b.len)\n return false;\n while (a[tot] == b.a[tot] && tot >= 0)\n tot--;\n if (tot < 0)\n return true;\n return false;\n}\n\nvoid BigNum::print() //输出大数\n{\n int i;\n cout << a[len - 1];\n for (i = len - 2; i >= 0; i--) {\n cout.width(DLEN);\n cout.fill('0');\n cout << a[i];\n }\n cout << endl;\n}\nint BigNum::Size()\n{\n int t = a[len - 1], cnt = 0;\n while (t) { t /= 10; cnt++; }\n cnt += (len - 1) * 4;\n return cnt;\n}\nint BigNum::the_first()\n{\n int t = a[len - 1];\n while (t > 10) { t /= 10; }\n return t;\n}\nint BigNum::the_last()\n{\n int t = a[0];\n return t % 10;\n}\nint BigNum::to_int()\n{\n int i, num;\n num = a[len - 1];\n for (i = len - 2; i >= 0; i--)\n num = num * (MAXN + 1) + a[i];\n return num;\n}\nlong long int BigNum::to_long()\n{\n int i;\n long long int num;\n num = a[len - 1];\n for (i = len - 2; i >= 0; i--)\n num = num * (MAXN + 1) + a[i];\n return num;\n}\nstring BigNum::to_String()\n{\n int i;\n string s = \""\"", tp = \""\"";\n s += (char)(a[len - 1] + '0');\n for (i = len - 2; i >= 0; i--) {\n tp = (char)(a[i] + '0');\n int tot = tp.size();\n tp.insert(tp.begin(), 4 - tot, '0');\n s = s + tp;\n }\n return s;\n}\nint main()\n{\n BigNum a[5010];\n a[1] = 1;\n for (int i = 2; i < 5001; i++)\n {\n a[i] = a[i - 1] * 2 + 1;\n }\n int n;\n cin >> n;\n cout << a[n] << endl;\n}",COMPILE_ERROR,0,0 1380797021154328576,009573e786977e10d295b5f0e8677590653c0edc7a18243395019cb41f1e7ce4,2021-04-10 16:17:18,C++,17.0,1375314185281409024,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \nusing namespace std;\n\n#define MAXN 9999\n#define MAXSIZE 500 //最大长度\n#define DLEN 4\n\nclass BigNum\n{\nprivate:\n int a[210]; //控制大数的位数\n int len; //长度\npublic:\n BigNum() { len = 1; memset(a, 0, sizeof(a)); } //构造函数\n void XD();\n BigNum(const int);\n BigNum(const long long int);\n BigNum(const char*);\n BigNum(const string&);\n BigNum(const BigNum&); //拷贝构造函数\n BigNum& operator = (const BigNum&); //重载赋值运算符\n BigNum& operator = (const int&);\n BigNum& operator = (const long long int&);\n\n friend istream& operator >> (istream&, BigNum&); //重载输入运算符\n friend ostream& operator << (ostream&, BigNum&); //重载输出运算符\n\n template BigNum operator << (const T&) const;\n template BigNum operator >> (const T&) const;\n\n BigNum operator + (const BigNum&) const; //重载加法运算符，大数加大数\n BigNum operator - (const BigNum&) const; //重载减法运算符，大数减大数\n BigNum operator * (const BigNum&) const; //重载乘法运算符，大数乘大数\n bool operator > (const BigNum& b)const; //重载大于\n bool operator < (const BigNum& b) const; //重载小于\n bool operator == (const BigNum& b) const; //重载等于符号\n template BigNum operator / (const T&) const; //重载除法运算符，大数除整数\n template BigNum operator ^ (const T&) const; //大数的n次方\n template T operator % (const T&) const; //大数对int取模\n\n template BigNum operator + (const T& b) const { BigNum t = b; t = *this + t; return t; }\n template BigNum operator - (const T& b) const { BigNum t = b; t = *this - t; return t; }\n template BigNum operator * (const T& b) const { BigNum t = b; t = (*this) * t; return t; }\n template bool operator < (const T& b) const { BigNum t = b; return ((*this) < t); }\n template bool operator > (const T& b) const { BigNum t = b; return ((*this) > t); }\n template bool operator == (const T& b) const { BigNum t = b; return ((*this) == t); }\n\n bool operator <= (const BigNum& b) const { return (*this) < b || (*this) == b; }\n bool operator >= (const BigNum& b) const { return (*this) > b || (*this) == b; }\n bool operator != (const BigNum& b) const { return !((*this) == b); }\n\n template bool operator >= (const T& b) const { BigNum t = b; return !((*this) < t); }\n template bool operator <= (const T& b) const { BigNum t = b; return !((*this) > t); }\n template bool operator != (const T& b) const { BigNum t = b; return !((*this) == t); }\n\n BigNum& operator += (const BigNum& b) { *this = *this + b; return *this; }\n BigNum& operator -= (const BigNum& b) { *this = *this - b; return *this; }\n BigNum& operator *= (const BigNum& b) { *this = *this * b; return *this; }\n template BigNum& operator /= (const T& b) { *this = *this / b; return *this; }\n template BigNum& operator %= (const T& b) { *this = *this % b; return *this; }\n template BigNum& operator += (const T& b) { *this = *this + b; return *this; }\n template BigNum& operator -= (const T& b) { *this = *this - b; return *this; }\n template BigNum& operator *= (const T& b) { *this = *this * b; return *this; }\n template BigNum& operator ^= (const T& b) { *this = *this ^ b; return *this; }\n\n BigNum operator ++ (int) { BigNum t = *this; *this += 1; return t; }\n BigNum operator -- (int) { BigNum t = *this; *this -= 1; return t; }\n BigNum& operator -- () { *this -= 1; return *this; }\n BigNum& operator ++ () { *this += 1; return *this; }\n\n template BigNum& operator <<= (const T& b) { *this = *this << b; return *this; }\n template BigNum& operator >>= (const T& b) { *this = *this >> b; return *this; }\n\n template BigNum friend operator + (const T& a, const BigNum& b) { BigNum t = a; t = t + a; return t; }\n template BigNum friend operator - (const T& a, const BigNum& b) { BigNum t = a; t = t - b; return t; }\n template BigNum friend operator * (const T& a, const BigNum& b) { BigNum t = a; t = t * b; return t; }\n template friend bool operator < (const T& a, const BigNum& b) { return b > a; }\n template friend bool operator > (const T& a, const BigNum& b) { return b < a; }\n template friend bool operator <= (const T& a, const BigNum& b) { return b >= a; }\n template friend bool operator >= (const T& a, const BigNum& b) { return b <= a; }\n template friend bool operator == (const T& a, const BigNum& b) { return b == a; }\n template friend bool operator != (const T& a, const BigNum& b) { return b != a; }\n\n void print(); //输出大数\n int Size(); //返回大数长度\n int the_first(); //返回第一个数字\n int the_last(); //返回最后一位数字\n int to_int(); //转化为整数\n long long int to_long();\n string to_String(); //转化为string类型\n //char* to_char();\n};\n\nBigNum::BigNum(const int b) //将一个int类型的变量转化为大数\n{\n int c, d = b;\n len = 0;\n memset(a, 0, sizeof(a));\n while (d > MAXN) {\n c = d - (d / (MAXN + 1)) * (MAXN + 1);\n d = d / (MAXN + 1);\n a[len++] = c;\n }\n a[len++] = d;\n}\nBigNum::BigNum(const long long int b)\n{\n long long int c, d = b;\n len = 0;\n memset(a, 0, sizeof(a));\n while (d > MAXN) {\n c = d - (d / (MAXN + 1)) * (MAXN + 1);\n d = d / (MAXN + 1);\n a[len++] = c;\n }\n a[len++] = d;\n}\nBigNum::BigNum(const string& s)\n{\n int t, k, index, l, i;\n memset(a, 0, sizeof(a));\n l = s.size();\n len = l / DLEN;\n if (l % DLEN)\n len++;\n index = 0;\n for (i = l - 1; i >= 0; i -= DLEN) {\n t = 0;\n k = i - DLEN + 1;\n if (k < 0) k = 0;\n for (int j = k; j <= i; j++)\n t = t * 10 + s[j] - '0';\n a[index++] = t;\n }\n}\nBigNum::BigNum(const char* s) //将一个字符串类型的变量转化为大数\n{\n int t, k, index, l, i;\n memset(a, 0, sizeof(a));\n l = strlen(s);\n len = l / DLEN;\n if (l % DLEN)\n len++;\n index = 0;\n for (i = l - 1; i >= 0; i -= DLEN) {\n t = 0;\n k = i - DLEN + 1;\n if (k < 0) k = 0;\n for (int j = k; j <= i; j++)\n t = t * 10 + s[j] - '0';\n a[index++] = t;\n }\n}\nBigNum::BigNum(const BigNum& b) : len(b.len) //拷贝构造函数\n{\n memset(a, 0, sizeof(a));\n for (int i = 0; i < len; i++)\n a[i] = b.a[i];\n}\nBigNum& BigNum::operator = (const BigNum& n) //重载赋值运算符，大数之间进行赋值运算\n{\n len = n.len;\n memset(a, 0, sizeof(a));\n for (int i = 0; i < len; i++)\n a[i] = n.a[i];\n return *this;\n}\nBigNum& BigNum::operator = (const int& num)\n{\n BigNum t(num);\n *this = t;\n return *this;\n}\nBigNum& BigNum::operator = (const long long int& num)\n{\n BigNum t(num);\n *this = t;\n return *this;\n}\nvoid XD()\n{\n cout << \""A hidden egg! Good luck for u!\"" << endl;\n}\nistream& operator >> (istream& in, BigNum& b) //重载输入运算符\n{\n char ch[MAXSIZE * 4];\n int i = -1;\n in >> ch;\n int l = strlen(ch);\n int cnt = 0, sum = 0;\n for (i = l - 1; i >= 0; ) {\n sum = 0;\n int t = 1;\n for (int j = 0; j < 4 && i >= 0; j++, i--, t *= 10)\n sum += (ch[i] - '0') * t;\n b.a[cnt] = sum;\n cnt++;\n }\n b.len = cnt++;\n return in;\n\n}\nostream& operator << (ostream& out, BigNum& b) //重载输出运算符\n{\n int i;\n cout << b.a[b.len - 1];\n for (i = b.len - 2; i >= 0; i--) {\n cout.width(DLEN);\n cout.fill('0');\n cout << b.a[i];\n }\n return out;\n}\n\ntemplate BigNum BigNum::operator << (const T& b) const\n{\n T temp = 1;\n for (int i = 0; i < b; i++)\n temp *= 2;\n BigNum t = (*this) * temp;\n return t;\n}\ntemplate BigNum BigNum::operator >> (const T& b) const\n{\n T temp = 1;\n for (int i = 0; i < b; i++)\n temp *= 2;\n BigNum t = (*this) / temp;\n return t;\n}\n\nBigNum BigNum::operator + (const BigNum& b) const //两个大数之间的相加运算\n{\n BigNum t(*this);\n int i, big;\n big = b.len > len ? b.len : len;\n for (i = 0; i < big; i++) {\n t.a[i] += b.a[i];\n if (t.a[i] > MAXN) {\n t.a[i + 1]++;\n t.a[i] -= MAXN + 1;\n }\n }\n if (t.a[big] != 0)\n t.len = big + 1;\n else\n t.len = big;\n return t;\n}\nBigNum BigNum::operator - (const BigNum& b) const //两个大数之间的相减运算\n{\n int i, j, big;\n bool flag;\n BigNum t1, t2;\n if (*this > b) {\n t1 = *this;\n t2 = b;\n flag = 0;\n }\n else {\n t1 = b;\n t2 = *this;\n flag = 1;\n }\n big = t1.len;\n for (i = 0; i < big; i++) {\n if (t1.a[i] < t2.a[i]) {\n j = i + 1;\n while (t1.a[j] == 0)\n j++;\n t1.a[j--]--;\n while (j > i)\n t1.a[j--] += MAXN;\n t1.a[i] += MAXN + 1 - t2.a[i];\n }\n else\n t1.a[i] -= t2.a[i];\n }\n t1.len = big;\n while (t1.a[t1.len - 1] == 0 && t1.len > 1) {\n t1.len--;\n big--;\n }\n if (flag)\n t1.a[big - 1] = 0 - t1.a[big - 1];\n return t1;\n}\n\nBigNum BigNum::operator * (const BigNum& b) const //两个大数之间的相乘运算\n{\n BigNum ret;\n int i, j, up;\n int temp, temp1;\n for (i = 0; i < len; i++) {\n up = 0;\n for (j = 0; j < b.len; j++) {\n temp = a[i] * b.a[j] + ret.a[i + j] + up;\n if (temp > MAXN) {\n temp1 = temp - temp / (MAXN + 1) * (MAXN + 1);\n up = temp / (MAXN + 1);\n ret.a[i + j] = temp1;\n }\n else {\n up = 0;\n ret.a[i + j] = temp;\n }\n }\n if (up != 0) ret.a[i + j] = up;\n }\n ret.len = i + j;\n while (ret.a[ret.len - 1] == 0 && ret.len > 1)\n ret.len--;\n return ret;\n}\ntemplate BigNum BigNum::operator / (const T& b) const\n{\n BigNum ret;\n T i, down = 0;\n for (i = len - 1; i >= 0; i--) {\n ret.a[i] = (a[i] + down * (MAXN + 1)) / b;\n down = a[i] + down * (MAXN + 1) - ret.a[i] * b;\n }\n ret.len = len;\n while (ret.a[ret.len - 1] == 0 && ret.len > 1)\n ret.len--;\n return ret;\n}\ntemplate T BigNum::operator % (const T& b) const\n{\n T i, d = 0;\n for (i = len - 1; i >= 0; i--) {\n d = ((d * (MAXN + 1)) % b + a[i]) % b;\n }\n return d;\n}\n\n\ntemplate BigNum BigNum::operator^(const T& n) const //大数的n次方运算\n{\n BigNum t, ret(1);\n int i;\n if (n < 0) return 0;\n if (n == 0)\n return 1;\n if (n == 1)\n return *this;\n int m = n;\n while (m > 1) {\n t = *this;\n for (i = 1; (i << 1) <= m; i <<= 1)\n t = t * t;\n m -= i;\n ret = ret * t;\n if (m == 1) ret = ret * (*this);\n }\n return ret;\n}\n\nbool BigNum::operator > (const BigNum& b) const //大数和另一个大数的大小比较\n{\n int tot;\n if (len > b.len)\n return true;\n else if (len == b.len) {\n tot = len - 1;\n while (a[tot] == b.a[tot] && tot >= 0)\n tot--;\n if (tot >= 0 && a[tot] > b.a[tot])\n return true;\n else\n return false;\n }\n else\n return false;\n}\n\nbool BigNum::operator < (const BigNum& b) const\n{\n int tot;\n if (len > b.len)\n return false;\n else if (len == b.len) {\n tot = len - 1;\n while (a[tot] == b.a[tot] && tot >= 0)\n tot--;\n if (tot >= 0 && a[tot] > b.a[tot])\n return false;\n else\n return false;\n }\n else\n return true;\n}\n\nbool BigNum::operator == (const BigNum& b) const\n{\n int tot = len - 1;\n if (len != b.len)\n return false;\n while (a[tot] == b.a[tot] && tot >= 0)\n tot--;\n if (tot < 0)\n return true;\n return false;\n}\n\nvoid BigNum::print() //输出大数\n{\n int i;\n cout << a[len - 1];\n for (i = len - 2; i >= 0; i--) {\n cout.width(DLEN);\n cout.fill('0');\n cout << a[i];\n }\n cout << endl;\n}\nint BigNum::Size()\n{\n int t = a[len - 1], cnt = 0;\n while (t) { t /= 10; cnt++; }\n cnt += (len - 1) * 4;\n return cnt;\n}\nint BigNum::the_first()\n{\n int t = a[len - 1];\n while (t > 10) { t /= 10; }\n return t;\n}\nint BigNum::the_last()\n{\n int t = a[0];\n return t % 10;\n}\nint BigNum::to_int()\n{\n int i, num;\n num = a[len - 1];\n for (i = len - 2; i >= 0; i--)\n num = num * (MAXN + 1) + a[i];\n return num;\n}\nlong long int BigNum::to_long()\n{\n int i;\n long long int num;\n num = a[len - 1];\n for (i = len - 2; i >= 0; i--)\n num = num * (MAXN + 1) + a[i];\n return num;\n}\nstring BigNum::to_String()\n{\n int i;\n string s = \""\"", tp = \""\"";\n s += (char)(a[len - 1] + '0');\n for (i = len - 2; i >= 0; i--) {\n tp = (char)(a[i] + '0');\n int tot = tp.size();\n tp.insert(tp.begin(), 4 - tot, '0');\n s = s + tp;\n }\n return s;\n}\nint main()\n{\n BigNum a[5010];\n a[1] = 1;\n for (int i = 2; i < 5001; i++)\n {\n a[i] = a[i - 1] * 2 + 1;\n }\n int n;\n cin >> n;\n cout << a[n] << endl;\n}",PARTIAL_ACCEPTED,79,4548 1382257940255830016,9ce8381af3d8df09e3a4325f826e7a2d4d1c8cb4b97fa97d4a7d9732bb9750ba,2021-04-14 17:02:28,C++,0.0,1375314185281409024,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nstring s;int flag[1000];\nint n;\nint main(){\n\tcin>>n;\n\ts+='1';\n\twhile(n--){\n\t\t//memset(flag,0,sizeof(flag));\n\t\tcout<0;i--){\n\t\t\tif(s[i]>='5'){\n\t\t\t\tflag[i-1]=1;\n\t\t\t\ts[i]=(s[i]*2+flag[i])-58;\n\t\t\t}\n\t\t\telse {s[i]=s[i]*2+flag[i]-48;}\n\t\t}\n\t\tif(s[0]>='5'){\n\t\t\t\ts[0]=s[0]*2+flag[0]-58;\n\t\t\t\ts.insert(0,\""1\"");\n\t\t\t}\n\t\telse s[0]=s[0]*2+flag[0]-48; \n\t}\n\ts[s.length()-1]--;\n\tcout<\nusing namespace std;\nstring s;int flag[1000];\nint n;\nint main(){\n\tcin>>n;\n\ts+='1';\n\twhile(n--){\n\t\t//memset(flag,0,sizeof(flag));\n\t\tfor(int i=s.length()-1;i>0;i--){\n\t\t\tif(s[i]>='5'){\n\t\t\t\tflag[i-1]=1;\n\t\t\t\ts[i]=(s[i]*2+flag[i])-58;\n\t\t\t}\n\t\t\telse {s[i]=s[i]*2+flag[i]-48;}\n\t\t}\n\t\tif(s[0]>='5'){\n\t\t\t\ts[0]=s[0]*2+flag[0]-58;\n\t\t\t\ts.insert(0,\""1\"");\n\t\t\t}\n\t\telse s[0]=s[0]*2+flag[0]-48; \n\t}\n\ts[s.length()-1]--;\n\tcout<\nusing namespace std;\nstring s;int flag[10000];\nint n;\nint main(){\n\tcin>>n;\n\ts+='1';\n\twhile(n--){\n\t\t//memset(flag,0,sizeof(flag));\n\t\tfor(int i=s.length()-1;i>0;i--){\n\t\t\tif(s[i]>='5'){\n\t\t\t\tflag[i-1]=1;\n\t\t\t\ts[i]=(s[i]*2+flag[i])-58;\n\t\t\t}\n\t\t\telse {s[i]=s[i]*2+flag[i]-48;}\n\t\t}\n\t\tif(s[0]>='5'){\n\t\t\t\ts[0]=s[0]*2+flag[0]-58;\n\t\t\t\ts.insert(0,\""1\"");\n\t\t\t}\n\t\telse s[0]=s[0]*2+flag[0]-48; \n\t}\n\ts[s.length()-1]--;\n\tcout<\nusing namespace std;\nstring s;int flag[10000];\nint n;\nint main(){\n\tcin>>n;\n\ts+='1';\n\twhile(n--){\n\t\tmemset(flag,0,sizeof(flag));\n\t\tfor(int i=s.length()-1;i>0;i--){\n\t\t\tif(s[i]>='5'){\n\t\t\t\tflag[i-1]=1;\n\t\t\t\ts[i]=(s[i]*2+flag[i])-58;\n\t\t\t}\n\t\t\telse {s[i]=s[i]*2+flag[i]-48;}\n\t\t}\n\t\tif(s[0]>='5'){\n\t\t\t\ts[0]=s[0]*2+flag[0]-58;\n\t\t\t\ts.insert(0,\""1\"");\n\t\t\t}\n\t\telse s[0]=s[0]*2+flag[0]-48; \n\t}\n\ts[s.length()-1]--;\n\tcout<\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \nusing namespace std;\n\nstring A[500];\nstring add(string a, string b)\n{\n\tint A[600] = { 0 }, B[600] = { 0 };\n\tstring c;\n\tfor (int i = 0; i < a.size(); i++)\n\t\tA[i] = a[a.size() - i - 1] - '0';\n\tfor (int i = 0; i < b.size(); i++)\n\t\tB[i] = b[b.size() - i - 1] - '0';\n\tint m = max(a.size(), b.size());\n\tfor (int i = 0; i < m; i++)\n\t{\n\t\tA[i] += B[i];\n\t\tA[i + 1] += A[i] / 10;\n\t\tA[i] %= 10;\n\t}\n\tif (!A[m])\n\t\tm--;\n\tfor (int i = m; i >= 0; i--)\n\t{\n\t\tc += A[i] + '0';\n\t}\n\treturn c;\n}\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tA[1] = '1';\n\tfor (int i = 2; i <= n; i++)\n\t{\n\t\tstring cnt = add(A[i - 1], \""1\"");\n\t\tA[i] = add(cnt, A[i - 1]);\n\t}\n\tcout << A[n];\n\treturn 0;\n}",PARTIAL_ACCEPTED,29,432 1382671279318462464,c5b0f9a825a5172569f3f8d1e137cfcd9a962576badb7bbbfe64dc27ff17bd37,2021-04-15 20:24:56,C++,20.0,1375314185281409024,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \nusing namespace std;\n\nstring A[5000];\nstring add(string a, string b)\n{\n\tint A[6000] = { 0 }, B[6000] = { 0 };\n\tstring c;\n\tfor (int i = 0; i < a.size(); i++)\n\t\tA[i] = a[a.size() - i - 1] - '0';\n\tfor (int i = 0; i < b.size(); i++)\n\t\tB[i] = b[b.size() - i - 1] - '0';\n\tint m = max(a.size(), b.size());\n\tfor (int i = 0; i < m; i++)\n\t{\n\t\tA[i] += B[i];\n\t\tA[i + 1] += A[i] / 10;\n\t\tA[i] %= 10;\n\t}\n\tif (!A[m])\n\t\tm--;\n\tfor (int i = m; i >= 0; i--)\n\t{\n\t\tc += A[i] + '0';\n\t}\n\treturn c;\n}\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tA[1] = '1';\n\tfor (int i = 2; i <= n; i++)\n\t{\n\t\tstring cnt = add(A[i - 1], \""1\"");\n\t\tA[i] = add(cnt, A[i - 1]);\n\t}\n\tcout << A[n];\n\treturn 0;\n}",ACCEPTED,144,5172 1315617832051720192,4d902628a481654f4bdf7c9f00327ea7e048cb76b39b3551da47db091519a454,2020-10-12 19:38:28,C++,0.0,1313472811521138688,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\n\nint N;\nunsigned long long sum;\n\nint inp(){\n\tcin>>N;\n\t\n}\n\n\nint work(){\n\t\n\tsum=pow(2,N)-1;\n\tcout<\n#include\n#include\nusing namespace std;\n\nlong long int ans;\nvoid H(int n, int x, int y, int z) \n{\n if (n == 1)\n ans++;\n else\n {\n H(n - 1, x, z, y);\n ans++;\n H(n - 1, y, x, z);\n }\n}\nint main(void)\n{\n int m;\n scanf(\""%d\"", &m);\n H(m,'a','b','c');\n cout<\n#include\n#include\n#include\nusing namespace std;\n\nlong long int ans;\nvoid H()\nint main()\n{\n int n;\n\tans = pow(2,n);\n cout<\n#include\n#include\n#include\nusing namespace std;\n\nlong long int ans;\nint main()\n{\n int m;\n\tans = pow(2,m);\n cout<\n#include\n#include\n#include\nusing namespace std;\n\nlong long int ans;\nint main()\n{\n int m;\n scanf(\""%lld\"",&m);\n\tans = pow(2,m);\n cout<\n#include\n#include\n#include\nusing namespace std;\n\nlong long int ans;\nint main()\n{\n int m;\n scanf(\""%lld\"",&m);\n\tans = pow(2,m) - 1;\n cout<\n#include\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n printf(\""%d\"",pow(2,n)+n-1);\n return 0;\n}",WRONG_ANSWER,13,384 1315630804899774464,3e41993bec765f219c6146ff80d2c5e551ad8ffc867f81c9212a1cce8827ad30,2020-10-12 20:30:01,C++,0.0,1313472811521138688,1313471683597295616,1039132196031492096,#include\n#include\n#include\n#include\n#include\n#include\nusing namespace std;\nint digui(int o) {\n\tif (o == 1)\n\t\treturn 1;\n\telse return 2 * digui(o - 1) + 1;\n}\nint main() {\n\tint a;\n\tcin >> a;\n\tcout << digui(a);\n\t\treturn 0;\n}\n,WRONG_ANSWER,14,384 1315631300683284480,3ca4298741e1ad03dbf4e428fed9dbd02970769861b954e87d7adf154bbfb4c0,2020-10-12 20:31:59,Python,0.0,1313472811521138688,1313471683597295616,1039132196031492096,"input(pow(2,m) - 1)\n ",NON_ZERO_EXIT_CODE,63,2816 1315632363691884544,3ca4298741e1ad03dbf4e428fed9dbd02970769861b954e87d7adf154bbfb4c0,2020-10-12 20:36:13,C++,0.0,1313472811521138688,1313471683597295616,1039132196031492096,"#include\n#include\n#include\nusing namespace std;\n\nlong long int ans;\nvoid H(int n, int x, int y, int z) \n{\n if (n == 1)\n ans++;\n else\n {\n H(n - 1, x, z, y);\n ans++;\n H(n - 1, y, x, z);\n }\n}\nint main(void)\n{\n int m;\n scanf(\""%d\"", &m);\n H(m,'a','b','c');\n cout<\n#include\n#include\n#include\nusing namespace std;\n\nlong long int ans;\nint main()\n{\n int m;\n scanf(\""%lld\"",&m);\n\tans = pow(2,m) - 1;\n cout<\n#include\n#include\n#include\nusing namespace std;\n\nint ans;\nint main()\n{\n int m;\n cin>>m;\n\tans = pow(2,m) - 1;\n cout<\n#include\n#include\n#include\nusing namespace std;\n\nlong long int n;\nlong long int ans;\nint main()\n{\n scanf(\""%lld\"",&n);\n\tans = pow(2,n) - 1;\n \tprintf(\""%lld\"",ans);\n}",WRONG_ANSWER,25,368 1315633535525896192,3ca4298741e1ad03dbf4e428fed9dbd02970769861b954e87d7adf154bbfb4c0,2020-10-12 20:40:52,C++,0.0,1313472811521138688,1313471683597295616,1039132196031492096,"#include\n#include\n#include\nusing namespace std;\n\nlong long int ans;\nvoid H(int n, int x, int y, int z) \n{\n if (n == 1)\n ans++;\n else\n {\n H(n - 1, x, z, y);\n ans++;\n H(n - 1, y, x, z);\n }\n}\nint main(void)\n{\n long long int m;\n scanf(\""%lld\"", &m);\n H(m,'a','b','c');\n printf(\""%lld\"",ans;)\n}",COMPILE_ERROR,0,0 1315633657001328640,3ca4298741e1ad03dbf4e428fed9dbd02970769861b954e87d7adf154bbfb4c0,2020-10-12 20:41:21,C++,0.0,1313472811521138688,1313471683597295616,1039132196031492096,"#include\n#include\n#include\nusing namespace std;\n\nlong long int ans;\nvoid H(int n, int x, int y, int z) \n{\n if (n == 1)\n ans++;\n else\n {\n H(n - 1, x, z, y);\n ans++;\n H(n - 1, y, x, z);\n }\n}\nint main(void)\n{\n long long int m;\n scanf(\""%lld\"", &m);\n H(m,'a','b','c');\n printf(\""%lld\"",ans);\n}",TIME_LIMIT_EXCEEDED,0,0 1315634017271070720,3ca4298741e1ad03dbf4e428fed9dbd02970769861b954e87d7adf154bbfb4c0,2020-10-12 20:42:47,C++,0.0,1313472811521138688,1313471683597295616,1039132196031492096,"#include\n#include\n#include\n#include\nusing namespace std;\n\nint n;\nlong long int ans;\nint main()\n{\n scanf(\""%d\"",&n);\n\tans = pow(2,n) - 1;\n \tprintf(\""%lld\"",ans);\n}",WRONG_ANSWER,14,596 1315638444216336384,8046de31492a40b6c1f8fba5b22e870166941373a041dfee90b6098c391ca550,2020-10-12 21:00:23,C,0.0,1313472811521138688,1313471683597295616,1039132196031492096,"#include\nint main()\n{\n\tint a;\n\tscanf(\""%d\"", &a);\n\tprintf(\""1180591620717411303423\"");\n\treturn 0;\n}",WRONG_ANSWER,13,384 1315643158882467840,5a30551af2a8a45889dd4762a9128472a187a8fc6d3bd5b86d728f3f49b9d802,2020-10-12 21:19:07,C++,0.0,1313472811521138688,1313471683597295616,1039132196031492096,#include \n#include \n\nusing namespace std;\n\nint h(int v)\n{\n\tif (v == 1)\n\t\treturn 1;\n\treturn 2 * h(v - 1) + 1;\n}\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tcout << h(n) << endl;\n}\n,WRONG_ANSWER,20,488 1315649008028139520,48bd6d018d9c38334c5a487a6703ce3cf90e3304375b47bf6d16e1275463c00d,2020-10-12 21:42:21,C++,3.0,1313472811521138688,1313471683597295616,1039132196031492096,#include\n#include\n#include\n#include \n#include\n#include\nusing namespace std;\nlong long int sum=1;\nint main() {\n\tint num;\n\tcin >> num;\n\tfor (int i = 0; i < num; i++) {\n\t\tsum = sum * 2;\n\t}\n\tsum = sum - 1;\n\tcout << sum;\n},PARTIAL_ACCEPTED,18,512 1315650061016547328,48bd6d018d9c38334c5a487a6703ce3cf90e3304375b47bf6d16e1275463c00d,2020-10-12 21:46:32,C++,3.0,1313472811521138688,1313471683597295616,1039132196031492096,#include\n#include\n#include\n#include \n#include\n#include\nusing namespace std;\nlong long int sum=1;\nint main() {\n\tint num;\n\tcin >> num;\n\tfor (int i = 0; i < num; i++) {\n\t\tsum = sum * 2;\n\t}\n\tsum = sum - 1;\n\tcout << sum;\n},PARTIAL_ACCEPTED,18,384 1315650167505731584,48bd6d018d9c38334c5a487a6703ce3cf90e3304375b47bf6d16e1275463c00d,2020-10-12 21:46:58,C++,3.0,1313472811521138688,1313471683597295616,1039132196031492096,#include\n\nusing namespace std;\nlong long int sum=1;\nint main() {\n\tint num;\n\tcin >> num;\n\tfor (int i = 0; i < num; i++) {\n\t\tsum = sum * 2;\n\t}\n\tsum = sum - 1;\n\tcout << sum;\n},PARTIAL_ACCEPTED,17,600 1316219351075700736,d35e454795ab0b42f81650b3f00fdcbe82466cdf09a63695ed08abca79fc8d2c,2020-10-14 11:28:42,Python,20.0,1315988607459975175,1313471683597295616,1039132196031492096,"print(pow(2,int(input()))-1)",ACCEPTED,98,2944 1316230095179661312,e97e31691c4be1a18fe01bc4887a3891f019db5ceefeccccdb648ef26932e5ed,2020-10-14 12:11:23,C++,0.0,1315988607459975175,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\n\nlong long n;\n\nint main()\n{\n cin >> n;\n cout << pow(2,n) - 1;\n return 0;\n}",WRONG_ANSWER,19,384 1316230720403587072,e97e31691c4be1a18fe01bc4887a3891f019db5ceefeccccdb648ef26932e5ed,2020-10-14 12:13:52,C++,3.0,1315988607459975175,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\n\nlong long n;\n\nint main()\n{\n cin >> n;\n //cout << pow(2, n) - 1;\n long long ans = 1;\n for (int i = 0; i < n; ++i)\n {\n ans *= 2;\n }\n cout << ans - 1;\n return 0;\n}",PARTIAL_ACCEPTED,18,768 1316231383531438080,e97e31691c4be1a18fe01bc4887a3891f019db5ceefeccccdb648ef26932e5ed,2020-10-14 12:16:30,C++,0.0,1315988607459975175,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\n\n\n\nint main()\n{\n long long n;\n cin >> n;\n cout << (int)pow(2.0, n) - 1;\n return 0;\n}",WRONG_ANSWER,18,424 1316231420881715200,e97e31691c4be1a18fe01bc4887a3891f019db5ceefeccccdb648ef26932e5ed,2020-10-14 12:16:39,C++,0.0,1315988607459975175,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\n\n\n\nint main()\n{\n long long n;\n cin >> n;\n cout << (int)pow(2, n) - 1;\n return 0;\n}",WRONG_ANSWER,17,512 1316363511288086528,e97e31691c4be1a18fe01bc4887a3891f019db5ceefeccccdb648ef26932e5ed,2020-10-14 21:01:32,Python,0.0,1315988607459975175,1313471683597295616,1039132196031492096,print(2 ** (int)input() - 1),NON_ZERO_EXIT_CODE,126,3328 1316363568854908928,e97e31691c4be1a18fe01bc4887a3891f019db5ceefeccccdb648ef26932e5ed,2020-10-14 21:01:46,Python,0.0,1315988607459975175,1313471683597295616,1039132196031492096,print((2 ** (int)input()) - 1),NON_ZERO_EXIT_CODE,105,3060 1316367770821902336,e97e31691c4be1a18fe01bc4887a3891f019db5ceefeccccdb648ef26932e5ed,2020-10-14 21:18:28,Python,20.0,1315988607459975175,1313471683597295616,1039132196031492096,print(2 ** int(input()) - 1),ACCEPTED,108,3048 1316367816518844416,e97e31691c4be1a18fe01bc4887a3891f019db5ceefeccccdb648ef26932e5ed,2020-10-14 21:18:39,Python,0.0,1315988607459975175,1313471683597295616,1039132196031492096,print(2 ** equal(input()) - 1),NON_ZERO_EXIT_CODE,133,2944 1316367860810694656,e97e31691c4be1a18fe01bc4887a3891f019db5ceefeccccdb648ef26932e5ed,2020-10-14 21:18:49,Python,0.0,1315988607459975175,1313471683597295616,1039132196031492096,print(2 ** eqval(input()) - 1),NON_ZERO_EXIT_CODE,135,3188 1316368294443008000,e97e31691c4be1a18fe01bc4887a3891f019db5ceefeccccdb648ef26932e5ed,2020-10-14 21:20:32,Python,20.0,1315988607459975175,1313471683597295616,1039132196031492096,print(2 ** eval(input()) - 1),ACCEPTED,128,2932 1320303933344796672,d29ea70b08b2b83bb91527f8b13e72fd3f12f18ab95f885388b6017267deb002,2020-10-25 17:59:22,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nvoid move(int m,char x, char y,char z){\n if (m == 1){\n printf(\""把一个盘子从%c移动到%c\\n\"", x, z);\n }\n else{\n move(m - 1, x, z, y);\n printf(\""把一个盘子从%c移动到%c\\n\"", x, z);\n move(m - 1, y, x, z);\n }\n}\nint main(){\n int n = 0;\n printf(\""please input dishes:\\n\"");\n scanf_s(\""%d\"", &n);\n printf(\""在3根柱子上移动%d个盘子到另一个盘子的步骤为：\\n\"",n);\n move(n, 'A', 'B', 'C');\n system(\""pause\"");\n return 0;\n}",COMPILE_ERROR,0,0 1320303975929565184,d29ea70b08b2b83bb91527f8b13e72fd3f12f18ab95f885388b6017267deb002,2020-10-25 17:59:32,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nvoid move(int m,char x, char y,char z){\n if (m == 1){\n printf(\""把一个盘子从%c移动到%c\\n\"", x, z);\n }\n else{\n move(m - 1, x, z, y);\n printf(\""把一个盘子从%c移动到%c\\n\"", x, z);\n move(m - 1, y, x, z);\n }\n}\nint main(){\n int n = 0;\n printf(\""please input dishes:\\n\"");\n scanf_s(\""%d\"", &n);\n printf(\""在3根柱子上移动%d个盘子到另一个盘子的步骤为：\\n\"",n);\n move(n, 'A', 'B', 'C');\n system(\""pause\"");\n return 0;\n}",COMPILE_ERROR,0,0 1320304014915612672,d29ea70b08b2b83bb91527f8b13e72fd3f12f18ab95f885388b6017267deb002,2020-10-25 17:59:41,Java,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nvoid move(int m,char x, char y,char z){\n if (m == 1){\n printf(\""把一个盘子从%c移动到%c\\n\"", x, z);\n }\n else{\n move(m - 1, x, z, y);\n printf(\""把一个盘子从%c移动到%c\\n\"", x, z);\n move(m - 1, y, x, z);\n }\n}\nint main(){\n int n = 0;\n printf(\""please input dishes:\\n\"");\n scanf_s(\""%d\"", &n);\n printf(\""在3根柱子上移动%d个盘子到另一个盘子的步骤为：\\n\"",n);\n move(n, 'A', 'B', 'C');\n system(\""pause\"");\n return 0;\n}",COMPILE_ERROR,0,0 1320721577680130048,336ef16d5db127699ced6016aa61084efc5228a70b4966b4db5fca94218a6bca,2020-10-26 21:38:56,Java,0.0,1316353531113754624,1313471683597295616,1039132196031492096,package com.zwl.www;\n\nimport java.math.BigInteger;\nimport java.util.Scanner;\npublic class Demon1 {\n\n public static void main(String[] args) {\n Scanner input = new Scanner(System.in);\n int n=input.nextInt();\n BigInteger a=BigInteger.valueOf(1);\n BigInteger b=BigInteger.valueOf(2);\n BigInteger c=BigInteger.valueOf(1);\n for(int i=0;i\n int move(int plate_n,char from,char to,char buffer)\n{\n if(plate_n==1) printf(\""%c-->%c\\n\"",from,to);\n else\n {\n move(plate_n-1,from,buffer,to);\n printf(\""%c-->%c\\n\"",from,to);\n move(plate_n-1,buffer,to,from);\n }\n}\n\nint main(void)\n{\n int n;\n printf(\""Input step:\"");\n scanf(\""%d\"",&n);\n move(n,'a','b','c');\n return 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1321047151975936000,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-27 19:12:39,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \nstatic int i=1;\nvoid hanoi(int n,char one,char two,char three)\n {\n void move(char x,char y);\n if(n==1)\n move(one,three);\n else\n {\n hanoi(n-1,one,three,two);\n move(one,three);\n hanoi(n-1,two,one,three);\n }\n}\n\nvoid move(char x,char y)\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\n\ti++;\n}\n\nint main()\n{\n int n;\n printf(\""input the number of diskes:\"");\n scanf(\""%d\"",&n);\n printf(\""The step to move %d diskes:\\n\"",n);\n hanoi(n,'A','B','C');\n printf(\""The total number of times is %d\"",i-1);\n return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1321047244028334080,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-27 19:13:01,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \nstatic int i=1;\nvoid hanoi(int n,char one,char two,char three)\n {\n void move(char x,char y);\n if(n==1)\n move(one,three);\n else\n {\n hanoi(n-1,one,three,two);\n move(one,three);\n hanoi(n-1,two,one,three);\n }\n}\n\nvoid move(char x,char y)\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\n\ti++;\n}\n\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n hanoi(n,'A','B','C');\n return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1321053540760768512,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-27 19:38:02,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \nint i=0;\nvoid move(int n,char a,char b){\n\tprintf(\""move %d from %c to %c\\n\"",n,a,b);\n\ti++;\n}\nvoid hanoi(int n,char a,char b,char c){\n\tif(n==1)\n\t move(1,a,c);\n\telse\n\t\t{\n\t\t\thanoi(n-1,a,c,b);\n\t\t\tmove(n,a,c);\n\t\t\thanoi(n-1,b,a,c);\n\t\t}\n}\nint main(){\n\thanoi(5,'a','b','c');\n\tprintf(\""%d\"",i);\n\treturn 0;\n}",WRONG_ANSWER,11,484 1321053996551589888,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-27 19:39:51,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \nint i=0;\nvoid move(int n,char a,char b){\n\ti++;\n}\nvoid hanoi(int n,char a,char b,char c){\n\tif(n==1)\n\t move(1,a,c);\n\telse\n\t\t{\n\t\t\thanoi(n-1,a,c,b);\n\t\t\tmove(n,a,c);\n\t\t\thanoi(n-1,b,a,c);\n\t\t}\n}\nint main(){\n\thanoi(5,'a','b','c');\n\tprintf(\""%d\"",i);\n\treturn 0;\n}",WRONG_ANSWER,13,604 1321760942061604864,f8fa2bdcd67f3276f42b7a524817c91fe586c2d4bd0b2b6262a12827a7408597,2020-10-29 18:29:00,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"\n#include\nvoid hano(int n,char x,char y,char z);\nint main ()\n{\n\tint n;\n\tchar x,y,z;\n\tscanf(\""%d\\n\"",&n);\n\tscanf(\""%c %c %c \"",&x,&y,&z);\n\thano(n,x,y,z);\n}\nvoid hano(int n,char x,char y,char z)\n{\n\tif(n==1){\n\t\tprintf(\""%d: %c -> %c\\n\"",n,x,y);\n\t}\n\telse{\n\t\thano(n-1,x,z,y);\n\t\tprintf(\""%d: %c -> %c\\n\"",n,x,y);\n\t\thano(n-1,z,y,x);\n\t}\n}\n",TIME_LIMIT_EXCEEDED,0,0 1321761198899810304,f8fa2bdcd67f3276f42b7a524817c91fe586c2d4bd0b2b6262a12827a7408597,2020-10-29 18:30:01,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"\n#include\nvoid hano(int n,char x,char y,char z);\nint main ()\n{\n\n",COMPILE_ERROR,0,0 1321799212103454720,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-29 21:01:04,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include \nint main(void)\n{\n double y;\n\tscanf(\""%lf\"",&y);\n {\n\t\tprintf(\""%.0lf\\n\"", pow(2,y)-1);\n\t}\n return 0;\n}",WRONG_ANSWER,15,504 1321799338256547840,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-29 21:01:34,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include \nint main(void)\n{\n double y;\n\tscanf(\""%lf\"",&y);\n {\n\t\tprintf(\""%.0lf\\n\"", pow(2,y)-2);\n\t}\n return 0;\n}",WRONG_ANSWER,11,256 1321799688421199872,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-29 21:02:58,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include \nint main(void)\n{\n double y;\n\tscanf(\""%lf\"",&y);\n {\n\t\tprintf(\""%.0lf\\n\"", pow(2,y)-2);\n\t}\n return 0;\n}",WRONG_ANSWER,13,356 1321799722474754048,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-29 21:03:06,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include \nint main(void)\n{\n double y;\n\tscanf(\""%lf\"",&y);\n {\n\t\tprintf(\""%.0lf\\n\"", pow(2,y)-1);\n\t}\n return 0;\n}",WRONG_ANSWER,14,512 1321810487647715328,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-29 21:45:52,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include \nint main(void)\n{\n double y;\n\tscanf(\""%lf\"",&y);\n {\n\t\tprintf(\""1180591620717411303423\"", pow(2,y-1));\n\t}\n return 0;\n}",WRONG_ANSWER,11,356 1321810594878271488,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-29 21:46:18,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include \nint main(void)\n{\n double y;\n\tscanf(\""%lf\"",&y);\n {\n\t\tprintf(\""1180591620717411303423\"");\n\t}\n return 0;\n}",WRONG_ANSWER,36,384 1321810627610628096,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-29 21:46:26,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include \nint main(void)\n{\n double y;\n\tscanf(\""%lf\"",&y);\n {\n\t\tprintf(\""1180591620717411303423\"");\n\t}\n return 0;\n}",WRONG_ANSWER,13,256 1321811632020598784,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-29 21:50:25,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include \nint main(void)\n{\n double x,y;\n\tscanf(\""%lf\"",&y);\n {\n\t\tx=pow(2,y)-1\n printf(\""%.0lf\\n\"",x);\n\t}\n return 0;\n}",COMPILE_ERROR,0,0 1321811705928429568,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-29 21:50:43,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include \nint main(void)\n{\n double x,y;\n\tscanf(\""%lf\"",&y);\n {\n\t\tx=pow(2,y)-1\n\t}\n printf(\""%.0lf\\n\"",x);\n return 0;\n}",COMPILE_ERROR,0,0 1321812152195006464,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-29 21:52:29,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include \nint main(void)\n{\n double x,y;\n\tscanf(\""%lf\"",&y);\n\t\tx=pow(2,y)-1;\n\t\t{\n\t\t\tprintf(\""%.0lf\\n\"",x);\n\t\t}\n return 0;\n}",WRONG_ANSWER,12,372 1321812374044327936,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-29 21:53:22,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include \nint main(void)\n{\n double x,y;\n\tscanf(\""%lf\"",&y);\n\t\tx=pow(2,y-1);\n\t\t{\n\t\t\tprintf(\""%.0lf\\n\"",x);\n\t\t}\n return 0;\n}",WRONG_ANSWER,13,600 1321814668826718208,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-29 22:02:29,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include \nint main(void)\n{\n double x,y;\n int j;\n double a[100000];\n\tscanf(\""%lf\"",&y);\n\t\tx=pow(2,y);\n\t\ta[j]=x-1;\n\t\t{\n\t\t\tprintf(\""%.0lf\\n\"",a[j]);\n\t\t}\n return 0;\n}",WRONG_ANSWER,12,256 1321964728969408512,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-30 07:58:46,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include \nint main(void)\n{\n double x,y;\n\tscanf(\""%lf\"",&y);\n\t\tx=pow(2,y)-1;\n\t\t{\n\t\t\tprintf(\""%.0lf\\n\"",a[j]);\n\t\t}\n return 0;\n}",COMPILE_ERROR,0,0 1321964788814757888,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-10-30 07:59:01,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include \nint main(void)\n{\n double x,y;\n\tscanf(\""%lf\"",&y);\n\t\tx=pow(2,y)-1;\n\t\t{\n\t\t\tprintf(\""%.0lf\\n\"",x);\n\t\t}\n return 0;\n}",WRONG_ANSWER,11,256 1322740588861280256,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-11-01 11:21:46,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include \nint main(void)\n{\n double x,y;\n\tscanf(\""%lf\"",&y);\n\t\tx=pow(2,y)-1;\n\t\t{\n\t\t\tprintf(\""%s\\n\"",x);\n\t\t}\n return 0;\n}",SEGMENTATION_FAULT,11,296 1322741539181506560,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-11-01 11:25:32,C,15.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t;\n\tchar a[100]; \n\ta[0] = '1';\t\n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]);\n\t\tt = i; \n if(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0';\n\tprintf(\""%s\\n\"", a);\n\treturn 0;\n}",PARTIAL_ACCEPTED,42,256 1322742139285745664,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-11-01 11:27:56,C,17.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t;\n\tchar a[1000]; \n\ta[0] = '1';\t\n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]);\n\t\tt = i; \n if(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0';\n\tprintf(\""%s\\n\"", a);\n\treturn 0;\n}",PARTIAL_ACCEPTED,50,368 1322742205014683648,9a52b1358b588d585064a719129a13ca87ee79b42ba2297b8366f412ff622e74,2020-11-01 11:28:11,C,20.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t;\n\tchar a[10000]; \n\ta[0] = '1';\t\n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]);\n\t\tt = i; \n if(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0';\n\tprintf(\""%s\\n\"", a);\n\treturn 0;\n}",ACCEPTED,36,384 1323146148878307328,a1b7320790038a605b92b80bc1705543e396b61300858ff4c9999b42343ef624,2020-11-02 14:13:19,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",WRONG_ANSWER,20,384 1323146941719195648,a1b7320790038a605b92b80bc1705543e396b61300858ff4c9999b42343ef624,2020-11-02 14:16:28,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"const int maxn=60+5;\nint cas=1;\nint n,k;\nint start[maxn],finish[maxn]; //p[i]代表盘子为i的所在的柱子编号.\nll Move(int *p,int i,int zhu) //初始盘子所在的柱子编号数组P,把盘子1-i移动\n//到目标柱子所需的步数.\n{\n if(i == 0) return 0;\n if(p[i] == zhu) return Move(p,i-1,zhu);\n //如果p[i] == zhu. 那么Move（p,i,zhu） == Move(p,i-1,zhu).\n else return Move(p,i-1,6-p[i]-zhu) + (1ll<<(i-1));\n//否则就需要把i-1个盘子先移到中转盘子上.然后把i移到zhu上,最后再把i-1移到zhu上\n//注意结论.\n}\n\nvoid solve()\n{\n while(~scanf(\""%d\"",&n) && n){\n for(int i=1;i<=n;i++){\n int u; scanf(\""%d\"",&u);\n start[i] = u;\n }\n for(int i=1;i<=n;i++){\n int u; scanf(\""%d\"",&u);\n finish[i] = u;\n }\n k = -inf;\n for(int i=1;i<=n;i++){\n if(start[i] != finish[i])\n k = max(k,i);\n }\n if(k == -inf){\n printf(\""Case %d: \"", cas++);\n printf(\""0\\n\"");\n continue;\n }\n //注意用ll,步数可能会很大.\n ll res = Move(start,k-1,6-start[k]-finish[k]) +\n Move(finish,k-1,6-start[k]-finish[k]) + 1;\n printf(\""Case %d: \"", cas++);\n printf(\""%lld\\n\"",res);\n }\n}",COMPILE_ERROR,0,0 1323147245403582464,a1b7320790038a605b92b80bc1705543e396b61300858ff4c9999b42343ef624,2020-11-02 14:17:40,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",WRONG_ANSWER,19,384 1323147761890185216,a1b7320790038a605b92b80bc1705543e396b61300858ff4c9999b42343ef624,2020-11-02 14:19:43,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\nconst int mod = 20090308;\nconst int MAXN=1002;\nlong long a[MAXN],b[MAXN],c[MAXN],d[MAXN],m;\nint n;\nint main()\n{\n a[0]=b[0]=c[0]=d[0]=0;\n while(scanf(\""%d%I64d\"",&n,&m)!=EOF)\n {\n if(m==1)\n {\n a[1]=2;\n for(int i=2;i<=n;i++)\n a[i] =( 2 * a[i-1]+ 2* a[i-2]+3 ) % mod;\n }\n else\n {\n a[1]=b[1]=c[1]=2*m;\n d[1]=m;\n for(int i=2;i<=n;i++)\n {\n d[i]= ( 2*b[i-1]+ m ) % mod;\n b[i]= ( 2*b[i-1]+2*m+d[i-1] ) % mod;\n if(m==2)\n c[i]=( 2* b[i-1]+ 4+ 2* d[i-1]+2* b[i-2] + 4+2* d[i-2] +a[i-2] ) %mod;\n else\n c[i]=( b[i-1]+ m+4*(d[i-1]+m)+c[i-1] ) % mod;\n a[i]= ( b[i-1]+ d[i-1]+ c[i-1]+2*m ) % mod;\n }\n }\n printf(\""%d\\n\"",a[n]);\n }\n return 0;\n}\n\n",MULTIPLE_ERROR,15,356 1323614386300989441,a1b7320790038a605b92b80bc1705543e396b61300858ff4c9999b42343ef624,2020-11-03 21:13:55,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"include\nint h(int m)\n{\n\tint s;\n\tif(m==1) // 确定初始条件\n\t\ts=1;\n\telse\n\t\ts=2*h(m-1)+1;\n\treturn s;\n}\nint main()\n{ \n\tint n;\n\tscanf(\""%d\"",&n);\n\tprintf(\""%ld\"",h(n));\n}",COMPILE_ERROR,0,0 1323614519218491392,a1b7320790038a605b92b80bc1705543e396b61300858ff4c9999b42343ef624,2020-11-03 21:14:27,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"# include\nint h(int m)\n{\n\tint s;\n\tif(m==1) // 确定初始条件\n\t\ts=1;\n\telse\n\t\ts=2*h(m-1)+1;\n\treturn s;\n}\nint main()\n{ \n\tint n;\n\tscanf(\""%d\"",&n);\n\tprintf(\""%ld\"",h(n));\n}",WRONG_ANSWER,15,348 1323614757291372544,a1b7320790038a605b92b80bc1705543e396b61300858ff4c9999b42343ef624,2020-11-03 21:15:24,C,3.0,1316353531113754624,1313471683597295616,1039132196031492096,"# include\nlong h(long m)\n{\n\tlong s;\n\tif(m==1) // 确定初始条件\n\t\ts=1;\n\telse\n\t\ts=2*h(m-1)+1;\n\treturn s;\n}\nint main()\n{ \n\tlong n;\n\tscanf(\""%lld\"",&n);\n\tprintf(\""%lld\"",h(n));\n}",PARTIAL_ACCEPTED,15,364 1324228273866100736,a1b7320790038a605b92b80bc1705543e396b61300858ff4c9999b42343ef624,2020-11-05 13:53:18,Java,20.0,1316353531113754624,1313471683597295616,1039132196031492096,import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\n public static void main(String[] args) {\n Scanner input = new Scanner(System.in);\n int n=input.nextInt();\n BigInteger a=BigInteger.valueOf(1);\n BigInteger b=BigInteger.valueOf(2);\n BigInteger c=BigInteger.valueOf(1);\n for(int i=0;i\n\nvoid move(int n,char x,char y,char z)\n{\n\tif( 1 == n)\n\t{\n\t\tprintf(\""%c-->%c\\n\"",x,z);\n\t}\n\telse\n\t{\n\t\tmove(n-1,x,z,y);\n\t\tprintf(\""%c-->%c\\n\"",x,z);\n\t\tmove(n-1,y,x,z);\n\t}\n}\n\nint main()\n{\n\tchar x='x',y='y',z='z';\n\tint n;\n\t\n\tprintf(\""请输入汉诺塔的层数：\\n\"");\t\n\tscanf(\""%d\"",&n);\n\n\tmove(n,x,y,z);\n\treturn 0; \n}",TIME_LIMIT_EXCEEDED,0,0 1324237589272678400,19f5a3898c736188e6ba134921315d2dcc9d72243a1a7160f111d296f35657d2,2020-11-05 14:30:19,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n\nvoid move(int n,char x,char y,char z)\n{\n\tif( 1 == n)\n\t{\n\t\tprintf(\""%c-->%c\\n\"",x,z);\n\t}\n\telse\n\t{\n\t\tmove(n-1,x,z,y);\n\t\tprintf(\""%c-->%c\\n\"",x,z);\n\t\tmove(n-1,y,x,z);\n\t}\n}\n\nint main()\n{\n\tchar x='x',y='y',z='z';\n\tint n;\n\t\n\tprintf(\""请输入汉诺塔的层数：\\n\"");\t\n\tscanf(\""%d\"",&n);\n\n\tmove(n,x,y,z);\n\treturn 0; \n}",TIME_LIMIT_EXCEEDED,0,0 1324249810707988480,1f687bd10240b2692e1b4453c15118f239ad3d0d47ec7d6cb1899aa0ac09c790,2020-11-05 15:18:52,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nint main(){\n int n,s;\n scanf(\""%d\"",&n);\n s=pow(2,n)-1;\n printf(\""%d\"",s);\n}",WRONG_ANSWER,17,356 1324250236106883072,1f687bd10240b2692e1b4453c15118f239ad3d0d47ec7d6cb1899aa0ac09c790,2020-11-05 15:20:34,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nint main(){\n int n,s;\n scanf(\""%d\"",&n);\n s=pow(2,n)-1;\n printf(\""%d\"",s);\n return 0;\n}",WRONG_ANSWER,16,400 1324252755532001280,1f687bd10240b2692e1b4453c15118f239ad3d0d47ec7d6cb1899aa0ac09c790,2020-11-05 15:30:34,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nint main(){\n double n,s;\n scanf(\""%lf\"",&n);\n s=pow(2,n)-1;\n printf(\""%.2lf\"",s);\n return s;\n}",WRONG_ANSWER,18,356 1324252925707505664,1f687bd10240b2692e1b4453c15118f239ad3d0d47ec7d6cb1899aa0ac09c790,2020-11-05 15:31:15,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nint main(){\n double n,s;\n scanf(\""%lf\"",&n);\n s=pow(2,n)-1;\n printf(\""%.2lf\"",s);\n return 0;\n}",WRONG_ANSWER,15,384 1324264192020103168,1f687bd10240b2692e1b4453c15118f239ad3d0d47ec7d6cb1899aa0ac09c790,2020-11-05 16:16:01,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nint main(){\n double n,s;\n scanf(\""%lf\"",&n);\n s=pow(2,n)-1;\n printf(\""%lf\"",s);\n return 0;\n}",WRONG_ANSWER,44,360 1324270083917295616,1f687bd10240b2692e1b4453c15118f239ad3d0d47ec7d6cb1899aa0ac09c790,2020-11-05 16:39:26,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,#,COMPILE_ERROR,0,0 1324720212931588096,f0c4e08576481ea17177b76f64cab255c679dcf1452f966ab1c326c276bf691c,2020-11-06 22:28:05,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \n#include \n#include \nusing namespace std;\nint main()\n{\n int n,c=0;\n cin>>n;\n stack H[3];\n map m;\n for(int i=n; i>=1; i--)\n {\n H[0].push(i);\n }\n if(n%2==0)\n {\n m[0]='a';\n m[1]='b';\n m[2]='c';\n }\n else\n {\n m[0]='a';\n m[1]='c';\n m[2]='b';\n }\n while(1)\n {\n for(int i=0; i<3; i++)\n {\n if(!H[i].empty()&&H[i].top()==1)\n {\n H[i].pop();\n H[(i+1)%3].push(1);\n printf(\""%c -> %c\\n\"",m[i],m[(i+1)%3]);\n c++;\n if(c==pow(2,n)-1)\n {\n return 0;\n }\n if(H[(i+2)%3].empty()||(!H[i].empty()&&H[i].top() %c\\n\"",m[i],m[(i+2)%3]);\n c++;\n if(c==(pow(2,n)-1))\n {\n return 0;\n }\n }\n else\n {\n H[i].push(H[(i+2)%3].top());\n H[(i+2)%3].pop();\n printf(\""%c -> %c\\n\"",m[(i+2)%3],m[i]);\n c++;\n if(c==(pow(2,n)-1))\n {\n return 0;\n }\n }\n }\n }\n }\n return 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1324720239758356480,f0c4e08576481ea17177b76f64cab255c679dcf1452f966ab1c326c276bf691c,2020-11-06 22:28:11,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \n#include \n#include \nusing namespace std;\nint main()\n{\n int n,c=0;\n cin>>n;\n stack H[3];\n map m;\n for(int i=n; i>=1; i--)\n {\n H[0].push(i);\n }\n if(n%2==0)\n {\n m[0]='a';\n m[1]='b';\n m[2]='c';\n }\n else\n {\n m[0]='a';\n m[1]='c';\n m[2]='b';\n }\n while(1)\n {\n for(int i=0; i<3; i++)\n {\n if(!H[i].empty()&&H[i].top()==1)\n {\n H[i].pop();\n H[(i+1)%3].push(1);\n printf(\""%c -> %c\\n\"",m[i],m[(i+1)%3]);\n c++;\n if(c==pow(2,n)-1)\n {\n return 0;\n }\n if(H[(i+2)%3].empty()||(!H[i].empty()&&H[i].top() %c\\n\"",m[i],m[(i+2)%3]);\n c++;\n if(c==(pow(2,n)-1))\n {\n return 0;\n }\n }\n else\n {\n H[i].push(H[(i+2)%3].top());\n H[(i+2)%3].pop();\n printf(\""%c -> %c\\n\"",m[(i+2)%3],m[i]);\n c++;\n if(c==(pow(2,n)-1))\n {\n return 0;\n }\n }\n }\n }\n }\n return 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1324720519263600640,f0c4e08576481ea17177b76f64cab255c679dcf1452f966ab1c326c276bf691c,2020-11-06 22:29:18,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,#include ,COMPILE_ERROR,0,0 1324920849783898112,4cdf476fee37155f5615c2bc996a672e7c3085e44570c969ce9800832a557c34,2020-11-07 11:45:21,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\nint b=0;\nvoid bt()\n{\nfor(int i=0;i<20;i++) printf(\""*\"");\nfor(i=0;i<20;i++) printf(\""*\"");\nprintf(\""\\n\"");\n}\nvoid move(int n,char one,char two,char three)\n{ \nvoid show(char x,char y);\nif(n==1)\nshow(one,three); \nelse\n{move(n-1,one,three,two);\nshow(one,three);\nmove(n-1,two,one,three);}\n}\nvoid show(char x,char y)\n{\nb++; \nprintf(\""%c--->%c\\n\"",b,x,y);\n}\nvoid main()\n{ \nvoid bt(); \nvoid ps();\nvoid yuanti();\nvoid jd();\nps();\nbt(); \nps(); \nyuanti();\nprintf(\""\\n\""); \njd(); \nprintf(\""\\n\"");\nvoid move(int n,char one,char two,char three);\nint m;\nscanf(\""%d\"",&m);\nmove(m,'A','B','C');\n}",COMPILE_ERROR,0,0 1324921245550034944,4cdf476fee37155f5615c2bc996a672e7c3085e44570c969ce9800832a557c34,2020-11-07 11:46:55,Java,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"import java.util.Scanner;\n\npublic class hanoi {\n \n public static void hanio(int n,String A,String B,String C){\n if(n==1){ \n System.out.println(A+C);\n return;\n }\n else{ \n hanio(n-1,A,C,B);\n System.out.println(A+C);\n hanio(n-1,B,A,C);\n }\n }\n public static void main(String args[]){\n String a = \""a\"";\n String b = \""b\"";\n String c = \""c\"";\n hanio(3,a,b,c);\n }\n}",COMPILE_ERROR,0,0 1324921342958551040,4cdf476fee37155f5615c2bc996a672e7c3085e44570c969ce9800832a557c34,2020-11-07 11:47:18,Java,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"import java.util.Scanner;\npublic class hanoi{\n public static void hanio(int n,String A,String B,String C){\n if(n==1){ \n System.out.println(A+C);\n return;\n }\n else{ \n hanio(n-1,A,C,B);\n System.out.println(A+C);\n hanio(n-1,B,A,C);\n }\n }\n public static void main(String args[]){\n String a = \""a\"";\n String b = \""b\"";\n String c = \""c\"";\n hanio(3,a,b,c);\n }\n}",COMPILE_ERROR,0,0 1325253051552968704,74f322235a9915e9bf81b17401fd2e34d4586a5aef8491254747339e3e68cc73,2020-11-08 09:45:24,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \n#include \n#include \nusing namespace std;\nint main()\n{\n int n,c=0;\n cin>>n;\n stack H[3];\n map m;\n for(int i=n; i>=1; i--)\n {\n H[0].push(i);\n }\n if(n%2==0)\n {\n m[0]='a';\n m[1]='b';\n m[2]='c';\n }\n else\n {\n m[0]='a';\n m[1]='c';\n m[2]='b';\n }\n while(1)\n {\n for(int i=0; i<3; i++)\n {\n if(!H[i].empty()&&H[i].top()==1)\n {\n H[i].pop();\n H[(i+1)%3].push(1);\n printf(\""%c -> %c\\n\"",m[i],m[(i+1)%3]);\n c++;\n if(c==pow(2,n)-1)\n {\n return 0;\n }\n if(H[(i+2)%3].empty()||(!H[i].empty()&&H[i].top() %c\\n\"",m[i],m[(i+2)%3]);\n c++;\n if(c==(pow(2,n)-1))\n {\n return 0;\n }\n }\n else\n {\n H[i].push(H[(i+2)%3].top());\n H[(i+2)%3].pop();\n printf(\""%c -> %c\\n\"",m[(i+2)%3],m[i]);\n c++;\n if(c==(pow(2,n)-1))\n {\n return 0;\n }\n }\n }\n }\n }\n return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1325253187469389824,74f322235a9915e9bf81b17401fd2e34d4586a5aef8491254747339e3e68cc73,2020-11-08 09:45:56,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",WRONG_ANSWER,16,380 1325253730796355584,74f322235a9915e9bf81b17401fd2e34d4586a5aef8491254747339e3e68cc73,2020-11-08 09:48:06,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"# 递归法解hanoi塔问题\ndef move(n,fromSpike,toSpike):\n global count,top\n count+=1\n print(f\""第{count}回合：{n} 从{fromSpike} 移到 {toSpike}\"")\n top[fromSpike]= '0' if str(n+1) in top.values() else str(n+1)\n top[toSpike]=str(n)\n \ndef tower(n,fromSpike,spareSpike,toSpike):\n if n==1:\n move(1,fromSpike,toSpike)\n else:\n tower(n-1,fromSpike,toSpike,spareSpike)\n move(n,fromSpike,toSpike)\n tower(n-1,spareSpike,fromSpike,toSpike)\n \ncount = 0\ntop={'A':'1','B':'0','C':'0'}\ntower(4,'A','B','C')",COMPILE_ERROR,0,0 1325253765936234496,74f322235a9915e9bf81b17401fd2e34d4586a5aef8491254747339e3e68cc73,2020-11-08 09:48:14,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"\ndef move(n,fromSpike,toSpike):\n global count,top\n count+=1\n print(f\""第{count}回合：{n} 从{fromSpike} 移到 {toSpike}\"")\n top[fromSpike]= '0' if str(n+1) in top.values() else str(n+1)\n top[toSpike]=str(n)\n \ndef tower(n,fromSpike,spareSpike,toSpike):\n if n==1:\n move(1,fromSpike,toSpike)\n else:\n tower(n-1,fromSpike,toSpike,spareSpike)\n move(n,fromSpike,toSpike)\n tower(n-1,spareSpike,fromSpike,toSpike)\n \ncount = 0\ntop={'A':'1','B':'0','C':'0'}\ntower(4,'A','B','C')",COMPILE_ERROR,0,0 1325254040747032576,74f322235a9915e9bf81b17401fd2e34d4586a5aef8491254747339e3e68cc73,2020-11-08 09:49:19,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t/*这里抽象的很，需要理解为将n个盘子从one座移到three座(借助two座)的过程【其中one、two、three只是个形式位置】 \n\t\t\t\t\t\t\t\t\t\t\t\t\t----后面的hanoi(n-1,one,three,two)其实看成开头的定义hanoi(int n,char one,char two,char three)的形式样子 \n\t\t\t\t\t\t\t\t\t\t\t\t\t也就是one(实际位置如A)借助three(实际位置如C)移动到two(实际位置如B).下面的(3)其实和上面介绍的方法一样 \n\t\t\t\t\t\t\t\t\t\t\t\t\tone、two、three只是个形式位置，但A、B、C才是实际位置*/\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tprintf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""The step to move %d diskes:\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""The total number of times is %d\"",i-1);\n\treturn 0;\n}\n\n",TIME_LIMIT_EXCEEDED,0,0 1325254126079127552,74f322235a9915e9bf81b17401fd2e34d4586a5aef8491254747339e3e68cc73,2020-11-08 09:49:40,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=0;\t\n\nvoid hanoi(int n, char chufadi, char jiezhudian, char mudidi)\t \n{\t\t\t\t\t\t\t\t\t\t\t\t//假设一开始针对n曾盘子chufadi为A,jiezhudian为B(jiezhudian像跳台或者辅助器一样),mudidi为C \n\tvoid move(char chufadi, char mudidi);\t\t// ^\n\t if(n<=0)\t\t\t\t//防止n为0的情况\t// |\n\treturn ;\t\t\t\t\t\t\t\t\t// |\n\t \t\t\t\t\t\t\t\t\t\t\t// |\n\tif(n==1)\t\t\t\t\t\t\t\t\t// |\n\tmove( chufadi, mudidi);\t\t\t\t\t\t// |\n\telse{\t\t\t\t\t\t\t\t\t\t// |\n\t\t\t\t\t\t\t\t\t\t\t\t// |\n\thanoi(n-1, chufadi, mudidi, jiezhudian);\t// 这时候针对n-1层盘子,chufadi还是原来的chufadi(A)，但是jiezhudian由原来的jiezhudian(B)变为了原来的mudidi(C) \n\tmove( chufadi, mudidi);\t\t\t\t\t\t//这时候需要将第n层盘子就从原来的chufadi(A)移到mudidi(C) \n\thanoi(n-1, jiezhudian, chufadi, mudidi);\t//这时候针对n-1层已经移到B的盘子其实移动的方法和第15行几乎一样 \n\t\n\t}\n}\n\nvoid move(char chufadi, char mudidi)\n{\n\tprintf(\""%c-->%c\\n\"",chufadi,mudidi);\n\ti++;\n}\n\nint main(int argc,char const *argv[])\n{\n\tint n;\n\tprintf(\""选择在A上的盘子个数:\\n\"");\n\tscanf(\""%d\"",&n);\n\tprintf(\""\\n\"");\n\thanoi(n,'A','B','C');\n\tprintf(\""需要移动盘子的总次数:%d\"",i);\n\treturn 0;\n}\n\n",TIME_LIMIT_EXCEEDED,0,0 1325330876549124096,115e081737112472450ff50dcf80e09a4b1aaee6d4f353ebacba7b0229d62038,2020-11-08 14:54:39,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nvoid hanoi(int n, int x, int y, int z) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1)\n printf(\""%c-->%c\\n\"", x, z);\n else\n {\n hanoi(n - 1, x, z, y);\n printf(\""%c-->%c\\n\"", x, z);\n hanoi(n - 1, y, x, z);\n }\n}\nint main(void)\n{\n int m;\n printf(\""Input unmber:\"");\n scanf(\""%d\"", &m);\n printf(\""moving %2d diskes:\\n\"", m);\n hanoi(m, 'a', 'b', 'c');\n system(\""pause\"");\n}",TIME_LIMIT_EXCEEDED,0,0 1325331013766791168,115e081737112472450ff50dcf80e09a4b1aaee6d4f353ebacba7b0229d62038,2020-11-08 14:55:11,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nvoid hanoi(int n, int x, int y, int z) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1)\n printf(\""%c-->%c\\n\"", x, z);\n else\n {\n hanoi(n - 1, x, z, y);\n printf(\""%c-->%c\\n\"", x, z);\n hanoi(n - 1, y, x, z);\n }\n}\nint main(void)\n{\n int m;\n printf(\""Input unmber:\"");\n scanf(\""%d\"", &m);\n printf(\""moving %2d diskes:\\n\"", m);\n hanoi(m, 'a', 'b', 'c');\n system(\""pause\"");\n}",TIME_LIMIT_EXCEEDED,0,0 1325331047534120960,115e081737112472450ff50dcf80e09a4b1aaee6d4f353ebacba7b0229d62038,2020-11-08 14:55:19,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nvoid hanoi(int n, int x, int y, int z) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1)\n printf(\""%c-->%c\\n\"", x, z);\n else\n {\n hanoi(n - 1, x, z, y);\n printf(\""%c-->%c\\n\"", x, z);\n hanoi(n - 1, y, x, z);\n }\n}\nint main(void)\n{\n int m;\n printf(\""Input unmber:\"");\n scanf(\""%d\"", &m);\n printf(\""moving %2d diskes:\\n\"", m);\n hanoi(m, 'a', 'b', 'c');\n system(\""pause\"");\n}",TIME_LIMIT_EXCEEDED,0,0 1325331471709290496,115e081737112472450ff50dcf80e09a4b1aaee6d4f353ebacba7b0229d62038,2020-11-08 14:57:00,C,,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nvoid hanoi(int n, int x, int y, int z) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1)\n printf(\""%c-->%c\\n\"", x, z);\n else\n {\n hanoi(n - 1, x, z, y);\n printf(\""%c-->%c\\n\"", x, z);\n hanoi(n - 1, y, x, z);\n }\n}\nint main(void)\n{\n int m;\n printf(\""Input unmber:\"");\n scanf(\""%d\"", &m);\n printf(\""moving %2d diskes:\\n\"", m);\n hanoi(m, 'a', 'b', 'c');\n system(\""pause\"");\n}",none,0,0 1325331486263525376,115e081737112472450ff50dcf80e09a4b1aaee6d4f353ebacba7b0229d62038,2020-11-08 14:57:04,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nvoid hanoi(int n, int x, int y, int z) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1)\n printf(\""%c-->%c\\n\"", x, z);\n else\n {\n hanoi(n - 1, x, z, y);\n printf(\""%c-->%c\\n\"", x, z);\n hanoi(n - 1, y, x, z);\n }\n}\nint main(void)\n{\n int m;\n printf(\""Input unmber:\"");\n scanf(\""%d\"", &m);\n printf(\""moving %2d diskes:\\n\"", m);\n hanoi(m, 'a', 'b', 'c');\n system(\""pause\"");\n}",TIME_LIMIT_EXCEEDED,0,0 1325339476520677376,3c2a7ca877b9fd0a8eb01c529674befe6a0563d3cd20c915bcd1315ad1954c3f,2020-11-08 15:28:49,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nvoid hanoi(int n,char A,char B,char C)\n{\n if(n==1)//只有一个盘子，就把它直接搬到C\n printf(\""Move sheet %d from %c to %c\\n\"",n,A,C);\n else{//盘子数超过2个，每次处理两个盘子，A->B,A->C,B->C\n hanoi(n-1,A,C,B);\n printf(\""Move sheet %d from %c to %c\\n\"",n,A,C);\n hanoi(n-1,B,A,C);\n }\n}\nint main()\n{\n\tios::sync_with_stdio(false);\n\tint n;\n\tcin>>n;\n\thanoi(n,'A','B','C');\n\treturn 0;\n }\n",COMPILE_ERROR,0,0 1325339496474001408,3c2a7ca877b9fd0a8eb01c529674befe6a0563d3cd20c915bcd1315ad1954c3f,2020-11-08 15:28:54,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nvoid hanoi(int n,char A,char B,char C)\n{\n if(n==1)//只有一个盘子，就把它直接搬到C\n printf(\""Move sheet %d from %c to %c\\n\"",n,A,C);\n else{//盘子数超过2个，每次处理两个盘子，A->B,A->C,B->C\n hanoi(n-1,A,C,B);\n printf(\""Move sheet %d from %c to %c\\n\"",n,A,C);\n hanoi(n-1,B,A,C);\n }\n}\nint main()\n{\n\tios::sync_with_stdio(false);\n\tint n;\n\tcin>>n;\n\thanoi(n,'A','B','C');\n\treturn 0;\n }\n",TIME_LIMIT_EXCEEDED,0,0 1325339581575417856,3c2a7ca877b9fd0a8eb01c529674befe6a0563d3cd20c915bcd1315ad1954c3f,2020-11-08 15:29:14,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\ntypedef long long ll;\nll hanoi(int n,int k)\n{\n if(n==k)//最大的盘子只移动一次\n return 1;\n if(n==1)//只有一个盘子，不需要移动\n return 0;\n return 2*hanoi(n-1,k);//上面n-1层移动两次\n }\nint main()\n{\n ios::sync_with_stdio(false);\n int n,k,t;\n cin>>t;\n while(t--){\n cin>>n>>k;\n cout<\n#include\n\nvoid hanoi(int n, int x, int y, int z) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1)\n printf(\""%c-->%c\\n\"", x, z);\n else\n {\n hanoi(n - 1, x, z, y);\n printf(\""%c-->%c\\n\"", x, z);\n hanoi(n - 1, y, x, z);\n }\n}\n\nint main(void)\n{\n int m;\n printf(\""Input unmber:\"");\n scanf(\""%d\"", &m);\n printf(\""moving %2d diskes:\\n\"", m);\n hanoi(m, 'a', 'b', 'c');\n system(\""pause\"");\n}",TIME_LIMIT_EXCEEDED,0,0 1325341284580282368,115e081737112472450ff50dcf80e09a4b1aaee6d4f353ebacba7b0229d62038,2020-11-08 15:36:00,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\n\nvoid hanoi(int n, int x, int y, int z) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1)\n printf(\""%c-->%c\\n\"", x, z);\n else\n {\n hanoi(n - 1, x, z, y);\n printf(\""%c-->%c\\n\"", x, z);\n hanoi(n - 1, y, x, z);\n }\n}\n\nint main(void)\n{\n int m;\n printf(\""Input unmber:\"");\n scanf(\""%d\"", &m);\n printf(\""moving %2d diskes:\\n\"", m);\n hanoi(m, 'a', 'b', 'c');\n system(\""pause\"");\n}",TIME_LIMIT_EXCEEDED,0,0 1325342430602539008,115e081737112472450ff50dcf80e09a4b1aaee6d4f353ebacba7b0229d62038,2020-11-08 15:40:33,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\n\nvoid hanoi(int n, int x, int y, int z) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1)\n printf(\""%c-->%c\\n\"", x, z);\n else\n {\n hanoi(n - 1, x, z, y);\n printf(\""%c-->%c\\n\"", x, z);\n hanoi(n - 1, y, x, z);\n }\n}\nint main(void)\n{\n int m;\n printf(\""Input unmber:\"");\n scanf(\""%d\"", &m);\n printf(\""moving %2d diskes:\\n\"", m);\n hanoi(m, 'a', 'b', 'c');\n system(\""pause\"");\n}",TIME_LIMIT_EXCEEDED,0,0 1325342459480330240,115e081737112472450ff50dcf80e09a4b1aaee6d4f353ebacba7b0229d62038,2020-11-08 15:40:40,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\n\nvoid hanoi(int n, int x, int y, int z) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1)\n printf(\""%c-->%c\\n\"", x, z);\n else\n {\n hanoi(n - 1, x, z, y);\n printf(\""%c-->%c\\n\"", x, z);\n hanoi(n - 1, y, x, z);\n }\n}\nint main(void)\n{\n int m;\n printf(\""Input unmber:\"");\n scanf(\""%d\"", &m);\n printf(\""moving %2d diskes:\\n\"", m);\n hanoi(m, 'a', 'b', 'c');\n system(\""pause\"");\n}",TIME_LIMIT_EXCEEDED,0,0 1325342482428379136,115e081737112472450ff50dcf80e09a4b1aaee6d4f353ebacba7b0229d62038,2020-11-08 15:40:46,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\n\nvoid hanoi(int n, int x, int y, int z) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1)\n printf(\""%c-->%c\\n\"", x, z);\n else\n {\n hanoi(n - 1, x, z, y);\n printf(\""%c-->%c\\n\"", x, z);\n hanoi(n - 1, y, x, z);\n }\n}\nint main(void)\n{\n int m;\n printf(\""Input unmber:\"");\n scanf(\""%d\"", &m);\n printf(\""moving %2d diskes:\\n\"", m);\n hanoi(m, 'a', 'b', 'c');\n system(\""pause\"");\n}",TIME_LIMIT_EXCEEDED,0,0 1325342518192197632,115e081737112472450ff50dcf80e09a4b1aaee6d4f353ebacba7b0229d62038,2020-11-08 15:40:54,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\n\nvoid hanoi(int n, int x, int y, int z) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1)\n printf(\""%c-->%c\\n\"", x, z);\n else\n {\n hanoi(n - 1, x, z, y);\n printf(\""%c-->%c\\n\"", x, z);\n hanoi(n - 1, y, x, z);\n }\n}\nint main(void)\n{\n int m;\n printf(\""Input unmber:\"");\n scanf(\""%d\"", &m);\n printf(\""moving %2d diskes:\\n\"", m);\n hanoi(m, 'a', 'b', 'c');\n system(\""pause\"");\n}",TIME_LIMIT_EXCEEDED,0,0 1325393278322917376,cefae596e21a4b1bb9e98c6e1c797753da143fab18df487780dd3a98d529a0ac,2020-11-08 19:02:36,Python,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"# 递归法解hanoi塔问题\ndef move(n,fromSpike,toSpike):\n global count,top\n count+=1\n print(f\""第{count}回合：{n} 从{fromSpike} 移到 {toSpike}\"")\n top[fromSpike]= '0' if str(n+1) in top.values() else str(n+1)\n top[toSpike]=str(n)\n \ndef tower(n,fromSpike,spareSpike,toSpike):\n if n==1:\n move(1,fromSpike,toSpike)\n else:\n tower(n-1,fromSpike,toSpike,spareSpike)\n move(n,fromSpike,toSpike)\n tower(n-1,spareSpike,fromSpike,toSpike)\n \ncount = 0\ntop={'A':'1','B':'0','C':'0'}\ntower(4,'A','B','C')",NON_ZERO_EXIT_CODE,74,2816 1325406536990806016,a43361c1b4c88ec724dd48bef3884bc201a1a7f80bb281b331ecd6dee1b623a7,2020-11-08 19:55:17,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\nvoid hano(int n,char x,char y,char z);\nint main ()\n{\n\tint n;\n\tchar x,y,z;\n\tscanf(\""%d\\n\"",&n);\n\tscanf(\""%c %c %c \"",&x,&y,&z);\n\thano(n,x,y,z);\n}\nvoid hano(int n,char x,char y,char z)\n{\n\tif(n==1){\n\t\tprintf(\""%d: %c -> %c\\n\"",n,x,y);\n\t}\n\telse{\n\t\thano(n-1,x,z,y);\n\t\tprintf(\""%d: %c -> %c\\n\"",n,x,y);\n\t\thano(n-1,z,y,x);\n\t}\n}",TIME_LIMIT_EXCEEDED,0,0 1325406559992360960,a43361c1b4c88ec724dd48bef3884bc201a1a7f80bb281b331ecd6dee1b623a7,2020-11-08 19:55:23,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\nvoid hano(int n,char x,char y,char z);\nint main ()\n{\n\tint n;\n\tchar x,y,z;\n\tscanf(\""%d\\n\"",&n);\n\tscanf(\""%c %c %c \"",&x,&y,&z);\n\thano(n,x,y,z);\n}\nvoid hano(int n,char x,char y,char z)\n{\n\tif(n==1){\n\t\tprintf(\""%d: %c -> %c\\n\"",n,x,y);\n\t}\n\telse{\n\t\thano(n-1,x,z,y);\n\t\tprintf(\""%d: %c -> %c\\n\"",n,x,y);\n\t\thano(n-1,z,y,x);\n\t}\n}",TIME_LIMIT_EXCEEDED,0,0 1325406602279342080,a43361c1b4c88ec724dd48bef3884bc201a1a7f80bb281b331ecd6dee1b623a7,2020-11-08 19:55:33,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\nvoid hano(int n,char x,char y,char z);\nint main ()\n{\n\tint n;\n\tchar x,y,z;\n\tscanf(\""%d\\n\"",&n);\n\tscanf(\""%c %c %c \"",&x,&y,&z);\n\thano(n,x,y,z);\n}\nvoid hano(int n,char x,char y,char z)\n{\n\tif(n==1){\n\t\tprintf(\""%d: %c -> %c\\n\"",n,x,y);\n\t}\n\telse{\n\t\thano(n-1,x,z,y);\n\t\tprintf(\""%d: %c -> %c\\n\"",n,x,y);\n\t\thano(n-1,z,y,x);\n\t}\n}",TIME_LIMIT_EXCEEDED,0,0 1325410733996949504,28c453845408f53850a922f6f3c71a4cc0c271712762da6213c8c8ee97a2683e,2020-11-08 20:11:58,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"\n# 递归法解hanoi塔问题\n\ndef move(n,fromSpike,toSpike):\n\n global count,top\n\n count+=1\n\n print(f\""第{count}回合：{n} 从{fromSpike} 移到 {toSpike}\"")\n\n top[fromSpike]= '0' if str(n+1) in top.values() else str(n+1)\n\n top[toSpike]=str(n)\n\n \n\ndef tower(n,fromSpike,spareSpike,toSpike):\n\n if n==1:\n\n move(1,fromSpike,toSpike)\n\n else:\n\n tower(n-1,fromSpike,toSpike,spareSpike)\n\n move(n,fromSpike,toSpike)\n\n tower(n-1,spareSpike,fromSpike,toSpike)\n\n \n\ncount = 0\n\ntop={'A':'1','B':'0','C':'0'}\n\ntower(4,'A','B','C')\n",COMPILE_ERROR,0,0 1325410913440845824,28c453845408f53850a922f6f3c71a4cc0c271712762da6213c8c8ee97a2683e,2020-11-08 20:12:41,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t/*这里抽象的很，需要理解为将n个盘子从one座移到three座(借助two座)的过程【其中one、two、three只是个形式位置】 \n\t\t\t\t\t\t\t\t\t\t\t\t\t----后面的hanoi(n-1,one,three,two)其实看成开头的定义hanoi(int n,char one,char two,char three)的形式样子 \n\t\t\t\t\t\t\t\t\t\t\t\t\t也就是one(实际位置如A)借助three(实际位置如C)移动到two(实际位置如B).下面的(3)其实和上面介绍的方法一样 \n\t\t\t\t\t\t\t\t\t\t\t\t\tone、two、three只是个形式位置，但A、B、C才是实际位置*/\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tprintf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""The step to move %d diskes:\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""The total number of times is %d\"",i-1);\n\treturn 0;\n}\n\n",TIME_LIMIT_EXCEEDED,0,0 1325411088319168512,28c453845408f53850a922f6f3c71a4cc0c271712762da6213c8c8ee97a2683e,2020-11-08 20:13:23,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\t\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\n\t\tmove(one,three);\t\t\t\t\t\t\t\n\t\thanoi(n-1,two,one,three);\t\t\t\t\n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\nvoid move(char x,char y)\t\t\t\t\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t\n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tprintf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\n\tprintf(\""The step to move %d diskes:\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""The total number of times is %d\"",i-1);\n\treturn 0;\n}\n\n",TIME_LIMIT_EXCEEDED,0,0 1325411160745390080,28c453845408f53850a922f6f3c71a4cc0c271712762da6213c8c8ee97a2683e,2020-11-08 20:13:40,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\t\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\n\t\tmove(one,three);\t\t\t\t\t\t\t\n\t\thanoi(n-1,two,one,three);\t\t\t\t\n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\nvoid move(char x,char y)\t\t\t\t\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t\n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tprintf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\n\tprintf(\""The step to move %d diskes:\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""The total number of times is %d\"",i-1);\n\treturn 0;\n}\n\n",TIME_LIMIT_EXCEEDED,0,0 1325411386831978496,28c453845408f53850a922f6f3c71a4cc0c271712762da6213c8c8ee97a2683e,2020-11-08 20:14:34,C,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=0;\t\n\nvoid hanoi(int n, char chufadi, char jiezhudian, char mudidi)\t \n{\n\tvoid move(char chufadi, char mudidi);\n\t if(n<=0)\n\treturn ;\t\t\t\t\t\t\t\t\t\n\t \t\t\t\t\t\t\t\t\t\t\t\n\tif(n==1)\t\t\t\t\t\t\t\t\t\n\tmove( chufadi, mudidi);\t\t\t\t\t\t\n\telse{\t\t\t\t\t\t\t\t\t\t\n\thanoi(n-1, chufadi, mudidi, jiezhudian);\n\tmove( chufadi, mudidi);\t\n\thanoi(n-1, jiezhudian, chufadi, mudidi);\t\n\t\n\t}\n}\n\nvoid move(char chufadi, char mudidi)\n{\n\tprintf(\""%c-->%c\\n\"",chufadi,mudidi);\n\ti++;\n}\n\nint main(int argc,char const *argv[])\n{\n\tint n;\n\tprintf(\""选择在A上的盘子个数:\\n\"");\n\tscanf(\""%d\"",&n);\n\tprintf(\""\\n\"");\n\thanoi(n,'A','B','C');\n\tprintf(\""需要移动盘子的总次数:%d\"",i);\n\treturn 0;\n}\n\n",TIME_LIMIT_EXCEEDED,0,0 1325418989783924736,cefae596e21a4b1bb9e98c6e1c797753da143fab18df487780dd3a98d529a0ac,2020-11-08 20:44:46,Python,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"# 递归法解hanoi塔问题\ndef move(n,fromSpike,toSpike):\n global count,top\n count+=1\n print(f\""第{count}回合：{n} 从{fromSpike} 移到 {toSpike}\"")\n top[fromSpike]= '0' if str(n+1) in top.values() else str(n+1)\n top[toSpike]=str(n)\n \ndef tower(n,fromSpike,spareSpike,toSpike):\n if n==1:\n move(1,fromSpike,toSpike)\n else:\n tower(n-1,fromSpike,toSpike,spareSpike)\n move(n,fromSpike,toSpike)\n tower(n-1,spareSpike,fromSpike,toSpike)\n \ncount = 0\ntop={'A':'1','B':'0','C':'0'}\ntower(4,'A','B','C')",NON_ZERO_EXIT_CODE,83,2816 1325425564916469760,f63a876d10625fe2696c0e33094922d719d76279b37dd3343cf9dcd053206d8b,2020-11-08 21:10:54,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\n\nvoid hanoi(int n, int x, int y, int z) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1)\n printf(\""%c-->%c\\n\"", x, z);\n else\n {\n hanoi(n - 1, x, z, y);\n printf(\""%c-->%c\\n\"", x, z);\n hanoi(n - 1, y, x, z);\n }\n}\n\nint main(void)\n{\n int m;\n printf(\""Input unmber:\"");\n scanf(\""%d\"", &m);\n printf(\""moving %2d diskes:\\n\"", m);\n hanoi(m, 'a', 'b', 'c');\n system(\""pause\"");\n}",TIME_LIMIT_EXCEEDED,0,0 1325426468394708992,f63a876d10625fe2696c0e33094922d719d76279b37dd3343cf9dcd053206d8b,2020-11-08 21:14:29,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nlong count=0;\nvoid hanoi(int n) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1)\n count++;\n else\n {\n count+=2;\n }\n}\n\nint main(void)\n{\n int m;\n scanf(\""%d\"", &m);\n hanoi(m);\n printf(\""%ld\"",count);\n}",WRONG_ANSWER,14,348 1325427021574094848,f63a876d10625fe2696c0e33094922d719d76279b37dd3343cf9dcd053206d8b,2020-11-08 21:16:41,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nlong count=0;\nvoid hanoi(long n) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1){\n \n count++;\n hanoi(n-1);\n }\n else\n {\n count+=2;\n han(n-1);\n }\n}\n\nint main(void)\n{\n long m;\n scanf(\""%d\"", &m);\n hanoi(m);\n printf(\""%ld\"",count);\n}",COMPILE_ERROR,0,0 1325427107997728768,f63a876d10625fe2696c0e33094922d719d76279b37dd3343cf9dcd053206d8b,2020-11-08 21:17:02,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nlong count=0;\nvoid hanoi(long n) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1){\n \n count++;\n hanoi(n-1);\n }\n else\n {\n count+=2;\n han(n-1);\n }\n}\n\nint main(void)\n{\n long m;\n scanf(\""%ld\"", &m);\n hanoi(m);\n printf(\""%ld\"",count);\n}",COMPILE_ERROR,0,0 1325427431058780160,f63a876d10625fe2696c0e33094922d719d76279b37dd3343cf9dcd053206d8b,2020-11-08 21:18:19,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nlong count=0;\nvoid hanoi(long n) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1){\n \n count++;\n hanoi(n-1);\n }\n else\n {\n count+=2;\n han(n-1);\n }\n}\n\nint main(void)\n{\n long m=0;\n scanf(\""%ld\"", &m);\n hanoi(m);\n printf(\""%ld\"",count);\n}",COMPILE_ERROR,0,0 1325427609996185600,f63a876d10625fe2696c0e33094922d719d76279b37dd3343cf9dcd053206d8b,2020-11-08 21:19:02,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nlong count=0;\nvoid hanoi(long n) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1){\n \n count++;\n hanoi(n-1);\n }\n else\n {\n count+=2;\n han(n-1);\n }\n}\n\nint main(void)\n{\n long m=0;\n (void)scanf(\""%ld\"", &m);\n hanoi(m);\n printf(\""%ld\"",count);\n}",COMPILE_ERROR,0,0 1325427809188888576,f63a876d10625fe2696c0e33094922d719d76279b37dd3343cf9dcd053206d8b,2020-11-08 21:19:49,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nlong count=0;\nvoid han(long n) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1){\n \n count++;\n han(n-1);\n }\n else\n {\n count+=2;\n han(n-1);\n }\n}\n\nint main(void)\n{\n long m=0;\n scanf(\""%ld\"", &m);\n han(m);\n printf(\""%ld\"",count);\n}",TIME_LIMIT_EXCEEDED,0,0 1325427941518159872,f63a876d10625fe2696c0e33094922d719d76279b37dd3343cf9dcd053206d8b,2020-11-08 21:20:21,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nlong count=0;\nvoid han(long n) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1){\n \n count++;\n han(n-1);\n }\n else\n {\n count+=2;\n han(n-1);\n }\n}\n\nint main(void)\n{\n int m=0;\n scanf(\""%d\"", &m);\n han(m);\n printf(\""%ld\"",count);\n}",TIME_LIMIT_EXCEEDED,0,0 1325428541862494208,f63a876d10625fe2696c0e33094922d719d76279b37dd3343cf9dcd053206d8b,2020-11-08 21:22:44,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nlong int count=0;\nvoid han(long n) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1){\n \n count++;\n han(n-1);\n }\n else\n {\n count+=2;\n han(n-1);\n }\n}\n\nint main(void)\n{\n long int m=0;\n (void)scanf(\""%ld\"", &m);\n han(m);\n printf(\""%ld\"",count);\n}",TIME_LIMIT_EXCEEDED,0,0 1325428650163617792,f63a876d10625fe2696c0e33094922d719d76279b37dd3343cf9dcd053206d8b,2020-11-08 21:23:10,C++,0.0,1316353531113754624,1313471683597295616,1039132196031492096,"#include\n#include\nlong int count=0;\nvoid han(long n) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1){\n \n count++;\n han(n-1);\n }\n else\n {\n count+=2;\n han(n-1);\n }\n}\n\nint main(void)\n{\n long int m=0;\n m=scanf(\""%ld\"", &m);\n han(m);\n printf(\""%ld\"",count);\n}",TIME_LIMIT_EXCEEDED,0,0 1321636070555725824,cc0bf9e8716f1a485c7c1c8485a0be26c3bab2688bd3d6fadf85d388de101b0c,2020-10-29 10:12:48,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\n\nusing namespace std;\n\nlong long int HanioCount(int count)\n\nint main(){\n int count;\n \n cout << HanioCount(count);\n \n return 0;\n}\n\nlong long int HanioCount(int count){\n return pow(2, n)-1;\n}",COMPILE_ERROR,0,0 1321636131989696512,cc0bf9e8716f1a485c7c1c8485a0be26c3bab2688bd3d6fadf85d388de101b0c,2020-10-29 10:13:03,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\n\nusing namespace std;\n\nlong long int HanioCount(int count)\n\nint main(){\n int count;\n \n cout << HanioCount(count);\n \n return 0;\n}\n\nlong long int HanioCount(int count){\n return pow(2, n)-1;\n}",COMPILE_ERROR,0,0 1321636253642309632,cc0bf9e8716f1a485c7c1c8485a0be26c3bab2688bd3d6fadf85d388de101b0c,2020-10-29 10:13:32,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\n\nusing namespace std;\n\nlong long int HanoiCount(int count)\n\nint main(){\n int count;\n \n cin >> count;\n cout << HanoiCount(count);\n \n return 0;\n}\n\nlong long int HanoiCount(int count){\n return pow(2, n)-1;\n}",COMPILE_ERROR,0,0 1321636295131344896,cc0bf9e8716f1a485c7c1c8485a0be26c3bab2688bd3d6fadf85d388de101b0c,2020-10-29 10:13:42,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\n\nusing namespace std;\n\nlong long int HanoiCount(int count)\n\nint main(){\n int count;\n \n cin >> count;\n cout << HanoiCount(count);\n \n return 0;\n}\n\nlong long int HanoiCount(int count){\n return pow(2, count)-1;\n}",COMPILE_ERROR,0,0 1321636348886564864,cc0bf9e8716f1a485c7c1c8485a0be26c3bab2688bd3d6fadf85d388de101b0c,2020-10-29 10:13:55,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\n\nusing namespace std;\n\nlong long int HanoiCount(int count);\n\nint main(){\n int count;\n \n cin >> count;\n cout << HanoiCount(count);\n \n return 0;\n}\n\nlong long int HanoiCount(int count){\n return pow(2, count)-1;\n}",WRONG_ANSWER,19,384 1321636502959116288,cc0bf9e8716f1a485c7c1c8485a0be26c3bab2688bd3d6fadf85d388de101b0c,2020-10-29 10:14:31,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\n\nusing namespace std;\n\nlong int HanoiCount(int count);\n\nint main(){\n int count;\n \n cin >> count;\n cout << HanoiCount(count);\n \n return 0;\n}\n\nlong int HanoiCount(int count){\n return pow(2, count)-1;\n}",WRONG_ANSWER,20,476 1323228598255009792,688278197b1815d2853f10eaa1f5c60c5a620ca8c330a52225c4f756afd162ce,2020-11-02 19:40:56,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n #include \n #include \n using namespace std;\n const int N = 15;\n int d[N], f[N];\n int main(){\n d[1] = 1;\n for(int i = 2; i <= 12; ++ i)\n d[i] = d[i-1]*2 + 1;\n memset(f, 0x3f, sizeof f);\n f[1] = 1;\n for(int i = 2; i <= 12; ++ i)\n for(int j = 0; j < i; ++ j)\n f[i] = min(f[i], f[j] * 2 + d[i-j]);\n for(int i = 1; i < 13; ++ i)cout << f[i] << endl;\n return 0;\n }",WRONG_ANSWER,20,484 1323228839254511616,688278197b1815d2853f10eaa1f5c60c5a620ca8c330a52225c4f756afd162ce,2020-11-02 19:41:54,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\nvoid move(int n, char a, char b, char c);\nint i = 1;\nint main()\n{\n int num;\n cout << \""请输入圆盘的个数\"";\n cin >> num;\n move(num, 'A', 'B', 'C');\n system(\""pause\"");\n return 0;\n}\nvoid move(int n, char a, char b, char c)//中间盘永远时中转盘\n{\n if (n == 1)\n {\n cout << \""第\"" << i++ << \""步，将第\"" << n << \""个从\"" << a << \""移动到\"" << c << endl;\n }\n else\n {\n move(n - 1, a, c, b);\n cout << \""第\"" << i++ << \""步，将第\"" << n << \""个从\"" << a << \""移动到\"" << c << endl;\n move(n - 1, b, a, c);\n }\n}",TIME_LIMIT_EXCEEDED,0,0 1323228998973599744,688278197b1815d2853f10eaa1f5c60c5a620ca8c330a52225c4f756afd162ce,2020-11-02 19:42:32,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"\n#include\nusing namespace std;\nvoid hanoi(int n,char A,char B,char C)\n{\n\tif(n==1)\n\tcout<\""<\""<>n;\n\thanoi(n,'A','B','C');\n}",TIME_LIMIT_EXCEEDED,0,0 1324958465594015744,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-07 14:14:49,C++,3.0,1320359192822747136,1313471683597295616,1039132196031492096,#include \nusing namespace std;\n\nlong long int f(int n)\n{\n if(n == 1) return 1;\n else return 2 * f(n - 1) + 1;\n\n}\n\nint main()\n{\n int n;\n cin >> n;\n cout << f(n) << endl;\n return 0;\n}\n,PARTIAL_ACCEPTED,15,512 1324960282843332608,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-07 14:22:02,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,#include \nusing namespace std;\n\ndouble f(int n)\n{\n if(n == 1) return 1;\n else return 2 * f(n - 1) + 1;\n\n}\n\nint main()\n{\n int n;\n cin >> n;\n cout << f(n) << endl;\n return 0;\n}\n,WRONG_ANSWER,15,764 1324964482440544256,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-07 14:38:43,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,#include \n#include \n#include \nusing namespace std;\n\ndouble f(int n)\n{\n if(n == 1) return 1;\n else return 2 * f(n - 1) + 1;\n\n}\n\nint main()\n{\n int n;\n cin >> n;\n\n cout << fixed << setprecision(0) << f(n) << endl;\n return 0;\n}\n,WRONG_ANSWER,19,616 1324968748730372096,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-07 14:55:41,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,#include \n#include \n#include \nusing namespace std;\n\ndouble f(int n)\n{\n if(n == 1) return 1;\n else return 2 * f(n - 1) + 1;\n\n}\n\nint main()\n{\n while(1)\n {\n int n;\n cin >> n;\n\n cout << std::fixed << setprecision(0) << f(n) << endl;\n }\n return 0;\n}\n,TIME_LIMIT_EXCEEDED,0,0 1324968816423256064,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-07 14:55:57,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,#include \n#include \n#include \nusing namespace std;\n\ndouble f(int n)\n{\n if(n == 1) return 1;\n else return 2 * f(n - 1) + 1;\n\n}\n\nint main()\n{\n // while(1)\n // {\n int n;\n cin >> n;\n\n cout << std::fixed << setprecision(0) << f(n) << endl;\n //}\n return 0;\n}\n,WRONG_ANSWER,19,540 1324970675040993280,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-07 15:03:20,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,#include \n#include \n#include \nusing namespace std;\n\ndouble f(int n)\n{\n if(n == 1) return 1;\n else return 2 * f(n - 1) + 1;\n\n}\n\nint main()\n{\n // while(1)\n // {\n int n;\n cin >> n;\n\n cout << std::fixed << setprecision(0) << f(n) << endl;\n //}\n return 0;\n}\n,WRONG_ANSWER,24,504 1324974156962418688,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-07 15:17:10,Python,0.0,1320359192822747136,1313471683597295616,1039132196031492096,def f(n):\n if n == 1:\n return 1\n else:\n return 2 * f(n - 1) + 1\n\n\nfor x in range(199):\n a = int(input())\n print(f(a)),NON_ZERO_EXIT_CODE,128,3840 1324974305437597696,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-07 15:17:45,Python,15.0,1320359192822747136,1313471683597295616,1039132196031492096,def f(n):\n if n == 1:\n return 1\n else:\n return 2 * f(n - 1) + 1\n\n\n\na = int(input())\nprint(f(a))\n,PARTIAL_ACCEPTED,121,3752 1324974365243166720,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-07 15:18:00,Python,15.0,1320359192822747136,1313471683597295616,1039132196031492096,def f(n):\n if n == 1:\n return 1\n else:\n return 2 * f(n - 1) + 1\n return 0\n\n\na = int(input())\nprint(f(a))\n,PARTIAL_ACCEPTED,105,3800 1324974423518826496,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-07 15:18:14,Python,15.0,1320359192822747136,1313471683597295616,1039132196031492096,def f(n):\n if n == 1:\n return 1\n else:\n return 2 * f(n - 1) + 1\n return 0\n\n\na = int(input())\nprint(f(a))\n,PARTIAL_ACCEPTED,111,3996 1324976883080675328,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-07 15:28:00,Python,0.0,1320359192822747136,1313471683597295616,1039132196031492096,import sys\nsys.setrecursionlimit(100000)\n\n\ndef f(n):\n if n == 1:\n return 1\n else:\n return 2 * f(n - 1) + 1\n\n\nfor x in range(199):\n a = int(input())\n print(f(a))\n,NON_ZERO_EXIT_CODE,109,6388 1324976897769127936,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-07 15:28:03,Python,0.0,1320359192822747136,1313471683597295616,1039132196031492096,import sys\nsys.setrecursionlimit(100000)\n\n\ndef f(n):\n if n == 1:\n return 1\n else:\n return 2 * f(n - 1) + 1\n\n\nfor x in range(199):\n a = int(input())\n print(f(a))\n,NON_ZERO_EXIT_CODE,82,6316 1324976936381890560,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-07 15:28:13,Python,0.0,1320359192822747136,1313471683597295616,1039132196031492096,import sys\nsys.setrecursionlimit(100000)\n\n\ndef f(n):\n if n == 1:\n return 1\n else:\n return 2 * f(n - 1) + 1\n\n\nfor x in range(199):\n a = int(input())\n print(f(a))\n,NON_ZERO_EXIT_CODE,98,6528 1324976983352889344,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-07 15:28:24,Python,20.0,1320359192822747136,1313471683597295616,1039132196031492096,import sys\nsys.setrecursionlimit(100000)\n\n\ndef f(n):\n if n == 1:\n return 1\n else:\n return 2 * f(n - 1) + 1\n\n\n\na = int(input())\nprint(f(a))\n,ACCEPTED,111,6652 1325305609050992640,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-08 13:14:14,Python,20.0,1320359192822747136,1313471683597295616,1039132196031492096,import sys\nsys.setrecursionlimit(100000)\n\n\ndef f(n):\n if n == 1:\n return 1\n else:\n return 2 * f(n - 1) + 1\n\n\n\na = int(input())\nprint(f(a))\n,ACCEPTED,128,6532 1325305633491210240,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-08 13:14:20,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][111];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 101; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + 1;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 1 && S[i - 1][j] == 0) S[i][j] = 0;\n S[i][j] += add;\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 100;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}\n",WRONG_ANSWER,33,2688 1325309932619255808,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-08 13:31:25,C++,15.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][111];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 101; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j] == 0 && add == 0) break;\n }\n //printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 100;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}\n",PARTIAL_ACCEPTED,33,2600 1325310734956048384,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-08 13:34:36,C++,15.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j] == 0 && add == 0) break;\n }\n //printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 100;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}\n",PARTIAL_ACCEPTED,103,21504 1325312189604610048,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-08 13:40:23,C++,15.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && add == 0) break;\n }\n //printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}\n",PARTIAL_ACCEPTED,99,21884 1325315447738945536,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-08 13:53:20,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}\n",ACCEPTED,117,24180 1326159247098036224,db2d062ce61a1d9bb940391ac7b72bbb42946ff8ef5e289721e726708db46c5c,2020-11-10 21:46:17,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t/*这里抽象的很，需要理解为将n个盘子从one座移到three座(借助two座)的过程【其中one、two、three只是个形式位置】 \n\t\t\t\t\t\t\t\t\t\t\t\t\t----后面的hanoi(n-1,one,three,two)其实看成开头的定义hanoi(int n,char one,char two,char three)的形式样子 \n\t\t\t\t\t\t\t\t\t\t\t\t\t也就是one(实际位置如A)借助three(实际位置如C)移动到two(实际位置如B).下面的(3)其实和上面介绍的方法一样 \n\t\t\t\t\t\t\t\t\t\t\t\t\tone、two、three只是个形式位置，但A、B、C才是实际位置*/\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tprintf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""The step to move %d diskes:\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""The total number of times is %d\"",i-1);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1326159654053564416,db2d062ce61a1d9bb940391ac7b72bbb42946ff8ef5e289721e726708db46c5c,2020-11-10 21:47:55,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=0;\t\n\nvoid hanoi(int n, char chufadi, char jiezhudian, char mudidi)\t \n{\t\t\t\t\t\t\t\t\t\t\t\t//假设一开始针对n曾盘子chufadi为A,jiezhudian为B(jiezhudian像跳台或者辅助器一样),mudidi为C \n\tvoid move(char chufadi, char mudidi);\t\t// ^\n\t if(n<=0)\t\t\t\t//防止n为0的情况\t// |\n\treturn ;\t\t\t\t\t\t\t\t\t// |\n\t \t\t\t\t\t\t\t\t\t\t\t// |\n\tif(n==1)\t\t\t\t\t\t\t\t\t// |\n\tmove( chufadi, mudidi);\t\t\t\t\t\t// |\n\telse{\t\t\t\t\t\t\t\t\t\t// |\n\t\t\t\t\t\t\t\t\t\t\t\t// |\n\thanoi(n-1, chufadi, mudidi, jiezhudian);\t// 这时候针对n-1层盘子,chufadi还是原来的chufadi(A)，但是jiezhudian由原来的jiezhudian(B)变为了原来的mudidi(C) \n\tmove( chufadi, mudidi);\t\t\t\t\t\t//这时候需要将第n层盘子就从原来的chufadi(A)移到mudidi(C) \n\thanoi(n-1, jiezhudian, chufadi, mudidi);\t//这时候针对n-1层已经移到B的盘子其实移动的方法和第15行几乎一样 \n\t\n\t}\n}\n\nvoid move(char chufadi, char mudidi)\n{\n\tprintf(\""%c-->%c\\n\"",chufadi,mudidi);\n\ti++;\n}\n\nint main(int argc,char const *argv[])\n{\n\tint n;\n\t\n\tscanf(\""%d\"",&n);\n\tprintf(\""\\n\"");\n\thanoi(n,'A','B','C');\n\tprintf(\""%d\"",i);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1326172251486236672,db2d062ce61a1d9bb940391ac7b72bbb42946ff8ef5e289721e726708db46c5c,2020-11-10 22:37:58,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \n\nusing namespace std;\n\nint def[101][101]={0};\nstatic int t=0;\n\nvoid chess(int a,int b,int aa,int bb,int length){//a,b为子棋盘左上角坐标，aa,bb为特殊点坐标，length为子棋盘长度\n if(length==1){\n return;\n }\n t++;\n int tem =t;\n int l=length/2;\n \n if(aa=a+l && bb=b+l){//右上角的子棋盘\n chess(a,b+l,aa,bb,l);\n }\n else{\n def[a+l-1][b+l]=tem;\n //cout<<\""右上 \""<=a+l && bb>=b+l){\n chess(a+l,b+l,aa,bb,l);\n }\n else{\n def[a+l][b+l]=tem;\n //cout<<\""右下 \""<>aa;\n cin>>bb;\n\tcin>>length;\n \n \n \n \n a=b=1;\n m=length;\n \n chess(a,b,aa,bb,length);\n \n for(int i=1;i<=m;i++){ //输出结果\n for(int j=1;j<=m;j++){\n cout.width(3);\n cout<\n#include \nusing namespace std;\nint def[101][101]={0};\nstatic int t=0;\nvoid chess(int a,int b,int aa,int bb,int length){//a,b为子棋盘左上角坐标，aa,bb为特殊点坐标，length为子棋盘长度\n if(length==1){\n return;\n }\n t++;\n int tem =t;\n int l=length/2;\n \n if(aa=a+l && bb=b+l){//右上角的子棋盘\n chess(a,b+l,aa,bb,l);\n }\n else{\n def[a+l-1][b+l]=tem;\n //cout<<\""右上 \""<=a+l && bb>=b+l){\n chess(a+l,b+l,aa,bb,l);\n }\n else{\n def[a+l][b+l]=tem;\n //cout<<\""右下 \""<>aa;\n cin>>bb;\n\tcin>>length;\n a=b=1;\n m=length;\n chess(a,b,aa,bb,length);\n for(int i=1;i<=m;i++){ //输出结果\n for(int j=1;j<=m;j++){\n cout.width(3);\n cout<\n#include\nint MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tprintf(\""请输入您要设置的圆盘数：>\\n\"");\n\tscanf(\""%d\"", &n);\n\tint ret = MathMove(n);\n\tprintf(\""从A柱移动到C柱需要移动%d次。\\n\"", ret);\n\tsystem(\""pause\"");\n\treturn 0;\n}",COMPILE_ERROR,0,0 1326541334111145984,3cf513a2023efc85e5b270d8debed1b0d4c0957796a0e981a9a314ef2c8dbd9b,2020-11-11 23:04:34,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\nint MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tscanf(\""%d\"", &n);\n\tint ret = MathMove(n);\n\tprintf(\""%d\\n\"", ret);\n\tsystem(\""pause\"");\n\treturn 0;\n}",COMPILE_ERROR,0,0 1326541381070565376,3cf513a2023efc85e5b270d8debed1b0d4c0957796a0e981a9a314ef2c8dbd9b,2020-11-11 23:04:45,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\nint MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tscanf(\""%d\"", &n);\n\tint ret = MathMove(n);\n\tprintf(\""%d\\n\"", ret);\n\tsystem(\""pause\"");\n\treturn 0;\n}",COMPILE_ERROR,0,0 1326542125283721216,3cf513a2023efc85e5b270d8debed1b0d4c0957796a0e981a9a314ef2c8dbd9b,2020-11-11 23:07:43,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\nlonglong MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tscanf(\""%d\"", &n);\n\tint ret = MathMove(n);\n\tprintf(\""%d\\n\"", ret);\n\tsystem(\""pause\"");\n\treturn 0;\n}",COMPILE_ERROR,0,0 1326728529891643392,5cd2d3f75aa0019a3bfa329277fa4f7e5ac9d7099bc7fd268df9102fe2295ad6,2020-11-12 11:28:25,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\n\nvoid hanoi(int n, int x, int y, int z) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1)\n printf(\""%c-->%c\\n\"", x, z);\n else\n {\n hanoi(n - 1, x, z, y);\n printf(\""%c-->%c\\n\"", x, z);\n hanoi(n - 1, y, x, z);\n }\n}\n\nint main(void)\n{\n int m;\n printf(\""Input unmber:\"");\n scanf(\""%d\"", &m);\n printf(\""moving %2d diskes:\\n\"", m);\n hanoi(m, 'a', 'b', 'c');\n system(\""pause\"");\n}",TIME_LIMIT_EXCEEDED,0,0 1326728694379663360,5cd2d3f75aa0019a3bfa329277fa4f7e5ac9d7099bc7fd268df9102fe2295ad6,2020-11-12 11:29:04,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"def move(n,fromSpike,toSpike):\n global count,top\n count+=1\n print(f\""第{count}回合：{n} 从{fromSpike} 移到 {toSpike}\"")\n top[fromSpike]= '0' if str(n+1) in top.values() else str(n+1)\n top[toSpike]=str(n)\n \ndef tower(n,fromSpike,spareSpike,toSpike):\n if n==1:\n move(1,fromSpike,toSpike)\n else:\n tower(n-1,fromSpike,toSpike,spareSpike)\n move(n,fromSpike,toSpike)\n tower(n-1,spareSpike,fromSpike,toSpike)\n \ncount = 0\ntop={'A':'1','B':'0','C':'0'}\ntower(4,'A','B','C')",COMPILE_ERROR,0,0 1326730574354796544,5cd2d3f75aa0019a3bfa329277fa4f7e5ac9d7099bc7fd268df9102fe2295ad6,2020-11-12 11:36:33,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#define _CRT_SECURE_NO_WARNINGS\n#include \nint i = 0;\nvoid move(int n, char from, char to)\n{\n\ti++;\n}\n \nHanoi(int n, char A, char B, char C)\n{\n\tif (n == 1)\n\t{\n\t\tmove(n, A, C);\n\t}\n\telse\n\t{\n\t\tHanoi(n - 1, A, C, B);\n\t\tmove(n, A, C);\n\t\tHanoi(n - 1, B, A, C);\n\t}\n}\n \nint main()\n{\n\tint n = 0;\n\tscanf(\""%d\"", &n);\n\tHanoi(n, 'A', 'B', 'C');\n\tprintf(\""%d\\n\"", i);\n\treturn 0; \n}\n ",TIME_LIMIT_EXCEEDED,0,0 1326761349292838912,a5482bef26201f0b39edb12bacd24db467011853ab210649b650fd797be14fcc,2020-11-12 13:38:50,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"include\nusing namespace std;\ntypedef long long ll;\nll hanoi(int n,int k)\n{\n if(n==k)//最大的盘子只移动一次\n return 1;\n if(n==1)//只有一个盘子，不需要移动\n return 0;\n return 2*hanoi(n-1,k);//上面n-1层移动两次\n }\nint main()\n{\n ios::sync_with_stdio(false);\n int n,k,t;\n cin>>t;\n while(t--){\n cin>>n>>k;\n cout<\nusing namespace std;\ntypedef long long ll;\nll hanoi(int n,int k)\n{\n if(n==k)//最大的盘子只移动一次\n return 1;\n if(n==1)//只有一个盘子，不需要移动\n return 0;\n return 2*hanoi(n-1,k);//上面n-1层移动两次\n }\nint main()\n{\n ios::sync_with_stdio(false);\n int n,k,t;\n cin>>t;\n while(t--){\n cin>>n>>k;\n cout<\nusing namespace std;\n\nvoid hannuota(int n,char c1,char c2,char c3)//n个盘子从c1借助c2移动到c3\n{\n if(n==1)\n {\n printf(\""%d: %c -> %c\\n\"",n,c1,c3);\n }\n else\n {\n hannuota(n-1,c1,c3,c2);\n printf(\""%d: %c -> %c\\n\"",n,c1,c3);\n hannuota(n-1,c2,c1,c3);\n }\n}\n \nint main()\n{\n int n;\n cin>>n;\n char c1,c2,c3;\n cin>>c1>>c2>>c3;\n hannuota(n,c1,c3,c2);//n个盘子从c1借助c2移动到c3\n return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1326862622470000640,6de0afd5918928f6e7f7d47b6c0dccf6238636f4011c339566e1017d8cf8bf77,2020-11-12 20:21:15,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nint main(){\n\tchar s[1000];\n\tint a[100];\n\tint mm=0;\n\tchar str[10][10]={\""ling\"",\""yi\"",\""er\"",\""san\"",\""si\"",\""wu\"",\""liu\"",\""qi\"",\""ba\"",\""jiu\""};\n\tchar sr[10][10];\n\tscanf(\""%s\"",s);\n\tint len=strlen(s);\n\tint sum=0,n;\n\tfor(int i=0;i\n#include \nint main(){\n\tchar s[1000];\n\tint a[100];\n\tint mm=0;\n\tchar str[10][10]={\""ling\"",\""yi\"",\""er\"",\""san\"",\""si\"",\""wu\"",\""liu\"",\""qi\"",\""ba\"",\""jiu\""};\n\tchar sr[10][10];\n\tscanf(\""%s\"",s);\n\tint len=strlen(s);\n\tint sum=0,n;\n\tfor(int i=0;i\n\nstatic int i=0;\t\n\nvoid hanoi(int n, char chufadi, char jiezhudian, char mudidi)\t \n{\t\t\t\t\t\t\t\t\t\t\t\t//假设一开始针对n曾盘子chufadi为A,jiezhudian为B(jiezhudian像跳台或者辅助器一样),mudidi为C \n\tvoid move(char chufadi, char mudidi);\t\t// ^\n\t if(n<=0)\t\t\t\t//防止n为0的情况\t// |\n\treturn ;\t\t\t\t\t\t\t\t\t// |\n\t \t\t\t\t\t\t\t\t\t\t\t// |\n\tif(n==1)\t\t\t\t\t\t\t\t\t// |\n\tmove( chufadi, mudidi);\t\t\t\t\t\t// |\n\telse{\t\t\t\t\t\t\t\t\t\t// |\n\t\t\t\t\t\t\t\t\t\t\t\t// |\n\thanoi(n-1, chufadi, mudidi, jiezhudian);\t// 这时候针对n-1层盘子,chufadi还是原来的chufadi(A)，但是jiezhudian由原来的jiezhudian(B)变为了原来的mudidi(C) \n\tmove( chufadi, mudidi);\t\t\t\t\t\t//这时候需要将第n层盘子就从原来的chufadi(A)移到mudidi(C) \n\thanoi(n-1, jiezhudian, chufadi, mudidi);\t//这时候针对n-1层已经移到B的盘子其实移动的方法和第15行几乎一样 \n\t\n\t}\n}\n\nvoid move(char chufadi, char mudidi)\n{\n\tprintf(\""%c-->%c\\n\"",chufadi,mudidi);\n\ti++;\n}\n\nint main(int argc,char const *argv[])\n{\n\tint n;\n\tprintf(\""选择在A上的盘子个数:\\n\"");\n\tscanf(\""%d\"",&n);\n\tprintf(\""\\n\"");\n\thanoi(n,'A','B','C');\n\tprintf(\""需要移动盘子的总次数:%d\"",i);\n\treturn 0;\n}\n\n",TIME_LIMIT_EXCEEDED,0,0 1326863636750188544,6de0afd5918928f6e7f7d47b6c0dccf6238636f4011c339566e1017d8cf8bf77,2020-11-12 20:25:17,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#define _CRT_SECURE_NO_WARNINGS\n#include \nint i = 0;\nvoid move(int n, char from, char to)\n{\n\ti++;\n\tprintf(\""第%d步将%d号盘子%c<----->%c\\n\"",i, n, from, to);\n}\n \nHanoi(int n, char A, char B, char C)\n{\n\tif (n == 1)\n\t{\n\t\tmove(n, A, C);\n\t}\n\telse\n\t{\n\t\tHanoi(n - 1, A, C, B);\n\t\tmove(n, A, C);\n\t\tHanoi(n - 1, B, A, C);\n\t}\n}\n \nint main()\n{\n\tint n = 0;\n\tscanf(\""%d\"", &n);\n\tHanoi(n, 'A', 'B', 'C');\n\tprintf(\""共%d步\\n\"", i);\n\treturn 0; \n}",TIME_LIMIT_EXCEEDED,0,0 1326885995061268480,db2d062ce61a1d9bb940391ac7b72bbb42946ff8ef5e289721e726708db46c5c,2020-11-12 21:54:08,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=0;\t\n\nvoid hanoi(int n, char chufadi, char jiezhudian, char mudidi)\t \n{\t\t\t\t\t\t\t\t\t\t\t\t//假设一开始针对n曾盘子chufadi为A,jiezhudian为B(jiezhudian像跳台或者辅助器一样),mudidi为C \n\tvoid move(char chufadi, char mudidi);\t\t// ^\n\t if(n<=0)\t\t\t\t//防止n为0的情况\t// |\n\treturn ;\t\t\t\t\t\t\t\t\t// |\n\t \t\t\t\t\t\t\t\t\t\t\t// |\n\tif(n==1)\t\t\t\t\t\t\t\t\t// |\n\tmove( chufadi, mudidi);\t\t\t\t\t\t// |\n\telse{\t\t\t\t\t\t\t\t\t\t// |\n\t\t\t\t\t\t\t\t\t\t\t\t// |\n\thanoi(n-1, chufadi, mudidi, jiezhudian);\t// 这时候针对n-1层盘子,chufadi还是原来的chufadi(A)，但是jiezhudian由原来的jiezhudian(B)变为了原来的mudidi(C) \n\tmove( chufadi, mudidi);\t\t\t\t\t\t//这时候需要将第n层盘子就从原来的chufadi(A)移到mudidi(C) \n\thanoi(n-1, jiezhudian, chufadi, mudidi);\t//这时候针对n-1层已经移到B的盘子其实移动的方法和第15行几乎一样 \n\t\n\t}\n}\n\nvoid move(char chufadi, char mudidi)\n{\n\ti++;\n}\n\nint main(int argc,char const *argv[])\n{\n\tint N;\n\tscanf(\""%d\"",&N);\n\thanoi(N,'A','B','C');\n\tprintf(\""%d\"",i);\n\treturn 0;\n}\n ",TIME_LIMIT_EXCEEDED,0,0 1326888060839866368,db2d062ce61a1d9bb940391ac7b72bbb42946ff8ef5e289721e726708db46c5c,2020-11-12 22:02:20,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=0;\t\n\nvoid hanoi(int n, char chufadi, char jiezhudian, char mudidi)\t \n{\t\t\t\t\t\t\t\t\t\t\t\t//假设一开始针对n曾盘子chufadi为A,jiezhudian为B(jiezhudian像跳台或者辅助器一样),mudidi为C \n i++\t;\t\n\t if(n<=0)\t\t\t\t//防止n为0的情况\t\n\treturn ;\t\t\t\t\t\t\t\t\n\t \t\t\t\t\t\t\t\t\t\t\t\n\tif(n==1)\t\t\t\t\t\t\t\t\n i++\t;\t\t\t\t\t\n\telse{\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\n\thanoi(n-1, chufadi, mudidi, jiezhudian);\t// 这时候针对n-1层盘子,chufadi还是原来的chufadi(A)，但是jiezhudian由原来的jiezhudian(B)变为了原来的mudidi(C) \n i++\t;\t\t\t\t\t//这时候需要将第n层盘子就从原来的chufadi(A)移到mudidi(C) \n\thanoi(n-1, jiezhudian, chufadi, mudidi);\t//这时候针对n-1层已经移到B的盘子其实移动的方法和第15行几乎一样 \n\t\n\t}\n}\n\n\nint main(int argc,char const *argv[])\n{\n\tint N;\n\tscanf(\""%d\"",&N);\n\thanoi(N,'A','B','C');\n\tprintf(\""%d\"",i);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1327144115932020736,db2d062ce61a1d9bb940391ac7b72bbb42946ff8ef5e289721e726708db46c5c,2020-11-13 14:59:49,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\n\n//int add(){int i=0;\n//a[i]=nmod10;\n//n%10;\n//i++;}\nlong long int han(int n){int i;\nif(n==1)i=1;\nelse \ni=2*han(n-1)+1;\nreturn i;\n}\nint main(){\n\tint n,a;\n\tscanf(\""%d\"",&n);\na=han(n);\n\tprintf(\""%d\"",han(n));\n\treturn 0;\n}",WRONG_ANSWER,23,332 1327241454113832960,46eeb68e55c0f5ffffce80de61b71b66ddae87980c8d55d8a76d2da70efd9f6a,2020-11-13 21:26:36,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\nint MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tscanf(\""%d\"", &n);\n\tint ret = MathMove(n);\n\tprintf(\""%d\"", ret);\n\treturn 0;\n}",WRONG_ANSWER,18,372 1327241857958199296,8cfad0f019d56d0026592ea5b7455d76467bd5bf201a8b1798e8bd0de33c22fa,2020-11-13 21:28:12,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"\ndef move(n,fromSpike,toSpike):\n global count,top\n count+=1\n print(f\""第{count}回合：{n} 从{fromSpike} 移到 {toSpike}\"")\n top[fromSpike]= '0' if str(n+1) in top.values() else str(n+1)\n top[toSpike]=str(n)\n \ndef tower(n,fromSpike,spareSpike,toSpike):\n if n==1:\n move(1,fromSpike,toSpike)\n else:\n tower(n-1,fromSpike,toSpike,spareSpike)\n move(n,fromSpike,toSpike)\n tower(n-1,spareSpike,fromSpike,toSpike)\n \ncount = 0\ntop={'A':'1','B':'0','C':'0'}\ntower(4,'A','B','C')",COMPILE_ERROR,0,0 1327242066741243904,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:29:02,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\nvoid hanoi(int n,char a,char b,char c);\nint main(void)\n{\n int n;\n \n scanf(\""%d\"",&n);\n hanoi(n,'a','b','c');\n \n return 0;\n}\nvoid hanoi(int n,char a,char b,char c)\n{\n if(n==1)\n printf(\""%c-->%c\\n\"",a,b);\n else\n {\n hanoi(n-1,a,c,b);\n printf(\""%c-->%c\\n\"",a,b);\n hanoi(n-1,c,b,a);\n }\n}",TIME_LIMIT_EXCEEDED,0,0 1327242130989592576,8cfad0f019d56d0026592ea5b7455d76467bd5bf201a8b1798e8bd0de33c22fa,2020-11-13 21:29:17,Java,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"\ndef move(n,fromSpike,toSpike):\n global count,top\n count+=1\n print(f\""第{count}回合：{n} 从{fromSpike} 移到 {toSpike}\"")\n top[fromSpike]= '0' if str(n+1) in top.values() else str(n+1)\n top[toSpike]=str(n)\n \ndef tower(n,fromSpike,spareSpike,toSpike):\n if n==1:\n move(1,fromSpike,toSpike)\n else:\n tower(n-1,fromSpike,toSpike,spareSpike)\n move(n,fromSpike,toSpike)\n tower(n-1,spareSpike,fromSpike,toSpike)\n \ncount = 0\ntop={'A':'1','B':'0','C':'0'}\ntower(4,'A','B','C')",COMPILE_ERROR,0,0 1327242157553139712,8cfad0f019d56d0026592ea5b7455d76467bd5bf201a8b1798e8bd0de33c22fa,2020-11-13 21:29:23,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"\ndef move(n,fromSpike,toSpike):\n global count,top\n count+=1\n print(f\""第{count}回合：{n} 从{fromSpike} 移到 {toSpike}\"")\n top[fromSpike]= '0' if str(n+1) in top.values() else str(n+1)\n top[toSpike]=str(n)\n \ndef tower(n,fromSpike,spareSpike,toSpike):\n if n==1:\n move(1,fromSpike,toSpike)\n else:\n tower(n-1,fromSpike,toSpike,spareSpike)\n move(n,fromSpike,toSpike)\n tower(n-1,spareSpike,fromSpike,toSpike)\n \ncount = 0\ntop={'A':'1','B':'0','C':'0'}\ntower(4,'A','B','C')",COMPILE_ERROR,0,0 1327242185080356864,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:29:30,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",COMPILE_ERROR,0,0 1327242223089139712,8cfad0f019d56d0026592ea5b7455d76467bd5bf201a8b1798e8bd0de33c22fa,2020-11-13 21:29:39,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"\ndef move(n,fromSpike,toSpike):\n global count,top\n count+=1\n print(f\""第{count}回合：{n} 从{fromSpike} 移到 {toSpike}\"")\n top[fromSpike]= '0' if str(n+1) in top.values() else str(n+1)\n top[toSpike]=str(n)\n \ndef tower(n,fromSpike,spareSpike,toSpike):\n if n==1:\n move(1,fromSpike,toSpike)\n else:\n tower(n-1,fromSpike,toSpike,spareSpike)\n move(n,fromSpike,toSpike)\n tower(n-1,spareSpike,fromSpike,toSpike)\n \ncount = 0\ntop={'A':'1','B':'0','C':'0'}\ntower(4,'A','B','C')",COMPILE_ERROR,0,0 1327242226330316800,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:29:40,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",WRONG_ANSWER,118,340 1327242602513248256,8cfad0f019d56d0026592ea5b7455d76467bd5bf201a8b1798e8bd0de33c22fa,2020-11-13 21:31:10,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\n \nint n,cou=0;\n \nvoid hanio(int n,char a,char b,char c)\t//b为中间 \n{\n\tcou++;\n\tif(n==1)\n\t{\n\t\tprintf(\""%c-->%c\\n\"",a,c);\n\t}\n\telse\n\t{\n\t\thanio(n-1,a,c,b);\n\t\tprintf(\""%c-->%c\\n\"",a,c);\n\t\thanio(n-1,b,a,c);\n\t}\n}\n \nint main()\n{\n \n\tcin>>n;\n\thanio(n,'A','B','C');\n\tprintf(\""%d\\n\"",cou);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1327242650525446144,8cfad0f019d56d0026592ea5b7455d76467bd5bf201a8b1798e8bd0de33c22fa,2020-11-13 21:31:21,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\n \nint n,cou=0;\n \nvoid hanio(int n,char a,char b,char c)\t//b为中间 \n{\n\tcou++;\n\tif(n==1)\n\t{\n\t\tprintf(\""%c-->%c\\n\"",a,c);\n\t}\n\telse\n\t{\n\t\thanio(n-1,a,c,b);\n\t\tprintf(\""%c-->%c\\n\"",a,c);\n\t\thanio(n-1,b,a,c);\n\t}\n}\n \nint main()\n{\n \n\tcin>>n;\n\thanio(n,'A','B','C');\n\tprintf(\""%d\\n\"",cou);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1327243922712383488,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:36:24,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t/*这里抽象的很，需要理解为将n个盘子从one座移到three座(借助two座)的过程【其中one、two、three只是个形式位置】 \n\t\t\t\t\t\t\t\t\t\t\t\t\t----后面的hanoi(n-1,one,three,two)其实看成开头的定义hanoi(int n,char one,char two,char three)的形式样子 \n\t\t\t\t\t\t\t\t\t\t\t\t\t也就是one(实际位置如A)借助three(实际位置如C)移动到two(实际位置如B).下面的(3)其实和上面介绍的方法一样 \n\t\t\t\t\t\t\t\t\t\t\t\t\tone、two、three只是个形式位置，但A、B、C才是实际位置*/\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tprintf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""The step to move %d diskes:\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""The total number of times is %d\"",i-1);\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1327244066041151488,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:36:59,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\n\nvoid hanoi(int n, int x, int y, int z) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1)\n printf(\""%c-->%c\\n\"", x, z);\n else\n {\n hanoi(n - 1, x, z, y);\n printf(\""%c-->%c\\n\"", x, z);\n hanoi(n - 1, y, x, z);\n }\n}\n\nint main(void)\n{\n int m;\n printf(\""Input unmber:\"");\n scanf(\""%d\"", &m);\n printf(\""moving %2d diskes:\\n\"", m);\n hanoi(m, 'a', 'b', 'c');\n system(\""pause\"");\n}",TIME_LIMIT_EXCEEDED,0,0 1327244115936591872,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:37:10,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\n\nvoid hanoi(int n, int x, int y, int z)\n{\n if (n == 1)\n printf(\""%c-->%c\\n\"", x, z);\n else\n {\n hanoi(n - 1, x, z, y);\n printf(\""%c-->%c\\n\"", x, z);\n hanoi(n - 1, y, x, z);\n }\n}\n\nint main(void)\n{\n int m;\n printf(\""Input unmber:\"");\n scanf(\""%d\"", &m);\n printf(\""moving %2d diskes:\\n\"", m);\n hanoi(m, 'a', 'b', 'c');\n system(\""pause\"");\n}",TIME_LIMIT_EXCEEDED,0,0 1327244346152538112,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:38:05,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\nint MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tscanf(\""%d\"", &n);\n\tint ret = MathMove(n);\n\tprintf(\""%d\\n\"", ret);\n\tsystem(\""pause\"");\n\treturn 0;\n}",COMPILE_ERROR,0,0 1327244377483980800,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:38:13,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\nint MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tscanf(\""%d\"", &n);\n\tint ret = MathMove(n);\n\tprintf(\""%d\\n\"", ret);\n\tsystem(\""pause\"");\n\treturn 0;\n}",WRONG_ANSWER,88,564 1327244411031044097,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:38:21,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\nint MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tscanf(\""%d\"", &n);\n\tint ret = MathMove(n);\n\tprintf(\""%d\\n\"", ret);\n\treturn 0;\n}",WRONG_ANSWER,21,340 1327244537517649920,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:38:51,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#define _CRT_SECURE_NO_WARNINGS\n#include \nint i = 0;\nvoid move(int n, char from, char to)\n{\n\ti++;\n\tprintf(\""第%d步将%d号盘子%c<----->%c\\n\"",i, n, from, to);\n}\n \nHanoi(int n, char A, char B, char C)\n{\n\tif (n == 1)\n\t{\n\t\tmove(n, A, C);\n\t}\n\telse\n\t{\n\t\tHanoi(n - 1, A, C, B);\n\t\tmove(n, A, C);\n\t\tHanoi(n - 1, B, A, C);\n\t}\n}\n \nint main()\n{\n\tint n = 0;\n\tscanf(\""%d\"", &n);\n\tHanoi(n, 'A', 'B', 'C');\n\tprintf(\""%d\"", i);\n\treturn 0; \n}",TIME_LIMIT_EXCEEDED,0,0 1327244800739586048,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:39:54,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,#include\nusing namespace std;\nint f(int n)//n个盘子的移动次数\n{\n\tif(n==1) return 1;//递归终止条件；\n\telse return 2*f(n-1)+1;\n} \nint main()\n{\n\tint n;\n\tcin>>n;\n\tcout<\nusing namespace std;\nint f(int n)//n个盘子的移动次数\n{\n\tif(n==1) return 1;//递归终止条件；\n\telse return 2*f(n-1)+1;\n} \nint main()\n{\n\tint n;\n\tcin>>n;\n\tcout<\n \nint main()\n{\n char a[100], b[100];//如溢出，则换用更大的数组。\n int i = 0, j = 1;\n int cf = 0, fi = 1;//cf为判定是否有进位 fi为first的缩写。用来使最后位+1操作。\n int n; //为汉诺塔的个数。控制循环次数\n \n a[0] = '7';\n a[1] = '\\0';\n printf(\""Please enter the number of the Tower of Hanoi（3-?）：\"");\n scanf(\""%d\"", &n);\n n-=3;\n while(n--) {\n i = 0;j = 1;fi = 1;cf = 0; //每循环一次，重新赋值，变回缺\n \n while(b[j++] = a[i++]);//把数组a中的数据复制到b数组中\n b[j] = '\\0';//结尾加\\0结尾符\n i-=2;\n while(i!=-1) {\n if(5 > a[i]-'0') {\n b[i+1] = (a[i]-'0') * 2 + cf + fi + '0';//-‘0’为了把字母转换成数字进行相应运算\n cf = 0; //+‘0’使其重新变回字母\n }\n else {\n b[i+1] = (a[i]-'0') * 2 % 10 + cf + fi + '0';\n cf = 1;\n }\n --i;\n fi = 0;\n }\n if(cf) { //以下语句用来把数组b中的值赋到数组a中。使其重复循环。\n i = j = 1;\n while(a[i++] = b[j++]);\n a[i] = '\\0';\n a[0] = '1';\n }\n else {\n i = 0;\n j = 1;\n while(a[i++] = b[j++]);\n a[i] = '\\0';\n }\n }\n printf(\""%s\\n\"", a);\n return 0;\n}",MULTIPLE_ERROR,63,340 1327247018893062144,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:48:43,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"\n#include \n \nint main()\n{\n char a[100], b[100];//如溢出，则换用更大的数组。\n int i = 0, j = 1;\n int cf = 0, fi = 1;//cf为判定是否有进位 fi为first的缩写。用来使最后位+1操作。\n int n; //为汉诺塔的个数。控制循环次数\n \n a[0] = '7';\n a[1] = '\\0';\n printf(\""Please enter the number of the Tower of Hanoi（3-?）：\"");\n scanf(\""%d\"", &n);\n n-=3;\n while(n--) {\n i = 0;j = 1;fi = 1;cf = 0; //每循环一次，重新赋值，变回缺\n \n while(b[j++] = a[i++]);//把数组a中的数据复制到b数组中\n b[j] = '\\0';//结尾加\\0结尾符\n i-=2;\n while(i!=-1) {\n if(5 > a[i]-'0') {\n b[i+1] = (a[i]-'0') * 2 + cf + fi + '0';//-‘0’为了把字母转换成数字进行相应运算\n cf = 0; //+‘0’使其重新变回字母\n }\n else {\n b[i+1] = (a[i]-'0') * 2 % 10 + cf + fi + '0';\n cf = 1;\n }\n --i;\n fi = 0;\n }\n if(cf) { //以下语句用来把数组b中的值赋到数组a中。使其重复循环。\n i = j = 1;\n while(a[i++] = b[j++]);\n a[i] = '\\0';\n a[0] = '1';\n }\n else {\n i = 0;\n j = 1;\n while(a[i++] = b[j++]);\n a[i] = '\\0';\n }\n }\n printf(\""%s\\n\"", a);\n return 0;\n}",MULTIPLE_ERROR,22,212 1327247048329707520,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:48:50,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"\n#include \n \nint main()\n{\n char a[100], b[100];//如溢出，则换用更大的数组。\n int i = 0, j = 1;\n int cf = 0, fi = 1;//cf为判定是否有进位 fi为first的缩写。用来使最后位+1操作。\n int n; //为汉诺塔的个数。控制循环次数\n \n a[0] = '7';\n a[1] = '\\0';\n printf(\""Please enter the number of the Tower of Hanoi（3-?）：\"");\n scanf(\""%d\"", &n);\n n-=3;\n while(n--) {\n i = 0;j = 1;fi = 1;cf = 0; //每循环一次，重新赋值，变回缺\n \n while(b[j++] = a[i++]);//把数组a中的数据复制到b数组中\n b[j] = '\\0';//结尾加\\0结尾符\n i-=2;\n while(i!=-1) {\n if(5 > a[i]-'0') {\n b[i+1] = (a[i]-'0') * 2 + cf + fi + '0';//-‘0’为了把字母转换成数字进行相应运算\n cf = 0; //+‘0’使其重新变回字母\n }\n else {\n b[i+1] = (a[i]-'0') * 2 % 10 + cf + fi + '0';\n cf = 1;\n }\n --i;\n fi = 0;\n }\n if(cf) { //以下语句用来把数组b中的值赋到数组a中。使其重复循环。\n i = j = 1;\n while(a[i++] = b[j++]);\n a[i] = '\\0';\n a[0] = '1';\n }\n else {\n i = 0;\n j = 1;\n while(a[i++] = b[j++]);\n a[i] = '\\0';\n }\n }\n printf(\""%s\"", a);\n return 0;\n}",MULTIPLE_ERROR,26,340 1327247437983723520,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:50:22,C,15.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n \nint main()\n{\n\tint n, i, cf, fi, t; //n用来保存汉诺塔的层数,i用来控制循环，cf控制进位，fi用来判断第一位，t用来临时保存i值\n\tchar a[100]; //如溢出，则换用更大的数组。 \n\ta[0] = '1';\t\t //初始化指为1\n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); //获得当前数组的存储内容最大下标。以便控制循环和赋结尾符\n\t\t\t\n\t\tt = i; //保存i值\n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; //公式2^n-1中的‘-1’操作\n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",PARTIAL_ACCEPTED,36,208 1327247519571333120,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:50:42,C,17.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n \nint main()\n{\n\tint n, i, cf, fi, t; //n用来保存汉诺塔的层数,i用来控制循环，cf控制进位，fi用来判断第一位，t用来临时保存i值\n\tchar a[1000]; //如溢出，则换用更大的数组。 \n\ta[0] = '1';\t\t //初始化指为1\n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); //获得当前数组的存储内容最大下标。以便控制循环和赋结尾符\n\t\t\t\n\t\tt = i; //保存i值\n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; //公式2^n-1中的‘-1’操作\n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",PARTIAL_ACCEPTED,220,344 1327247658436349952,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:51:15,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; //n用来保存汉诺塔的层数,i用来控制循环，cf控制进位，fi用来判断第一位，t用来临时保存i值\n\tchar a[10000]; //如溢出，则换用更大的数组。 \n\ta[0] = '1';\t\t //初始化指为1\n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); //获得当前数组的存储内容最大下标。以便控制循环和赋结尾符\n\t\t\t\n\t\tt = i; //保存i值\n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; //公式2^n-1中的‘-1’操作\n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,36,320 1327248072355434496,a5482bef26201f0b39edb12bacd24db467011853ab210649b650fd797be14fcc,2020-11-13 21:52:54,C,15.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[100]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",PARTIAL_ACCEPTED,36,344 1327248134054658048,a5482bef26201f0b39edb12bacd24db467011853ab210649b650fd797be14fcc,2020-11-13 21:53:08,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,88,472 1327249283339079680,30ffda594b69b6bc5a154f40929b3bb24fda88cd3fb62f370bfa63a1c49247c2,2020-11-13 21:57:42,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); \n\t\t\t\n\t\tt = i; \n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,114,368 1327250104600571904,db2d062ce61a1d9bb940391ac7b72bbb42946ff8ef5e289721e726708db46c5c,2020-11-13 22:00:58,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); \n\t\t\t\n\t\tt = i; \n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}\n",ACCEPTED,42,348 1327267490796978176,70784ce0a14ee91febe0401699b171aed215b54abffacaa36ef9053172ca1194,2020-11-13 23:10:03,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); \n\t\t\t\n\t\tt = i; \n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,35,212 1327452398463008768,27ccc56198b9e0c34189835e569ec2f1600c7dbcd673d88aa05de4ef40f058ab,2020-11-14 11:24:49,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\nint b=0;\nvoid ps()\n{ for(int i=0;i<50;i++\n) printf(\""*\"");\nprintf(\""\\n\"");}\nvoid bt()\n{\nfor(int i=0;i<20;i++) printf(\""*\"");\nprintf(\""汉诺塔问题\"");\nfor(i=0;i<20;i++) printf(\""*\"");\nprintf(\""\\n\"");\n}\nvoid jd()\n{\nfor(int i=0;i<20;i++) printf(\""*\"");printf(\""用程序解决\"");\nfor(i=0;i<20;i++) printf(\""*\"");printf(\""\\n\"");\n}\nvoid yuanti()\n{ printf(\""原题:\\n现在有三根相邻的柱子\\n标号为A,B,C，A柱子上从下到上按金字塔状叠放着n个不\\n同大小的圆盘，现在把所有盘子一个一个移动到柱子B上\\n并且每次移动同一根柱子上都不能出现大盘子在小盘子\\n上方请问至少需要多少次移动\\n\"");\n}\nvoid move(int n,char one,char two,char three)\n{ \nvoid show(char x,char y);\nif(n==1)\nshow(one,three); \nelse\n{move(n-1,one,three,two);\nshow(one,three);\nmove(n-1,two,one,three);}\n}\nvoid show(char x,char y)\n{\nb++; \nprintf(\""第%d次的移动：%c--->%c\\n\"",b,x,y);\n}\nvoid main()\n{ \nvoid bt(); \nvoid ps();\nvoid yuanti();\nvoid jd();\nps();\nbt(); \nps(); \nyuanti();\nprintf(\""\\n\""); \njd(); \nprintf(\""\\n\"");\nvoid move(int n,char one,char two,char three);\nint m;\nprintf(\""有几个盘子：\"");\nscanf(\""%d\"",&m);\nprintf(\""移动方案为：\\n\"");\nmove(m,'A','B','C');\n}",COMPILE_ERROR,0,0 1327458289022226432,46eeb68e55c0f5ffffce80de61b71b66ddae87980c8d55d8a76d2da70efd9f6a,2020-11-14 11:48:13,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\nint MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tscanf(\""%d\"", &n);\n\tint ret = MathMove(n);\n\tprintf(\""%d\"", ret);\n\treturn 0;\n}",WRONG_ANSWER,71,336 1327458377333297152,46eeb68e55c0f5ffffce80de61b71b66ddae87980c8d55d8a76d2da70efd9f6a,2020-11-14 11:48:34,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\nint MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tscanf(\""%d\"", &n);\n\tlong long int ret = MathMove(n);\n\tprintf(\""%d\"", ret);\n\treturn 0;\n}",WRONG_ANSWER,30,336 1327458890700341248,46eeb68e55c0f5ffffce80de61b71b66ddae87980c8d55d8a76d2da70efd9f6a,2020-11-14 11:50:37,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\nfloat MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tscanf(\""%d\"", &n);\n\tfloat ret = MathMove(n);\n\tprintf(\""%d\"", ret);\n\treturn 0;\n}",WRONG_ANSWER,18,328 1327461317218451456,cc0bf9e8716f1a485c7c1c8485a0be26c3bab2688bd3d6fadf85d388de101b0c,2020-11-14 12:00:15,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n\nusing namespace std;\n\nint main(){\n int d[1000];\n int n, i, j;\n \n d[0] = 2;\n \n cin >> n;\n \n for(i = 1; i < n; i++){\n for(j = 0; j < 1000; j++){\n d[j] *= 2;\n }\n \n for(j = 0; j < 999; j++){\n if(d[j] > 9){\n d[j+1]++;\n d[j] %= 10;\n }\n }\n }\n \n int k = 999;\n \n while(d[k] == 0) k--;\n \n while(k >= 0) cout << k;\n \n return 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1327461348105306112,cc0bf9e8716f1a485c7c1c8485a0be26c3bab2688bd3d6fadf85d388de101b0c,2020-11-14 12:00:23,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n\nusing namespace std;\n\nint main(){\n int d[1000];\n int n, i, j;\n \n d[0] = 2;\n \n cin >> n;\n \n for(i = 1; i < n; i++){\n for(j = 0; j < 1000; j++){\n d[j] *= 2;\n }\n \n for(j = 0; j < 999; j++){\n if(d[j] > 9){\n d[j+1]++;\n d[j] %= 10;\n }\n }\n }\n \n int k = 999;\n \n while(d[k] == 0) k--;\n \n while(k >= 0) cout << a[k];\n \n return 0;\n}",COMPILE_ERROR,0,0 1327461391814148096,cc0bf9e8716f1a485c7c1c8485a0be26c3bab2688bd3d6fadf85d388de101b0c,2020-11-14 12:00:33,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n\nusing namespace std;\n\nint main(){\n int d[1000];\n int n, i, j;\n \n d[0] = 2;\n \n cin >> n;\n \n for(i = 1; i < n; i++){\n for(j = 0; j < 1000; j++){\n d[j] *= 2;\n }\n \n for(j = 0; j < 999; j++){\n if(d[j] > 9){\n d[j+1]++;\n d[j] %= 10;\n }\n }\n }\n \n int k = 999;\n \n while(d[k] == 0) k--;\n \n while(k >= 0) cout << d[k];\n \n return 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1327462162998841344,cc0bf9e8716f1a485c7c1c8485a0be26c3bab2688bd3d6fadf85d388de101b0c,2020-11-14 12:03:37,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\n\nusing namespace std;\n\nint main(){\n int d[2000];\n int n, i, j;\n \n memset(d, 0, sizeof(d));\n\td[0] = 2;\n \n cin >> n;\n \n for(i = 1; i < n; i++){\n for(j = 0; j < 2000; j++){\n d[j] *= 2;\n }\n \n for(j = 0; j < 1999; j++){\n if(d[j] > 9){\n d[j+1]++;\n d[j] %= 10;\n }\n }\n }\n \n int k = 1999;\n \n while(d[k] == 0) k--;\n while(k >= 0) cout << d[k--];\n \n return 0;\n}",WRONG_ANSWER,53,464 1327462366816841728,cc0bf9e8716f1a485c7c1c8485a0be26c3bab2688bd3d6fadf85d388de101b0c,2020-11-14 12:04:25,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\n\nusing namespace std;\n\nint main(){\n int d[2000];\n int n, i, j;\n \n memset(d, 0, sizeof(d));\n\td[0] = 2;\n \n cin >> n;\n \n for(i = 1; i < n; i++){\n for(j = 0; j < 2000; j++){\n d[j] *= 2;\n }\n \n for(j = 0; j < 1999; j++){\n if(d[j] > 9){\n d[j+1]++;\n d[j] %= 10;\n }\n }\n }\n \n int k = 1999;\n d[0]--;\n \n while(d[k] == 0) k--;\n while(k >= 0) cout << d[k--];\n \n return 0;\n}",ACCEPTED,76,336 1327480463104720896,047a7306158aef90dafcc37a4bd28c3bc7ff3bcb592b1da7f0c15705de867c35,2020-11-14 13:16:20,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,38,336 1327487959633571840,90cf53d801014fede7f637acddc0c04e46060edf0888a85f36d3b64a0d837644,2020-11-14 13:46:07,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,86,216 1327524165574537216,fbcc906feda5812c4fc83202944576e9ed984b575bb13271d520302ca3a43b7a,2020-11-14 16:09:59,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}\n",COMPILE_ERROR,0,0 1327524229286023168,fbcc906feda5812c4fc83202944576e9ed984b575bb13271d520302ca3a43b7a,2020-11-14 16:10:15,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}\n",ACCEPTED,113,24148 1327528911114940416,e70c2666551a871d5cd79b906560758c041c16220c5657129c83926b53d9b5ba,2020-11-14 16:28:51,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}",COMPILE_ERROR,0,0 1327528957312024576,e70c2666551a871d5cd79b906560758c041c16220c5657129c83926b53d9b5ba,2020-11-14 16:29:02,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}",COMPILE_ERROR,0,0 1327529105496784896,e70c2666551a871d5cd79b906560758c041c16220c5657129c83926b53d9b5ba,2020-11-14 16:29:37,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}",COMPILE_ERROR,0,0 1327529269694377984,e70c2666551a871d5cd79b906560758c041c16220c5657129c83926b53d9b5ba,2020-11-14 16:30:16,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}",ACCEPTED,124,24148 1327530374797021184,e70c2666551a871d5cd79b906560758c041c16220c5657129c83926b53d9b5ba,2020-11-14 16:34:40,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(int i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(int i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t\nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); \n\t\t\t\n\t\tt = i; \n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,41,256 1327551114963406848,47edf3057b2187cfaddc473dc19f836a1a604f0fe57350416d756eb8cae6ce08,2020-11-14 17:57:05,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"\n#include\n#include\n#define INF 0xfffffff;\n__int64 a[100000];\nvoid fun()\n{\n\tint i,j;\n\t__int64 temp,min;\n\ta[1]=1;\n\ta[2]=3;\n\tfor(i=3;i<=64;i++)\n\t{\n\t\tmin=INF;\n\t\tfor(j=1;j\n///迭代\nint main()\n{\n __int64 dp[21] = {0,1};\n int i;\n for(i = 2; i < 21; ++i )\n dp[i] = 3 * dp[i-1] + 1;///从中间柱子移入移除\n int t;\n scanf(\""%d\"",&t);\n while(t--)\n {\n scanf(\""%d\"",&i);\n printf(\""%I64d\\n\"",(dp[i-1] + 1)<<1);///最大盘可放上面\n }\n \n return 0;\n}",COMPILE_ERROR,0,0 1327560484463915008,da0ecf6ea9952dbf61bb373dcfb1bed113191f74569b506a411c46144a1d8bb3,2020-11-14 18:34:19,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}\n",ACCEPTED,39,208 1327560892142895104,688278197b1815d2853f10eaa1f5c60c5a620ca8c330a52225c4f756afd162ce,2020-11-14 18:35:56,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"\n#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,43,336 1327575386948681728,3c53dfc8431acc810baf0acd592c5ce4c89552845d89b0adb871a95cdd4caf21,2020-11-14 19:33:32,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); \n\t\t\t\n\t\tt = i; \n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,33,344 1327576108778999808,1ad4bce9b981f7ec51606c775d6d70b80ac0024caa9e80e42989f8a2b2b0b95b,2020-11-14 19:36:24,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); \n\t\t\t\n\t\tt = i; \n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,158,216 1327581178032603136,1e8f906ee3c7b9f3cf09d69769cc8d54de0e8f97a28d3e9c05b7954ebb1ba0a3,2020-11-14 19:56:32,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t/*这里抽象的很，需要理解为将n个盘子从one座移到three座(借助two座)的过程【其中one、two、three只是个形式位置】 \n\t\t\t\t\t\t\t\t\t\t\t\t\t----后面的hanoi(n-1,one,three,two)其实看成开头的定义hanoi(int n,char one,char two,char three)的形式样子 \n\t\t\t\t\t\t\t\t\t\t\t\t\t也就是one(实际位置如A)借助three(实际位置如C)移动到two(实际位置如B).下面的(3)其实和上面介绍的方法一样 \n\t\t\t\t\t\t\t\t\t\t\t\t\tone、two、three只是个形式位置，但A、B、C才是实际位置*/\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tprintf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""The step to move %d diskes:\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""The total number of times is %d\"",i-1);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1327582242798616576,1e8f906ee3c7b9f3cf09d69769cc8d54de0e8f97a28d3e9c05b7954ebb1ba0a3,2020-11-14 20:00:46,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}",COMPILE_ERROR,0,0 1327582301547212800,1e8f906ee3c7b9f3cf09d69769cc8d54de0e8f97a28d3e9c05b7954ebb1ba0a3,2020-11-14 20:01:00,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}",ACCEPTED,120,24148 1327592826382368768,27ccc56198b9e0c34189835e569ec2f1600c7dbcd673d88aa05de4ef40f058ab,2020-11-14 20:42:49,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}",ACCEPTED,126,24148 1327608937495744512,8ca4924787fb27b062f4a9e836bd6ac75716991032472f6270db2280946c20a8,2020-11-14 21:46:51,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}",ACCEPTED,112,24148 1327615022018379776,3cf513a2023efc85e5b270d8debed1b0d4c0957796a0e981a9a314ef2c8dbd9b,2020-11-14 22:11:01,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}\n",COMPILE_ERROR,0,0 1327615044104572928,3cf513a2023efc85e5b270d8debed1b0d4c0957796a0e981a9a314ef2c8dbd9b,2020-11-14 22:11:07,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}\n",ACCEPTED,176,24152 1327620826279784448,46eeb68e55c0f5ffffce80de61b71b66ddae87980c8d55d8a76d2da70efd9f6a,2020-11-14 22:34:05,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=0;\t\n\nvoid hanoi(int n, char chufadi, char jiezhudian, char mudidi)\t \n{\t\t\t\t\t\t\t\t\t\t\t\t\n\tvoid move(char chufadi, char mudidi);\t\t\n\t if(n<=0)\t\t\t\t\n\treturn ;\t\t\t\t\t\t\t\t\t\n\t \t\t\t\t\t\t\t\t\t\t\t\n\tif(n==1)\t\t\t\t\t\t\t\t\t\n\tmove( chufadi, mudidi);\t\t\t\t\t\t\n\telse\n\t{\t\t\t\t\t\t\t\t\t\t\n\thanoi(n-1, chufadi, mudidi, jiezhudian);\t\n\tmove( chufadi, mudidi);\t\t\t\t\t\t\n\thanoi(n-1, jiezhudian, chufadi, mudidi);\t\n\t}\n}\n\nvoid move(char chufadi, char mudidi)\n{\n\ti++;\n}\n\nint main(int argc,char const *argv[])\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tprintf(\""\\n\"");\n\thanoi(n,'A','B','C');\n\tprintf(\""需要移动盘子的总次数:%d\"",i);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1327623598367621120,46eeb68e55c0f5ffffce80de61b71b66ddae87980c8d55d8a76d2da70efd9f6a,2020-11-14 22:45:06,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n\nint i;\n\nvoid HanNuoTa(int n, char src, char trans, char dest)\n{\n if (n == 1) \n printf(\""第%d步：将第%d个盘子从%c--->%c\\n\"",i++, n, src, dest);\n else\n {\n HanNuoTa(n - 1, src, trans, dest); \n printf(\""第%d步：将第%d个盘子从%c--->%c\\n\"",i++, n, src, dest); \n HanNuoTa(n - 1, trans, src, dest); \n }\n}\n\nint main()\n{\n int n;\n while (scanf(\""%d\"", &n)) \n {\n i = 1;\n HanNuoTa(n, '1','2','3');\n printf(\""总的步数%d\\n\"", --i);\n }\n return 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1327625989741658112,ffe3da389656ac80d382056a409e50ed680aeac7b40a7e8e1256196746a99116,2020-11-14 22:54:36,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}\n",ACCEPTED,253,24152 1327626944083218432,46eeb68e55c0f5ffffce80de61b71b66ddae87980c8d55d8a76d2da70efd9f6a,2020-11-14 22:58:24,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\t\t\t\t\t\t\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t \n\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t\n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t \t\n\t\tmove(one,three);\t\t\t\t\t\t\t\n\t\thanoi(n-1,two,one,three);\t\t\t\t\t \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t\nvoid move(char x,char y)\t\t\t\t\n{\t\t\t\t\t\n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t\n\thanoi(n,'A','B','C');\n\tprintf(\""%d\"",i-1);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1327627585484566528,46eeb68e55c0f5ffffce80de61b71b66ddae87980c8d55d8a76d2da70efd9f6a,2020-11-14 23:00:57,C++,3.0,1320359192822747136,1313471683597295616,1039132196031492096,#include\nusing namespace std;\n \nlong long cishu=0;\n \n \nvoid yidong(int n)\n{\n if(n==1)\n {\n cishu+=1;\n }\n else\n {\n yidong(n-1);\n cishu=cishu*2+1;\n }\n}\n \nint main()\n{\n int N;\n cin>>N;\n yidong(N);\n cout<\nusing namespace std;\ndouble cishu=0;\n \n \nvoid yidong(int n)\n{\n if(n==1)\n {\n cishu+=1;\n }\n else\n {\n yidong(n-1);\n cishu=cishu*2+1;\n }\n}\n \nint main()\n{\n int N;\n cin>>N;\n yidong(N);\n cout<\nusing namespace std;\n__int128_t cishu=0;\n \n \nvoid yidong(int n)\n{\n if(n==1)\n {\n cishu+=1;\n }\n else\n {\n yidong(n-1);\n cishu=cishu*2+1;\n }\n}\n \nint main()\n{\n int N;\n cin>>N;\n yidong(N);\n cout<\nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}\n",ACCEPTED,30,472 1327641959721910272,d404309b881b785fe884b0a608d95d36da9c78182eca9e847e1dcdad70a2bf98,2020-11-14 23:58:04,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); \n\t\t\t\n\t\tt = i; \n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,45,336 1327786119987810304,5cd2d3f75aa0019a3bfa329277fa4f7e5ac9d7099bc7fd268df9102fe2295ad6,2020-11-15 09:30:54,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); \n\t\t\t\n\t\tt = i; \n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}\n",ACCEPTED,47,208 1327786225772343296,eabf4bf10a0a306e09d8e06be9e3844becd88b1443611d3b87203009ec3068c7,2020-11-15 09:31:19,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t/*这里抽象的很，需要理解为将n个盘子从one座移到three座(借助two座)的过程【其中one、two、three只是个形式位置】 \n\t\t\t\t\t\t\t\t\t\t\t\t\t----后面的hanoi(n-1,one,three,two)其实看成开头的定义hanoi(int n,char one,char two,char three)的形式样子 \n\t\t\t\t\t\t\t\t\t\t\t\t\t也就是one(实际位置如A)借助three(实际位置如C)移动到two(实际位置如B).下面的(3)其实和上面介绍的方法一样 \n\t\t\t\t\t\t\t\t\t\t\t\t\tone、two、three只是个形式位置，但A、B、C才是实际位置*/\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tprintf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""The step to move %d diskes:\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""The total number of times is %d\"",i-1);\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1327786729676025856,eabf4bf10a0a306e09d8e06be9e3844becd88b1443611d3b87203009ec3068c7,2020-11-15 09:33:20,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=0;\t\n\nvoid hanoi(int n, char chufadi, char jiezhudian, char mudidi)\t \n{\t\t\t\t\t\t\t\t\t\t\t\t//假设一开始针对n曾盘子chufadi为A,jiezhudian为B(jiezhudian像跳台或者辅助器一样),mudidi为C \n\tvoid move(char chufadi, char mudidi);\t\t// ^\n\t if(n<=0)\t\t\t\t//防止n为0的情况\t// |\n\treturn ;\t\t\t\t\t\t\t\t\t// |\n\t \t\t\t\t\t\t\t\t\t\t\t// |\n\tif(n==1)\t\t\t\t\t\t\t\t\t// |\n\tmove( chufadi, mudidi);\t\t\t\t\t\t// |\n\telse{\t\t\t\t\t\t\t\t\t\t// |\n\t\t\t\t\t\t\t\t\t\t\t\t// |\n\thanoi(n-1, chufadi, mudidi, jiezhudian);\t// 这时候针对n-1层盘子,chufadi还是原来的chufadi(A)，但是jiezhudian由原来的jiezhudian(B)变为了原来的mudidi(C) \n\tmove( chufadi, mudidi);\t\t\t\t\t\t//这时候需要将第n层盘子就从原来的chufadi(A)移到mudidi(C) \n\thanoi(n-1, jiezhudian, chufadi, mudidi);\t//这时候针对n-1层已经移到B的盘子其实移动的方法和第15行几乎一样 \n\t\n\t}\n}\n\nvoid move(char chufadi, char mudidi)\n{\n\tprintf(\""%c-->%c\\n\"",chufadi,mudidi);\n\ti++;\n}\n\nint main(int argc,char const *argv[])\n{\n\tint n;\n\tprintf(\""选择在A上的盘子个数:\\n\"");\n\tscanf(\""%d\"",&n);\n\tprintf(\""\\n\"");\n\thanoi(n,'A','B','C');\n\tprintf(\""需要移动盘子的总次数:%d\"",i);\n\treturn 0;\n}\n\n",TIME_LIMIT_EXCEEDED,0,0 1327797615913385984,7d21ce0230163b904bc0069cdd31f1755e5f6165020b2abe6a3c9ddff25a6d36,2020-11-15 10:16:35,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}",ACCEPTED,119,24188 1327800772966006784,fc5ee1b00a2ad8f9a5ec1bd76a8f2983c6d37247fb5d988b796f294a7aa9c475,2020-11-15 10:29:08,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,40,208 1327801194254483456,28af24d56af0703b2f8f33795add21dbe3b4db0a0ccbb5f210427439c337876b,2020-11-15 10:30:48,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}\n",ACCEPTED,48,340 1327817602345545728,4b2bcd2c79c492385cbd1593650cd62c42c382ab0c8423728a58b7549eff47da,2020-11-15 11:36:00,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",COMPILE_ERROR,0,0 1327819937633357824,46eeb68e55c0f5ffffce80de61b71b66ddae87980c8d55d8a76d2da70efd9f6a,2020-11-15 11:45:17,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); \n\t\t\t\n\t\tt = i; \n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,35,332 1327821390059474944,d24ba13755787a6bffa8ec2eea75839a402ebbfb42660f08e633f911d45d0a41,2020-11-15 11:51:03,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}\n",ACCEPTED,35,340 1327822959697510400,e03b3fb4f35169283fdb5a42ce5590c218ac755591611a892de44d2f6ec236a6,2020-11-15 11:57:18,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,50,332 1327826381087752192,eabf4bf10a0a306e09d8e06be9e3844becd88b1443611d3b87203009ec3068c7,2020-11-15 12:10:53,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}\n\n",ACCEPTED,40,336 1327845721187074048,76c0dd14cdbd40b652e43f772de78f5deb5264d2a4a6f3d465f975e3494b48be,2020-11-15 13:27:44,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t/*这里抽象的很，需要理解为将n个盘子从one座移到three座(借助two座)的过程【其中one、two、three只是个形式位置】 \n\t\t\t\t\t\t\t\t\t\t\t\t\t----后面的hanoi(n-1,one,three,two)其实看成开头的定义hanoi(int n,char one,char two,char three)的形式样子 \n\t\t\t\t\t\t\t\t\t\t\t\t\t也就是one(实际位置如A)借助three(实际位置如C)移动到two(实际位置如B).下面的(3)其实和上面介绍的方法一样 \n\t\t\t\t\t\t\t\t\t\t\t\t\tone、two、three只是个形式位置，但A、B、C才是实际位置*/\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tprintf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""The step to move %d diskes:\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""The total number of times is %d\"",i-1);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1327847991765700608,aeedbce27b9e5e539d3e36ad401ba1dc688d49b80f3e81ebe7db6db96172eeee,2020-11-15 13:36:46,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}\n",ACCEPTED,149,340 1327867203682897920,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 14:53:06,C++,15.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nlong long int a[1000][1000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<101;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,108,4436 1327867257574965248,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 14:53:19,C++,15.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nlong long int a[10000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<101;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,38,20436 1327867381574348800,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 14:53:49,C++,15.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[10000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<101;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,32,19272 1327867853322530816,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 14:55:41,C++,15.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[10000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<1000;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,45,19492 1327867920065282048,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 14:55:57,C++,15.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[10000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<10000;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,42,19276 1327868388446392320,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 14:57:49,C++,15.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[10000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<10000;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\t//printf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,33,19408 1327868465193758720,b2248ba84d85227ea55413c95d694645c6a055ce7babd63fa1228586418cbaae,2020-11-15 14:58:07,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}\n",ACCEPTED,106,24276 1327869731273789440,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 15:03:09,C++,17.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[10000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<101;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0&&add!=0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,42,20292 1327870060505681920,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 15:04:27,C++,17.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[10000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<101;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0&&add!=0&&a[i][j]!=0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,44,20308 1327870307525013504,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 15:05:26,C++,17.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[10000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n //add=0;\n\t for(j=1;j<101;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0&&add!=0&&a[i][j]!=0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,42,20304 1327870356667043840,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 15:05:38,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[10000][100]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<101;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0&&add!=0&&a[i][j]!=0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",SEGMENTATION_FAULT,72,4300 1327870379071459328,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 15:05:43,C++,17.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[10000][1000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<101;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0&&add!=0&&a[i][j]!=0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,37,17864 1327870416108175360,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 15:05:52,C++,17.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[5000][1000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<101;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0&&add!=0&&a[i][j]!=0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,116,17872 1327872178092331008,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 15:12:52,C++,17.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[5000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<10000;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0&&add!=0&&a[i][j]!=0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,103,39376 1327872205730820096,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 15:12:59,C++,17.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[5000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<1000;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0&&add!=0&&a[i][j]!=0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,77,36008 1327872230233944064,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 15:13:05,C++,17.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[5000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<5000;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0&&add!=0&&a[i][j]!=0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,49,23764 1327872256135737344,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 15:13:11,C++,17.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[5000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<3000;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0&&add!=0&&a[i][j]!=0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,124,16080 1327872296067739648,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 15:13:20,C++,17.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[5000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<2000;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0&&add!=0&&a[i][j]!=0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,128,53580 1327872323159138304,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 15:13:27,C++,17.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[5000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<2500;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0&&add!=0&&a[i][j]!=0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,112,62416 1327872347701587968,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 15:13:33,C++,17.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[5000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<2800;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0&&add!=0&&a[i][j]!=0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=100;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,122,15180 1327877907254157312,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 15:35:38,C++,17.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[5000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<2800;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0&&add!=0&&a[i][j]!=0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=10000;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,42,15304 1327877934728433664,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 15:35:45,C++,17.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[5000][10000]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<2800;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0&&add!=0&&a[i][j]!=0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=1000;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",PARTIAL_ACCEPTED,40,15224 1327878037935697920,10abf6650083037f2aab66aeeebefcb73be5b515aa2100401027f11c3943e88d,2020-11-15 15:36:09,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint a[5000][2100]={0};\nvoid add(int n)\n{\n\tint i=0,j;\n\tint add=0;\n\ta[0][1]=0,a[1][1]=1;\n\t\n\tfor(i=2;i<=n;i++)\n {\n add=0;\n\t for(j=1;j<2000;j++)\n {\n \t if(j==1)a[i][j]=(2*a[i-1][j])+1+add; \n \t else a[i][j]=(2*a[i-1][j])+add;\n \t add=a[i][j]/10000;\n\t\t if(a[i][j]/10000<1&&a[i-1][j+1]==0&&add!=0)\n\t\t {\n\t\t \t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n\t\t \t break;\n\t\t }\n \t a[i][j]=a[i][j]%10000; \n\t\t //printf(\""A[%d][%d]:%lld \"",i,j,a[i][j]);\n \t \n \t \n\n\t }\n\t //printf(\""\\n\"");\n }\n}\nint main(void)\n{\n\tint n;\n\tscanf(\""%d\"",&n); \n\tadd(n);\n\t\n int j=2000;\n while(a[n][j]==0)\n\t{\n\t\tj--;\n\t}\n\tprintf(\""%d\"",a[n][j]);\n\tj--;\n\twhile(j>0)\n\t{\n\t\tprintf(\""%04d\"",a[n][j]);\n\t\tj--;\n\t}\n\tprintf(\""\\n\"");\n \n\n return 0;\n}",ACCEPTED,94,37324 1327899510500831232,0f75b28b40eef604beadbc40220b1c8147953b134fd623cb866203a4a31cca17,2020-11-15 17:01:29,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}\n",ACCEPTED,50,356 1327934708030451712,59189f982fe26bbd59e8a2b574c8e51513b6f54c9cda3df02e43c8345c1abb55,2020-11-15 19:21:20,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\nvoid hano(int n,char x,char y,char z);\nint main ()\n{\n\tint n;\n\tchar x,y,z;\n\tscanf(\""%d\\n\"",&n);\n\tscanf(\""%c %c %c \"",&x,&y,&z);\n\thano(n,x,y,z);\n}\nvoid hano(int n,char x,char y,char z)\n{\n\tif(n==1){\n\t\tprintf(\""%d: %c -> %c\\n\"",n,x,y);\n\t}\n\telse{\n\t\thano(n-1,x,z,y);\n\t\tprintf(\""%d: %c -> %c\\n\"",n,x,y);\n\t\thano(n-1,z,y,x);\n\t}\n}\n",TIME_LIMIT_EXCEEDED,0,0 1327934869574078464,463f2d5e4b281531cf141d8509159a280993003e89440f6627bc47f6a2655428,2020-11-15 19:21:59,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,44,332 1327935120070488064,59189f982fe26bbd59e8a2b574c8e51513b6f54c9cda3df02e43c8345c1abb55,2020-11-15 19:22:59,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n \nusing namespace std;\nlong long f(int n)\n{\n\tif (n == 1) return 2;\n\treturn 3 * f(n - 1) + 2;\n}\nint main()\n{\n\tint n;\n\twhile (scanf(\""%d\"", &n) != EOF) {\n\t\tprintf(\""%lld\\n\"", f(n));\n\t}\n\treturn 0;\n}\n",COMPILE_ERROR,0,0 1327935468508106752,59189f982fe26bbd59e8a2b574c8e51513b6f54c9cda3df02e43c8345c1abb55,2020-11-15 19:24:22,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n #include \nusing namespace std;\nlong long f(int n)\n{\n\tif (n == 1) return 2;\n\treturn 3 * f(n - 1) + 2;\n}\nint main()\n{\n\tint n;\n\twhile (scanf(\""%d\"", &n) != EOF) {\n\t\tprintf(\""%lld\\n\"", f(n));\n\t}\n\treturn 0;\n}\n",COMPILE_ERROR,0,0 1327935579673939968,59189f982fe26bbd59e8a2b574c8e51513b6f54c9cda3df02e43c8345c1abb55,2020-11-15 19:24:48,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n #include \nusing namespace std;\nlong f(int n)\n{\n\tif (n == 1) return 2;\n\treturn 3 * f(n - 1) + 2;\n}\nint main()\n{\n\tint n;\n\twhile (scanf(\""%d\"", &n) != EOF) {\n\t\tprintf(\""%lld\\n\"", f(n));\n\t}\n\treturn 0;\n}\n",COMPILE_ERROR,0,0 1327936068327133184,b9ff29c6ac5877215b8907445338f54977b05c1f1c43e12978869e91b23217de,2020-11-15 19:26:45,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,56,208 1327942044367269888,886255ece688498099d70297c932dafe15a5df35ab26791d2ecc94342e340f3e,2020-11-15 19:50:30,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,48,468 1327942083319771136,701a99beea25196788c11da2681696b79b242de5fe7f3ac2508d0db0d47e5413,2020-11-15 19:50:39,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); \n\t\t\t\n\t\tt = i; \n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,52,340 1327944482809786368,6de0afd5918928f6e7f7d47b6c0dccf6238636f4011c339566e1017d8cf8bf77,2020-11-15 20:00:11,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); \n\t\t\t\n\t\tt = i; \n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,56,400 1327945687002861568,9fa348412231779eb4b1b7ef369bfb9762fb79ea4c9ac5e3e3c374d4add745eb,2020-11-15 20:04:58,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}\n",ACCEPTED,54,336 1327945942041710592,a9507adc9e2b961c325eee6c7e3847ab664617ade1656699451acc8e37513fc3,2020-11-15 20:05:59,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,218,344 1327946181842644992,34481cbf4dff4d063e3b2737a6378de08abdfa7e47cad12bd6b491d654bb17c4,2020-11-15 20:06:56,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}",ACCEPTED,137,24148 1327946284384997376,dc2f99a4d721b5c2636ef54c6485da3e58628cb3e8efb978a6c48a3d490bed44,2020-11-15 20:07:20,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}\n",ACCEPTED,43,340 1327947018677604352,76c0dd14cdbd40b652e43f772de78f5deb5264d2a4a6f3d465f975e3494b48be,2020-11-15 20:10:16,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}\n",ACCEPTED,41,340 1327957618984038400,47edf3057b2187cfaddc473dc19f836a1a604f0fe57350416d756eb8cae6ce08,2020-11-15 20:52:23,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"void Merge(SqList L,int low,int m,int high)\n{\n\tint B[high-low+1];\n\tint a = low,b = m+1,k = 0;\n\twhile(a<=m&&b<=high)//a和b像两个指针一样移动 \n\t{\n\t\tif(L.elem[a]<=L.elem[b])\n\t\t\tB[k++] = L.elem[a++];\n\t\telse if(L.elem[b]<=L.elem[a])\n\t\t\tB[k++] = L.elem[b++];\n\t}\n\twhile(a<=m)\n\t\tB[k++] = L.elem[a++];\n\twhile(b<=high)\n\t\tB[k++] = L.elem[b++];\n\tfor(int i = low,k =0;i <= high;i++)\n\t{\n\t\tL.elem[i] = B[k++];\n\t}\n}",COMPILE_ERROR,0,0 1327958067959115776,47edf3057b2187cfaddc473dc19f836a1a604f0fe57350416d756eb8cae6ce08,2020-11-15 20:54:10,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(int i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(int i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t\n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",WRONG_ANSWER,45,504 1327960083129249792,76938097f9bcb3884b5a6ab8116d21621fdd38c2924277c29a1f624e8111bfc2,2020-11-15 21:02:10,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k,i;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t\nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,55,376 1327960244563824640,8c1ea1589415e637a2bef55331b48e5b9032bbca6accde6a0e58307031e6cdda,2020-11-15 21:02:49,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include \n\nlong long F(int num) //递归结果将很大,式子中含3^35\n{\n\tif (num==1)\n\t{\n\t\treturn 2; //递归出口，只有一个盘子，移动两次 \n\t}\n\telse\n\t{\n\t\treturn 3*F(num-1)+2; //递归主体\n\t}\n}\nint main()\n{\n\tint n;\n\twhile (scanf(\""%d\"",&n)!=EOF)\n\t{\n\t\tprintf(\""%lld\\n\"",F(n));\n\t}\n\treturn 0;\n}",WRONG_ANSWER,32,472 1327960786803437568,8c1ea1589415e637a2bef55331b48e5b9032bbca6accde6a0e58307031e6cdda,2020-11-15 21:04:58,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"include\nint h(int m)\n{\n\tint s;\n\tif(m==1) // 确定初始条件\n\t\ts=1;\n\telse\n\t\ts=2*h(m-1)+1;\n\treturn s;\n}\nint main()\n{ \n\tint n;\n\tscanf(\""%d\"",&n);\n\tprintf(\""%ld\"",h(n));\n}",COMPILE_ERROR,0,0 1327960865316622336,8c1ea1589415e637a2bef55331b48e5b9032bbca6accde6a0e58307031e6cdda,2020-11-15 21:05:17,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"include\nint h(int m)\n{\n\tint s;\n\tif(m==1) // 确定初始条件\n\t\ts=1;\n\telse\n\t\ts=2*h(m-1)+1;\n\treturn s;\n}\nvoid main()\n{ \n\tint n;\n\tscanf(\""%d\"",&n);\n\tprintf(\""%ld\"",h(n));\n}",COMPILE_ERROR,0,0 1327960897684058112,b675d4c716f4a8df46ecec20fbcc8f25ee1b8ce76a4af620d92a3c496aa4f5aa,2020-11-15 21:05:25,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include '4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}\n",COMPILE_ERROR,0,0 1327960942877691904,b675d4c716f4a8df46ecec20fbcc8f25ee1b8ce76a4af620d92a3c496aa4f5aa,2020-11-15 21:05:35,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include xxx\nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); \n\t\t\t\n\t\tt = i; \n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}\n",ACCEPTED,125,496 1327960943968202752,8c1ea1589415e637a2bef55331b48e5b9032bbca6accde6a0e58307031e6cdda,2020-11-15 21:05:36,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"include\nint h(int m)\n{\n\tint s;\n\tif(m==1) // 确定初始条件\n\t\ts=1;\n\telse\n\t\ts=2*h(m-1)+1;\n\treturn s;\n}\nint main()\n{ \n\tint n;\n\tscanf(\""%d\"",&n);\n\tprintf(\""%ld\"",h(n));\n return 0； \n}",COMPILE_ERROR,0,0 1327960989879054336,8c1ea1589415e637a2bef55331b48e5b9032bbca6accde6a0e58307031e6cdda,2020-11-15 21:05:46,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"include\nint h(int m)\n{\n\tint s;\n\tif(m==1) // 确定初始条件\n\t\ts=1;\n\telse\n\t\ts=2*h(m-1)+1;\n\treturn s;\n}\nint main()\n{ \n\tint n;\n\tscanf(\""%d\"",&n);\n\tprintf(\""%ld\"",h(n));\n return 0;\n}",COMPILE_ERROR,0,0 1327960994232750080,47edf3057b2187cfaddc473dc19f836a1a604f0fe57350416d756eb8cae6ce08,2020-11-15 21:05:48,C++,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); \n\t\t\t\n\t\tt = i; \n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,38,336 1327961258721357824,8c1ea1589415e637a2bef55331b48e5b9032bbca6accde6a0e58307031e6cdda,2020-11-15 21:06:51,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nusing namespace std; \nconst int times=3; \nlong move(int, char, char,char); \nint main() \n{ \n long a; \n a=move(times,'A','B','C'); \n cout<\nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,40,468 1327978868296986624,4b2bcd2c79c492385cbd1593650cd62c42c382ab0c8423728a58b7549eff47da,2020-11-15 22:16:49,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint i = 0;\nvoid move(int n, char from, char to)\n{\n i++;\n}\n \nHanoi(int n, char A, char B, char C)\n{\n if (n == 1)\n {\n move(n, A, C);\n }\n else\n {\n Hanoi(n - 1, A, C, B);\n move(n, A, C);\n Hanoi(n - 1, B, A, C);\n }\n}\n \nint main()\n{\n int n = 0;\n scanf(\""%d\"", &n);\n Hanoi(n, 'A', 'B', 'C');\n printf(\""%d\\n\"", i);\n return 0; \n}",TIME_LIMIT_EXCEEDED,0,0 1327980030823837696,4b2bcd2c79c492385cbd1593650cd62c42c382ab0c8423728a58b7549eff47da,2020-11-15 22:21:26,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"void Merge(SqList L,int low,int m,int high)\n{\n\tint B[high-low+1];\n\tint a = low,b = m+1,k = 0;\n\twhile(a<=m&&b<=high)//a和b像两个指针一样移动 \n\t{\n\t\tif(L.elem[a]<=L.elem[b])\n\t\t\tB[k++] = L.elem[a++];\n\t\telse if(L.elem[b]<=L.elem[a])\n\t\t\tB[k++] = L.elem[b++];\n\t}\n\twhile(a<=m)\n\t\tB[k++] = L.elem[a++];\n\twhile(b<=high)\n\t\tB[k++] = L.elem[b++];\n\tfor(int i = low,k =0;i <= high;i++)\n\t{\n\t\tL.elem[i] = B[k++];\n\t}\n}",COMPILE_ERROR,0,0 1327981595378929664,4b2bcd2c79c492385cbd1593650cd62c42c382ab0c8423728a58b7549eff47da,2020-11-15 22:27:39,C,20.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n\t\twhile(a[++i]); \n\t\tt = i; \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n \n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}\n",ACCEPTED,41,328 1327985703217344513,9a08a875015ef174d8022ceb44f7bba8a442e47151be251f2123a4426f54cc15,2020-11-15 22:43:59,C,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(int i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t\nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); \n\t\t\t\n\t\tt = i; \n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}\n",ACCEPTED,82,368 1327987120011292672,9a08a875015ef174d8022ceb44f7bba8a442e47151be251f2123a4426f54cc15,2020-11-15 22:49:36,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(int i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t\n#include\nint MathMove(unsigned int n)\n{\n\tif (n == 1)\n\t\treturn 1;\n\telse\n\t\treturn 2 * MathMove(n - 1) + 1;\n}\nint main()\n{\n\tunsigned int n = 0;\n\tprintf(\""请输入您要设置的圆盘数：>\\n\"");\n\tscanf(\""%d\"", &n);\n\tint ret = MathMove(n);\n\tprintf(\""从A柱移动到C柱需要移动%d次。\\n\"", ret);\n\tsystem(\""pause\"");\n\treturn 0;\n}",COMPILE_ERROR,0,0 1327987615803199488,9a08a875015ef174d8022ceb44f7bba8a442e47151be251f2123a4426f54cc15,2020-11-15 22:51:35,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(int i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t\n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t/*这里抽象的很，需要理解为将n个盘子从one座移到three座(借助two座)的过程【其中one、two、three只是个形式位置】 \n\t\t\t\t\t\t\t\t\t\t\t\t\t----后面的hanoi(n-1,one,three,two)其实看成开头的定义hanoi(int n,char one,char two,char three)的形式样子 \n\t\t\t\t\t\t\t\t\t\t\t\t\t也就是one(实际位置如A)借助three(实际位置如C)移动到two(实际位置如B).下面的(3)其实和上面介绍的方法一样 \n\t\t\t\t\t\t\t\t\t\t\t\t\tone、two、three只是个形式位置，但A、B、C才是实际位置*/\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tprintf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""The step to move %d diskes:\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""The total number of times is %d\"",i-1);\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1327988080855035904,9a08a875015ef174d8022ceb44f7bba8a442e47151be251f2123a4426f54cc15,2020-11-15 22:53:25,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=0;\t\n\nvoid hanoi(int n, char chufadi, char jiezhudian, char mudidi)\t \n{\t\t\t\t\t\t\t\t\t\t\t\t//假设一开始针对n曾盘子chufadi为A,jiezhudian为B(jiezhudian像跳台或者辅助器一样),mudidi为C \n\tvoid move(char chufadi, char mudidi);\t\t// ^\n\t if(n<=0)\t\t\t\t//防止n为0的情况\t// |\n\treturn ;\t\t\t\t\t\t\t\t\t// |\n\t \t\t\t\t\t\t\t\t\t\t\t// |\n\tif(n==1)\t\t\t\t\t\t\t\t\t// |\n\tmove( chufadi, mudidi);\t\t\t\t\t\t// |\n\telse{\t\t\t\t\t\t\t\t\t\t// |\n\t\t\t\t\t\t\t\t\t\t\t\t// |\n\thanoi(n-1, chufadi, mudidi, jiezhudian);\t// 这时候针对n-1层盘子,chufadi还是原来的chufadi(A)，但是jiezhudian由原来的jiezhudian(B)变为了原来的mudidi(C) \n\tmove( chufadi, mudidi);\t\t\t\t\t\t//这时候需要将第n层盘子就从原来的chufadi(A)移到mudidi(C) \n\thanoi(n-1, jiezhudian, chufadi, mudidi);\t//这时候针对n-1层已经移到B的盘子其实移动的方法和第15行几乎一样 \n\t\n\t}\n}\n\nvoid move(char chufadi, char mudidi)\n{\n\tprintf(\""%c-->%c\\n\"",chufadi,mudidi);\n\ti++;\n}\n\nint main(int argc,char const *argv[])\n{\n\tint n;\n\tprintf(\""选择在A上的盘子个数:\\n\"");\n\tscanf(\""%d\"",&n);\n\tprintf(\""\\n\"");\n\thanoi(n,'A','B','C');\n\tprintf(\""需要移动盘子的总次数:%d\"",i);\n\treturn 0;\n}\n\n",TIME_LIMIT_EXCEEDED,0,0 1327988260597747712,9a08a875015ef174d8022ceb44f7bba8a442e47151be251f2123a4426f54cc15,2020-11-15 22:54:08,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include\n#include\n\nvoid hanoi(int n, int x, int y, int z) //这里的x，y，z代表我的A杆、B杆、C杆。（下同）\n{\n if (n == 1)\n printf(\""%c-->%c\\n\"", x, z);\n else\n {\n hanoi(n - 1, x, z, y);\n printf(\""%c-->%c\\n\"", x, z);\n hanoi(n - 1, y, x, z);\n }\n}\n\nint main(void)\n{\n int m;\n printf(\""Input unmber:\"");\n scanf(\""%d\"", &m);\n printf(\""moving %2d diskes:\\n\"", m);\n hanoi(m, 'a', 'b', 'c');\n system(\""pause\"");\n}\n",TIME_LIMIT_EXCEEDED,0,0 1327988407801032704,9a08a875015ef174d8022ceb44f7bba8a442e47151be251f2123a4426f54cc15,2020-11-15 22:54:43,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(int i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k,i;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k,i;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&ta[index])\n\t\t\tindex=i;\n\t}\n\treturn a[index];\n}\nint min(int a[ ], int m, int n)\n{\n\tint i,index=m;\n\tfor(i=m;i<=n;i++)\n\t{\n\t\tif(a[i] \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(int i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(int i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(int i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(int i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t\nint main()\n{\n\tint n, i, cf, fi, t; \n\tchar a[10000]; \n\ta[0] = '1';\t\t \n\ta[1] = '\\0';\n\tscanf(\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\ti = 0; cf = 0; fi = 0;\n \n\t\twhile(a[++i]); \n\t\t\t\n\t\tt = i; \n \n\t\tif(a[0]>'4')\n\t\t\tfi = 1;\n\t\telse\n\t\t\tfi = 0;\n\t\twhile(i--) {\n\t\t\tif(a[i]>'4') {\n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 % 10 + cf + '0';\n\t\t\t\tcf = 1;\n\t\t\t}\n\t\t\telse { \n\t\t\t\ta[i+fi] = (a[i]-'0') * 2 + cf + '0';\n\t\t\t\tcf = 0;\n\t\t\t}\t\n\t\t}\n\t\ta[t+fi] = '\\0';\t\n\t\tif(fi)\n\t\t\ta[0] = '1';\n\t}\n\ti = 0;\n\twhile(a[++i]);\n\ta[i-1] = a[i-1]-'0'-1 + '0'; \n\tprintf(\""%s\\n\"", a);\t\n\treturn 0;\n}",ACCEPTED,44,328 1327990945627590656,e70c2666551a871d5cd79b906560758c041c16220c5657129c83926b53d9b5ba,2020-11-15 23:04:49,C++,0.0,1320359192822747136,1313471683597295616,1039132196031492096,"#include \n#include\n#include\nusing namespace std;\nconst int maxn=10010;\n \nint main(){\n\t\n\tint n,k;\n\tint a[maxn];\n\t\n\tcin>>n>>k;\n\t\n\tfor(int i=1;i<=n;i++)\n\t cin>>a[i];\n\t \n\tfor(int i=2;i<=n;i++){\n\t\t\n\t\tint t=a[i],j=i;\n\t\twhile(j>1&&t\n#include \nusing namespace std;\n\nint S[5001][2011];\n\nvoid inti_S()\n{\n S[1][1] = 1;\n S[2][1] = 3;\n int add = 0;\n\n for(int i = 3; i <= 5001; i ++)\n {\n for(int j = 1; j <= 2000; j++)\n {\n S[i][j] = 2 * S[i - 1][j] + add;\n //printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(j == 1) S[i][j] += 1;\n\n add = S[i][j] / 10000;\n // cout << \""add:\"" << add << endl;\n S[i][j] %= 10000;\n // printf(\""S[%d][%d]:%d\\n\"", i, j, S[i][j]);\n if(S[i][j] == 0 && S[i - 1][j + 1] == 0 && add == 0) break;\n }\n // printf(\""\\n\"");\n }\n}\n\nint main()\n{\n inti_S();\n\n int n;\n while(scanf(\""%d\"", &n) != EOF){\n\n int k = 2000;\n while(!S[n][k]) --k;\n // cout << k << endl;\n\n if(k == 1) printf(\""%d\\n\"", S[n][1]);\n else{\n for(int i = k; i >= 1; i--)\n {\n if(i == k) printf(\""%d\"", S[n][i]);\n else printf(\""%04d\"", S[n][i]);\n //cout << S[i][k] << \""\\t\"";\n }\n cout << endl;\n }\n }\n return 0;\n}\n",ACCEPTED,119,24144 1480696911211253760,3e26b6b49d57ab0293d9a0c3f50454b822adc597d3898d65dd2ec902adc23e18,2022-01-11 08:23:48,C,20.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include \n#include \n#define GC getchar()\n#define Clean(X,K) memset(X,K,sizeof(X))\n\nint readInt () {\n\tint X = 0 , F = 1 ;\n\tchar C = GC ;\n\twhile (C > '9' || C < '0') {\n\t\tif (C == '-') F = -1 ;\n\t\tC = GC ;\n\t}\n\twhile (C >='0' && C <= '9') {\n\t\tX = X * 10 + C - '0';\n\t\tC = GC ;\n\t}\n\treturn X*F ;\n}\n\n#define maxl 100005\nint S[maxl] ;\nint len = 1 ;\n#define base 10\nvoid mul2 () {\n\tfor (int i = 0 ; i < len ; ++ i) {\n\t\tS[i] *= 2 ;\n\n\t}\n\tfor (int i = 0 ; i < len ; ++ i) {\n\t\twhile (S[i] >= base ) {\n\t\t\tS[i] -= base ;\n\t\t\t++ S[i + 1] ;\n\t\t}\n\t}\n\tif (S[len]) ++ len ;\n}\n\nvoid add1 () {\n\tS[0] ++ ;\n\tfor (int i = 0 ; i < len ; ++ i) {\n\t\tif (S[i] >= base) {\n\t\t\tS[i] -= base ;\n\t\t\t++ S[i + 1] ;\n\t\t}\n\t}\n\tif (S[len]) ++ len ;\n}\nint main () {\n//\tfreopen (\""PTA.txt\"" , \""r\"" , stdin) ;\n\tint N = readInt () ;//\n//\tS[0] = 5 ;\n//\tS[1] = 1 ;\n//\tlen = 2;\n\tfor (int I = 1 ; I <= N ; ++ I) {\n\t\tmul2 () ;\n\t\tadd1 () ;\n\n\t}\n\t\tfor (int i = len - 1 ; i >= 0 ; -- i) printf (\""%d\"" , S[i]) ;\n\t\tputchar ('\\n') ;\n\n\treturn 0 ;\n}",ACCEPTED,32,312 1480774274301284352,a1842af8ef720b1f5dde30fc4c231a1644680326e158f1d42ac6014231e6a2a4,2022-01-11 13:31:13,C,0.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\nlong long int count=0;\n void hx(int n,char a,char b,char c){\n \n\t if(n==1) count++;\n\t else { hx(n-1,a,b,c);\n\t count++;\n\t hx(n-1,c,a,b);\n\t } \n }\n int main(void){\n \tint n;\n \tscanf(\""%d\"",&n);\n \thx(n,'a','b','c');\n \tprintf(\""%lld\"",count);\n \t\n \t\n }",TIME_LIMIT_EXCEEDED,0,0 1480780613987586048,a1842af8ef720b1f5dde30fc4c231a1644680326e158f1d42ac6014231e6a2a4,2022-01-11 13:56:24,C,17.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include \n\n\nint main(void)\n{\n\t int n;\n\t scanf(\""%d\"",&n);\n\tint a[1000];\t\t//先定义一个足够大的数组 \n\tint i,j;\n\t\n\tfor(i=0; i<1000; i++)\t//先置零 \n\t{\n\t\ta[i] = 0;\n\t}\n\ta[0] = 1;\n\tfor(i=0; i 9)\t\t//大于9的需要进1 \n\t\t\t{\n\t\t\t\ta[j+1]++;\t\t//高一位进1 \n\t\t\t\ta[j] = a[j] % 10; \n\t\t\t}\n\t\t}\n\t}\n if(a[0]==0){\n \ta[0]=9;\n \ta[1]=a[1]-1;\n\t }\n\t else a[0]=a[0]-1;\n\n\tint c=0;\n\tfor(i=999; i>=0; i--)\t//打印 \n\t{if(a[i]==0&&c==0) continue;\n\t else {\n\t \t c=1;\n\t\t\t \tprintf(\""%d\"",a[i]);\n\t} \n\t\n\t}\n} \n",PARTIAL_ACCEPTED,35,384 1480781230730629120,a1842af8ef720b1f5dde30fc4c231a1644680326e158f1d42ac6014231e6a2a4,2022-01-11 13:58:51,C,0.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include \n\n\nint main(void)\n{\n\t int n;\n\t scanf(\""%d\"",&n);\n\tint a[1000000000000];\t\t//先定义一个足够大的数组 \n\tint i,j;\n\t\n\tfor(i=0; i<1000000000000; i++)\t//先置零 \n\t{\n\t\ta[i] = 0;\n\t}\n\ta[0] = 1;\n\tfor(i=0; i 9)\t\t//大于9的需要进1 \n\t\t\t{\n\t\t\t\ta[j+1]++;\t\t//高一位进1 \n\t\t\t\ta[j] = a[j] % 10; \n\t\t\t}\n\t\t}\n\t}\n if(a[0]==0){\n \ta[0]=9;\n \ta[1]=a[1]-1;\n\t }\n\t else a[0]=a[0]-1;\n\n\tint c=0;\n\tfor(i=1000000000000-1; i>=0; i--)\t//打印 \n\t{if(a[i]==0&&c==0) continue;\n\t else {\n\t \t c=1;\n\t\t\t \tprintf(\""%d\"",a[i]);\n\t} \n\t\n\t}\n} \n",TIME_LIMIT_EXCEEDED,0,0 1480781407436591104,a1842af8ef720b1f5dde30fc4c231a1644680326e158f1d42ac6014231e6a2a4,2022-01-11 13:59:33,C,20.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include \n\n\nint main(void)\n{\n\t int n;\n\t scanf(\""%d\"",&n);\n\tint a[10000];\t\t//先定义一个足够大的数组 \n\tint i,j;\n\t\n\tfor(i=0; i<10000; i++)\t//先置零 \n\t{\n\t\ta[i] = 0;\n\t}\n\ta[0] = 1;\n\tfor(i=0; i 9)\t\t//大于9的需要进1 \n\t\t\t{\n\t\t\t\ta[j+1]++;\t\t//高一位进1 \n\t\t\t\ta[j] = a[j] % 10; \n\t\t\t}\n\t\t}\n\t}\n if(a[0]==0){\n \ta[0]=9;\n \ta[1]=a[1]-1;\n\t }\n\t else a[0]=a[0]-1;\n\n\tint c=0;\n\tfor(i=9999; i>=0; i--)\t//打印 \n\t{if(a[i]==0&&c==0) continue;\n\t else {\n\t \t c=1;\n\t\t\t \tprintf(\""%d\"",a[i]);\n\t} \n\t\n\t}\n} \n",ACCEPTED,91,320 1481506099411935232,4613e095587dea1a2fa7c45d7b7aee3d4c9061aefd74ac136cf24e588237771d,2022-01-13 13:59:13,C,0.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\nint p=0;\nvoid hon(int n,char A,char B,char C);\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\thon(n,'A','B','C');\n\tprintf(\""%d\"",p);\n\treturn 0;\n\t \n}\nvoid hon(int n,char A,char B,char C)\n{\n\tp=p+1;\n\tif(n>1)\n\t{\n\t\thon(n-1,A,C,B);\n\t\thon(n-1,B,A,C);\n\t}\n\t\n}",TIME_LIMIT_EXCEEDED,0,0 1481507038902476800,4613e095587dea1a2fa7c45d7b7aee3d4c9061aefd74ac136cf24e588237771d,2022-01-13 14:02:57,C,0.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\nint p=0;\nvoid hon(int n,char A,char B,char C);\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\thon(n,'A','B','C');\n\treturn 0;\n\t \n}\nvoid hon(int n,char A,char B,char C)\n{\n\tp=p+1;\n\tif(n==1)\n\t{\n\t\tprintf(\""%d\"",p);\n\t}\n\telse\n\t{\n\t\thon(n-1,A,C,B);\n\t\thon(n-1,B,A,C);\n\t}\n\n\t\n}",TIME_LIMIT_EXCEEDED,0,0 1481508691887386624,4613e095587dea1a2fa7c45d7b7aee3d4c9061aefd74ac136cf24e588237771d,2022-01-13 14:09:31,C,0.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\nint p=0;\nvoid hon(int n,char A,char B,char C);\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\thon(n,'A','B','C');\n\tprintf(\""%d\"",p);\n\treturn 0;\n\t \n}\nvoid hon(int n,char A,char B,char C)\n{\n\tif(n==1)\n\t{\n\t\tp++;\n\t}\n\telse\n\t{\n\t\thon(n-1,A,C,B);\n\t\tp++;\n\t\thon(n-1,B,A,C);\n\t}\n\n\t\n}",TIME_LIMIT_EXCEEDED,0,0 1481509259689775104,4613e095587dea1a2fa7c45d7b7aee3d4c9061aefd74ac136cf24e588237771d,2022-01-13 14:11:47,C,0.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\nlong long int p=0;\nvoid hon(int n,char A,char B,char C);\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\thon(n,'A','B','C');\n\tprintf(\""%lld\"",p);\n\treturn 0;\n\t \n}\nvoid hon(int n,char A,char B,char C)\n{\n\tif(n==1)\n\t{\n\t\tp++;\n\t}\n\telse\n\t{\n\t\thon(n-1,A,C,B);\n\t\tp++;\n\t\thon(n-1,B,A,C);\n\t}\n\n\t\n}",TIME_LIMIT_EXCEEDED,0,0 1482201423444889600,a6059d9d6485f26d45fb9c34a8120c35fe0237c729e7126226a4a1dafafaca24,2022-01-15 12:02:11,C++,0.0,1480465199618179074,1313471683597295616,1039132196031492096,"\n#include \n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",WRONG_ANSWER,14,452 1482348713920876544,05cd51f7d0abc7eab4e73fdaee2b3e9437c26a685d35fc02adc31941e35de6bd,2022-01-15 21:47:28,C,20.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\n#include\n#include\nchar a[10000]={0};\nvoid cpy(char a[],char b[]) {\n\tfor (int i = 0; i < 10000; i++)\n\t\ta[i] = b[i];\n\n}\nvoid db(char* a) {\n\n\tint len = (int)strlen(a + 1);\n\t/*printf(\""len=%d\\n\"", len);*/\n\tfor (int i = 1; i <= len; i++) {\n\t\ta[i - 1] += (a[i] + a[i] - '0' - '0') / 10;\n\t\ta[i]='0'+ (a[i] + a[i] - '0' - '0') % 10;\n\t}\n\tif (a[0]!=0)\n\t\tfor (int i = 10000-1; i > 0; i--)\n\t\t\ta[i] = a[i - 1];\n\ta[0] = '0';\n}\n//163\n//2\nvoid print(char* s) {\n\tint i = 1;\n\twhile (s[i] == '0'||s[i]==0) {\n\t\ti++;\n\n\n\t}\n\tprintf(\""%s\"", s + i);\n}\nvoid dvd(char* s) {\n\tdb(s);\n\tprint(s);\n\n}\nint main(){\n\tint n;\n\tscanf(\""%d\"", &n);\n\tfor (int i = 0; i < 10000; i++) {\n\t\ta[i] = 0;\n\t}\n\ta[1] = '1';\n\tfor (int i = 0; i < n; i++) {\n\t\tdb(a);\n\t}\n\tint len = strlen(a);\n\ta[len-1]--;\n\n\tprint(a);\n}",ACCEPTED,48,192 1482703096621748224,4d33d86f360abe57555fea06ab88f5156d70494daf606220efc54c895aff6687,2022-01-16 21:15:40,C,0.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\ndouble Hanoi(int a);\n//当你需要移动某个盘子的时候，你需要先将它上面的全部盘子移动到无关杆上，再将这个盘子移动到目标杆，然后将它上面的盘子从无关杆移动到目标杆。\n//这样只需移动一步+前面一种形态移动出去再移动回来，得结果\nint main()\n{\n int a;\n double n;\n scanf(\""%d\"",&a);\n n=Hanoi(a);\n printf(\""%lf\"",n);\n}\ndouble Hanoi(int a)\n{\n double n;\n if(a==0) n=0;\n else n=1+Hanoi(a-1)*2;\n return n;\n}\n",WRONG_ANSWER,10,444 1482707445490110464,4d33d86f360abe57555fea06ab88f5156d70494daf606220efc54c895aff6687,2022-01-16 21:32:57,C,3.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\nlong long int Hanoi(int a);\n//当你需要移动某个盘子的时候，你需要先将它上面的全部盘子移动到无关杆上，再将这个盘子移动到目标杆，然后将它上面的盘子从无关杆移动到目标杆。\n//这样只需移动一步+前面一种形态移动出去再移动回来，得结果\nint main()\n{\n int a;\n long long int n;\n scanf(\""%d\"",&a);\n n=Hanoi(a);\n printf(\""%lld\"",n);\n}\nlong long int Hanoi(int a)\n{\n long long int n;\n if(a==0) n=0;\n else n=1+Hanoi(a-1)*2;\n return n;\n}\n",PARTIAL_ACCEPTED,10,344 1482714302564917248,4d33d86f360abe57555fea06ab88f5156d70494daf606220efc54c895aff6687,2022-01-16 22:00:11,C,3.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\nlong long int Hanoi(int a);\n//当你需要移动某个盘子的时候，你需要先将它上面的全部盘子移动到无关杆上，再将这个盘子移动到目标杆，然后将它上面的盘子从无关杆移动到目标杆。\n//这样只需移动一步+前面一种形态移动出去再移动回来，得结果\nint main()\n{\n int a;\n long long int n;\n scanf(\""%d\"",&a);\n n=Hanoi(a);\n printf(\""%lld\"",n);\n}\nlong long int Hanoi(int a)\n{\n long long int n;\n if(a==0) n=0;\n else n=1+Hanoi(a-1)*2;\n return n;\n}\n//数据太大溢出了",PARTIAL_ACCEPTED,10,332 1483731881237102592,2af84ac536038c923fc33448e5a467d6b87957414ac070e1946d1dc6f907891c,2022-01-19 17:23:41,C,0.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\n#include\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n \n printf(\""%.0f\"",pow(2,n)-1);\n \n \n}\n",WRONG_ANSWER,12,476 1483734502006034432,2af84ac536038c923fc33448e5a467d6b87957414ac070e1946d1dc6f907891c,2022-01-19 17:34:06,C,3.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\nlong long doit(int n);\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n printf(\""%lld\"",doit(n)-1);\n}\nlong long doit(int n)\n{\n if(n==0)return 1;\n return 2*doit(n-1);\n}\n\n",PARTIAL_ACCEPTED,11,324 1483734847851544576,2af84ac536038c923fc33448e5a467d6b87957414ac070e1946d1dc6f907891c,2022-01-19 17:35:28,C,0.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\ndouble doit(int n);\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n printf(\""%.0lf\"",doit(n)-1);\n}\ndouble doit(int n)\n{\n if(n==0)return 1;\n return 2*doit(n-1);\n}\n\n",WRONG_ANSWER,11,448 1483737320662208512,2af84ac536038c923fc33448e5a467d6b87957414ac070e1946d1dc6f907891c,2022-01-19 17:45:18,C,3.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\nlong double doit(int n);\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n long double p=doit(n)-1;\n \n printf(\""%.0Lf\"",p);\n}\nlong double doit(int n)\n{\n if(n==0)return 1;\n return 2*doit(n-1);\n}\n\n",PARTIAL_ACCEPTED,16,456 1483739125654978560,2af84ac536038c923fc33448e5a467d6b87957414ac070e1946d1dc6f907891c,2022-01-19 17:52:28,C++,3.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\nlong double doit(int n);\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n long double p=doit(n)-1;\n \n printf(\""%.0Lf\"",p);\n}\nlong double doit(int n)\n{\n if(n==0)return 1;\n return 2*doit(n-1);\n}\n\n",PARTIAL_ACCEPTED,11,328 1483739226608472064,942e646dd19ab67778171bcb08516d39ede3dab1d0783ad161104697726dfdc4,2022-01-19 17:52:52,C,0.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include \nstatic int i=0;\nvoid move(char x,char y){\n\ti++;\n}\nvoid hanoi(int n,char a,char b,char c)\n{\n\tvoid move(char a,char b);\n\tif(n==1)\n\tmove(a,c);\n\telse{\n\t\thanoi(n-1,a,b,c);\n\t\tmove(a,c);\n\t\thanoi(n-1,b,a,c);\n\t\t \n\t}\n}\nint main ()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\thanoi(n,'x','y','z');\n\tprintf(\""%d\"",i-1);\n\treturn 0; \n\t\n}",TIME_LIMIT_EXCEEDED,0,0 1485482682300973056,99442fec854e5bddbb9865afa41ac561a73d4c1d61717144c33621312a1d61fe,2022-01-24 13:20:45,C,0.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\n#include\ndouble pingfang(int n)\n{\n\tdouble sum=1;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tsum=sum*2; \n\t}\n\treturn sum;\n}\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tdouble a=pingfang(n)-1;\n\tprintf(\""%.0f\"",a);\n\treturn 0;\n } ",WRONG_ANSWER,10,316 1485484431404924928,99442fec854e5bddbb9865afa41ac561a73d4c1d61717144c33621312a1d61fe,2022-01-24 13:27:42,C,3.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\nlong long int han(int n)\n{\n\tif(n==0)return 0;\n\telse if(n==1)return 1;\n\telse return 2*han(n-1)+1;\n}\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tprintf(\""%lld\"",han(n));\n\treturn 0;\n}",PARTIAL_ACCEPTED,10,324 1485485875802095616,99442fec854e5bddbb9865afa41ac561a73d4c1d61717144c33621312a1d61fe,2022-01-24 13:33:26,C,0.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\ndouble han(int n)\n{\n\tif(n==1)return 1;\n\telse return 2*han(n-1)+1;\n}\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tprintf(\""%.0f\"",han(n));\n\treturn 0;\n}",WRONG_ANSWER,10,328 1485488406649606144,99442fec854e5bddbb9865afa41ac561a73d4c1d61717144c33621312a1d61fe,2022-01-24 13:43:29,C,0.0,1480465199618179074,1313471683597295616,1039132196031492096,#include\nusing namespace std;\n\n\nint main()\n\n{\n\tint n;\tcin>>n;\n\tlong double sum=1;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tsum=sum*2;\n\t}\n\tsum=sum-1;\n\tcout<\nusing namespace std;\n\n\nint main()\n\n{\n\tint n;\tcin>>n;\n\tlong double sum=1;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tsum=sum*2;\n\t}\n\tsum=sum-1;\n\tcout<\ndouble fact(int n){\n\tdouble result;\n\tif(n==1||n==0){\n\t\tresult=1;\n\t} \n\telse{\n\t\tresult=n*fact(n-1);\n\t}\n\treturn result;\n}\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tprintf(\""%f\"",fact(n));\n}",WRONG_ANSWER,11,324 1490312466952409088,a25e4a2b39af85bf759356e131ee11f30f1a0fc19e13f141800ac9ffb31b24dc,2022-02-06 21:12:35,C,0.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\ndouble fact(int n){\n\tdouble result;\n\tif(n==1||n==0){\n\t\tresult=1;\n\t} \n\telse{\n\t\tresult=n*fact(n-1);\n\t}\n\treturn result;\n}\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tprintf(\""%lf\"",fact(n));\n}",WRONG_ANSWER,12,320 1490313639868055552,a25e4a2b39af85bf759356e131ee11f30f1a0fc19e13f141800ac9ffb31b24dc,2022-02-06 21:17:15,C,0.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\ndouble fact(int n){\n\tint i;\n\tdouble k=1;\n\tfor(i=0;i\nlong long fact(int n){\n\tint i;\n\tlong long k=1;\n\tfor(i=0;i\nlong double doit(int n);\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n long double p=doit(n)-1;\n \n printf(\""%.0Lf\"",p);\n}\nlong double doit(int n)\n{\n if(n==0)return 1;\n return 2*doit(n-1);\n}\n\n",PARTIAL_ACCEPTED,14,324 1492094409155354624,2af84ac536038c923fc33448e5a467d6b87957414ac070e1946d1dc6f907891c,2022-02-11 19:13:23,C++,0.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",WRONG_ANSWER,14,456 1492105314903314432,2af84ac536038c923fc33448e5a467d6b87957414ac070e1946d1dc6f907891c,2022-02-11 19:56:43,C++,15.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\nlong long hano(int x)\n{\n if(x==0)return 0;\n if(x==1)return 2;\n return (long long )2*hano(x-1)-1;\n}\nint main()\n{\n int a[3001]={1,0};\n int n;\n scanf(\""%d\"",&n);\n int wei=1;\n for(int i=1;i<=n;i++)\n {\n for(int j=0;j<=3000;j++)\n {\n a[j]=a[j]*2;\n }\n for(int j=0;j<=3000;j++)\n {\n if(a[j]>=10)\n {\n a[j+1]=a[j+1]+(a[j]-a[j]%10)/10;\n a[j]=a[j]%10;\n wei=j+1;\n }\n }\n }\n \n int flag=1;\n a[0]--;\n for(int i=wei;i>=0;i--)\n {\n if(a[i]==0&&flag==1)continue;\n if(a[i]!=0)flag=0;\n printf(\""%d\"",a[i]);\n }\n \n \n return 0;\n}\n",PARTIAL_ACCEPTED,47,372 1492105577899040768,2af84ac536038c923fc33448e5a467d6b87957414ac070e1946d1dc6f907891c,2022-02-11 19:57:46,C++,15.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\nint main()\n{\n int a[3001]={1,0};\n int n;\n scanf(\""%d\"",&n);\n int wei=1;\n for(int i=1;i<=n;i++)\n {\n for(int j=0;j<=3000;j++)\n {\n a[j]=a[j]*2;\n }\n for(int j=0;j<=3000;j++)\n {\n if(a[j]>=10)\n {\n a[j+1]=a[j+1]+(a[j]-a[j]%10)/10;\n a[j]=a[j]%10;\n wei=j+1;\n }\n }\n }\n \n a[0]--;\n for(int i=wei;i>=0;i--)\n {\n printf(\""%d\"",a[i]);\n }\n \n \n return 0;\n}\n",PARTIAL_ACCEPTED,55,336 1492105796404723712,2af84ac536038c923fc33448e5a467d6b87957414ac070e1946d1dc6f907891c,2022-02-11 19:58:38,C++,15.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\nint main()\n{\n int a[3001]={1,0};\n int n;\n scanf(\""%d\"",&n);\n int wei=0;\n for(int i=1;i<=n;i++)\n {\n for(int j=0;j<=3000;j++)\n {\n a[j]=a[j]*2;\n }\n for(int j=0;j<=3000;j++)\n {\n if(a[j]>=10)\n {\n a[j+1]=a[j+1]+(a[j]-a[j]%10)/10;\n a[j]=a[j]%10;\n wei=j+1;\n }\n }\n }\n \n a[0]--;\n for(int i=wei;i>=0;i--)\n {\n printf(\""%d\"",a[i]);\n }\n \n \n return 0;\n}\n\n",PARTIAL_ACCEPTED,55,324 1492106338141806592,2af84ac536038c923fc33448e5a467d6b87957414ac070e1946d1dc6f907891c,2022-02-11 20:00:47,C++,15.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\nconst int PPP=5000;\nint main()\n{\n int a[PPP]={1,0};\n int n;\n scanf(\""%d\"",&n);\n int wei=0;\n for(int i=1;i<=n;i++)\n {\n for(int j=0;j=10)\n {\n a[j+1]=a[j+1]+(a[j]-a[j]%10)/10;\n a[j]=a[j]%10;\n wei=j+1;\n }\n }\n }\n \n a[0]--;\n for(int i=wei;i>=0;i--)\n {\n printf(\""%d\"",a[i]);\n }\n \n \n return 0;\n}\n\n",PARTIAL_ACCEPTED,63,196 1492106769395171328,2af84ac536038c923fc33448e5a467d6b87957414ac070e1946d1dc6f907891c,2022-02-11 20:02:30,C++,15.0,1480465199618179074,1313471683597295616,1039132196031492096,"#include\nconst int PPP=10000;\nint main()\n{\n int a[PPP]={1,0};\n int n;\n scanf(\""%d\"",&n);\n int wei=0;\n for(int i=1;i<=n;i++)\n {\n for(int j=0;j=10)\n {\n a[j+1]=a[j+1]+(a[j]-a[j]%10)/10;\n a[j]=a[j]%10;\n wei=j+1;\n }\n }\n }\n \n a[0]--;\n for(int i=wei;i>=0;i--)\n {\n printf(\""%d\"",a[i]);\n }\n \n \n return 0;\n}\n\n",PARTIAL_ACCEPTED,91,328 1480815710954708992,67734b37819aa16c765aec7ba8a96a04cbbd165f57c2fb0089c3fbfd6f19bcd6,2022-01-11 16:15:52,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint fan(int n) {\n\tif (n >1)\n\t\treturn (2 * fan(n - 1) + 1);\n\telse\n\t\treturn 1;\n}\nint main() {\n\tint n, m;\n\tscanf(\""%d\"", &n);\n\tprintf(\""%d\"", fan(n));\n\n\treturn 0;\n}\n",WRONG_ANSWER,10,328 1480818676080173056,67734b37819aa16c765aec7ba8a96a04cbbd165f57c2fb0089c3fbfd6f19bcd6,2022-01-11 16:27:39,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint fan(int n) {\n\tint i,m=1;\n\tfor (i=0;i\nint hnt(int N)\n{\n static int i=0;\n i++;\n if(N==1)\n return i;\n hnt(N-1);\n hnt(N-1);\n return i;\n}\nint main()\n{\n int n,t;\n scanf(\""%d\"",&n);\n t=hnt(n);\n printf(\""%d\"",t);\n return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1481964771128762368,3a36b6f9d2d20b11d254ac4c001e57489a8db9bbf33ef7dc58aa65f2d7cb1c91,2022-01-14 20:21:49,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\nint hnt(int N)\n{\n static int i=0;\n i++;\n if(N==1)\n return i;\n hnt(N-1);\n hnt(N-1);\n return i;\n}\nint main()\n{\n int n,t;\n scanf(\""%d\"",&n);\n t=hnt(n);\n printf(\""%lld\"",t);\n return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0 1481980081484722176,3a36b6f9d2d20b11d254ac4c001e57489a8db9bbf33ef7dc58aa65f2d7cb1c91,2022-01-14 21:22:39,C,20.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\n#include\nint main()\n{\n\tint i,j,n,temp,d=1,carry,k;\n\tint a[3000];\n\tscanf(\""%d\"",&n);\n\ta[0]=1;\n\tfor(k=1;k<=n;k++)\n\t{\n\t\tfor(j=1,carry=0;j<=d;j++)\n\t\t{\n\t\t\ttemp=a[j-1]*2+carry;\n\t\t\ta[j-1]=temp%10;\n\t\t\tcarry=temp/10;\n\t\t}\n\t\twhile(carry)\n\t\t{\n\n\t\t ++d;\n\t a[d-1]=carry%10;\n\t\t\tcarry=carry/10;\n\t\t}\n }\n\tfor(j=d-1;j>0;j--)\n\tprintf(\""%d\"",a[j]);\n\tprintf(\""%d\"",a[j]-1);\n }\n",ACCEPTED,20,472 1481981257865359360,3a36b6f9d2d20b11d254ac4c001e57489a8db9bbf33ef7dc58aa65f2d7cb1c91,2022-01-14 21:27:20,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\n#include\nint main()\n{\n\tint i,j,n,temp,d=1,carry,k;\n\tint a[3000];\n\tscanf(\""%d\"",&n);\n\ta[0]=1;\n\tfor(k=1;k<=n;k++)\n\t{\n\t\tfor(j=1,carry=0;j<=d;j++)\n\t\t{\n\t\t\ttemp=a[j-1]*2+carry;\n\t\t\ta[j-1]=temp%10;\n\t\t\tcarry=temp/10;\n\t\t}\n\t\twhile(carry)\n\t\t{\n\t\t ++d;\n\t a[d-1]=carry%10;\n\t\t}\n }\n\tfor(j=d-1;j>0;j--)\n\tprintf(\""%d\"",a[j]);\n\tprintf(\""%d\"",a[j]-1);\n }\n",SEGMENTATION_FAULT,10,448 1481983894748786688,3a36b6f9d2d20b11d254ac4c001e57489a8db9bbf33ef7dc58aa65f2d7cb1c91,2022-01-14 21:37:49,C,20.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\n#include\nint main()\n{\n\tint i,j,n,temp,d=1,carry,k;\n\tint a[3000];\n\tscanf(\""%d\"",&n);\n\ta[0]=1;\n\tfor(k=1;k<=n;k++)\n\t{\n\t\tfor(j=1,carry=0;j<=d;j++)\n\t\t{\n\t\t\ttemp=a[j-1]*2+carry;\n\t\t\ta[j-1]=temp%10;\n\t\t\tcarry=temp/10;\n\t\t}\n\t\tif(carry)\n {\n ++d;\n\t a[d-1]=carry%10;\n }\n }\n\tfor(j=d-1;j>0;j--)\n\tprintf(\""%d\"",a[j]);\n\tprintf(\""%d\"",a[j]-1);\n\tprintf(\""\\n\"");\n }\n",ACCEPTED,18,364 1482160947832475648,1486049e7b388bd518cd44f25f9cb17f97f2a84ea043927314025b778fc61c19,2022-01-15 09:21:21,C,17.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\nint main()\n{\n char str[1000];\n str[0]='1';\n int i,j,k=1,l,n,m,x;\n scanf(\""%d\"",&n);\n for(i=0;i=0;j--)\n {\n l=(str[j]-'0')*2;\n str[j]=l%10+m+'0';\n m=l/10;\n }\n if(m>0)\n {\n for(x=k;x>0;x--)\n str[x]=str[x-1];\n str[0]=m+'0';\n k++;\n }\n }\n str[k]='\\0';\n str[k-1]-=1;\n printf(\""%s\"",str);\n return 0;\n}",PARTIAL_ACCEPTED,17,320 1482161018829660160,1486049e7b388bd518cd44f25f9cb17f97f2a84ea043927314025b778fc61c19,2022-01-15 09:21:38,C,20.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\nint main()\n{\n char str[100000];\n str[0]='1';\n int i,j,k=1,l,n,m,x;\n scanf(\""%d\"",&n);\n for(i=0;i=0;j--)\n {\n l=(str[j]-'0')*2;\n str[j]=l%10+m+'0';\n m=l/10;\n }\n if(m>0)\n {\n for(x=k;x>0;x--)\n str[x]=str[x-1];\n str[0]=m+'0';\n k++;\n }\n }\n str[k]='\\0';\n str[k-1]-=1;\n printf(\""%s\"",str);\n return 0;\n}",ACCEPTED,15,316 1482265687216218112,3c7f6d23f45f236d0b8cfcee769f8683de970024f4aba627d38eab67eb0bbed1,2022-01-15 16:17:33,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nlong int count(int n)\n{\n if(n==1)\n return 1;\n\n return count(--n)*2+1;\n}\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n printf(\""%ld\"",count(n));\n return 0;\n}\n",PARTIAL_ACCEPTED,13,308 1482265872897921024,3c7f6d23f45f236d0b8cfcee769f8683de970024f4aba627d38eab67eb0bbed1,2022-01-15 16:18:17,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nlong long int count(int n)\n{\n if(n==1)\n return 1;\n\n return count(--n)*2+1;\n}\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n printf(\""%lld\"",count(n));\n return 0;\n}\n",PARTIAL_ACCEPTED,10,472 1482266156910956544,3c7f6d23f45f236d0b8cfcee769f8683de970024f4aba627d38eab67eb0bbed1,2022-01-15 16:19:25,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nunsigned long long int count(int n)\n{\n if(n==1)\n return 1;\n\n return count(--n)*2+1;\n}\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n printf(\""%llu\"",count(n));\n return 0;\n}\n",PARTIAL_ACCEPTED,10,320 1482585959119052800,8d9a44c195b7a9805d4f0dc814da699e740626905f57ea641f0118dac5aa407a,2022-01-16 13:30:12,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"//先不用递归试试\n#include\n#include\nint main()\n{\n int n;\n scanf(\""%d\"", &n);\n printf(\""%d\"", (pow(2,n)-1));\n return 0;\n}",WRONG_ANSWER,10,340 1483085446430031872,8d9a44c195b7a9805d4f0dc814da699e740626905f57ea641f0118dac5aa407a,2022-01-17 22:34:59,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\n#include\nint main()\n{\n int n;\n unsigned long long int p;\n scanf(\""%d\"", &n);\n p=pow(2,n)-1;\n printf(\""%llu\"", p);\n return 0;\n}\n",WRONG_ANSWER,11,440 1483708294022529024,af9f4d176d9889b661ff7459bd2ead781d2b44e04c9f55f1e3da780f27fde467,2022-01-19 15:49:57,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nlong long int step = 0;\nvoid hanoi(int n,char A,char B,char C){\n\tif(n == 1)step++;\n\telse {\n\t\thanoi(n-1,A,C,B);\n\t\tstep++;\n\t\thanoi(n-1,B,A,C);\n\t}\n}\nint main(){\n\tint n;\n\tchar A,B,C;\n\tscanf(\""%d\"",&n);\n\thanoi(n,A,B,C);\n\tprintf(\""%lld\"",step);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0 1484325235548962816,af9f4d176d9889b661ff7459bd2ead781d2b44e04c9f55f1e3da780f27fde467,2022-01-21 08:41:28,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"//2的n次方-1\n#include \nint main(){\n\tchar a[1000];\n\tint flag=0,n,i,j,k,len,t,p,q;\n\tscanf(\""%d\"",&n);\n\tn=n-1;\n\ta[0]='2';\n\tlen=1; \n\tq=0;\n\tfor(i=1;i<1000;i++)a[i]='0';\n\tfor(i=0;i=10){\n\t\t\t\ta[j]=(p+q)%10+'0';\n\t\t\t\t\n\t\t\t}\n\t\t\ta[j]=p+q+'0';\n\t\t\tq=t*2/10;\n\t\t\tif(q!=0)len++;\t\n\t\t}\n\t}\n\tfor(i=999;i>=0;i--){\n\t\tif(a[i]!='0')flag=1;\n\t\tif(flag==1)printf(\""%c\"",a[i]);\n\t}\n\treturn 0;\n} ",MULTIPLE_ERROR,10,444 1484327846200705024,af9f4d176d9889b661ff7459bd2ead781d2b44e04c9f55f1e3da780f27fde467,2022-01-21 08:51:50,C,15.0,1480788754650771457,1313471683597295616,1039132196031492096,"//2的n次方-1\n#include \nint main(){\n\tchar a[10000];\n\tint flag=0,n,i,j,k,len,t,p,q;\n\tscanf(\""%d\"",&n);\n\tn=n-1;\n\ta[0]='2';\n\tlen=1; \n\tq=0;\n\tfor(i=1;i<10000;i++)a[i]='0';\n\tfor(i=0;i=0;i--){\n\t\tif(a[i]!='0'){\n\t\t\tk=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(a[0]!='0')a[0]=(a[0]-'0')-1+'0';\n\tfor(i=k;i>=0;i--){\n\t\tprintf(\""%c\"",a[i]);\n\t}\n\treturn 0;\n} ",PARTIAL_ACCEPTED,18,448 1484328704234459136,af9f4d176d9889b661ff7459bd2ead781d2b44e04c9f55f1e3da780f27fde467,2022-01-21 08:55:15,C,17.0,1480788754650771457,1313471683597295616,1039132196031492096,"//2的n次方-1\n#include \nint main(){\n\tchar a[1000000];\n\tint flag=0,n,i,j,k,len,t,p,q;\n\tscanf(\""%d\"",&n);\n\tn=n-1;\n\ta[0]='2';\n\tlen=1; \n\tq=0;\n\tfor(i=1;i<1000000;i++)a[i]='0';\n\tfor(i=0;i=0;i--){\n\t\tif(a[i]!='0'){\n\t\t\tk=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(a[0]!='0')a[0]=(a[0]-'0')-1+'0';\n\tfor(i=k;i>=0;i--){\n\t\tprintf(\""%c\"",a[i]);\n\t}\n\treturn 0;\n} ",PARTIAL_ACCEPTED,90,1340 1484328794486702080,af9f4d176d9889b661ff7459bd2ead781d2b44e04c9f55f1e3da780f27fde467,2022-01-21 08:55:36,C,17.0,1480788754650771457,1313471683597295616,1039132196031492096,"//2的n次方-1\n#include \nint main(){\n\tchar a[100000];\n\tint flag=0,n,i,j,k,len,t,p,q;\n\tscanf(\""%d\"",&n);\n\tn=n-1;\n\ta[0]='2';\n\tlen=1; \n\tq=0;\n\tfor(i=1;i<100000;i++)a[i]='0';\n\tfor(i=0;i=0;i--){\n\t\tif(a[i]!='0'){\n\t\t\tk=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(a[0]!='0')a[0]=(a[0]-'0')-1+'0';\n\tfor(i=k;i>=0;i--){\n\t\tprintf(\""%c\"",a[i]);\n\t}\n\treturn 0;\n} ",PARTIAL_ACCEPTED,209,436 1484328890230587392,af9f4d176d9889b661ff7459bd2ead781d2b44e04c9f55f1e3da780f27fde467,2022-01-21 08:55:59,C,17.0,1480788754650771457,1313471683597295616,1039132196031492096,"//2的n次方-1\n#include \nint main(){\n\tchar a[300000];\n\tint flag=0,n,i,j,k,len,t,p,q;\n\tscanf(\""%d\"",&n);\n\tn=n-1;\n\ta[0]='2';\n\tlen=1; \n\tq=0;\n\tfor(i=1;i<300000;i++)a[i]='0';\n\tfor(i=0;i=0;i--){\n\t\tif(a[i]!='0'){\n\t\t\tk=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(a[0]!='0')a[0]=(a[0]-'0')-1+'0';\n\tfor(i=k;i>=0;i--){\n\t\tprintf(\""%c\"",a[i]);\n\t}\n\treturn 0;\n} ",PARTIAL_ACCEPTED,84,580 1484328949659942912,af9f4d176d9889b661ff7459bd2ead781d2b44e04c9f55f1e3da780f27fde467,2022-01-21 08:56:13,C,17.0,1480788754650771457,1313471683597295616,1039132196031492096,"//2的n次方-1\n#include \nint main(){\n\tchar a[200000];\n\tint flag=0,n,i,j,k,len,t,p,q;\n\tscanf(\""%d\"",&n);\n\tn=n-1;\n\ta[0]='2';\n\tlen=1; \n\tq=0;\n\tfor(i=1;i<200000;i++)a[i]='0';\n\tfor(i=0;i=0;i--){\n\t\tif(a[i]!='0'){\n\t\t\tk=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(a[0]!='0')a[0]=(a[0]-'0')-1+'0';\n\tfor(i=k;i>=0;i--){\n\t\tprintf(\""%c\"",a[i]);\n\t}\n\treturn 0;\n} ",PARTIAL_ACCEPTED,87,568 1484329071575007232,af9f4d176d9889b661ff7459bd2ead781d2b44e04c9f55f1e3da780f27fde467,2022-01-21 08:56:42,C,17.0,1480788754650771457,1313471683597295616,1039132196031492096,"//2的n次方-1\n#include \nint main(){\n\tchar a[150000];\n\tint flag=0,n,i,j,k,len,t,p,q;\n\tscanf(\""%d\"",&n);\n\tn=n-1;\n\ta[0]='2';\n\tlen=1; \n\tq=0;\n\tfor(i=1;i<150000;i++)a[i]='0';\n\tfor(i=0;i=0;i--){\n\t\tif(a[i]!='0'){\n\t\t\tk=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(a[0]!='0')a[0]=(a[0]-'0')-1+'0';\n\tfor(i=k;i>=0;i--){\n\t\tprintf(\""%c\"",a[i]);\n\t}\n\treturn 0;\n} ",PARTIAL_ACCEPTED,84,452 1484329139401867264,af9f4d176d9889b661ff7459bd2ead781d2b44e04c9f55f1e3da780f27fde467,2022-01-21 08:56:58,C,17.0,1480788754650771457,1313471683597295616,1039132196031492096,"//2的n次方-1\n#include \nint main(){\n\tchar a[120000];\n\tint flag=0,n,i,j,k,len,t,p,q;\n\tscanf(\""%d\"",&n);\n\tn=n-1;\n\ta[0]='2';\n\tlen=1; \n\tq=0;\n\tfor(i=1;i<120000;i++)a[i]='0';\n\tfor(i=0;i=0;i--){\n\t\tif(a[i]!='0'){\n\t\t\tk=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(a[0]!='0')a[0]=(a[0]-'0')-1+'0';\n\tfor(i=k;i>=0;i--){\n\t\tprintf(\""%c\"",a[i]);\n\t}\n\treturn 0;\n} ",PARTIAL_ACCEPTED,239,588 1486517697918353408,46cdd72576ae360de5ab1c884b8e3714d7158eeb5a3c749cf04d97b25b68ba69,2022-01-27 09:53:32,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint fun(int x);\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n printf(\""%d\"",fun(n));\n return 0;\n}\nint fun(int x)\n{\n int z;\n if(x==1) return 1;\n else\n z=2*fun(x-1)+1;\n return z;\n}\n",WRONG_ANSWER,10,328 1489523384806096896,05b4865302d0be4dd801011e67edef2d49f25de57a2f708632d4a0920bdf40b2,2022-02-04 16:57:03,C,15.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint main(){\n int n,x,i,c;\n char a[100]={1,0};\n scanf(\""%d\"",&n);\n if(n==1){\n printf(\""%d\"",1);\n return 0;\n }\n for(x=1;x9){\n a[i]=a[i]%10;\n c=1;\n }else\n c=0;\n }\n for(i=0,c=1;i<100;i++){\n a[i]=a[i]+c;\n if(a[i]>9){\n a[i]=0;\n c=1;\n }else\n break;\n }\n }\n for(i=99,c=0;i>=0;i--)\n if(a[i]==0 && c==0)\n continue;\n else{\n printf(\""%d\"",a[i]);\n c=1;\n }\n return 0;\n}\n",PARTIAL_ACCEPTED,13,320 1489524719861944320,05b4865302d0be4dd801011e67edef2d49f25de57a2f708632d4a0920bdf40b2,2022-02-04 17:02:21,C,20.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint main(){\n int n,x,i,c;\n char a[1520]={1,0};\n scanf(\""%d\"",&n);\n if(n==1){\n printf(\""%d\"",1);\n return 0;\n }\n for(x=1;x9){\n a[i]=a[i]%10;\n c=1;\n }else\n c=0;\n }\n for(i=0,c=1;i<1520;i++){\n a[i]=a[i]+c;\n if(a[i]>9){\n a[i]=0;\n c=1;\n }else\n break;\n }\n }\n for(i=1519,c=0;i>=0;i--)\n if(a[i]==0 && c==0)\n continue;\n else{\n printf(\""%d\"",a[i]);\n c=1;\n }\n return 0;\n}\n",ACCEPTED,29,344 1489526623203545088,05b4865302d0be4dd801011e67edef2d49f25de57a2f708632d4a0920bdf40b2,2022-02-04 17:09:55,C,20.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint main(){\n int n,x,i,c;\n char a[1520]={1,0};\n scanf(\""%d\"",&n);\n// if(n==1){\n// printf(\""%d\"",1);\n// return 0;\n// }\n for(x=1;x9){\n a[i]=a[i]%10;\n c=1;\n }else\n c=0;\n }\n for(i=0,c=1;i<1520;i++){\n a[i]=a[i]+c;\n if(a[i]>9){\n a[i]=0;\n c=1;\n }else\n break;\n }\n }\n for(i=1519,c=0;i>=0;i--)\n if(a[i]==0 && c==0)\n continue;\n else{\n printf(\""%d\"",a[i]);\n c=1;\n }\n return 0;\n}\n",ACCEPTED,33,320 1489526779487789056,05b4865302d0be4dd801011e67edef2d49f25de57a2f708632d4a0920bdf40b2,2022-02-04 17:10:32,C,20.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint main(){\n int n,x,i,c;\n char a[1520]={1,0};\n scanf(\""%d\"",&n);\n for(x=1;x9){\n a[i]=a[i]%10;\n c=1;\n }else\n c=0;\n }\n for(i=0,c=1;i<1520;i++){\n a[i]=a[i]+c;\n if(a[i]>9){\n a[i]=0;\n c=1;\n }else\n break;\n }\n }\n for(i=1519,c=0;i>=0;i--)\n if(a[i]==0 && c==0)\n continue;\n else{\n printf(\""%d\"",a[i]);\n c=1;\n }\n return 0;\n}\n",ACCEPTED,29,344 1491607978812952576,c91bffd2913f67ec68e471ca5cc1a6d6e4359b6c327f73631f97e235c7e7470f,2022-02-10 11:00:29,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \n#include \nint main() {\n\tlong long a;\n\tint i, n, step = 0;\n\tscanf_s(\""%d\"", &n);\n\tfor (i = 0;i <= n;i++) {\n\t\tstep += pow(2, i - 1);\n\t}\n\tprintf(\""%d\"", step);\n\treturn 0;\n}\n",COMPILE_ERROR,0,0 1491608003475742720,c91bffd2913f67ec68e471ca5cc1a6d6e4359b6c327f73631f97e235c7e7470f,2022-02-10 11:00:35,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \n#include \nint main() {\n\tlong long a;\n\tint i, n, step = 0;\n\tscanf(\""%d\"", &n);\n\tfor (i = 0;i <= n;i++) {\n\t\tstep += pow(2, i - 1);\n\t}\n\tprintf(\""%d\"", step);\n\treturn 0;\n}\n",WRONG_ANSWER,10,324 1491608102410985472,c91bffd2913f67ec68e471ca5cc1a6d6e4359b6c327f73631f97e235c7e7470f,2022-02-10 11:00:59,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \n#include \nint main() {\n\tlong long step = 0;\n\tint i, n;\n\tscanf_s(\""%d\"", &n);\n\tfor (i = 0;i <= n;i++) {\n\t\tstep += pow(2, i - 1);\n\t}\n\tprintf(\""%d\"", step);\n\treturn 0;\n}",COMPILE_ERROR,0,0 1491608127581003776,c91bffd2913f67ec68e471ca5cc1a6d6e4359b6c327f73631f97e235c7e7470f,2022-02-10 11:01:05,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \n#include \nint main() {\n\tlong long step = 0;\n\tint i, n;\n\tscanf(\""%d\"", &n);\n\tfor (i = 0;i <= n;i++) {\n\t\tstep += pow(2, i - 1);\n\t}\n\tprintf(\""%d\"", step);\n\treturn 0;\n}",WRONG_ANSWER,10,312 1491608780294115328,c91bffd2913f67ec68e471ca5cc1a6d6e4359b6c327f73631f97e235c7e7470f,2022-02-10 11:03:40,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \n#include \nint main() {\n\tlong long step = 0;\n\tint i, n;\n\tscanf(\""%d\"", &n);\n\tfor (i = 0;i <= n;i++) {\n\t\tstep += pow(2, i - 1);\n\t}\n\tprintf(\""%lld\"", step);\n\treturn 0;\n}",WRONG_ANSWER,11,356 1494513562868072448,c91bffd2913f67ec68e471ca5cc1a6d6e4359b6c327f73631f97e235c7e7470f,2022-02-18 11:26:14,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \n#include \nint main() {\n\tlong long step = 0;\n\tint i, n;\n\tscanf(\""%d\"", &n);\n\tfor (i = 0;i <= n;i++) {\n\t\tstep += pow(2, i - 1);\n\t}\n\tprintf(\""%lld\"", step);\n\treturn 0;\n}",WRONG_ANSWER,11,328 1494515625073909760,c91bffd2913f67ec68e471ca5cc1a6d6e4359b6c327f73631f97e235c7e7470f,2022-02-18 11:34:26,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \n#include \nint main() {\n\tlong long step = 0;\n\tint i, n;\n\tscanf(\""%d\"", &n);\n\tfor (i = 0;i <= n;i++) {\n\t\tstep += pow(2, i - 1);\n\t}\n\tprintf(\""%lld\"", step);\n\treturn 0;\n}",WRONG_ANSWER,10,324 1494546715645628416,f7d7caa73d948ff5785fc5b6b5f3f9a931e9e84531b1ae509929936cb04c2a28,2022-02-18 13:37:59,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint main(){\n int m,n=0,i;\n scanf(\""%d\"",&m);\n for(i=1;i<=m;i++){\n n=2*n+1;\n }\n printf(\""%d\"",n);\n return 0;\n}\n",WRONG_ANSWER,10,332 1494546921313607680,f7d7caa73d948ff5785fc5b6b5f3f9a931e9e84531b1ae509929936cb04c2a28,2022-02-18 13:38:48,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint main(){\n int m,n=0,i;\n scanf(\""%d\"",&m);\n for(i=1;i<=m;i++){\n n=2*n+1;\n }\n printf(\""%d\"",n);\n return 0;\n}\n",WRONG_ANSWER,10,324 1497860991118364672,2a28f75b539bfccdf3c18a7f155aa0e500d8b942c3a806ea7f2c39dc4d9f83aa,2022-02-27 17:07:43,C,17.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\nint a[100];\nint main()\n{\n int flag,i,n,j,k=1;\n a[1]=1;\n scanf(\""%d\"",&n);\n for(i=1;i<=n;i++){\n flag=0;\n for(j=1;j<=k;j++){\n a[j]=a[j]*2+flag;\n flag=a[j]/10;\n a[j]=a[j]%10;\n if(flag!=0&&j==k){\n k++;}\n }\n }\n a[1]-=1;\n for(i=k;i>0;i--){\n printf(\""%d\"",a[i]);\n }\n return 0;\n}\n",PARTIAL_ACCEPTED,26,320 1497861199559806976,2a28f75b539bfccdf3c18a7f155aa0e500d8b942c3a806ea7f2c39dc4d9f83aa,2022-02-27 17:08:33,C,20.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\nint a[10000];\nint main()\n{\n int flag,i,n,j,k=1;\n a[1]=1;\n scanf(\""%d\"",&n);\n for(i=1;i<=n;i++){\n flag=0;\n for(j=1;j<=k;j++){\n a[j]=a[j]*2+flag;\n flag=a[j]/10;\n a[j]=a[j]%10;\n if(flag!=0&&j==k){\n k++;}\n }\n }\n a[1]-=1;\n for(i=k;i>0;i--){\n printf(\""%d\"",a[i]);\n }\n return 0;\n}\n",ACCEPTED,35,360 1505737804344897536,a6f218c45c5bbeba3c2fb2e91ecb107b8e05ab76333b42d6a6a44b415362e17a,2022-03-21 10:47:22,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"\n#include \nint sum;\nvoid f(n, x, y, z) //汉诺塔函数\n{\n if (n == 1)\n {\n sum++;\n\n }\n else\n {\n f(n - 1, x, z, y);\n sum++;\n f(n - 1, y, x, z);\n }\n}\nint main()\n{\n int m;\n scanf(\""%d\"", &m);\n f(m, 'A', 'B', 'C');\n printf(\""%d\"",sum);\n}\n",TIME_LIMIT_EXCEEDED,1000,456 1510582507410120704,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 19:38:29,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint f(int m)\n{\n if(m==1)\n return 1;\n else\n if(m==2)\n return 3;\n else\n return (f(m-1)+1)+(f(m-2)+1)+1;\n}\nint main()\n{\n int n,t;\n scanf(\""%d\"",&n);\n t=f(n);\n printf(\""%d\"",t);\n return 0;\n}",TIME_LIMIT_EXCEEDED,1000,452 1510583429385248768,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 19:42:09,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint f(int m)\n{\n if(m==1)\n return 1;\n else\n if(m==2)\n return 3;\n else\n return (f(m-1)+1)+(f(m-2)+1)+1;\n}\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n printf(\""%d\"",f(n));\n return 0;\n}",TIME_LIMIT_EXCEEDED,1000,476 1510584423166861312,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 19:46:06,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint f(int m)\n{\n if(m==1||m==2)\n return 2*m-1;\n else\n return (f(m-1)+1)+(f(m-2)+1)+1;\n}\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n printf(\""%d\"",f(n));\n return 0;\n}",TIME_LIMIT_EXCEEDED,1000,456 1510586593806532608,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 19:54:43,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint f(int m)\n{\n if(m==1||m==2)\n return 2*m-1;\n else\n return f(m-1)+f(m-2)+3;\n}\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n printf(\""%d\"",f(n));\n return 0;\n}",TIME_LIMIT_EXCEEDED,1000,572 1510589450187005952,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 20:06:04,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint f(int m)\n{\n if(m==1||m==2)\n return 2*m-1;\n else\n return (f(m-1)+1)+(f(m-2)+1)+1;\n}\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n printf(\""%d\"",f(n));\n return 0;\n}",TIME_LIMIT_EXCEEDED,1000,444 1510590084692926464,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 20:08:36,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint f(int m)\n{\n f(1)=1;\n f(2)=3;\n return f(m-1)+f(m-2)+3;\n}\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n printf(\""%d\"",f(n));\n return 0;\n}",COMPILE_ERROR,0,0 1510595343221874688,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 20:29:29,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint f(int m)\n{\n if(m==1)\n return 1;\n else\n return 2*f(m-1)+1;\n}\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n printf(\""%d\"",f(n));\n return 0;\n}",WRONG_ANSWER,15,324 1510595642446442496,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 20:30:41,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint f(int m)\n{\n if(m==1)\n return 1;\n else\n return 2*f(m-1)+1;\n}\nint main()\n{\n int n,t;\n scanf(\""%d\"",&n);\n t=f(n);\n printf(\""%d\"",t);\n return 0;\n}",WRONG_ANSWER,16,384 1510595865786015744,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 20:31:34,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint f(int m)\n{\n if(m>=2)\n return 2*f(m-1)+1;\n else\n return 1;\n}\nint main()\n{\n int n,t;\n scanf(\""%d\"",&n);\n t=f(n);\n printf(\""%d\"",t);\n return 0;\n}",WRONG_ANSWER,15,476 1510596111851974656,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 20:32:33,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nlong int f(int m)\n{\n if(m>=2)\n return 2*f(m-1)+1;\n else\n return 1;\n}\nint main()\n{\n int n,t;\n scanf(\""%d\"",&n);\n t=f(n);\n printf(\""%d\"",t);\n return 0;\n}",WRONG_ANSWER,18,352 1510600955019542528,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 20:51:47,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nlong int f(int m)\n{\n if(m>=2)\n return 2*f(m-1)+1;\n else\n return 1;\n}\nint main()\n{\n int n,t;\n scanf(\""%d\"",&n);\n t=f(n);\n printf(\""%ld\"",t);\n return 0;\n}",PARTIAL_ACCEPTED,16,512 1510603030538051584,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:00:02,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nlong int f(int m)\n{\n if(m>=2)\n return 2*f(m-1)+1;\n else\n return 1;\n}\nint main()\n{\n long int n,t;\n scanf(\""%d\"",&n);\n t=f(n);\n printf(\""%ld\"",t);\n return 0;\n}",PARTIAL_ACCEPTED,17,444 1510603487682904064,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:01:51,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nlong long int f(int m)\n{\n if(m>=2)\n return 2*f(m-1)+1;\n else\n return 1;\n}\nint main()\n{\n long long int n,t;\n scanf(\""%d\"",&n);\n t=f(n);\n printf(\""%lld\"",t);\n return 0;\n}",PARTIAL_ACCEPTED,17,476 1510603862393634816,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:03:21,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nunsigned long int f(int m)\n{\n if(m>=2)\n return 2*f(m-1)+1;\n else\n return 1;\n}\nint main()\n{\n unsigned long int n,t;\n scanf(\""%d\"",&n);\n t=f(n);\n printf(\""%lu\"",t);\n return 0;\n}",PARTIAL_ACCEPTED,16,324 1510604396458012672,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:05:28,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nunsigned char f(int m)\n{\n if(m>=2)\n return 2*f(m-1)+1;\n else\n return 1;\n}\nint main()\n{\n unsigned char int n,t;\n scanf(\""%d\"",&n);\n t=f(n);\n printf(\""%ld\"",t);\n return 0;\n}",COMPILE_ERROR,0,0 1510604487609171968,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:05:50,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nunsigned char f(int m)\n{\n if(m>=2)\n return 2*f(m-1)+1;\n else\n return 1;\n}\nint main()\n{\n unsigned char int n,t;\n scanf(\""%s\"",&n);\n t=f(n);\n printf(\""%ld\"",t);\n return 0;\n}",COMPILE_ERROR,0,0 1510605848959344640,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:11:14,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nlong long f(int m)\n{\n if(m>=2)\n return 2*f(m-1)+1;\n else\n return 1;\n}\nint main()\n{\n int n;\n scanf(\""%s\"",&n);\n printf(\""%ld\"",f(n));\n return 0;\n}",MULTIPLE_ERROR,414,320 1510605922886873088,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:11:32,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nlong int f(int m)\n{\n if(m>=2)\n return 2*f(m-1)+1;\n else\n return 1;\n}\nint main()\n{\n int n;\n scanf(\""%s\"",&n);\n printf(\""%ld\"",f(n));\n return 0;\n}",MULTIPLE_ERROR,411,468 1510606244351459328,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:12:49,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nlong int f(int m)\n{\n if(m>=2)\n return 2*f(m-1)+1;\n else\n return 1;\n}\nint main()\n{\n int n,t;\n scanf(\""%s\"",&n);\n t=f(n);\n printf(\""%ld\"",t);\n return 0;\n}",MULTIPLE_ERROR,412,488 1510606318845947904,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:13:06,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nlong int f(int m)\n{\n if(m>=2)\n return 2*f(m-1)+1;\n else\n return 1;\n}\nint main()\n{\n long int n,t;\n scanf(\""%d\"",&n);\n t=f(n);\n printf(\""%ld\"",t);\n return 0;\n}",PARTIAL_ACCEPTED,15,352 1510606522542321664,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:13:55,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nunsigned long int f(int m)\n{\n if(m>=2)\n return 2*f(m-1)+1;\n else\n return 1;\n}\nint main()\n{\n unsigned long int n,t;\n scanf(\""%d\"",&n);\n t=f(n);\n printf(\""%lu\"",t);\n return 0;\n}",PARTIAL_ACCEPTED,16,336 1510607169301078016,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:16:29,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nunsigned int f(int m)\n{\n if(m>=2)\n return 2*f(m-1)+1;\n else\n return 1;\n}\nint main()\n{\n unsigned int n,t;\n scanf(\""%u\"",&n);\n t=f(n);\n printf(\""%lu\"",t);\n return 0;\n}",WRONG_ANSWER,15,356 1510607281473544192,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:16:56,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nunsigned long int f(int m)\n{\n if(m>=2)\n return 2*f(m-1)+1;\n else\n return 1;\n}\nint main()\n{\n unsigned long int n,t;\n scanf(\""%lu\"",&n);\n t=f(n);\n printf(\""%lu\"",t);\n return 0;\n}",PARTIAL_ACCEPTED,17,476 1510609869252980736,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:27:13,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nint h(int m)\n{\n\tint s;\n\tif(m==1)\n\t\ts=1;\n\telse\n\t\ts=2*h(m-1)+1;\n\treturn s;\n}\nint main()\n{ \n\tint n;\n\tscanf(\""%d\"",&n);\n\tprintf(\""%ld\"",h(n));\n}",WRONG_ANSWER,15,348 1510612722537328640,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:38:33,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nlong int f(int m)\n{\n if(m==1)\n return 1;\n else\n return 2*f(m-1)+1;\n}\nint main()\n{\n long int n,t;\n scanf(\""%d\"",&n);\n t=f(n);\n printf(\""%ld\"",t);\n return 0;\n}",PARTIAL_ACCEPTED,16,324 1510612958421336064,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:39:29,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nunsigned long int f(int m)\n{\n if(m==1)\n return 1;\n else\n return 2*f(m-1)+1;\n}\nint main()\n{\n unsigned long int n,t;\n scanf(\""%lu\"",&n);\n t=f(n);\n printf(\""%lu\"",t);\n return 0;\n}",PARTIAL_ACCEPTED,14,328 1510613117716262912,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:40:07,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nunsigned long int f(int m)\n{\n if(m==1)\n return 1;\n else\n return 2*f(m-1)+1;\n}\nint main()\n{\n unsigned long int n,t;\n scanf(\""%lu\"",&n);\n t=f(n);\n printf(\""%lu\"",t);\n return 0;\n}",PARTIAL_ACCEPTED,16,348 1510613336328126464,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:40:59,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nunsigned long int f(int m)\n{\n if(m==1)\n return 1;\n else\n return 2*f(m-1)+1;\n}\nint main()\n{\n unsigned long int n,t;\n scanf(\""%lu\"",&n);\n t=f(n);\n printf(\""%lu\"",t);\n return 0;\n}",PARTIAL_ACCEPTED,17,320 1510613904412504064,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:43:15,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nunsigned long int f(int m)\n{\n if(m==1)\n return 1;\n else\n return 2*f(m-1)+1;\n}\nint main()\n{\n unsigned long int n,t;\n scanf(\""%lu\"",&n);\n t=f(n);\n printf(\""%lu\"",t);\n return 0;\n}",PARTIAL_ACCEPTED,15,480 1510615505002127360,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:49:36,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nunsigned long int f(int m)\n{\n if(m==1)\n return 1;\n else\n return 2*f(m-1)+1;\n}\nint main()\n{\n unsigned long int n,t;\n scanf(\""%lu\"",&n);\n t=f(n);\n printf(\""%lu\"",t);\n return 0;\n}",PARTIAL_ACCEPTED,16,328 1510617425896890368,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 21:57:14,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \ndouble f(int m)\n{\n if(m==1)\n return 1;\n else\n return 2*f(m-1)+1;\n}\nint main()\n{\n double n,t;\n scanf(\""%lf\"",&n);\n t=f(n);\n printf(\""%.0lf\"",t);\n return 0;\n}",WRONG_ANSWER,20,336 1510621593269264384,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 22:13:48,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \n#include \nint main()\n{\n int n;\n double t;\n scanf(\""%d\"",&n);\n t=pow(2,n)-1;\n printf(\""%.0lf\"",t);\n return 0;\n}",WRONG_ANSWER,18,484 1510634588719693824,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 23:05:26,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nunsigned long long f(int m)\n{\n if(m==1)\n return 1;\n else\n return 2*f(m-1)+1;\n}\nint main()\n{\n int n;\n unsigned long long t;\n scanf(\""%d\"",&n);\n t=f(n);\n printf(\""%llu\"",t);\n return 0;\n}",PARTIAL_ACCEPTED,12,212 1510636914050220032,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 23:14:41,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nunsigned long long f(int m)\n{\n if(m==1)\n return 1;\n else\n return 2*f(m-1)+1;\n}\nint main()\n{\n int n;\n unsigned char a[30];\n scanf(\""%d\"",&n);\n a=f(n);\n printf(\""%s\"",a);\n return 0;\n}",COMPILE_ERROR,0,0 1510648188939886592,2cf0a22e9b8d5ea3d03e4d84c726128f5f017164f56fd9cfde8d5184edaaf671,2022-04-03 23:59:29,C,3.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \nunsigned long int f(unsigned int m)\n{\n if(m==1)\n return 1;\n else\n return 2*f(m-1)+1;\n}\nint main()\n{\n unsigned int n;\n unsigned long int t;\n scanf(\""%u\"",&n);\n t=f(n);\n printf(\""%lu\"",t);\n return 0;\n}",PARTIAL_ACCEPTED,14,332 1522131615717822464,46cdd72576ae360de5ab1c884b8e3714d7158eeb5a3c749cf04d97b25b68ba69,2022-05-05 16:30:31,C,15.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \n#include \nint main()\n{\n char s[200]={'1'};\n int i,n,j,len=0,flag1,flag2;\n scanf(\""%d\"",&n);\n for(i=0;i=0;i--)\n printf(\""%c\"",s[i]);\n return 0;\n}",PARTIAL_ACCEPTED,28,344 1522131847243399168,46cdd72576ae360de5ab1c884b8e3714d7158eeb5a3c749cf04d97b25b68ba69,2022-05-05 16:31:26,C,17.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \n#include \nint main()\n{\n char s[500]={'1'};\n int i,n,j,len=0,flag1,flag2;\n scanf(\""%d\"",&n);\n for(i=0;i=0;i--)\n printf(\""%c\"",s[i]);\n return 0;\n}",PARTIAL_ACCEPTED,41,468 1522132125459972096,46cdd72576ae360de5ab1c884b8e3714d7158eeb5a3c749cf04d97b25b68ba69,2022-05-05 16:32:33,C,20.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \n#include \nint main()\n{\n char s[5000]={'1'};\n int i,n,j,len=0,flag1,flag2;\n scanf(\""%d\"",&n);\n for(i=0;i=0;i--)\n printf(\""%c\"",s[i]);\n return 0;\n}",ACCEPTED,35,356 1532155328635314176,02277d3e1d5823796ab10245a37a82a2612428d4939f9213ea0929837ed232df,2022-06-02 08:21:11,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\n int n,cou=0;\n \nvoid hanio(int n,char a,char b,char c)\n{\n\tcou++;\n\tif(n==1)\n\t{\n\t\n\t}\n\telse\n\t{\n\t\thanio(n-1,a,c,b);\n\t\thanio(n-1,b,a,c);\n\t}\n}\n \nint main()\n{\n \n\tscanf(\""%d\"",&n);\n\thanio(n,'A','B','C');\n\tprintf(\""%d\\n\"",cou);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,1000,436 1532165313364729856,2c7ad04f7f4ef78548f6ba30f32f4077f64ae364a4a3634b7e3b9aa322ff991c,2022-06-02 09:00:51,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\nint hannuo(int n,char a,char b,char c){\n\tint i=0;\n\ti++;\n\tif(n==0)\n\treturn i;\n\telse {\n\t\thannuo(n-1,a,c,b);\n\t\thannuo(n-1,b,a,c);\n\t}\n}\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint h=hannuo(n,'A','B','C');\n\tprintf(\""%d\"",h);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,1000,576 1532172717041082368,2c7ad04f7f4ef78548f6ba30f32f4077f64ae364a4a3634b7e3b9aa322ff991c,2022-06-02 09:30:16,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\n#include\nstruct node { \n\tchar start;\n\tchar mid;\n\tchar goal;\n\tint num;\n};\nstruct S {\n\tstruct node *data;\n\tint top;\n\tint maxsize;\n};\ntypedef struct S * Stack;\nvoid push(Stack S,int n,char a,char b,char c);\nstruct node pop(Stack S);\nint main() {\n\tint n;\n\tint coun=0;\n\tscanf(\""%d\"",&n);\n\tStack St;\n\tSt =(Stack)malloc(sizeof(struct S));\n\tSt->data =(struct node *)malloc(10000*sizeof(struct node));\n\tSt->top =-1;\n\tSt->maxsize =10000;\n\tstruct node m;\n\tpush(St,n,'a','b','c');\n\twhile(St->top>=0) { \n\t\tm =pop(St);\n\t\tif(m.num ==1) {\n\t\t\tcoun++;\n\t\t}\n\t\telse { \n\t\t\tpush(St, m.num -1, m.mid, m.start, m.goal);\n\t\t\tpush(St,1, m.start, m.mid, m.goal);\n\t\t\tpush(St, m.num -1, m.start, m.goal, m.mid);\n\t\t}\n\t}\n\tprintf(\""%d\"",coun);\n\treturn 0;\n}\nvoid push(Stack S,int n,char a,char b,char c) { \n\tS->top++;\n\tS->data[S->top].start = a;\n\tS->data[S->top].mid = b;\n\tS->data[S->top].goal = c;\n\tS->data[S->top].num=n;\n}\nstruct node pop(Stack S) { \n\treturn S->data[S->top--];\n}",TIME_LIMIT_EXCEEDED,1000,360 1532283666133639168,2c7ad04f7f4ef78548f6ba30f32f4077f64ae364a4a3634b7e3b9aa322ff991c,2022-06-02 16:51:09,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\n#include\nstruct node { \n\tchar start;\n\tchar mid;\n\tchar goal;\n\tint num;\n};\nstruct S {\n\tstruct node *data;\n\tint top;\n\tint maxsize;\n};\ntypedef struct S * Stack;\nvoid push(Stack S,int n,char a,char b,char c);\nstruct node pop(Stack S);\nint main() {\n\tint n;\n\tint coun=0;\n\tscanf(\""%d\"",&n);\n\tStack St;\n\tSt =(Stack)malloc(sizeof(struct S));\n\tSt->data =(struct node *)malloc(10000*sizeof(struct node));\n\tSt->top =-1;\n\tSt->maxsize =10000;\n\tstruct node m;\n\tpush(St,n,'a','b','c');\n\twhile(St->top>=0) { \n\t\tm =pop(St);\n\t\tif(m.num ==1) {\n\t\t\tcoun++;\n\t\t}\n\t\telse { \n\t\t\tpush(St, m.num -1, m.mid, m.start, m.goal);\n\t\t\tpush(St,1, m.start, m.mid, m.goal);\n\t\t\tpush(St, m.num -1, m.start, m.goal, m.mid);\n\t\t}\n\t}\n\tprintf(\""%d\"",coun);\n\treturn 0;\n}\nvoid push(Stack S,int n,char a,char b,char c) { \n\tS->top++;\n\tS->data[S->top].start = a;\n\tS->data[S->top].mid = b;\n\tS->data[S->top].goal = c;\n\tS->data[S->top].num=n;\n}\nstruct node pop(Stack S) { \n\treturn S->data[S->top--];\n}",TIME_LIMIT_EXCEEDED,1000,332 1539611727359614976,2760c5085315640232dca1b3fca68aadd82b3b2989516a3be03d6876e9041156,2022-06-22 22:10:15,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#define _CRT_SECURE_NO_WARNINGS 1\n#include \n\nvoid hanoi(int n, char a, char b, char c);\nvoid move(char x, char y);\n\nint main()\n{\n\tint lay = 0;\n\tscanf(\""%d\"", &lay);\n\thanoi(lay, 'A', 'B', 'C');\n\treturn 0;\n}\nvoid move(char x, char y)\n{\n\tprintf(\""%c->%c\\n\"", x, y);\n}\nvoid hanoi(int n, char a, char b, char c)\n{\n\tif (n == 1)\n\t\tmove(a, c);\n\telse\n\t{\n\t\thanoi(n - 1, a, c, b);\n\t\tmove(a, c);\n\t\thanoi(n - 1, b, a, c);\n\t}\n\n}",TIME_LIMIT_EXCEEDED,1000,17084 1539996159379738624,2760c5085315640232dca1b3fca68aadd82b3b2989516a3be03d6876e9041156,2022-06-23 23:37:50,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\n\n\nvoid hanoi(int n,char one,char two,char three)\t\n\t{\n\t void move(char x,char y);\t\n\t if(n==1)\n\t \tmove(one,three);\t\t\n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\n\t\tmove(one,three); \n\t\thanoi(n-1,two,one,three);】 \n\t}\n}\t\n\t\nvoid move(char x,char y)\t\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tprintf(\""input the number of diskes:\"");\n\tscanf(\""%d\"",&n);\t\n\tprintf(\""The step to move %d diskes:\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""The total number of times is %d\"",i-1);\n\treturn 0;\n}\n",COMPILE_ERROR,0,0 1539996919152746496,2760c5085315640232dca1b3fca68aadd82b3b2989516a3be03d6876e9041156,2022-06-23 23:40:51,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\n#include\n#include\nusing namespace std;\nvoid solve(int n,char src,char dst,char temp){\n if(n==1){ \n cout<\""<\""<>num;\n solve(num,'A','B','V');\n} ",COMPILE_ERROR,0,0 1540566427680612352,61ce94367c9d895c6bfb566da720c78618db15d728ac18bb0afba5a402e83656,2022-06-25 13:23:53,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \n#include \n#include \n#include \n#include \n \nusing namespace std;\nint ans = 0;\n \nlong long hanoi(int n){\n if(n==0) return 0;\n if(n==1) return 2;\n return 3*hanoi(n-1)+2;\n}\n \nint n;\n \nint main(){\n while(scanf(\""%d\"",&n)!=EOF){\n printf(\""%lld\\n\"",hanoi(n));\n }\n}",COMPILE_ERROR,0,0 1540577926314696704,c91bffd2913f67ec68e471ca5cc1a6d6e4359b6c327f73631f97e235c7e7470f,2022-06-25 14:09:34,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include \n#include \nint main() {\n\tlong long step = 0;\n\tint i, n;\n\tscanf(\""%d\"", &n);\n\tfor (i = 0;i <= n;i++) {\n\t\tstep += pow(2, i - 1);\n\t}\n\tprintf(\""%lld\"", step);\n\treturn 0;\n}",WRONG_ANSWER,15,328 1540577959638433792,c91bffd2913f67ec68e471ca5cc1a6d6e4359b6c327f73631f97e235c7e7470f,2022-06-25 14:09:42,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"\n#include\nint main()\n{\n\tvoid hanoi(int n,char one ,char two ,char three );\n\tint n;\n\tscanf(\""%d\"",&n);\n\thanoi(n ,'A' ,'B' ,'C' );\n\treturn 0 ;\n}\n \n//将n个盘子借助two，从one移到three \nvoid hanoi(int n,char one ,char two ,char three ) //定义汉诺塔函数 \n{\n\tvoid move (char one ,char two );\n\tif (n == 1)\n\t\tmove(one,three);\n\telse {\n\t\thanoi(n-1,one ,three ,two);\n\t\tmove(one,three);\n\t\thanoi(n-1,two ,one ,three );\n\t}\n}\nvoid move (char x ,char y ) //定义move函数，打印移动的过程 \n{\n\tprintf(\""%c -> %c\\n\"",x ,y );\n}\n",TIME_LIMIT_EXCEEDED,1000,21936 1542794237602136064,c166cb48eb531e61a53468840c5c78b8af8b5ff1b282a54660a63cba53e32aa8,2022-07-01 16:56:24,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\nint move(int);\nint main()\n{\n\tint a,s;\n\tscanf_s(\""%d\"", &a);\n\ts = move(a);\n\tprintf(\""%d\"", s);\n\treturn 0;\n}\n\nint move(int a)\n{\n\tif (a == 1)\n\t{\n\t\ta = 1;\n\t}\n\telse \n\t{\n\t\ta = 2 * move(a - 1) + 1;\n\t}\n\treturn a;\n}\n",COMPILE_ERROR,0,0 1542794599125979136,c166cb48eb531e61a53468840c5c78b8af8b5ff1b282a54660a63cba53e32aa8,2022-07-01 16:57:50,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\nint move(int);\nint main()\n{\n\tint a,s;\n\tscanf_s(\""%d\"", &a);\n\ts = move(a);\n\tprintf(\""%d\"", s);\n\treturn 0;\n}\n\nint move(int a)\n{\n\tif (a == 1)\n\t{\n\t\ta = 1;\n\t}\n\telse \n\t{\n\t\ta = 2 * move(a - 1) + 1;\n\t}\n\treturn a;\n}\n",COMPILE_ERROR,0,0 1542794661373648896,c166cb48eb531e61a53468840c5c78b8af8b5ff1b282a54660a63cba53e32aa8,2022-07-01 16:58:05,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\nint move(int);\nint main()\n{\n\tint a,s;\n\tscanf_s(\""%d\"", a);\n\ts = move(a);\n\tprintf(\""%d\"", s);\n\treturn 0;\n}\n\nint move(int a)\n{\n\tif (a == 1)\n\t{\n\t\ta = 1;\n\t}\n\telse \n\t{\n\t\ta = 2 * move(a - 1) + 1;\n\t}\n\treturn a;\n}\n",COMPILE_ERROR,0,0 1542794763043569664,c166cb48eb531e61a53468840c5c78b8af8b5ff1b282a54660a63cba53e32aa8,2022-07-01 16:58:29,C,0.0,1480788754650771457,1313471683597295616,1039132196031492096,"#include\nint move(int a)\n{\n\tif (a == 1)\n\t{\n\t\ta = 1;\n\t}\n\telse \n\t{\n\t\ta = 2 * move(a - 1) + 1;\n\t}\n\treturn a;\n}\n\nint main()\n{\n\tint a,s;\n\tscanf_s(\""%d\"", &a);\n\ts = move(a);\n\tprintf(\""%d\"", s);\n\treturn 0;\n}\n\n",COMPILE_ERROR,0,0 1506959667992436736,669ba26c6fd3c485daff93df8ab04a19d1c48041995a38f8f69117dfbe08b29e,2022-03-24 19:42:37,C++,17.0,1481269038406500353,1313471683597295616,1039132196031492096,"#include\n#include\nchar h1[100000],h2[100000];\nint main(){\n int n,b,tmp1=0,tmp2=0,p=0;\n scanf(\""%d\"",&n);\n h1[0]='0',h1[1]='\\0';\n for(int i=1;i<=n;i++){\n \tb=strlen(h1);\n \ttmp1=0;\n\t\tfor(int j=0;j=0;i--) printf(\""%c\"",h2[i]);\n return 0;\n}",PARTIAL_ACCEPTED,217,324 1506960227709722624,669ba26c6fd3c485daff93df8ab04a19d1c48041995a38f8f69117dfbe08b29e,2022-03-24 19:44:50,C++,20.0,1481269038406500353,1313471683597295616,1039132196031492096,"#include\n#include\nchar h1[100000],h2[100000];\nint main(){\n int n,b,tmp1=0,tmp2=0,p=0;\n scanf(\""%d\"",&n);\n h1[0]='0',h1[1]='\\0';\n for(int i=1;i<=n;i++){\n \tb=strlen(h1);\n \ttmp1=0;\n\t\tfor(int j=0;j=0;i--) printf(\""%c\"",h2[i]);\n return 0;\n}",ACCEPTED,28,376 1326755644674494464,01da5f75c5ec4651892315d081a0b41b66fdaf1cee16d58b6f0043bd5f34f650,2020-11-12 13:16:10,Python,300.0,1326687599098220545,1313471683597295616,1039132196031492096,\nn = int(input())\nans = int(1)\nprint(int(2**n-1))\n,ACCEPTED,233,2900 1326759394265841664,bd121f1a4d30b05d413a141659b2448b178d16262527f0613aee5e23791b1605,2020-11-12 13:31:04,Python,300.0,1326687599098220545,1313471683597295616,1039132196031492096,"n = input()\na = 0\nfor i in range(0,int(n)):\n a = a*2+1\nprint(a)",ACCEPTED,116,3028 1326760764343631872,4178bef667d06057d86dc5a61ec6f9ce164aa894e318672954f5b1fc49dfaea8,2020-11-12 13:36:30,Python,300.0,1326687599098220545,1313471683597295616,1039132196031492096,n = int(input())\nprint(2**n-1),ACCEPTED,113,3020 1326761012826783744,79a6851cac7e3903621e9a69f4c9bb55a368db394f80616c0179336680c43be7,2020-11-12 13:37:30,Java,300.0,1326687599098220545,1313471683597295616,1039132196031492096,import java.io.BufferedInputStream;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class Main {\n\tprivate static Scanner scan = new Scanner(new BufferedInputStream(System.in));\n\tprivate static BigInteger[] d = new BigInteger[5010];\n\tprivate static void init() {\n\t\td[1] = BigInteger.valueOf(1);\n\t\td[2] = BigInteger.valueOf(2);\n\t\tfor (int i = 2; i<=5000; ++ i) {\n\t\t\td[i] = d[i - 1].multiply(BigInteger.valueOf(2)).add(BigInteger.valueOf(1));\n\t\t}\n\t}\n\t\n\tprivate static void sol() {\n\t\t\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tinit();\n\t\tint n = scan.nextInt();\n\t\tSystem.out.println(d[n]);\n\t\t\n//\t\tint T = scan.nextInt();\n//\t\tfor (int t = 0; t < T; ++ t) sol();\n\t}\n}\n,ACCEPTED,1615,19704 1326761470445301760,8104578a4e21eaeae5723c936eb7cea19ac0d8ff9b0a9ae4401e030df546d024,2020-11-12 13:39:19,Java,300.0,1326687599098220545,1313471683597295616,1039132196031492096,// package X;\n\n\nimport java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint x = cin.nextInt();\n\t\tBigInteger cnt = BigInteger.valueOf(2);\n\t\tSystem.out.println(cnt.pow(x).subtract(BigInteger.valueOf(1)));\n\t}\n}\n,ACCEPTED,717,15184 1326761818519027712,47098535a8d14cf058b25922c7cdcb8deda99ec49f0cff6ae3ba6c10400d0896,2020-11-12 13:40:42,Python,300.0,1326687599098220545,1313471683597295616,1039132196031492096,"N = input()\na=0\nfor it in range (1, N + 1):\n a=a*2+1\nprint(a)",ACCEPTED,78,2892 1326763383568019456,8f74fa74ac00d1b3a8510c91628fd774bb8cc161249d9cecd6c7a04a89bcf8c7,2020-11-12 13:46:55,Java,300.0,1326687599098220545,1313471683597295616,1039132196031492096,"\nimport java.util.*;\nimport java.math.*;\npublic class Main {\n\tpublic static void main(String [] ars) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tBigInteger a,b,c,i;\n\t\t//int d;\n\t\ti=new BigInteger(\""1\"");\n\t\ta=new BigInteger(\""1\"");\n\t\tb=new BigInteger(\""2\"");\n\t\t\tBigInteger ans1;\n\t\t\tint ans;\n\t\t\tans=cin.nextInt();\n\t\t\tans1=b.pow(ans);\n\t\t\tans1=ans1.subtract(a);\n\t\t\tSystem.out.println(ans1);\n\t}\n\n}\n",ACCEPTED,1322,14768 1326765638966915072,5b8d25892174dc468565d45325e75859ab9e11a09d28c0f00db0fb6878afb7a5,2020-11-12 13:55:53,C++,0.0,1326687599098220545,1313471683597295616,1039132196031492096,"#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#define endl '\\n'\n#define x first\n#define y second\n#define clr(arr,a) memset(arr, a, sizeof(arr))\n#define IOS ios::sync_with_stdio(false)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair P;\ntypedef pair Pll;\nconst double pi = acos(-1.0);\nconst double eps = 1e-8;\nconst ll MOD = 1e9+7;\nconst int INF = 0x3f3f3f3f;\nconst int maxn = 1e5+10;\n__int128 arr[maxn] = {1, 1};\nint main(void) {\n for (int i = 2; i> k;\n while(arr[k]) {\n s += arr[k]%10+'0';\n arr[k] /= 10;\n }\n reverse(s.begin(), s.end());\n cout << s << endl;\n return 0;\n}",WRONG_ANSWER,43,1876 1326767020025401344,c32d3892294d87a8bef3f281df41b512c9b742ea0c18f9221a2b98c3a8eb60e7,2020-11-12 14:01:22,Python,300.0,1326687599098220545,1313471683597295616,1039132196031492096,a = input()\na = int(a)\nans = 1\nfor i in range(a-1):\n ans = ans*2+1\nprint(ans),ACCEPTED,124,2892 1326769071733129216,5b8d25892174dc468565d45325e75859ab9e11a09d28c0f00db0fb6878afb7a5,2020-11-12 14:09:31,Java,300.0,1326687599098220545,1313471683597295616,1039132196031492096,//package bn;\nimport java.math.BigInteger;\nimport java.util.*;\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tBigInteger arr[] = new BigInteger [6000];\n\t\tfor (int i = 0; i<6000; ++i) arr[i] = BigInteger.valueOf(0);\n\t\tarr[1] = BigInteger.ONE;\n\t\tfor (int i = 2; i<6000; ++i) {\n\t\t\tarr[i] = arr[i-1].multiply(BigInteger.valueOf(2));\n\t\t\tarr[i] = arr[i].add(BigInteger.valueOf(1));\n\t\t}\n\t\tScanner input = new Scanner(System.in);\n\t\tint n = input.nextInt();\n\t\tSystem.out.println(arr[n]);\n\t}\n}\n,ACCEPTED,856,23288 1326775073412042752,f2639c0e898c799101bd50b8b33ffbeb495046e0dc0038f90fc52a6b688af678,2020-11-12 14:33:22,Java,0.0,1326687599098220545,1313471683597295616,1039132196031492096,public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tBigInteger ans = BigInteger.valueOf(2);\n\t\tBigInteger x = BigInteger.valueOf(1);\n\t\tBigInteger x1 = BigInteger.valueOf(1);\n\t\tBigInteger n = sc.nextBigInteger();\n\t\tint nn = n.intValue();\n\t\tfor(int i=0;i\nint main(){\n printf(\""1180591620717411303423\"");\n return 0;\n}",WRONG_ANSWER,18,204 1328681043652894720,81eb8da1edbc2827c6a2a0fd722312d08855eda88ea40d49fbae17e3f690b249,2020-11-17 20:47:01,C++,20.0,1328125767953575937,1313471683597295616,1039132196031492096,"#include \nusing namespace std;\nint a[5010], pa = 1;\nint main() {\n\tint n;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++) {\n\t\tfor(int i0=0;i0 10) {\n\t\t\ta[pa] = a[pa - 1] / 10;\n\t\t\ta[pa - 1] %= 10;\n\t\t\tpa++;\n\t\t}\n\t}\n\tfor(int i=pa-1;i>=0;i--) {\n\t\tcout<\n#include\nusing namespace std;\nint a[1000005];\nint main()\n{\n\ta[0]=2;\n\tint n,p=0;\n\tscanf(\""%d\"",&n);\n\tfor(int i=1;i0)\n\t\tp++;\n\t}\n\tif(a[0]>0)\n\ta[0]-=1;\n\tfor(int i=p;i>=0;i--){\n\t\tprintf(\""%d\"",a[i]);\n\t}\n\treturn 0;\n}",ACCEPTED,74,444 1329003738126991360,753fbad91e1963be9302de061368d84d1e5ba61aab7fc2ae993882a257b41534,2020-11-18 18:09:17,Python,5.0,1328683423563902977,1313471683597295616,1039132196031492096,n=int(input())\nlast=1\nnow=0\nfor i in range(n-1):\n now=last*2+1\n last=now\nprint(last)\n\n,ACCEPTED,108,3016 1329013273562570752,0bc20111368d6b067e593330d8e9af6c15f7989f240cdb834cba0edafcd01148,2020-11-18 18:47:10,Java,0.0,1328683423563902977,1313471683597295616,1039132196031492096,"\nimport java.io.BufferedInputStream;\nimport java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileReader;\nimport java.io.FileWriter;\nimport java.io.IOException;\nimport java.math.BigInteger;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.TreeSet;\n\npublic class Main\n{\n\tpublic static void main(String args[])\n\t{\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tBigInteger num[]=new BigInteger[n+1];\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tnum[i]=num[i-1].multiply(new BigInteger(\""3\"")).add(new BigInteger(\""2\""));\n\t\t}\n\t\tSystem.out.println(num[n]);\n\t}\n}\n",WRONG_ANSWER,562,15536 1329013541037522944,0bc20111368d6b067e593330d8e9af6c15f7989f240cdb834cba0edafcd01148,2020-11-18 18:48:14,Java,0.0,1328683423563902977,1313471683597295616,1039132196031492096,"\nimport java.io.BufferedInputStream;\nimport java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileReader;\nimport java.io.FileWriter;\nimport java.io.IOException;\nimport java.math.BigInteger;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.TreeSet;\n\npublic class Main\n{\n\tpublic static void main(String args[])\n\t{\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tBigInteger num[]=new BigInteger[n+1];\n\t\tnum[0]=new BigInteger(\""0\"");\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tnum[i]=num[i-1].multiply(new BigInteger(\""3\"")).add(new BigInteger(\""2\""));\n\t\t}\n\t\tSystem.out.println(num[n]);\n\t}\n}\n",WRONG_ANSWER,1067,24080 1329014985916530688,0bc20111368d6b067e593330d8e9af6c15f7989f240cdb834cba0edafcd01148,2020-11-18 18:53:59,Java,4.0,1328683423563902977,1313471683597295616,1039132196031492096,"\nimport java.io.BufferedInputStream;\nimport java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileReader;\nimport java.io.FileWriter;\nimport java.io.IOException;\nimport java.math.BigInteger;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.TreeSet;\n\npublic class Main\n{\n\tpublic static void main(String args[])\n\t{\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tBigInteger num[]=new BigInteger[n+1];\n\t\tnum[0]=new BigInteger(\""0\"");\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tnum[i]=num[i-1].multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t\tSystem.out.println(num[n]);\n\t}\n}\n",PARTIAL_ACCEPTED,1228,15596 1329015214447386624,0bc20111368d6b067e593330d8e9af6c15f7989f240cdb834cba0edafcd01148,2020-11-18 18:54:53,Java,5.0,1328683423563902977,1313471683597295616,1039132196031492096,"\nimport java.io.BufferedInputStream;\nimport java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileReader;\nimport java.io.FileWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\nimport java.io.StreamTokenizer;\nimport java.math.BigInteger;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.TreeSet;\n\npublic class Main\n{\n\tstatic StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));\n\tstatic PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));\n\tpublic static void main(String args[]) throws IOException\n\t{\n\t\tin.nextToken();\n\t\tint n=(int)in.nval;\n\t\tBigInteger num[]=new BigInteger[n+1];\n\t\tnum[0]=new BigInteger(\""0\"");\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tnum[i]=num[i-1].multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t\tout.println(num[n]);\n\t\tout.flush();\n\t}\n}\n",ACCEPTED,617,19440 1329021096342183936,51a170df5badb2d0bdeb008347c138be6f1cfa404910671181cb2b4daba1ef13,2020-11-18 19:18:16,Java,5.0,1328683423563902977,1313471683597295616,1039132196031492096,"import java.io.*;\nimport java.math.BigInteger;\n\npublic class Main {\n public static void main(String[]args) throws IOException{\n StreamTokenizer sc=new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));\n PrintWriter out=new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n// Scanner sc=new Scanner(System.in);\n BigInteger[] all=new BigInteger[5010];\n all[1]=new BigInteger(\""1\"");\n BigInteger two=new BigInteger(\""2\"");\n\n for (int i = 2; i < 5010; i++) {\n all[i]=(all[i-1].multiply(two)).add(all[1]);\n }\n sc.nextToken();\n int n=(int)sc.nval;\n out.println(all[n]);\n out.flush();\n\n\n }\n}\n",ACCEPTED,657,18120 1329021912985755648,8ce69f3d432453dbffdd8f88b8ba84ef44a7c7ff0433898f248ae0e8ab231056,2020-11-18 19:21:30,Python,5.0,1328683423563902977,1313471683597295616,1039132196031492096,"a=int(input())\nprint(pow(2,a)-1)",ACCEPTED,122,3020 1329025946438197248,e5987a8031277c3fc139c2ca5b5dee627e738da42aace2afc5f94a3c529622f5,2020-11-18 19:37:32,Java,5.0,1328683423563902977,1313471683597295616,1039132196031492096,"\n\nimport java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main\n{\n\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner in=new Scanner(System.in);\n\t\tBigInteger a=in.nextBigInteger();\n\t\tBigInteger b=new BigInteger(\""2\"");\n\t\tBigInteger c=new BigInteger(\""1\"");\n\t\tSystem.out.println(dd(b,a).subtract(c));\n\t}\n\tpublic static BigInteger dd(BigInteger a,BigInteger b)\n\t{\n\t\tBigInteger res=new BigInteger(\""1\"");\n\t\twhile(b.compareTo(new BigInteger(\""0\""))>0)\n\t\t{\n\t\t\tif(b.mod(new BigInteger(\""2\"")).compareTo(new BigInteger(\""1\""))==0)res=res.multiply(a);\n\t\t\tb=b.divide(new BigInteger(\""2\""));\n\t\t\ta=a.multiply(a);\n\t\t}\n\t\treturn res;\n\t}\n\t\n}\n",ACCEPTED,734,15708 1329028393047023616,aa449dce0805cf9d7e4d5a89527175bfba24a9990e155c7b0cee14737fdfe34c,2020-11-18 19:47:15,Java,0.0,1328683423563902977,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main\n{\n public static void main(String[] args)\n {\n Scanner in=new Scanner(System.in);\n int n=in.nextInt();\n BigInteger b=new BigInteger(\""3\"");\n b=b.pow(n).subtract(BigInteger.ONE);\n System.out.println(b.toString());\n }\n}\n",MULTIPLE_ERROR,1026,14852 1329030010613915648,aa449dce0805cf9d7e4d5a89527175bfba24a9990e155c7b0cee14737fdfe34c,2020-11-18 19:53:41,Java,5.0,1328683423563902977,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main\n{\n public static void main(String[] args)\n {\n Scanner in=new Scanner(System.in);\n int n=in.nextInt();\n BigInteger b=new BigInteger(\""2\"");\n b=b.pow(n).subtract(BigInteger.ONE);\n System.out.println(b.toString());\n }\n}\n",ACCEPTED,1708,14632 1329035697058340864,5121b160a89e8cab7c1692ea05ed6f8ce0b63ca0938d01acd98fa0ebda75c805,2020-11-18 20:16:17,Java,5.0,1328683423563902977,1313471683597295616,1039132196031492096,import java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main\n{\n\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner in=new Scanner(System.in);\n\t\tBigInteger a[]=new BigInteger[5001];\n\t\ta[0]=BigInteger.ZERO;\n\t\ta[1]=BigInteger.valueOf(2);\n\t\tfor(int i=2;i<=5000;i++)\n\t\t{\n\t\t\ta[i]=a[i-1].multiply(BigInteger.valueOf(2));\n\t\t}\n\t\tint n=in.nextInt();\n\t\tSystem.out.println(a[n].subtract(BigInteger.valueOf(1)));\n\t}\n\t\n}\n,ACCEPTED,764,17080 1329036780010848256,bc2af39a1eaddb68346120d34b4ae73604c65f5efc380790a8424f5cfe5d92a7,2020-11-18 20:20:35,Python,0.0,1328683423563902977,1313471683597295616,1039132196031492096,a = int(input())\nprint(3 ** (a - 1)),WRONG_ANSWER,119,2896 1329038996935393280,ff9e35e7104ab944d746d409ff4ef5515c362655c25f436d6378caf2f99b3bf7,2020-11-18 20:29:23,Java,5.0,1328683423563902977,1313471683597295616,1039132196031492096,import java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main\n{\n\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner s=new Scanner(System.in);\n\t\tBigInteger a[]=new BigInteger[5001];\n\t\ta[0]=BigInteger.ZERO;\n\t\ta[1]=BigInteger.valueOf(2);\n\t\tfor(int i=2;i<=5000;i++)\n\t\t{\n\t\t\ta[i]=a[i-1].multiply(BigInteger.valueOf(2));\n\t\t}\n\t\tint n=s.nextInt();\n\t\tSystem.out.println(a[n].subtract(BigInteger.valueOf(1)));\n\t}\n\t\n},ACCEPTED,779,17416 1329039353803554816,d298a9a67209c095c710908aabe2fbc03cbc8d1488b46621b9683f0627f15dd0,2020-11-18 20:30:48,Java,0.0,1328683423563902977,1313471683597295616,1039132196031492096,\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class Main\n{\n public static void main(String args[])\n {\n Scanner in = new Scanner(System.in);\n String a=in.next();\n BigInteger sum=BigInteger.TWO;\n for (int i=0;i sz=new Vector();\n\t\tScanner laji=new Scanner(System.in);\n\t\tint a=laji.nextInt();\n\t\tSystem.out.println(BigInteger.ONE.shiftLeft(a));\n\t}\n},WRONG_ANSWER,719,14460 1329053998203396096,d9975184374be365be59fb9723225d443e44028d804e2e3d1e816606d6330e95,2020-11-18 21:29:00,Java,5.0,1328683423563902977,1313471683597295616,1039132196031492096,import java.math.BigInteger;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.LinkedList;\nimport java.util.Queue;\nimport java.util.Scanner;\nimport java.util.Stack;\nimport java.util.Vector;\n\n\npublic class Main\n{\n\tpublic static void main(String[] args)\n\t{\n\t\tVector sz=new Vector();\n\t\tScanner laji=new Scanner(System.in);\n\t\tint a=laji.nextInt();\n\t\tSystem.out.println(BigInteger.ONE.shiftLeft(a).subtract(BigInteger.ONE));\n\t}\n},ACCEPTED,638,15432 1329054850137841664,8ce2d8988da6754f61565aee09fc74b7f30e04855708bbd53dbc4388f1f04b3f,2020-11-18 21:32:23,Java,5.0,1328683423563902977,1313471683597295616,1039132196031492096,\n\nimport java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main\n{\n public static void main(String[] args)\n {\n Scanner in=new Scanner(System.in);\n int x=in.nextInt();\n BigInteger xx=new BigInteger(String.valueOf(2));\n xx=xx.pow(x).subtract(BigInteger.ONE);\n System.out.println(xx);\n }\n}\n,ACCEPTED,682,15164 1329069023496355840,bef7d76fe33fe5322d9bef5eccb48fedfa271bd72fcecb756b4b89f63a1b367a,2020-11-18 22:28:42,Java,5.0,1328683423563902977,1313471683597295616,1039132196031492096,\n\nimport java.math.BigInteger;\nimport java.util.Arrays;\nimport java.util.LinkedList;\nimport java.util.Scanner;\n\nimport javax.swing.text.AbstractDocument.LeafElement;\nimport javax.xml.crypto.Data;\n\npublic class Main\n{\n\t\n\t public static void main(String[] args)\n {\n\t\t Scanner in=new Scanner(System.in);\n\t\t int b=in.nextInt();\n\t\tBigInteger a=BigInteger.ONE.add(BigInteger.ONE);\n\t\tSystem.out.println((a.pow(b).subtract(BigInteger.ONE)));\n\t\t\n\t\t\t\t \n }\n\t\t\n\t\n}\n,ACCEPTED,665,15216 1329070767831891968,039fbcff24a931d7d22b5d5990ba3f9ae415ee730f3fa51e48b0ef7109cfa18a,2020-11-18 22:35:38,C++,0.0,1328683423563902977,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\ntypedef long long ll;\nconst int N=1e3+5;\nconst int INF=0x3f3f3f3f;\nconst ll mod=10000019;\nstring s;\nint a[N],ind[N],fa[N];\nint main()\n{\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout.tie(0);\n\tcout<<0;\n\treturn 0;\n}\n",WRONG_ANSWER,25,460 1329070820919197696,039fbcff24a931d7d22b5d5990ba3f9ae415ee730f3fa51e48b0ef7109cfa18a,2020-11-18 22:35:51,C++,0.0,1328683423563902977,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\ntypedef long long ll;\nconst int N=1e3+5;\nconst int INF=0x3f3f3f3f;\nconst ll mod=10000019;\nstring s;\nint a[N],ind[N],fa[N];\nint main()\n{\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout.tie(0);\n\tcout<<1;\n\treturn 0;\n}\n",WRONG_ANSWER,69,376 1329070847628525568,039fbcff24a931d7d22b5d5990ba3f9ae415ee730f3fa51e48b0ef7109cfa18a,2020-11-18 22:35:57,C++,0.0,1328683423563902977,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\ntypedef long long ll;\nconst int N=1e3+5;\nconst int INF=0x3f3f3f3f;\nconst ll mod=10000019;\nstring s;\nint a[N],ind[N],fa[N];\nint main()\n{\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout.tie(0);\n\tcout<<2;\n\treturn 0;\n}\n",WRONG_ANSWER,26,340 1329071139350757376,039fbcff24a931d7d22b5d5990ba3f9ae415ee730f3fa51e48b0ef7109cfa18a,2020-11-18 22:37:07,C++,0.0,1328683423563902977,1313471683597295616,1039132196031492096,"#include\nusing namespace std;\ntypedef long long ll;\nconst int N=1e3+5;\nconst int INF=0x3f3f3f3f;\nconst ll mod=10000019;\nint main()\n{\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout.tie(0);\n ll n,sum=0;\n cin>>n;\n for(int i=1;i<=n;i++)\n {\n sum+=3*sum+2;\n }\n\tcout<0&&N<5000)\n\t\t{\n\t\t\tSystem.out.print(count(N));\n\t\t}\n\t\tin.close();\n\t}\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,1111,16528 1338026842051633152,68548a74eee62fa6002a0a0fecc8cd7bb2022c8c057669bbd53830aa9662db7d,2020-12-13 15:43:53,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint N=in.nextInt();\n\t\tif(N>0&&N<5000)\n\t\t{\n\t\t\tSystem.out.print(count(N));\n\t\t}\n\t\tin.close();\n\t}\n\tstatic BigInteger count(int N) {\n\t\tif(N==1) {\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n\t\t\treturn count(N-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n}",ACCEPTED,648,20280 1338028590623416320,09e950642491db3708b17084f96b3e85aa6cfaa824e1516503014162acffcd3d,2020-12-13 15:50:50,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t/*这里抽象的很，需要理解为将n个盘子从one座移到three座(借助two座)的过程【其中one、two、three只是个形式位置】 \n\t\t\t\t\t\t\t\t\t\t\t\t\t----后面的hanoi(n-1,one,three,two)其实看成开头的定义hanoi(int n,char one,char two,char three)的形式样子 \n\t\t\t\t\t\t\t\t\t\t\t\t\t也就是one(实际位置如A)借助three(实际位置如C)移动到two(实际位置如B).下面的(3)其实和上面介绍的方法一样 \n\t\t\t\t\t\t\t\t\t\t\t\t\tone、two、three只是个形式位置，但A、B、C才是实际位置*/\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tprintf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""The step to move %d diskes:\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""The total number of times is %d\"",i-1);\n\treturn 0;\n}",COMPILE_ERROR,0,0 1338028667354017792,09e950642491db3708b17084f96b3e85aa6cfaa824e1516503014162acffcd3d,2020-12-13 15:51:08,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"#include \n\nstatic int i=1;\t\t\t\t\t\t//记录移动所需的次数\n\n\nvoid hanoi(int n,char one,char two,char three)\t\t/*这里抽象的很，需要理解为将n个盘子从one座移到three座(借助two座)的过程【其中one、two、three只是个形式位置】 \n\t\t\t\t\t\t\t\t\t\t\t\t\t----后面的hanoi(n-1,one,three,two)其实看成开头的定义hanoi(int n,char one,char two,char three)的形式样子 \n\t\t\t\t\t\t\t\t\t\t\t\t\t也就是one(实际位置如A)借助three(实际位置如C)移动到two(实际位置如B).下面的(3)其实和上面介绍的方法一样 \n\t\t\t\t\t\t\t\t\t\t\t\t\tone、two、three只是个形式位置，但A、B、C才是实际位置*/\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t void move(char x,char y);\t\t\t\t\t\t\t\t\t \n\t if(n==1)\n\t \tmove(one,three);\t\t\t\t\t\t\t//递归的关键点，跟two没什么关系，主要为one→three \n\telse\n\t{\n\t\thanoi(n-1,one,three,two);\t\t\t\t\t//(1).将A座上的n-1个盘(借助C)座先移动到B座上【这是针对总的情况】 \t\n\t\tmove(one,three);\t\t\t\t\t\t\t//(2).把A座剩下的一个盘直接移到C座上【这是针对总的情况】 \n\t\thanoi(n-1,two,one,three);\t\t\t\t\t//(3).将n-1个盘从B座(借助A)座移动到C座上【这是针对总的情况】 \n\t}\n}\t\n\t\t\t\t\t\t\t\t\t\t\t//其实(1)和(3)的移动方法一样，只是座的名字不同了( 总的情况移动方法 和(1)、(3)也是类似的)\nvoid move(char x,char y)\t\t\t\t\n{\n\tprintf(\""%d:%c-->%c\\n\"",i,x,y);\t\t\t\t\t//主力输出点! \n\ti++;\n}\n\n\nint main()\n{\n\tint n;\n\tprintf(\""input the number of diskes:\"");\t\t\n\tscanf(\""%d\"",&n);\t\t\t\t\t\t\t\t//输入盘子个数 \n\tprintf(\""The step to move %d diskes:\\n\"",n);\n\thanoi(n,'A','B','C');\n\tprintf(\""The total number of times is %d\"",i-1);\n\treturn 0;\n}",COMPILE_ERROR,0,0 1338029245597544448,4d86edf68f08a862fe582cf5a8a42ea139bb566ed3b584a1703b31c4c0e99dee,2020-12-13 15:53:26,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\nprivate static Scanner s;\nstatic BigInteger count(int number) {\nif(number==1) {\nreturn new BigInteger(\""1\"");\n}else {\nreturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n}\n}\n public static void main(String[] args) {\n\ts = new Scanner(System.in);\n\tint number = s.nextInt();\n\tSystem.out.println(count(number));\n\t}\n}",ACCEPTED,849,20968 1338029311074820096,4d86edf68f08a862fe582cf5a8a42ea139bb566ed3b584a1703b31c4c0e99dee,2020-12-13 15:53:41,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\nprivate static Scanner s;\nstatic BigInteger count(int number) {\nif(number==1) {\nreturn new BigInteger(\""1\"");\n}else {\nreturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n}\n}\n public static void main(String[] args) {\n\ts = new Scanner(System.in);\n\tint number = s.nextInt();\n\tSystem.out.println(count(number));\n\t}\n}",ACCEPTED,870,21548 1338029379525865472,96f40af35797cbf901a3d6e2fc15ad98ffa3be5fb6684e9340cdf4189fc18a43,2020-12-13 15:53:58,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n//\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n//\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n\n}",ACCEPTED,857,21312 1338029416276357120,96f40af35797cbf901a3d6e2fc15ad98ffa3be5fb6684e9340cdf4189fc18a43,2020-12-13 15:54:06,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n//\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n//\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n\n}",ACCEPTED,964,21016 1338029931739541504,8b231a58fb43563a99558f9b863f8aec1ff6ce8559959d8baa05d98356e07830,2020-12-13 15:56:09,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,import java.util.Scanner;\n\npublic class Main{\n public static void main(String args[]){\n Scanner in = new Scanner (System.in);\n int n = in.nextInt();\n System.out.print(f(n));\n }\n public static BigInteger f(int n){\n if (n==1)\n return 1;\n else \n return (2*f(n-1)+1);\n }\n},COMPILE_ERROR,0,0 1338030198199480320,8b231a58fb43563a99558f9b863f8aec1ff6ce8559959d8baa05d98356e07830,2020-12-13 15:57:13,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,import java.util.Scanner;\n\npublic class Main{\n public static void main(String args[]){\n Scanner in = new Scanner (System.in);\n int n = in.nextInt();\n System.out.print(f(n));\n }\n public static BigInteger f(int n){\n if (n==1)\n return 1;\n else \n return (2*f(n-1)+1);\n }\n},COMPILE_ERROR,0,0 1338030316877307904,8b231a58fb43563a99558f9b863f8aec1ff6ce8559959d8baa05d98356e07830,2020-12-13 15:57:41,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,import java.util.Scanner;\nimport java.util.*;\npublic class Main{\n public static void main(String args[]){\n Scanner in = new Scanner (System.in);\n int n = in.nextInt();\n System.out.print(f(n));\n }\n public static BigInteger f(int n){\n if (n==1)\n return 1;\n else \n return (2*f(n-1)+1);\n }\n},COMPILE_ERROR,0,0 1338030459060023296,8b231a58fb43563a99558f9b863f8aec1ff6ce8559959d8baa05d98356e07830,2020-12-13 15:58:15,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,import java.util.Scanner;\nimport java.util.*;\npublic class Main{\n public static void main(String args[]){\n Scanner in = new Scanner (System.in);\n int n = in.nextInt();\n System.out.print(f(n));\n }\n public static Long f(int n){\n if (n==1)\n return 1;\n else \n return (2*f(n-1)+1);\n }\n},COMPILE_ERROR,0,0 1338030674936655872,8b231a58fb43563a99558f9b863f8aec1ff6ce8559959d8baa05d98356e07830,2020-12-13 15:59:06,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,import java.util.Scanner;\nimport java.util.*;\npublic class Main{\n public static void main(String args[]){\n Scanner in = new Scanner (System.in);\n int n = in.nextInt();\n System.out.print(f(n));\n }\n public static int f(int n){\n if (n==1)\n return 1;\n else \n return (2*f(n-1)+1);\n }\n},WRONG_ANSWER,783,15244 1338031248641945600,d35434d4fec2ad2b494f10a3d7460b7a9e0aa53f222936e551525ccdeddae3bc,2020-12-13 16:01:23,Java,10.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\t\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n//\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n//\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n\n}\n\n\n\t\t\n",PARTIAL_ACCEPTED,1096,15536 1338031481132216320,d35434d4fec2ad2b494f10a3d7460b7a9e0aa53f222936e551525ccdeddae3bc,2020-12-13 16:02:19,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n//\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n//\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n\n}\n\n\n\t\t\n",ACCEPTED,822,20740 1338031518159532032,d35434d4fec2ad2b494f10a3d7460b7a9e0aa53f222936e551525ccdeddae3bc,2020-12-13 16:02:28,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n//\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n//\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n\n}\n\n\n\t\t\n",ACCEPTED,769,21888 1338031687701688320,d14dd9adcf2d7561c26361c91b3b45c420ca82fe78873e80c8f6e4999ab036d2,2020-12-13 16:03:08,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\n\npublic class H13 {\n\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n//\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n//\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n\n}\n",COMPILE_ERROR,0,0 1338031833470525440,d14dd9adcf2d7561c26361c91b3b45c420ca82fe78873e80c8f6e4999ab036d2,2020-12-13 16:03:43,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\n\npublic class Main {\n\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n//\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n//\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n\n}\n",COMPILE_ERROR,0,0 1338031984369000448,68548a74eee62fa6002a0a0fecc8cd7bb2022c8c057669bbd53830aa9662db7d,2020-12-13 16:04:19,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint N=in.nextInt();\n\t\tif(N>0&&N<5000)\n\t\t{\n\t\t\tSystem.out.print(count(N));\n\t\t}\n\t\tin.close();\n\t}\n\tstatic BigInteger count(int N) {\n\t\tif(N==1) {\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n\t\t\treturn count(N-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n}",ACCEPTED,1076,20708 1338032094318489600,d14dd9adcf2d7561c26361c91b3b45c420ca82fe78873e80c8f6e4999ab036d2,2020-12-13 16:04:45,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n//\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n//\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n\n}\n",COMPILE_ERROR,0,0 1338032299512229888,9a5e3b3d93d40a958d32c500fee3b3cc8b37b2424577b0923f40226267114324,2020-12-13 16:05:34,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner N=new Scanner(System.in);\n\t int pai=N.nextInt();\n\t for(int i=0;i<1;i++)\n\t {\n\t\t \n\t }\n\t\t\n\t}\n},WRONG_ANSWER,700,14684 1338032339026767872,8b231a58fb43563a99558f9b863f8aec1ff6ce8559959d8baa05d98356e07830,2020-12-13 16:05:43,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.util.Scanner;\nimport java.util.*;\npublic class Main{\n public static void main(String args[]){\n Scanner in = new Scanner (System.in);\n int n = in.nextInt();\n System.out.print(f(n));\n }\n public static BigInteger f(int n){\n if (n==1)\n return new BigInteger(\""1\"") ;\n else \n return (new BigInteger(\""2\"").multiply(f(n-1)).add(new BigInteger(\""1\"")));\n }\n}",COMPILE_ERROR,0,0 1338032377949904896,d35434d4fec2ad2b494f10a3d7460b7a9e0aa53f222936e551525ccdeddae3bc,2020-12-13 16:05:53,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n//\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n//\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n\n}\n\n\n\t\t\n",ACCEPTED,759,20260 1338032406106271744,d14dd9adcf2d7561c26361c91b3b45c420ca82fe78873e80c8f6e4999ab036d2,2020-12-13 16:05:59,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n//\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n//\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n\n}\n",ACCEPTED,940,21812 1338032423718154240,e1378dffdef115084346f5a78138c8af88a9954724084e157db534f3908534db,2020-12-13 16:06:03,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n/*\n 1 1 \n 2 3\n 3 7\n n 2n+1\n */\n\npublic class Main {\n\n\t\n\t \n\t\n\t\n\t\tstatic BigInteger count(int number) {\n\t\t\tif(number==1) {\n\n\t\t\t\treturn new BigInteger(\""1\"");\n\t\t\t}else {\n\n\t\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic static void main(String[] args) {\n\t\t\tScanner s=new Scanner(System.in);\n\t\t\tint number = s.nextInt();\n\t\t\tSystem.out.println(count(number));\n\t\t}\n\t\t\t\n\t\t}\n\n\t\n",ACCEPTED,669,21180 1338032729776513024,5320798fc248c05c3f88909d88fb0a3de05d44bf5f53dfabf7f2ec396300f06f,2020-12-13 16:07:16,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n\t\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n\t\t\t\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n\n}",ACCEPTED,791,20136 1338032741214380032,d35434d4fec2ad2b494f10a3d7460b7a9e0aa53f222936e551525ccdeddae3bc,2020-12-13 16:07:19,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\npublic class Main {\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n//\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n//\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n\n}\n\n\n\t\t\n",ACCEPTED,626,20380 1338032779764232192,d530a98ef63ccc60bf8b1ae13109f1c9c3a2f73c8788f3c448083d3445bd6608,2020-12-13 16:07:28,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.util.Scanner;\npublic class Main {\n public static void main(String[] args) {\n \t Scanner scanner=new Scanner(System.in);\n \t\tSystem.out.println(\""请输入汉诺塔数量:\"");\n \t\tint n=scanner.nextInt();\n\t System.out.println(\""需要移动的次数:\""+hanoi(n));\t\n\t}\n \n static long hanoi(int n){\n \tif(n==1){\n \t\treturn 1;\n \t}else{\n \t\treturn 2*hanoi(n-1)+1;\n \t}\n } \n \n \n}",WRONG_ANSWER,738,15608 1338032855999897600,5236e56f7e809e62629ce1ce6f8e9c36b9eefcd50fdfc29dd1085f895173e6f1,2020-12-13 16:07:46,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"package algorithm.recursion;\npublic class HanoiTower{\n private static int step= 0; \n /**汉诺塔的递归演示。\n * @param from 碟子的出发地\n * @param temp 碟子的中转站\n * @param to 碟子的到达地\n * @param n 要移动的碟子个数\n */\n static void hanoi(char from, char temp, char to, int n){ \n if (n == 1) {\n step++;\n System.out.println(\""第\""+step+ \""步: \""+ from+\""→\""+ to);\n }else {\n //将n-1个碟子移到中转站，故目前的到达地是temp。\n hanoi(from, to,temp,n-1);\n //第n个碟子移到到达地\n step++;\n System.out.println(\""第\""+step+ \""步: \""+ from+\""→\""+ to);\n //将n-1个碟子移到到达地。\n hanoi(temp,from,to,n-1);\n }\n }\n}\n",COMPILE_ERROR,0,0 1338032970273710080,5236e56f7e809e62629ce1ce6f8e9c36b9eefcd50fdfc29dd1085f895173e6f1,2020-12-13 16:08:14,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"package algorithm.recursion;\npublic class HanoiTower{\n private static int step= 0; \n static void hanoi(char from, char temp, char to, int n){ \n if (n == 1) {\n step++;\n System.out.println(\""第\""+step+ \""步: \""+ from+\""→\""+ to);\n }else {\n hanoi(from, to,temp,n-1);\n step++;\n System.out.println(\""第\""+step+ \""步: \""+ from+\""→\""+ to);\n hanoi(temp,from,to,n-1);\n }\n }\n}\n",COMPILE_ERROR,0,0 1338033004331462656,6e7d5784f041dc7b8141d7387384d997a6b127246414892f5856fe6c3ea0d6c6,2020-12-13 16:08:22,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.util.Scanner;\nimport java.math.BigInteger;\npublic class Main{\n\t\tstatic BigInteger count(int number) {\n\t\t\tif(number==1) {\n\t\t\t\treturn new BigInteger(\""1\"");\n\t\t\t}else {\n\t\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic static void main(String[] args) {\n\t\t\tScanner s=new Scanner(System.in);\n\t\t\tint number = s.nextInt();\n\t\t}\n}\n",WRONG_ANSWER,1051,15548 1338033080013479936,5236e56f7e809e62629ce1ce6f8e9c36b9eefcd50fdfc29dd1085f895173e6f1,2020-12-13 16:08:40,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"package algorithm.recursion;\npublic class HanoiTower{\n private static int step= 0; \n static void hanoi(char from, char temp, char to, int n){ \n if (n == 1) {\n step++;\n System.out.println(\""m\""+step+ \""n: \""+ from+\""→\""+ to);\n }else {\n hanoi(from, to,temp,n-1);\n step++;\n System.out.println(\""m\""+step+ \""n: \""+ from+\""→\""+ to);\n hanoi(temp,from,to,n-1);\n }\n }\n}\n",COMPILE_ERROR,0,0 1338033161861128192,5236e56f7e809e62629ce1ce6f8e9c36b9eefcd50fdfc29dd1085f895173e6f1,2020-12-13 16:08:59,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"public class ccc{\n private static int step= 0; \n static void hanoi(char from, char temp, char to, int n){ \n if (n == 1) {\n step++;\n System.out.println(\""m\""+step+ \""n: \""+ from+\""→\""+ to);\n }else {\n hanoi(from, to,temp,n-1);\n step++;\n System.out.println(\""m\""+step+ \""n: \""+ from+\""→\""+ to);\n hanoi(temp,from,to,n-1);\n }\n }\n}\n",COMPILE_ERROR,0,0 1338033359798722560,8b231a58fb43563a99558f9b863f8aec1ff6ce8559959d8baa05d98356e07830,2020-12-13 16:09:47,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.util.Scanner;\nimport java.util.*;\npublic class Main{\n public static void main(String args[]){\n Scanner in = new Scanner (System.in);\n int n = in.nextInt();\n System.out.print(f(n));\n }\n public static BigInteger f(int n){\n if (n==1)\n return new BigInteger(\""1\"") ;\n else \n return (new BigInteger(\""2\"").multiply(f(n-1)).add(new BigInteger(\""1\"")));\n }\n}",COMPILE_ERROR,0,0 1338033586341470208,d530a98ef63ccc60bf8b1ae13109f1c9c3a2f73c8788f3c448083d3445bd6608,2020-12-13 16:10:41,Java,2.0,1337292647548874753,1313471683597295616,1039132196031492096,import java.util.Scanner;\npublic class Main {\n public static void main(String[] args) {\n \t Scanner scanner=new Scanner(System.in);\n \t\n \t\tint n=scanner.nextInt();\n\t System.out.println(hanoi(n));\t\n\t}\n \n static long hanoi(int n){\n \tif(n==1){\n \t\treturn 1;\n \t}else{\n \t\treturn 2*hanoi(n-1)+1;\n \t}\n } \n \n \n},PARTIAL_ACCEPTED,587,14744 1338033707259060224,8b231a58fb43563a99558f9b863f8aec1ff6ce8559959d8baa05d98356e07830,2020-12-13 16:11:09,Java,10.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.util.Scanner;\nimport java.util.*;\nimport java.math.BigInteger;\npublic class Main{\n public static void main(String args[]){\n Scanner in = new Scanner (System.in);\n int n = in.nextInt();\n System.out.print(f(n));\n }\n public static BigInteger f(int n){\n if (n==1)\n return new BigInteger(\""1\"") ;\n else \n return (new BigInteger(\""2\"").multiply(f(n-1)).add(new BigInteger(\""1\"")));\n }\n}",PARTIAL_ACCEPTED,1049,15952 1338033852725911552,d530a98ef63ccc60bf8b1ae13109f1c9c3a2f73c8788f3c448083d3445bd6608,2020-12-13 16:11:44,Java,2.0,1337292647548874753,1313471683597295616,1039132196031492096,import java.util.Scanner;\npublic class Main {\n public static void main(String[] args) {\n \t Scanner scanner=new Scanner(System.in);\n \t\n \t\tint n=scanner.nextInt();\n\t System.out.println(hanoi(n));\t\n\t}\n \n public static long hanoi(int n){\n \tif(n==1){\n \t\treturn 1;\n \t}else{\n \t\treturn 2*hanoi(n-1)+1;\n \t}\n } \n \n \n},PARTIAL_ACCEPTED,1437,15324 1338033898276052992,8b231a58fb43563a99558f9b863f8aec1ff6ce8559959d8baa05d98356e07830,2020-12-13 16:11:55,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.util.Scanner;\nimport java.util.*;\nimport java.math.BigInteger;\npublic class Main{\n public static void main(String args[]){\n Scanner in = new Scanner (System.in);\n int n = in.nextInt();\n System.out.print(f(n));\n }\n public static BigInteger f(int n){\n if (n==1)\n return new BigInteger(\""1\"") ;\n else \n return (new BigInteger(\""2\"").multiply(f(n-1)).add(new BigInteger(\""1\"")));\n }\n}",ACCEPTED,1002,21948 1338034281446699008,fcb81641ce3fa924639d739535de90dfaa54d890c92124118a3ae42482ba43be,2020-12-13 16:13:26,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n static BigInteger count(int number) {\n\t\tif(number==1) {\n//\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n//\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));}\n}\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n}\n\n",ACCEPTED,968,19948 1338034944297725952,b27c588823804420e5a3cb2598e585b1f23a06da8953a7ddf79d51e03c8ec4b1,2020-12-13 16:16:04,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\n\npublic class javaq {\n\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n//\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n//\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}",COMPILE_ERROR,0,0 1338035020931850240,d14dd9adcf2d7561c26361c91b3b45c420ca82fe78873e80c8f6e4999ab036d2,2020-12-13 16:16:23,Java,8.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n//\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n//\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n\n}\n",PARTIAL_ACCEPTED,954,15248 1338035071292862464,b27c588823804420e5a3cb2598e585b1f23a06da8953a7ddf79d51e03c8ec4b1,2020-12-13 16:16:35,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\n\npublic class javaq {\n\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n//\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n//\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n}",COMPILE_ERROR,0,0 1338035118348759040,d14dd9adcf2d7561c26361c91b3b45c420ca82fe78873e80c8f6e4999ab036d2,2020-12-13 16:16:46,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n//\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n//\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n\n}\n",ACCEPTED,1099,20492 1338035255162761216,b27c588823804420e5a3cb2598e585b1f23a06da8953a7ddf79d51e03c8ec4b1,2020-12-13 16:17:18,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\n\npublic class Main {\n\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n",COMPILE_ERROR,0,0 1338035886195793920,6e7d5784f041dc7b8141d7387384d997a6b127246414892f5856fe6c3ea0d6c6,2020-12-13 16:19:49,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.util.Scanner;\nimport java.math.BigInteger;\npublic class Main{\n\t\tstatic BigInteger count(int number) {\n\t\t\tif(number==1) {\n\t\t\t\treturn new BigInteger(\""1\"");\n\t\t\t}else {\n\t\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic static void main(String[] args) {\n\t\t\tScanner s=new Scanner(System.in);\n\t\t\tint number = s.nextInt();\n\t\t}\n}\n",WRONG_ANSWER,662,15152 1338035926335283200,b27c588823804420e5a3cb2598e585b1f23a06da8953a7ddf79d51e03c8ec4b1,2020-12-13 16:19:59,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\n\npublic class Main {\n\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n\n}",COMPILE_ERROR,0,0 1338036089565016064,b27c588823804420e5a3cb2598e585b1f23a06da8953a7ddf79d51e03c8ec4b1,2020-12-13 16:20:37,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\n\npublic class Main {\n\n\tstatic BigInteger count(int number) {\n\t\tif(number==1) {\n\t\t\treturn 1;\n\t\t\treturn new BigInteger(\""1\"");\n\t\t}else {\n\t\t\treturn count(number-1)*2+1;\n\t\t\treturn count(number-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint number = s.nextInt();\n\t\tSystem.out.println(count(number));\n\t}\n\n}",COMPILE_ERROR,0,0 1338037061028732928,7ade1058b657b6724d75db774d44bcefe9bb89de2483fadb48d1f90eb295cf01,2020-12-13 16:24:29,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n\n\n\t\tpublic static void main(String args[]) {\n\t\t\tScanner s = new Scanner(System.in);\n\t\t\tint num = s.nextInt();\n\t\t\tSystem.out.println(f(num));\n\n\t\t\t\n\t\t}\n\t\tpublic static BigInteger f(int n) {\n\t\t\tif(n == 1) {\n\t\t\t\treturn new BigInteger(\""1\"");\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn f(n-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t\t}\n\t\t}\n\t\t\n}",ACCEPTED,1058,20968 1338037109170958336,7ade1058b657b6724d75db774d44bcefe9bb89de2483fadb48d1f90eb295cf01,2020-12-13 16:24:41,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n\n\n\t\tpublic static void main(String args[]) {\n\t\t\tScanner s = new Scanner(System.in);\n\t\t\tint num = s.nextInt();\n\t\t\tSystem.out.println(f(num));\n\n\t\t\t\n\t\t}\n\t\tpublic static BigInteger f(int n) {\n\t\t\tif(n == 1) {\n\t\t\t\treturn new BigInteger(\""1\"");\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn f(n-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n\t\t\t}\n\t\t}\n\t\t\n}",ACCEPTED,762,20332 1338037337974435840,d530a98ef63ccc60bf8b1ae13109f1c9c3a2f73c8788f3c448083d3445bd6608,2020-12-13 16:25:35,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,import java.util.Scanner;\npublic class Main {\n public static void main(String[] args) {\n \t Scanner scanner=new Scanner(System.in);\n \t\t\n \t\tdouble n=scanner.nextDouble();\n\t System.out.println(+hanoi(n));\t\n\t}\n \n static double hanoi(double n){\n \tif(n==1){\n \t\treturn 1;\n \t}else{\n \t\treturn 2*hanoi(n-1)+1;\n \t}\n } \n \n \n},WRONG_ANSWER,741,18956 1338039970126684160,9c164f79bc6301de3cf0906144bf3bb7e1e2a91823eadd1d0c850ac7c10ca6a1,2020-12-13 16:36:03,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.util.Scanner;\nimport java.math.BigInteger;\npublic class Main{\n public static void main(Strung[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n System.out.println(f(n));\n }\n public static int f(int n){\n if(n==1)\n return 1;\n else{\n return f(n-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n }\n }\n}",COMPILE_ERROR,0,0 1338040026934337536,9c164f79bc6301de3cf0906144bf3bb7e1e2a91823eadd1d0c850ac7c10ca6a1,2020-12-13 16:36:16,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.util.Scanner;\nimport java.math.BigInteger;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n System.out.println(f(n));\n }\n public static int f(int n){\n if(n==1)\n return 1;\n else{\n return f(n-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n }\n }\n}",COMPILE_ERROR,0,0 1338040163849007104,9c164f79bc6301de3cf0906144bf3bb7e1e2a91823eadd1d0c850ac7c10ca6a1,2020-12-13 16:36:49,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.util.Scanner;\nimport java.math.BigInteger;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n System.out.println(f(n));\n }\n public static int f(int n){\n if(n==1)\n return 1;\n else{\n return f(n-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n }\n }\n}",COMPILE_ERROR,0,0 1338040245952503808,9c164f79bc6301de3cf0906144bf3bb7e1e2a91823eadd1d0c850ac7c10ca6a1,2020-12-13 16:37:08,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.util.Scanner;\nimport java.math.BigInteger;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n System.out.println(f(n));\n }\n public static int f(int n){\n if(n==1)\n return 1;\n else{\n return f(n-1)multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n }\n }\n}",COMPILE_ERROR,0,0 1338040276650614784,9c164f79bc6301de3cf0906144bf3bb7e1e2a91823eadd1d0c850ac7c10ca6a1,2020-12-13 16:37:16,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.util.Scanner;\nimport java.math.BigInteger;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n System.out.println(f(n));\n }\n public static int f(int n){\n if(n==1)\n return 1;\n else{\n return f(n-1) multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n }\n }\n}",COMPILE_ERROR,0,0 1338040443688771584,9c164f79bc6301de3cf0906144bf3bb7e1e2a91823eadd1d0c850ac7c10ca6a1,2020-12-13 16:37:56,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.util.Scanner;\nimport java.math.BigInteger;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n System.out.println(f(n));\n }\n public static int f(int n){\n if(n==1)\n return 1;\n else{\n return f(n-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n }\n }\n}",COMPILE_ERROR,0,0 1338041321091031040,d530a98ef63ccc60bf8b1ae13109f1c9c3a2f73c8788f3c448083d3445bd6608,2020-12-13 16:41:25,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.math.BigDecimal;\nimport java.text.DecimalFormat;\nimport java.time.format.DecimalStyle;\nimport java.util.Scanner;\npublic class Main {\n public static void main(String[] args) {\n \t Scanner scanner=new Scanner(System.in);\n \t\t\n \t\tdouble n=scanner.nextDouble();\n//\t System.out.println(hanoi(n));\n//\t String str = new BigDecimal(hanoi(n)).toString();\n\t DecimalFormat decimalFormat = new DecimalFormat(\""###\"");\n\t System.out.println(decimalFormat.format(hanoi(n)));\n\t \n\t}\n \n public static double hanoi(double n){\n \tif(n==1){\n \t\treturn 1;\n \t}else{\n \t\treturn 2*hanoi(n-1)+1;\n \t}\n } \n// Double double1 = 123456789.123456789;\n//\tDecimalFormat decimalFormat = new DecimalFormat(\""#,##0.00\"");//格式化设置\n//\tSystem.out.println(decimalFormat.format(double1));\n//\tSystem.out.println(double1);\n//// \n}",WRONG_ANSWER,980,18424 1338041631163342848,d530a98ef63ccc60bf8b1ae13109f1c9c3a2f73c8788f3c448083d3445bd6608,2020-12-13 16:42:39,Java,2.0,1337292647548874753,1313471683597295616,1039132196031492096,import java.util.Scanner;\npublic class Main {\n public static void main(String[] args) {\n \t Scanner scanner=new Scanner(System.in);\n \t\n \t\tint n=scanner.nextInt();\n\t System.out.println(hanoi(n));\t\n\t}\n \n public static long hanoi(int n){\n \tif(n==1){\n \t\treturn 1;\n \t}else{\n \t\treturn 2*hanoi(n-1)+1;\n \t}\n } \n \n \n},PARTIAL_ACCEPTED,659,14992 1338041840169705472,33ad9102e5b19122d58d8cae235f7783834efdf54c6e13ca16e3596c8ece45cc,2020-12-13 16:43:28,Java,0.0,1337292647548874753,1313471683597295616,1039132196031492096,"public class main(){\n static Biglnteger count(int number){\n if(number==1){\n return 1;\n return new biglnteger(\""1\"");\n \n }else{\n return count(number-1)*2+1;\n return count(number-1).multiply(new biglnteger(\""2\"")).add(new biglnteger(\""1\""))\n }\n \n }\n public static void main(String[] args){\n Scanner c=new Scanner(System.in);\n int number =c.nextln();\n System.out.println(count(number));\n }\n}",COMPILE_ERROR,0,0 1338042069992398848,9c164f79bc6301de3cf0906144bf3bb7e1e2a91823eadd1d0c850ac7c10ca6a1,2020-12-13 16:44:23,Java,12.0,1337292647548874753,1313471683597295616,1039132196031492096,"import java.util.Scanner;\nimport java.math.BigInteger;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n System.out.println(f(n));\n }\n public static BigInteger f(int n){\n if(n==1)\n return new BigInteger(\""1\"");\n else{\n return f(n-1).multiply(new BigInteger(\""2\"")).add(new BigInteger(\""1\""));\n }\n }\n}",ACCEPTED,1130,20960 1580538493905936384,e9cd5f072d115f0721ada47dd545bdca7f616886869c049ec09821f0edd5519d,2022-10-13 20:38:36,C++,300.0,1580527157662965765,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint main() {\n int N, K;\n cin >> N >> K;\n int x;\n for (int i = 1; i <= N; ++i) cin >> x;\n for (int i = 1; i <= N; ++i) {\n if (K * i - (i - 1) >= N) {\n cout << i;\n return 0;\n }\n }\n return 0;\n}",ACCEPTED,871,896 1580543149910540288,cb6fad0d1c4cee515d36b069990f02c420f5315ac767fd49818c19e75b4f24b7,2022-10-13 20:57:06,C++,300.0,1580527157662965765,1580523125900832768,1039131349729988608,"\n#include \n#define ll long long\n#define endl '\\n'\n#define pb push_back\n#define maxn 1000011\nusing namespace std;\n\nconst ll mod = 1e9+7;\ninline ll rd() { ll res,op = 1; char ch; while((ch=getchar())<'0' || ch > '9') \n if(ch == '-') op = -1; res = (ll)(ch - '0'); while((ch = getchar())<='9' && ch >= '0') \n res = (res<<1) + (res<<3) + (ll)(ch - '0'); return res * op; }\nll power(ll al,ll kl) { al %= mod; if (al == 1 || al == 0) return al; ll base = 1LL; \n while(kl) { if(kl & 1) base = base * al % mod; al = al * al % mod; kl >>= 1; } return base;}\n\nll n, k;\nint a[maxn];\nint main() {\n ios::sync_with_stdio(0);cin.tie(0);\n\n cin >> n >> k;\n int pos;\n for (int i = 1; i <= n; i++) {\n cin >> a[i];\n if (a[i] == n) {\n pos = i;\n }\n }\n printf(\""%d\\n\"", (n + k - 2) / (k - 1));\n\n \n\n return 0;\n}",ACCEPTED,317,4156 1580564914279825408,9c28bf83ad8e12f0d019de03e7afd1a0720c920a1d0fa6c8e535a222dbeb5f9a,2022-10-13 22:23:35,C++,300.0,1580527157662965765,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint n,k,pos,sum;\n\nint main()\n{\n\tcin>>n>>k;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tint x;\n\t\tscanf(\""%d\"",&x);\n\t}\n\tcout<\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair pr;\n#define xx first\n#define yy second\n#define mp make_pair\n#define pb push_back\n#define SZ(x) ((int)x.size())\ntemplateinline void qmax(T &x,const T &y){if(xinline void qmin(T &x,const T &y){if(x>y) x=y;}\n\ninline int read(){\n\tint w=0,f=1; char c;\n\twhile(!isdigit(c=getchar())) c=='-'&&(f=-1);\n\twhile(isdigit(c)) w=w*10+(c^48),c=getchar();\n\treturn w*f;\n}\n\n#define N 2000005\n#define P 998244353\n#define inf 2147483647\n#define inf2 9223372036854775807\n\nint n,k,ans,pos;\nint a[N];\n\nint main(){\n\tint i,j;\n\tn=read(),k=read();\n\tfor(i=1;i<=n;i++){\n\t\ta[i]=read();\n\t\tif(a[i]==n) pos=i;\n\t}\n\tfor(i=pos;i<=n;i++) i=i+k-1,ans++;\n\tfor(i=pos;i>=1;i--) i=i-k+1,ans++;\n\t\n\tcout<\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair pr;\n#define xx first\n#define yy second\n#define mp make_pair\n#define pb push_back\n#define SZ(x) ((int)x.size())\ntemplateinline void qmax(T &x,const T &y){if(xinline void qmin(T &x,const T &y){if(x>y) x=y;}\n\ninline int read(){\n\tint w=0,f=1; char c;\n\twhile(!isdigit(c=getchar())) c=='-'&&(f=-1);\n\twhile(isdigit(c)) w=w*10+(c^48),c=getchar();\n\treturn w*f;\n}\n\n#define N 2000005\n#define P 998244353\n#define inf 2147483647\n#define inf2 9223372036854775807\n\nint n,k,ans1,ans2,pos;\nint a[N];\n\nint main(){\n\tint i,j;\n\tn=read(),k=read();\n\tfor(i=1;i<=n;i++){\n\t\ta[i]=read();\n\t\tif(a[i]==n) pos=i;\n\t}\n\tfor(i=pos;i<=n;i++) i=i+k-1,ans1++;\n\tfor(i=pos;i>=1;i--) i=i-k+1,ans1++;\n\tfor(i=1;i<=n;i++)\n i=i+k-1,ans2++;\n \n\tcout<\nusing namespace std;\nint main(){\n\tint n,k;\n\tcin >> n >> k;\n\tint tmp;\n\tfor(int i = 1;i <= n;i ++){\n\t\tint x;\n\t\tscanf(\""%d\"",&x);\n\t\tif(x == n) tmp = i;\n\t}\n\tk --;\n\tint tmp1 = tmp - 1;\n\tint ans = 0;\n\tif(tmp1 > 0)\n\t\tans = ans + (tmp1 - 1) / k + 1;\n\tif(tmp1 < k)\n\t\ttmp = tmp + (k - tmp1);\n\tint tmp2 = n - tmp;\n\tif(tmp2 > 0)\n\t\tans = ans + (tmp2 - 1) / k + 1;\n\tcout << ans;\n\treturn 0;\n}",WRONG_ANSWER,319,612 1581205283346890752,e608e3fe3a5f7bf502c19ae22972cdb6fd2e7378ab4bba4d67f1e41aca28682d,2022-10-15 16:48:11,C,0.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include \nint a[10000];\nint main() {\n\tint n,k;\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(int i=1;i<=n;i++) scanf(\""%d\"",&a[i]);\n\tint maxone=1;\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\nint a[1000];\nint main() {\n\tint n,k;\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(int i=1;i<=n;i++) scanf(\""%d\"",&a[i]);\n\tint maxone=1;\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\nint a[100];\nint main() {\n\tint n,k;\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(int i=1;i<=n;i++) scanf(\""%d\"",&a[i]);\n\tint maxone=1;\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\n\nint main() {\n\tint n,k;int a[n+1];\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(int i=1;i<=n;i++) scanf(\""%d\"",&a[i]);\n\tint maxone=1;\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\n\nint main() {\n\tint n,k;int a[105];\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(int i=1;i<=n;i++) scanf(\""%d\"",&a[i]);\n\tint maxone=1;\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\n\nint main() {\n\tint n,k;int a[50];\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(int i=1;i<=n;i++) scanf(\""%d\"",&a[i]);\n\tint maxone=1;\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\n\nint main() {\n\tint n,k;int a[50];\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(int i=1;i<=n;i++) scanf(\""%d\"",&a[i]);\n\tint maxone=1;\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\nint a[10000];\nint main() {\n\tint n,k;\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(int i=1;i<=n;i++) {\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tint maxone=1;\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\nusing namespace std;\nint main()\n{\n long long n,k,max,t;\n cin>>n>>k;\n long long p[100005];\n cin>>p[1];\n max=p[1];\n for(long long i=2;i<=n;i++)\n {\n cin>>p[i];\n \n }\n if(k==n)\n cout<<\""1\"";\n else if(k\nusing namespace std;\nint main()\n{\n long long n,k;\n cin>>n>>k;\n long long p[100005];\n cin>>p[1];\n for(long long i=2;i<=n;i++)\n {\n cin>>p[i];\n }\n if(k==n)\n cout<<\""1\"";\n else if(k\nusing namespace std;\nint a[10000];\nint main() {\n\tint n,k;\n\tcin>>n>>k;\n\tfor(int i=1;i<=n;i++) {\n\t\tcin>>a[i];\n\t}\n\tint maxone=1;\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\nusing namespace std;\nint main()\n{\n long long n,k;\n cin>>n>>k;\n long long p[1000005];\n cin>>p[1];\n for(long long i=2;i<=n;i++)\n {\n cin>>p[i];\n }\n if(k==n)\n cout<<\""1\"";\n else if(k\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n int a[n+1];\n for(int i=1;i<=n;i++)\n {\n cin>>a[i];\n }\n int max=a[1],x=1;\n for(int i=2;i<=n;i++)\n {\n if(a[i]>max) max=a[i],x=i;\n }\n cout<<((n-3+1)/2+1);\n return 0;\n}\n",WRONG_ANSWER,80,1528 1581207661492097024,e608e3fe3a5f7bf502c19ae22972cdb6fd2e7378ab4bba4d67f1e41aca28682d,2022-10-15 16:57:38,C++,0.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint a[10000];\nint main() {\n\tint i,n,k,maxone=1,count=0;\n\tcin>>n>>k;\n\tfor(i=1;i<=n;i++) {\n\t\tcin>>a[i];\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\nusing namespace std;\n\nint n,k,x,ans;\n\nint main()\n{\n\tcin>>n>>k;\n\tint max=0,index=0;\n\tfor(int i=1;i<=n;++i)\n\t{\n\t\tcin>>x;\n\t\tif(x>max)\n\t\t{\n\t\t\tmax=x;\n\t\t\tindex=i;\n\t\t}\n\t}\n\tans++;\n\tfor(int i=index+k/2;i<=n;i+=k-1)\n\t\tans++;\n\tfor(int i=index-k/2-1;i>=1;i-=k-1)\n\t\tans++;\n\tcout<\nusing namespace std;\nint a[100];\nint main() {\n\tint i,n,k,maxone=1,count=0;\n\tcin>>n>>k;\n\tfor(i=1;i<=n;i++) {\n\t\tcin>>a[i];\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\nusing namespace std;\nint a[100];\nint main() {\n\tint i,n,k,maxone=1,count=0;\n\tcin>>n>>k;\n\tfor(i=1;i<=n;i++) {\n\t\tcin>>a[i];\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\nusing namespace std;\n\nint n,k,x,ans;\n\nint main()\n{\n\tcin>>n>>k;\n\tint max=0,index=0;\n\tfor(int i=1;i<=n;++i)\n\t{\n\t\tcin>>x;\n\t\tif(x>max)\n\t\t{\n\t\t\tmax=x;\n\t\t\tindex=i;\n\t\t}\n\t}\n\tans++;\n\tfor(int i=index+k/2+1;i<=n;i+=k-1)\n\t\tans++;\n\tfor(int i=index-k/2;i>=1;i-=k-1)\n\t\tans++;\n\tcout<\nint a[10000];\nint main() {\n\tint i,n,k,maxone=1,count=0;\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(i=1;i<=n;i++) {\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\nint a[100];\nint main() {\n\tint i,n,k,maxone=1,count=0;\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(i=1;i<=n;i++) {\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\n#include\n#include\n\nusing namespace std;\nint num[1000001];\n\nint main()\n{\n\tint n,k;cin >> n >> k;\n\t/*int i;\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tscanf(\""%d\"",&num[i]);\n\t\tif(num[i]==n)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t}*/\n\t\n\tif((n-1)>(k-1)*((n-1)/(k-1))) cout << (n-1)/(k-1)+1;\n\telse cout << (n-1)/(k-1);\n\n\treturn 0;\n}",ACCEPTED,33,456 1581208975873728512,671e366d53dcb27ff2d7f07c46b08ffd966c3872df69580edd6fca9d1561d15f,2022-10-15 17:02:51,C++,0.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include\n#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n int a[1000010]={};\n int xb=1;\n for(int i=1;i<=n;i++)\n {\n cin>>a[i];\n if(a[i]==n)\n {\n xb=i;\n }\n }\n int left=ceil(1.0*(xb-1)/(k-1));\n int right =ceil(1.0*(n-xb)/(k-1));\n cout<\nusing namespace std;\n\nint n,k,x,ans;\n\nint main()\n{\n\tcin>>n>>k;\n\tint max=0,index=0;\n\tfor(int i=1;i<=n;++i)\n\t{\n\t\tcin>>x;\n\t\tif(x>max)\n\t\t{\n\t\t\tmax=x;\n\t\t\tindex=i;\n\t\t}\n\t}\n\tans++;\n\tif(k%2==1)\n\t{\n\t\tfor(int i=index+k/2;i1;i-=k-1)\n\t\t\tans++;\n }\n else if(k%2==0)\n {\n \tint t1=1,t2=1;\n\t\tfor(int i=index+k/2;i1;i-=k-1)\n\t\t\tt1++;\n\t\tfor(int i=index+k/2-1;i1;i-=k-1)\n\t\t\tt2++;\t\n\t\tans=min(t1,t2);\n\t}\n\tcout<\nusing namespace std;\nint main()\n{\n long long n,k;\n cin>>n>>k;\n long long p[1000005];\n cin>>p[1];\n for(long long i=2;i<=n;i++)\n {\n cin>>p[i];\n }\n if(k==n)\n cout<<\""1\"";\n else if(kn/2&&k!=2)\n cout<<\""2\"";\n else if(k\n#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n int a[1000010]={};\n int xb=1;\n int right_sheng=(n-xb)%(k-1);\n int left_sheng=(xb-1)%(k-1);\n cout<\n#include \nusing namespace std;\n\nint main() {\n\tlong int n, k;\n\n\tlong int num;\n\tcin >> n >> k;\n\tlong int a[n];\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\n\t}\n\tn = n - 1;\n\tk = k - 1;\n\tif (n % k == 0) {\n\t\tcout << n / k;\n\t} else {\n\t\tnum = n / k + 1;\n\n\t\tcout << num;\n\t}\n\n\n}",ACCEPTED,898,7892 1581211702271983616,e16557588bd27fb8a03e3862f81b484bf86541d707cede21e55ba0147985d0ea,2022-10-15 17:13:41,C++,0.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\n\n\nint main() {\n\t\n\tint n, k, ans = 0;\n\n\tcin >> n >> k;\n\n\tint start = 0;\n\tint end = start + k - 1;\n\n\tint* a = new int[n];\n\tfor (int i = 0; i < n; ++i)\n\t\tcin >> a[i];\n\n\twhile (end <= n) {\n\t\tans += 1;\n\t\tstart = end;\n\t\tend = start + k - 1;\n\t}\n\n\tcout << ans;\n\t\n\n\t\n\treturn 0;\n\t\n}",WRONG_ANSWER,71,1580 1581211800334819328,776e7a9247f09fdcd7c88591056d3ed63fbc392e1a425acafc735ac8187dbe9e,2022-10-15 17:14:05,C++,0.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint main(){\n\tint n,flag=0;\n\tcin>>n;\n\tint k,a[n];\n\tcin>>k;\n\tfor(int i=0;i>a[i];\n\t}\n\tfor(int j=1;j<=n-k+1;j++){\n\t\tsort(a+1,a+n-k+2);\n\t\tint m=a[n-k+1];\n\t\ta[j]=m;\n\t\tflag++;\n\t\t\n\t}\n\tcout<\nusing namespace std;\nint main(){\n\tint n,flag=0;\n\tcin>>n;\n\tint k,a[n];\n\tcin>>k;\n\tfor(int i=0;i>a[i];\n\t}\n\tfor(int j=1;j<=n-k+1;j++){\n\t\tsort(a+1,a+n-k+2);\n\t\tint m=a[n-k+1];\n\t\ta[j]=m;\n\t\tflag++;\n\t\t\n\t}\n\tcout<\nusing namespace std;\nint main(){\n\tcout<<3;\n},WRONG_ANSWER,4,308 1581212139830173696,7e9ee31a6e6568d1752240d051b460eaca118d483faad2268a6ffa105bb524a3,2022-10-15 17:15:26,C++,300.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\n#define ll long long\n#define rep(i,a,b) for(ll i=a;i<=b;i++)\n\nint main() {\n\tdouble n, k;\n\tcin >> n >> k;\n\tdouble a;\n\tdouble temp = 0;\n\tdouble index;\n\trep(i, 1, n) {\n\t\tcin >> a;\n\t\tif (temp < a) {\n\t\t\ttemp = a;\n\t\t\tindex = i;\n\t\t}\n\t}\n\tdouble end = n - index;\n\tif (index >= k && end <= k) {\n\t\tcout << ceil((index - 1) / (k - 1) ) + ceil((end - 1) / (k - 1) );\n\t}\n\telse {\n\t\tcout << ceil((n - 1) / (k - 1));\n\t}\n\treturn 0;\n}",ACCEPTED,1342,456 1581213119099486208,e16557588bd27fb8a03e3862f81b484bf86541d707cede21e55ba0147985d0ea,2022-10-15 17:19:19,C++,300.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\n\n\nint main() {\n\t\n\tint n, k, ans = 0;\n\n\tcin >> n >> k;\n\n\tint start = 0;\n\tint end = start + k - 1;\n\n\tint* a = new int[n];\n\tfor (int i = 0; i < n; ++i)\n\t\tcin >> a[i];\n\n\twhile (start < n) {\n\t\tans += 1;\n\t\tstart = end;\n\t\tend = start + k - 1;\n\t\tif (start < n && a[start + 1] == n ) {\n\t\t\tstart++;\n\t\t\tend++;\n\t\t}\n\n\t}\n\n\tcout << ans;\n\t\n\n\t\n\treturn 0;\n\t\n}\n",ACCEPTED,913,4088 1581213540794818560,0805053007d2c06c307492b3f2fcf5603b92a87b38143a2028732dbb90e4c9a5,2022-10-15 17:21:00,C++,0.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n\tint n,k,s,js=0;\n\tcin>>n>>k;\n\tint a[n];\t\n\tfor(int i=0;i>a[i];\n\t\tif(a[i]==n)s=i;\n\t}\n\t\n\tif(s==0||s==n-1)\n\t{\n\t\tif((n-1)%2==0)js=(n-1)/2;\n\t\telse js=(n-1)/2+1;\n\t}\n\telse if(s==1||s==2||s==n-2||s==n-3)\n\t{\n\t\tif((n-3)%2==0)js=1+(n-3)/2;\n\t\telse js=2+(n-3)/2;\n\t}\n\telse if(n%2==0)js=n/2;\n\telse js=(n-1)/2;\n\t\n\tcout<\nusing namespace std;\nint main()\n{\n\tint n,k,r,js=0;\n\tcin>>n>>k;\n\tint a[n];\t\n\tfor(int i=0;i>a[i];\n\t\tif(a[i]==n)r=i;\n\t}\n\tif(n==1)js=0;\n\tif(n==2||n==3)js=1;\n\telse if(r==0||r==n-1)\n\t{\n\t\tif((n-1)%2==0)js=(n-1)/2;\n\t\telse js=(n-1)/2+1;\n\t}\n\telse if(r==1||r==2||r==n-2||r==n-3)\n\t{\n\t\tif((n-3)%2==0)js=1+(n-3)/2;\n\t\telse js=2+(n-3)/2;\n\t}\n\telse if(n%2==0)js=n/2;\n\telse js=(n-1)/2;\n\t\n\tcout<\nusing namespace std;\nint main()\n{\n\tlong long n,k,r,js=0;\n\tcin>>n>>k;\n\tint a[n];\t\n\tfor(int i=0;i>a[i];\n\t\tif(a[i]==n)r=i;\n\t}\n\tif(n==1)js=0;\n\tif(n==2||n==3)js=1;\n\telse if(r==0||r==n-1)\n\t{\n\t\tif((n-1)%2==0)js=(n-1)/2;\n\t\telse js=(n-1)/2+1;\n\t}\n\telse if(r==1||r==2||r==n-2||r==n-3)\n\t{\n\t\tif((n-3)%2==0)js=1+(n-3)/2;\n\t\telse js=2+(n-3)/2;\n\t}\n\telse if(n%2==0)js=n/2;\n\telse js=(n-1)/2;\n\t\n\tcout<\nint a[1000];\nint main() {\n\tint i,n,k,maxone=1,count=0;\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(i=1;i<=n;i++) {\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\nusing namespace std;\nint main()\n{\n int n,k,m=1;\n cin>>n>>k;\n int a[1005];\n for(int i=1;i<+n;i++)\n {\n cin>>a[i];\n if(a[i]==n)\n {\n m=i;\n }\n }\n int t=((m-1)/(k-1))+((m-1)%(k-1))+((n-m)/(k-1))+((n-m)%(k-1));\n cout<\nusing namespace std;\nint main()\n{\n int n,k,m=1;\n cin>>n>>k;\n int a[n+1];\n for(int i=1;i<+n;i++)\n {\n cin>>a[i];\n if(a[i]==n)\n {\n m=i;\n }\n }\n int t=((m-1)/(k-1))+((m-1)%(k-1))+((n-m)/(k-1))+((n-m)%(k-1));\n cout<\nint a[10];\nint main() {\n\tint i,n,k,maxone=1,count=0;\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(i=1;i<=n;i++) {\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\nusing namespace std;\nint main(){\n\tint n,k;\n\tcin >> n >> k;\n\tint tmp;\n\tfor(int i = 1;i <= n;i ++){\n\t\tint x;\n\t\tscanf(\""%d\"",&x);\n\t\tif(x == n) tmp = i;\n\t}\n\tk --;\n\tint tmp1 = tmp - 1;\n\tint ans = 0;\n\tif(tmp1 > 0)\n\t\tans = ans + (tmp1 - 1) / k + 1;\n\tif(tmp1 < k && tmp1 > 0)\n\t\ttmp = tmp + (k - tmp1);\n\tint tmp2 = n - tmp;\n\tif(tmp2 > 0)\n\t\tans = ans + (tmp2 - 1) / k + 1;\n\tcout << ans;\n\treturn 0;\n}",WRONG_ANSWER,298,488 1581215140330397696,e608e3fe3a5f7bf502c19ae22972cdb6fd2e7378ab4bba4d67f1e41aca28682d,2022-10-15 17:27:21,C,0.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include \nint main() {\n\tint i,n,k,maxone=1,count=0;\n\tscanf(\""%d%d\"",&n,&k);\n\tint a[105];\n\tfor(i=1;i<=n;i++) {\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[maxone]\nusing namespace std;\nint main()\n{\n\tint n,k,r,js=0,i;\n\tcin>>n>>k;\n\tint a[n];\t\n\tfor(i=0;i>a[i];\n\t}\n\tfor(r=-1;r\nint main() {\n\tint i,n,k,maxone=1,count=0;\n\tscanf(\""%d%d\"",&n,&k);\n\tint a[105];\n\tfor(i=1;i<=n;i++) {\n\t\tscanf(\""%d\"",&a[i]);if(a[maxone]\nint main() {\n\tint i,n,k,maxone=1,max=0,number,count=0;\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(i=1;i<=n;i++) {\n\t\tscanf(\""%d\"",&number);\n\t\tif(max\n#define pii pair\ntypedef long long ll;\nconst double PI = acos(-1.0);\nconst double eps = 1e-8;\n#define Equ(a,b) ((fabs((a)-(b))) < (eps))\n#define More(a,b) (((a)-(b)) > (eps))\n#define Less(a,b) (((a)-(b)) < (eps))\n#define INF 0x3f3f3f3f3f3f3f3f\n#define MOD 1000000007\n#define int long long\n#define fi first\n#define se second\n#define mem(a,b) memset(a,b,sizeof(a))\n#define endl '\\n'\n#define lowbit(x) x&(-x)\n#define IO ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\nusing namespace std;\nsigned main()\n{\n int n,k;\n cin>>n>>k;\n cout<<((n-3)+1)/2+1;\n return 0;\n}",WRONG_ANSWER,4,320 1581217377278550016,e608e3fe3a5f7bf502c19ae22972cdb6fd2e7378ab4bba4d67f1e41aca28682d,2022-10-15 17:36:14,C,0.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include \nint main() {\n\tint i,n,k,maxone=1,max=0,number,count=0;\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(i=1;i<=n;i++) {\n\t\tscanf(\""%d\"",&number);\n\t\tif(max\nusing namespace std;\nconst int N = 1e6 + 10;\nint a[N],f[N];\nint main()\n{\n int n,k;\n cin >> n >> k;\n int sum = 0;\n for(int i = 1;i <= n;i++){\n cin >> a[i];\n if(a[i] == n){\n if((i - 1) % (k - 1) == 0) sum += (i - 1) / (k - 1);\n else{\n sum += (i - 1) / (k - 1) + 1;\n }\n if((n - i) % (k - 1) == 0) sum += (n - i) / (k - 1);\n else{\n sum += (n - i) / (k - 1) + 1;\n }\n break;\n }\n }\n cout << sum;\n return 0;\n}",WRONG_ANSWER,8,568 1581218846769725440,0805053007d2c06c307492b3f2fcf5603b92a87b38143a2028732dbb90e4c9a5,2022-10-15 17:42:05,C++,0.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n\tint n,k,r=0,js=0,i;\n\tcin>>n>>k;\n\tint a[n];\t\n\tfor(i=0;i>a[i];\n\t}\n\tfor(r=-1;r\nusing namespace std;\nconst int maxn = 1e6+5;\nint dp[maxn],a[maxn];\nint main()\n{\n\n int n,k,id=0;\n cin>>n>>k;\n for (int i=1; i<=n; i++)\n {\n cin>>a[i];\n if (a[i]==n) id=i;\n }\n int l,r;\n l=id-1;\n\n r=n-id;\n k--;\n int ans=0;\n if (l%k==0) ans=ans+l/k;\n else ans=ans+l/k+1;\n if (r%k==0) ans=ans+r/k;\n else ans=ans+r/k+1;\n cout<\nusing namespace std;\nint main(){\n\tint n,k;\n\tcin >> n >> k;\n\tint tmp;\n\tfor(int i = 1;i <= n;i ++){\n\t\tint x;\n\t\tscanf(\""%d\"",&x);\n\t\tif(x == n) tmp = i;\n\t}\n\tk --;\n\tint tmp1 = tmp - 1;\n\tint ans = 0;\n\tif(tmp1 > 0)\n\t\tans = ans + (tmp1 - 1) / k + 1;\n\ttmp = tmp + tmp1 % k;\n\tint tmp2 = n - tmp;\n\tif(tmp2 > 0)\n\t\tans = ans + (tmp2 - 1) / k + 1;\n\tcout << ans;\n\treturn 0;\n}",WRONG_ANSWER,63,436 1581219617443733504,022ead19dcb64d2d769e0a5f2f22ec394b24b7031ab11d98ab55b26bcf6c6024,2022-10-15 17:45:09,C++,0.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nconst int N = 1e6 + 10;\nint a[N],f[N];\nint main()\n{\n int n,k;\n cin >> n >> k;\n int sum = 0;\n for(int i = 1;i <= n;i++){\n cin >> a[i];\n if(a[i] == n){\n if(i < k){\n i = k;\n }\n if(i + k - 1 > n){\n i = n - k + 1;\n }\n if((i - 1) % (k - 1) == 0) sum += (i - 1) / (k - 1);\n else{\n sum += (i - 1) / (k - 1) + 1;\n }\n if((n - i) % (k - 1) == 0) sum += (n - i) / (k - 1);\n else{\n sum += (n - i) / (k - 1) + 1;\n }\n break;\n }\n }\n cout << sum;\n return 0;\n}",WRONG_ANSWER,78,564 1581219739116298240,209370e8f966e1d4879f9270d9a25d058ad66618184f6f4218921d08db170989,2022-10-15 17:45:38,C++,300.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint main(){\n\tint n,k;\n\tcin >> n >> k;\n\tint tmp;\n\tfor(int i = 1;i <= n;i ++){\n\t\tint x;\n\t\tscanf(\""%d\"",&x);\n\t\tif(x == n) tmp = i;\n\t}\n\tk --;\n\tint tmp1 = tmp - 1;\n\tint ans = 0;\n\tif(tmp1 > 0)\n\t\tans = ans + (tmp1 - 1) / k + 1;\n\ttmp = tmp + (k - tmp1 % k);\n\tint tmp2 = n - tmp;\n\tif(tmp2 > 0)\n\t\tans = ans + (tmp2 - 1) / k + 1;\n\tcout << ans;\n\treturn 0;\n}",ACCEPTED,337,768 1581219822264172544,e608e3fe3a5f7bf502c19ae22972cdb6fd2e7378ab4bba4d67f1e41aca28682d,2022-10-15 17:45:57,C,300.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include \nint main() {\n\tint i,n,k,maxone=1,max=0,number,count=0;\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(i=1;i<=n;i++) {\n\t\tscanf(\""%d\"",&number);\n\t\tif(max\nusing namespace std;\nint n,m,k,a[1000001],b[1000001],ans;\nint main()\n{\n\tcin>>n>>k;\n\tfor (int i=1;i<=n;i++) \n\t{\n\t\tcin>>a[i];\n\t\tif (a[i]==n) b[++m]=i;\n\t}\n\tm++;\n\tb[m]=m;\n\tfor (int i=0;i<=m;i++)\n\t{\n\t\tint len=b[i+1]-b[i]-1;\n\t\tif (len<=k) ans++;\n\t\telse \n\t\t{\n\t\t ans+=len/3;\n\t\t\tif (len%k!=0) ans++;\n\t\t}\n\t}\n\tcout<\nusing namespace std;\nint main()\n{\n\tint arr[1000000],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=0;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nconst int maxn = 1e6+5;\nint dp[maxn],a[maxn];\nint main()\n{\n\n int n,k,id=0;\n cin>>n>>k;\n for (int i=1; i<=n; i++)\n {\n cin>>a[i];\n if (a[i]==n) id=i;\n }\n int l,r;\n l=id-1;\n\n r=n-id;\n k--;\n int ans=0;\n if (l%k==0) ans=ans+l/k;\n else \n {\n ans=ans+l/k+1;\n r=n-(id-l%k+k);\n }\n if (r%k==0) ans=ans+r/k;\n else ans=ans+r/k+1;\n cout<\nusing namespace std;\n\nint n,k,x,ans;\n\nint main()\n{\n\tcin>>n>>k;\n\tint max=0,index=0;\n\tfor(int i=1;i<=n;++i)\n\t{\n\t\tcin>>x;\n\t\tif(x>max)\n\t\t{\n\t\t\tmax=x;\n\t\t\tindex=i;\n\t\t}\n\t}\n\tans++;\n\tif(indexn-k)\n\t\tindex=n-k;\n\tif(k%2==1)\n\t{\n\t\tfor(int i=index+k/2;i1;i-=k-1)\n\t\t\tans++;\n }\n else if(k%2==0)\n {\n \tint t1=1,t2=1;\n\t\tfor(int i=index+k/2;i1;i-=k-1)\n\t\t\tt1++;\n\t\tfor(int i=index+k/2-1;i1;i-=k-1)\n\t\t\tt2++;\t\n\t\tans=min(t1,t2);\n\t}\n\tcout<\nusing namespace std;\nint main(){\n int n,m;\n cin>>n>>m;\n int a[n+1];\n for(int i=1;i<=n;i++){\n cin>>a[i];\n }\n int j=1;\n int x=0;\n while(j<=n-m+1){\n int b=j;\n for(int i=j;i<=j+m-1;i++){\n a[i]=n;\n b++;\n }\n j=b;\n \n while(a[j]=a[j+1]){\n j++;\n }\n x++;\n }\n}",RUNTIME_ERROR,75,1584 1581222366101164032,a65c83f82d9b53221fc073bba9f631796070aaaac4ed8a976085d4e9b3d4084e,2022-10-15 17:56:04,C++,300.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include\n#include\n#include\n#include\n#include\nusing namespace std;\nint a[1000010];\nint main()\n{\n\tint n,k;\n\tint p;\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(int i=1;i<=n;++i)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t\tif(a[i]==n) p=i;\n\t}\n\tint ans=0;\n\t\n\t\n\t\tans=n/(k-1);\n\t\tif(n%(k-1)!=0) ++ans;\n\tprintf(\""%d\"",ans);\n\t\n\treturn 0;\n } ",ACCEPTED,317,4012 1581222936505532416,3aca2995577beb9c8ac4bbaea357a6187d8cc8778f16735a69ac4b9131be46c3,2022-10-15 17:58:20,C++,0.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n\tint arr[100],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=1;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint main()\n{\n long long n,k;\n cin>>n>>k;\n long long p[1000005];\n cin>>p[1];\n for(long long i=2;i<=n;i++)\n {\n cin>>p[i];\n }\n if(n%k==0)\n cout<\nusing namespace std;\nint main()\n{\n\tint arr[100],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=2;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint main()\n{\n\tint arr[100],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=2;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint a[1000003];\nint main() {\nint n,k,num;\ncin>>n>>k;\nnum = n-k;\nint ans = 0;\nint max=-1000,maxn=0;\nfor(int i=0;i>a[i];\nif(a[i]>max)\n{max = a[i];\nmaxn = i;}\n}\nans+=maxn/num+1;\nans+=(n-1-maxn)/num;\ncout<\nusing namespace std;\nint main()\n{\n\tint arr[100],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=2;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint a[1000003];\nint main() {\nint n,k,num;\ncin>>n>>k;\nnum = n-k;\nint ans = 0;\nint max=-1000,maxn=0;\nfor(int i=0;i>a[i];\nif(a[i]>max)\n{max = a[i];\nmaxn = i;}\n}\nans+=maxn/num+1;\nans+=(n-1-maxn)/num+1;\ncout<\nusing namespace std;\nint a[1000003];\nint main() {\nint n,k,num;\ncin>>n>>k;\nnum = n-k;\nint ans = 0;\nint max=-1000,maxn=0;\nfor(int i=0;i>a[i];\nif(a[i]>max)\n{max = a[i];\nmaxn = i;}\n}\nans+=maxn/num+1;\nans+=(n-1-maxn)/num+1;\ncout<\nusing namespace std;\nint main()\n{\n\tint arr[100],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=2;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint main()\n{\n\tint arr[100],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=2;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint main()\n{\n\tint arr[100],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=2;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint main()\n{\n\tint n,k;\n\tcin>>n>>k;\n\tfor(int i=0;i>x;\n\t}\n\tint ans;\n\tif((n-1)%(k-1)==0) ans=(n-1)/(k-1);\n\telse ans=(n-1)/(k-1)+1;\n\tcout<\nusing namespace std;\nint main()\n{\n\tint arr[1000000],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=0;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint main()\n{\n\tint arr[1000000],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=0;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint main()\n{\n\tint n,k,r,js=0,i;\n\tcin>>n>>k;\n\tint a[n];\t\n\tfor(i=0;i>a[i];\n\t}\n\tfor(r=-1;r0&&r<=k-1||rn-k)\n\t{\n\t\tif((n-k)%(k-1)==0)js=1+(n-k)/(k-1);\n\t\telse js=2+(n-k)/(k-1);\n\t}\n\telse if(n%2==0)js=n/2;\n\telse js=(n-1)/2;\n\t\n\tcout<\n#include \nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n int a[n];\n for(int i=0; i>a[i];\n }\n cout<<3<\nusing namespace std;\nint main()\n{\n\tint arr[1000000],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=1;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint n,k,a[2000001],maxx=-1e9,bj,ans=0;\nint main(){\n\tcin>>n>>k;\n\tfor(int i=1;i<=n;i++)cin>>a[i],maxx=max(maxx,a[i]);\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[i]==maxx){\n\t\t\tbj=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tint cnt=1;\n\twhile(cnt\nusing namespace std;\nint main()\n{\n\tint arr[1000000],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=2;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\n#include\n#incllude\nusing namespace std; \nint main() {\n\tint a,b;\n\tcin>>a>>b;\n\tint p[a];\n\tfor(int i=0;i>p[i];\n\t}\n\tint j;\n\tint x=j+k-2;\n\tsort(p,p+x);\n\t\n\t\n\t\n\t}\n",COMPILE_ERROR,0,0 1581225246572986368,0805053007d2c06c307492b3f2fcf5603b92a87b38143a2028732dbb90e4c9a5,2022-10-15 18:07:31,C++,0.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n\tint n,k,r,js=0,i;\n\tcin>>n>>k;\n\tint a[n];\t\n\tfor(i=0;i>a[i];\n\t}\n\tfor(r=-1;r0&&r<=k-1)||(rn-k))\n\t{\n\t\tif((n-k)%(k-1)==0)js=1+(n-k)/(k-1);\n\t\telse js=2+(n-k)/(k-1);\n\t}\n\telse if(n%2==0)js=n/2;\n\telse js=(n-1)/2;\n\t\n\tcout<\nusing namespace std;\nint main()\n{\n\tint arr[1000000],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=2;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint main()\n{\n\tint arr[1000000],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=1;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint main()\n{\n\tint arr[1000000],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=2;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint main()\n{\n\tint arr[1000000],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=3;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint main()\n{\n\tint arr[1000000],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=3;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint main()\n{\n\tint arr[1000000],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=2;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint main()\n{\n\tint arr[1000000],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=1;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\nusing namespace std;\nint main()\n{\n\tint n,k,r,js=0,i;\n\tcin>>n>>k;\n\tint a[n];\t\n\tfor(i=0;i>a[i];\n\t}\n\tfor(r=-1;r0&&r<=k-1)||(rn-k))\n\t\t{\n\t\t\tif((n-k)%(k-1)==0)js=1+(n-k)/(k-1);\n\t\t\telse js=2+(n-k)/(k-1);\n\t\t}\n\t\telse if(n%2==0)js=n/2;\n\t\telse js=(n-1)/2;\n\t\t\n\t\tcout<\nusing namespace std;\nint main()\n{\n\tint arr[1000000],j=0;\n\tint n, k,out;\n\tcin >>n>> k;\n\twhile (n--)\n\t{\n\t\tcin >> arr[j];\n\t\tj++;\n\t}\n\tout = n - k + 1;\n\tint max = 0,count=0;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif(max\n#include \nusing namespace std;\nint main(){\n int n,k;\n cin>>n>>k;\n int a[n];\n int b[n];\n int num=0;\n for (int i=0;i>a[i];\n a[i]=b[i];\n }\n int b=n-k-1;\n sort(b,b+n);\n int max=b[n-1];\n for (int i=0;i\n#include \nusing namespace std;\nint main(){\n int n,k;\n cin>>n>>k;\n int a[n];\n int b[n];\n int num=0;\n for (int i=0;i>a[i];\n a[i]=b[i];\n }\n int s=n-k-1;\n sort(b,b+n);\n int max=b[n-1];\n for (int i=0;i\nusing namespace std;\nint main()\n{\n long long n,k;\n cin>>n>>k;\n long long p[1000005];\n\n for(long long i=1;i<=n;i++)\n {\n cin>>p[i];\n }\n if(n%k==0)\n cout<\nusing namespace std;\nint main()\n{\n\tint n,k;\n\tcin>>n;\n\tint T[n+5];\n\tfor(int i=1;i<=n;i++)\n\tcin>>T[i];\n\t//每次都是1到k+1-1,k到k+k-1, \n\tint j=1,d=0;\n\twhile(1)\n\t{\n\t\tif(j==n)\n\t\tbreak;\n\t\t//找到有线段的最大值 \n\t\tint max=T[j];\n\t\tfor(int i=j;i<=j+k-1;i++)\n\t\t{\n\t\t\tif(T[i]>max)\n\t\t\tmax=T[i];\n\t\t}\n\t\t//将有线段变为最大值\n\t for(int i=j;i<=j+k-1;i++)\n\t {\n\t \tT[i]=max;\n\t\t}\n\t\td++;\n\t\tj=j+k-1;\n\t\tif(j+k-1>n)\n\t\tj=n-k+1;\n\t}\n\tcout<\n#include \n#include \nusing namespace std;\nint main(){\n int n,k;\n cin>>n>>k;\n int a[n];\n int b[n];\n int num=0;\n for (int i=0;i>a[i];\n a[i]=b[i];\n }\n int s=n-k-1;\n sort(b,b+n);\n int max=b[n-1];\n for (int i=0;i\n#include \n\nusing namespace std;\n\nint main()\n{\n int n,k,m;\n cin>>n>>k;\n int a[n];\n for(int i=0;i>a[i];\n }\n for(int j=0;j\n#include \nusing namespace std;\nint main()\n{ \n int max,max_,t;\n double k;\n int n;\n cin>>n>>k;\n int p[n+1];\n for(int i=1;i<=n;i++)\n {\n cin>>p[i];\n if(p[i]>max){max=p[i];max_=i;}\n }\n if(max_<=k) t=ceil((n-1)/(k-1));\n else if(max_>=(n-k)) t=ceil((n-1)/(k-1));\n else t=ceil((n-1)/(k-1));\n cout<\n#include \n#include \nusing namespace std;\nint main(){\n int n,k;\n cin>>n>>k;\n int a[n];\n int b[n];\n int num=0;\n int flag;\n for (int i=0;i>a[i];\n a[i]=b[i];\n }\n int s=n-k-1;\n sort(b,b+n);\n int max=b[n-1];\n for (int i=0;i\nusing namespace std;\nint main()\n{\n\tint n,k,r,js=0,i;\n\tcin>>n>>k;\n\tint a[n];\t\n\tfor(i=0;i>a[i];\n\t}\n\tfor(r=-1;r0&&r<=k-1)||(rn-k))\n\t\t{\n\t\t\tif((n-k)%(k-1)==0)js=1+(n-k)/(k-1);\n\t\t\telse js=2+(n-k)/(k-1);\n\t\t}\n\t\telse if(n%2==0)js=n/2;\n\t\telse js=(n-1)/2;\n\t\t\n\t\tcout<\nusing namespace std;\nint main()\n{\n int n,k;\n \n cin>>n>>k;\n int a[n+1];\n int max=0;\n int maxi;\n int num=0;\n int x;\n for(int i=1;i<=n;i=i+1)\n {\n cin>>a[i];\n if(a[i]>max)\n {\n maxi=i;\n max=a[i];\n }\n }\n \n num=num+1;\n x=k;\n while(x\nusing namespace std;\nint main()\n{\n int n,k;\n \n cin>>n>>k;\n int a[n+1];\n int max=0;\n int maxi;\n int num=0;\n int x;\n for(int i=1;i<=n;i=i+1)\n {\n cin>>a[i];\n if(a[i]>max)\n {\n maxi=i;\n max=a[i];\n }\n }\n \n num=num+1;\n x=k;\n while(x\nusing namespace std;\nint main(){\n int n,k,maxn=0;\n cin>>n>>k;\n int a[n];\n for(int i=0;i>a[i];\n if(a[i]==n)\n maxn=i;\n }\n maxn++;\n cout<k&&ni*K-1&&n\nusing namespace std;\nint main()\n{\n\tint n,k,r,js=0,i;\n\tcin>>n>>k;\n\tint a[n];\t\n\tfor(i=0;i>a[i];\n\t}\n\tfor(r=-1;r0&&r<=k-1)||(rn-k))\n\t\t{\n\t\t\tif((n-k)%(k-1)==0)js=1+(n-k)/(k-1);\n\t\t\telse js=2+(n-k)/(k-1);\n\t\t}\n\t\telse if(n%(k-1)==0)js=n/(k-1);\n\t\telse js=(n-1)/(k-1);\n\t\t\n\t\tcout<\n#include\nusing namespace std;\nint main()\n{int n,k;\n \n\treturn 0;\n}",WRONG_ANSWER,5,456 1581226858381107200,b12e1025e2445b4c1f9e36fb2fc657f28fac96a120b294aeae56edd16b5a0e9d,2022-10-15 18:13:55,C++,0.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n cout<<\""3\""<\nusing namespace std;int n,k,maxn=0;\nint num(int n){\nif(n<=k)\n return 1;\n else if (n>k&&n<2*k-1)\n return 2;\n else for(int i=3;;i++)\n {\n\t\tif(n>i*k-1&&n<(i+1)*k-1)\n \n return i;\n\t\t\tbreak;}\n \n \n}\nint main(){\n \n cin>>n>>k;\n int a[n];\n for(int i=0;i>a[i];\n if(a[i]==n)\n maxn=i;\n \n }\n maxn++;\n \n cout<\nusing namespace std;int n,k,maxn=0;\nint num(int n){\nif(n<=k)\n return 1;\n else if (n>k&&n<2*k-1)\n return 2;\n else for(int i=3;;i++)\n {\n\t\tif(n>(i-1)*k-1&&n<(i)*k-1)\n \n return i;\n\t\t\tbreak;}\n \n \n}\nint main(){\n \n cin>>n>>k;\n int a[n];\n for(int i=0;i>a[i];\n if(a[i]==n)\n maxn=i;\n \n }\n maxn++;\n \n cout<\nusing namespace std;\nint yes(int a[],int x) {\n\tfor(int i=1; i>n>>k;\n\tint a[n+1];\n\tfor(int i=1; i>a[i];\n\t}\n\tif(yes(a,n)) {\n\t\tcout<<0;\n\t\treturn 0;\n\t}\n\tint m=0;\n\tfor(int j=1; j<=n-k+1;j++) {\n\t\tif(a[j]>=m)\tm=a[j];\n\t}\n\tfor(int j=1; j<=n-k+1;j++) {\n\t\ta[j]=m;\n\t}\n\tint l=1;\n\twhile(yes) {\n\t\t\n\t}\n\n\n\treturn 0;\n}",WRONG_ANSWER,70,1588 1581227021963157504,ffac54f0333068e41af04dc26cd5060ccdd907db632a86b7a08fc4b4331e189f,2022-10-15 18:14:34,C++,0.0,1580876659037036550,1580523125900832768,1039131349729988608,"#include \n#include \n\nusing namespace std;\n\nint main()\n{\n int n,k,m;\n m=0;\n cin>>n>>k;\n int a[n];\n for(int i=0;i>a[i];\n }\n for(int j=0;j\n#include \n\nusing namespace std;\n\nint main()\n{\n int n,k,m;\n m=0;\n cin>>n>>k;\n int a[n];\n for(int i=0;i>a[i];\n }\n for(int j=0;j\nusing namespace std;\nint n,k,flag;\nint a[2000005];\nint main(){\n\tscanf(\""%d%d\"",&n,&k);\n\tfor(int i=1;i<=n;++i){\n\t\tscanf(\""%d\"",&a[i]);\n\t\tif(a[i]==n){\n\t\t\tflag=i;\n\t\t}\n\t}\n\tdouble ans=ceil(n/(k-1));\n\tprintf(\""%d\"",int(ans));\n}",COMPILE_ERROR,0,0 1581263467176583168,ec12a7fc6aecaf5b087d29507bdc219763b728f5ea3640dc26f108e12ab20a56,2022-10-15 20:39:23,C++,0.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint n,k,flag;\nint a[2000005];\nint main(){\n\tscanf(\""%d%d\"",&n,&k);\n\tdouble ans=ceil(n/(k-1));\n\tprintf(\""%d\"",int(ans));\n}",WRONG_ANSWER,43,476 1581271456243568640,9f6fd3080ece4a12e427d906fc8527715eb686cd1186cf6d19ea68ded761855f,2022-10-15 21:11:08,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n double n,k;\n cin>>n>>k;\n int tmp;\n for(int i=1;i<=6;i++) cin>>tmp;\n double x=(n-1)/(k-1);\n cout<\nusing namespace std;\nint n,k;\nint arr[1003];\n\nbool visit[1003];\nint ans=246214122;\nbool check(){\n\tfor(int i=1;i<=n;i++){\n\t\tif(arr[i]!=n) return false;\n\t}\n\treturn true;\n\t\n}\nvoid _print(int x,int step,int a[1003]){\n\tcout<\nusing namespace std;\nint n,k;\nint arr[1003];\n\nbool visit[1003];\nint ans=246214122;\nbool check(){\n\tfor(int i=1;i<=n;i++){\n\t\tif(arr[i]!=n) return false;\n\t}\n\treturn true;\n\t\n}\nvoid _print(int x,int step,int a[1003]){\n\tcout<>n>>k;\n\tmemset(visit,0,sizeof(visit));\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>arr[i];\n\t}\n\tvisit[1]=1;\n\tdfs(1,1,arr);\n\tcout<\nusing namespace std;\nint n,k;\nint arr[1000003];\n\nbool visit[1000003];\nint ans=246214122;\nbool check(){\n\tfor(int i=1;i<=n;i++){\n\t\tif(arr[i]!=n) return false;\n\t}\n\treturn true;\n\t\n}\nvoid _print(int x,int step,int a[1000003]){\n\tcout<>n>>k;\n\tmemset(visit,0,sizeof(visit));\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>arr[i];\n\t}\n\tvisit[1]=1;\n\tdfs(1,1,arr);\n\tcout<\nusing namespace std;\nint n,k,flag,ans1,ans2;\nint a[2000005];\nint main(){\n\tcin>>n>>k; \n\tfor(int i=1;i<=n;++i){\n\t\tcin>>a[i];\n\t\tif(a[i]==n) flag=i;\n\t}\n\tfor(int i=flag;i<=n;++i){\n\t\ti+=k-1;\n\t\tans1++;\n\t}\n\tfor(int i=flag;i>=1;--i){\n\t\ti-=k-1;\n\t\tans1++;\n\t}\n\tfor(int i=1;i<=n;++i){\n\t\ti+=k-1;\n\t\tans2++;\n\t}\n\tcout<\nusing namespace std;\nint n,k,flag,ans1,ans2;\nint a[2000005];\nint main(){\n\tcin>>n>>k; \n\tfor(int i=1;i<=n;++i){\n\t\tcin>>a[i];\n\t\tif(a[i]==n) flag=i;\n\t}\n\tfor(int i=flag;i<=n;++i){\n\t\ti+=k-1;\n\t\tans1++;\n\t}\n\tfor(int i=flag;i>=1;--i){\n\t\ti-=k-1;\n\t\tans1++;\n\t}\n\tfor(int i=1;i<=n;++i){\n\t\ti+=k-1;\n\t\tans2++;\n\t}\n\tcout<\nusing namespace std;\n#define ex(a,b) double c=a;a=b;b=c;\nint findnum(int a[],int n,int find);\n#define vv vector\npriority_queue ,less> q2;\n#define epsilon 1e-6\n//bool operator <(const dd d)const{}结构体排序定义\n//////////////////////////////////////////////////\nint n,k;\nint main()\n{\n\tcin>>n>>k;\n int js=0;\n int sz[n+1];\n for(int i=1;i<=n;i++)\n {\n cin>>sz[i];\n }\n int first=find(sz,sz+n,n)-sz;\n if(k-1>=n-first)\n {\n for(int i=n-k+1;i<=n;i++)\n {\n sz[i]=n;\n }\n js++;\n }\n else\n {\n for(int i=first;i<=first+k-1;i++)\n {\n sz[i]=n;\n }\n js++;\n first=first+k-1;\n int flag=0;\n while(1)\n {\n for(int i=first;i<=first+k-1;i++)\n {\n sz[i]=n;\n if(i==n)\n {flag=1;break;}\n }\n first=first+k-1;\n js++;\n if(flag==1)\n {\n break;\n }\n }\n }\n first=find(sz,sz+n,n)-sz;\n int flag=0;\n while(1)\n {\n for(int i=first;i>=first-k+1;i--)\n {\n sz[i]=n;\n if(i==1)\n {flag=1;break;}\n }\n first=first-k+1;\n js++;\n if(flag==1)\n {\n break;\n }\n }\n cout<\nusing namespace std;\n#define ex(a,b) double c=a;a=b;b=c;\nint findnum(int a[],int n,int find);\n#define vv vector\npriority_queue ,less> q2;\n#define epsilon 1e-6\n//bool operator <(const dd d)const{}结构体排序定义\n//////////////////////////////////////////////////\nlong long n,k;\nint main()\n{\n\tcin>>n>>k;\n int js=0;\n long long sz[n+1];\n for(int i=1;i<=n;i++)\n {\n cin>>sz[i];\n }\n int first=find(sz,sz+n,n)-sz;\n if(k-1>=n-first)\n {\n for(int i=n-k+1;i<=n;i++)\n {\n sz[i]=n;\n }\n js++;\n }\n else\n {\n for(int i=first;i<=first+k-1;i++)\n {\n sz[i]=n;\n }\n js++;\n first=first+k-1;\n int flag=0;\n while(1)\n {\n for(int i=first+1;i<=first+k-1;i++)\n {\n sz[i]=n;\n if(i==n)\n {flag=1;break;}\n }\n first=first+k-1;\n js++;\n if(flag==1)\n {\n break;\n }\n }\n }\n first=find(sz,sz+n,n)-sz;\n int flag=0;\n while(1)\n {\n for(int i=first-1;i>=first-k+1;i--)\n {\n sz[i]=n;\n if(i==1)\n {flag=1;break;}\n }\n first=first-k+1;\n js++;\n if(flag==1)\n {\n break;\n }\n }\n cout<\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair pr;\n#define xx first\n#define yy second\n#define mp make_pair\n#define pb push_back\n#define SZ(x) ((int)x.size())\ntemplateinline void qmax(T &x,const T &y){if(xinline void qmin(T &x,const T &y){if(x>y) x=y;}\n\ninline int read(){\n\tint w=0,f=1; char c;\n\twhile(!isdigit(c=getchar())) c=='-'&&(f=-1);\n\twhile(isdigit(c)) w=w*10+(c^48),c=getchar();\n\treturn w*f;\n}\n\n#define N 2000005\n#define P 998244353\n#define inf 2147483647\n#define inf2 9223372036854775807\n\nint n,k,ans1,ans2,pos;\nint a[N];\n\nint main(){\n\tint i,j;\n\tn=read(),k=read();\n\tfor(i=1;i<=n;i++){\n\t\ta[i]=read();\n\t\tif(a[i]==n) pos=i;\n\t}\n\tfor(i=pos;i<=n;i++) i=i+k-1,ans1++;\n\tfor(i=pos;i>=1;i--) i=i-k+1,ans1++;\n\tfor(i=1;i<=n;i++)\n i=i+k-1,ans2++;\n \n\tcout<\nusing namespace std;\n#define ex(a,b) double c=a;a=b;b=c;\nint findnum(int a[],int n,int find);\n#define vv vector\npriority_queue ,less> q2;\n#define epsilon 1e-6\n//bool operator <(const dd d)const{}结构体排序定义\n//////////////////////////////////////////////////\nlong long n,k;\nint main()\n{\n\tcin>>n>>k;\n int js=0;\n long long sz[n+1];\n sz[0]=0;\n for(int i=1;i<=n;i++)\n {\n cin>>sz[i];\n }\n int first=find(sz,sz+n,n)-sz;\n if(k-1>=n-first)\n {\n for(int i=n-k+1;i<=n;i++)\n {\n sz[i]=n;\n }\n js++;\n }\n else\n {\n for(int i=first;i<=first+k-1;i++)\n {\n sz[i]=n;\n }\n js++;\n first=first+k-1;\n int flag=0;\n while(1)\n {\n for(int i=first+1;i<=first+k-1;i++)\n {\n sz[i]=n;\n if(i==n)\n {flag=1;break;}\n }\n first=first+k-1;\n js++;\n if(flag==1)\n {\n break;\n }\n }\n }\n first=find(sz,sz+n,n)-sz;\n int flag=0;\n while(1)\n {\n for(int i=first-1;i>=first-k+1;i--)\n {\n sz[i]=n;\n if(i==1)\n {flag=1;break;}\n }\n first=first-k+1;\n js++;\n if(flag==1)\n {\n break;\n }\n }\n cout<\nusing namespace std;\ndouble n,k;\nint main(){\n\tcin>>n>>k;\n\tfor(int i=1;i<=n;i++){\n int a;\n\t\tcin>>a;\n\t}\n\tdouble ans=(n-1)/(k-1);\n ans=ceil(ans);\n\tcout<\nusing namespace std;\n#define ex(a,b) double c=a;a=b;b=c;\nint findnum(int a[],int n,int find);\n#define vv vector\npriority_queue ,less> q2;\n#define epsilon 1e-6\n//bool operator <(const dd d)const{}结构体排序定义\n//////////////////////////////////////////////////\n\nint main()\n{\n\tlong long n,k;\n cout<<(n-1)/(k-1);\n}",WRONG_ANSWER,41,476 1581279226657300480,ffae43461214039dbe87bee89349b534a0a825c84e4555d6abfd01693e5f0e37,2022-10-15 21:42:01,C++,0.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\n#define ex(a,b) double c=a;a=b;b=c;\nint findnum(int a[],int n,int find);\n#define vv vector\npriority_queue ,less> q2;\n#define epsilon 1e-6\n//bool operator <(const dd d)const{}结构体排序定义\n//////////////////////////////////////////////////\n\nint main()\n{\n\tlong long n,k;\n cin>>n>>k;\n cout<<(n-1)/(k-1);\n}",WRONG_ANSWER,41,640 1581279429342846976,ffae43461214039dbe87bee89349b534a0a825c84e4555d6abfd01693e5f0e37,2022-10-15 21:42:49,C++,0.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\n#define ex(a,b) double c=a;a=b;b=c;\nint findnum(int a[],int n,int find);\n#define vv vector\npriority_queue ,less> q2;\n#define epsilon 1e-6\n//bool operator <(const dd d)const{}结构体排序定义\n//////////////////////////////////////////////////\n\nint main()\n{\n\tlong long n,k;\n cin>>n>>k;\n int sz[n+1];\n sz[0]=0;\n for(int i=1;i<=n;i++)\n {\n cin>>sz[i];\n }\n cout<<(n-1)/(k-1);\n}",WRONG_ANSWER,861,4144 1581279751519911936,ffae43461214039dbe87bee89349b534a0a825c84e4555d6abfd01693e5f0e37,2022-10-15 21:44:06,C++,0.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\n#define ex(a,b) double c=a;a=b;b=c;\nint findnum(int a[],int n,int find);\n#define vv vector\npriority_queue ,less> q2;\n#define epsilon 1e-6\n//bool operator <(const dd d)const{}结构体排序定义\n//////////////////////////////////////////////////\n\nint main()\n{\n\tlong long n,k;\n cin>>n>>k;\n int sz[n+1];\n sz[0]=0;\n for(int i=1;i<=n;i++)\n {\n cin>>sz[i];\n }\n cout<\nusing namespace std;\n#define ex(a,b) double c=a;a=b;b=c;\nint findnum(int a[],int n,int find);\n#define vv vector\npriority_queue ,less> q2;\n#define epsilon 1e-6\n//bool operator <(const dd d)const{}结构体排序定义\n//////////////////////////////////////////////////\n\nint main()\n{\n\tlong long n,k;\n cin>>n>>k;\n int sz[n+1];\n sz[0]=0;\n for(int i=1;i<=n;i++)\n {\n cin>>sz[i];\n }\n cout<\nusing namespace std;\nint main()\n{\n\tdouble n,k;\n\tcin>>n>>k;\n\tn--,k--;\n\tprintf(\""%d\"",int(ceil(n/k)));\n}",ACCEPTED,43,576 1581294889559969792,5c5f20566d038a62940d2fef02dea80b007b5884807e10552759f4243a19a4ea,2022-10-15 22:44:15,C++,0.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main(){\n int n,m;\n int a;\n cin>>n>>m;\n for(int i=0;i>a;\n }\n cout<\nusing namespace std;\nint main(){\n\tdouble n,k;\n\tcin>>n>>k;\n\tn--,k--;\n\tprintf(\""%d\"",int(ceil(n/k)));\n}",ACCEPTED,43,480 1581294991112458240,5c5f20566d038a62940d2fef02dea80b007b5884807e10552759f4243a19a4ea,2022-10-15 22:44:39,C++,0.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main(){\n int n,m;\n int a;\n cin>>n>>m;\n for(int i=0;i>a;\n }\n cout<\nusing namespace std;\nint main(){\n float n,m;\n float a;\n cin>>n>>m;\n for(int i=0;i>a;\n }\n float num=ceil((n-m)/(m-1));\n cout<\nusing namespace std;int n,k,maxn=0;\nint num(int n){\nif(n<=k)\n return 1;\n else if (n>k&&n<=2*k-1)\n return 2;\n else for (int i=3;;i++)\n { \n\t\tif(n>(i-1)*k-1&&n<(i)*k-1)\n \n return i;\n\t\t\tbreak;} \n}\nint main(){\n \n cin>>n>>k;\n int a[n];\n for(int i=0;i>a[i];\n if(a[i]==n)\n maxn=i;\n \n }\n maxn++;\n\n cout<\nusing namespace std;int n,k,maxn=0;\nint num(int n){\nif(n<=k)\n return 1;\n else if (n>k&&n<=2*k-1)\n return 2;\n else for (int i=3;;i++)\n { \n\t\tif(n>(i-1)*k-1&&n<(i)*k-1)\n \n return i;\n\t\t\tbreak;} \n}\nint main(){\n \n cin>>n>>k;\n int a[n];\n for(int i=0;i>a[i];\n if(a[i]==n)\n maxn=i;\n \n }\n maxn++;\n\n cout<\nusing namespace std;int n,k,maxn=0;\nlong long num(long long n){\nif(n<=k)\n return 1;\n else if (n>k&&n<=2*k-1)\n return 2;\n else for (int i=3;;i++)\n { \n\t\tif(n>(i-1)*k-1&&n<(i)*k-1)\n \n return i;\n\t\t\tbreak;} \n}\nint main(){\n \n cin>>n>>k;\n long long a[n];\n for(long long i=0;i>a[i];\n if(a[i]==n)\n maxn=i;\n \n }\n maxn++;\n\n cout<\nusing namespace std;\nint main(){\n int n,k;\n cin>>n>>k;\n cout<<(n-1)/(k-1);\n}",WRONG_ANSWER,32,484 1581460045174718464,9398937a83e492f5187be0403b6f9d56f1625efe8ffdbd9fb77520b1d9a79c20,2022-10-16 09:40:31,C++,0.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main(){\n int n,k;\n cin>>n>>k;\n cout<\nusing namespace std;\nint main(){\n double n,k;\n cin>>n>>k;\n float num=ceil((n-1)/(k-1));\n cout<\nusing namespace std;\nint a[10086];\nint main()\n{\n\tint n,k,ans;\n\tcin>>n>>k;\n\tint max1=0;\n\tint biao;\n for(int i=1;i<=n;i++)\n {\n \tcin>>a[i];\n \tmax1=max(a[i],max1);\n\t}\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tif(a[i]==max1)\n\t biao=i;\n\t}\n if((biao-1)%2==0)//左 \n ans=biao/2;\n\telse \n\tans=(biao-1)/2;\n\tif((n-biao)%2==0)\n\t ans=ans+n/2;\n\t else if((n-biao)%2!=0) \n\t ans=ans+n/2+1;\n\t cout<\nusing namespace std;\nint a[10086];\nint main()\n{\n\tint n,k,ans;\n\tcin>>n>>k;\n\tint max1=0;\n\tint biao;\n for(int i=1;i<=n;i++)\n {\n \tcin>>a[i];\n \tmax1=max(a[i],max1);\n\t}\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tif(a[i]==max1)\n\t biao=i;\n\t}\n if((biao-1)%2==0)//左 \n ans=biao/2;\n\telse \n\tans=(biao-1)/2;\n\tif((n-biao)%2==0)\n\t ans=ans+n/2;\n\t else if((n-biao)%2!=0) \n\t ans=ans+n/2+1;\n\t cout<\nusing namespace std;\nint a[100];\nint main()\n{\n\tint n,k,ans;\n\tcin>>n>>k;\n\tint max1=0;\n\tint biao;\n for(int i=1;i<=n;i++)\n {\n \tcin>>a[i];\n \tmax1=max(a[i],max1);\n\t}\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tif(a[i]==max1)\n\t biao=i;\n\t}\n if((biao-1)%2==0)//左 \n ans=biao/2;\n\telse \n\tans=(biao-1)/2;\n\tif((n-biao)%2==0)\n\t ans=ans+n/2;\n\t else if((n-biao)%2!=0) \n\t ans=ans+n/2+1;\n\t cout<\nusing namespace std;\nint a[100];\nint main()\n{\n\tint n,k,ans;\n\tcin>>n>>k;\n\tint max1=0;\n\tint biao;\n for(int i=1;i<=n;i++)\n {\n \tcin>>a[i];\n \tmax1=max(a[i],max1);\n\t}\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tif(a[i]==max1)\n\t biao=i;\n\t}\n if((biao-1)%2==0)//左 \n ans=biao/2;\n\telse \n\tans=(biao-1)/2;\n\tif((n-biao)%2==0)//右\n\t ans=ans+n/2;\n\t else if((n-biao)%2!=0) \n\t ans=ans+n/2+1;\n\t cout<\nusing namespace std;\nint a[100];\nint main()\n{\n\tint n,k,ans;\n\tcin>>n>>k;\n\tint max1=0;\n\tint biao;\n for(int i=1;i<=n;i++)\n {\n \tcin>>a[i];\n \tmax1=max(a[i],max1);\n\t}\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tif(a[i]==max1)\n\t biao=i;\n\t}\n if((biao-1)%(k-1)==0)//左 \n ans=biao/(k-1);\n\telse \n\tans=(biao-1)/(k-1);\n\tif((n-biao)%(k-1)==0)//右\n\t ans=ans+n/(k-1);\n\t else if((n-biao)%(k-1)!=0) \n\t ans=ans+n/(k-1)+1;\n\t cout<\nusing namespace std;\nint a[100];\nint main()\n{\n\tint n,k,ans;\n\tcin>>n>>k;\n\tint max1=0;\n\tint biao;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tif(a[i]==n)\n\t biao=i;\n\t}\n if((biao-1)%(k-1)==0)//左 \n ans=biao/(k-1);\n\telse \n\tans=(biao-1)/(k-1);\n\tif((n-biao)%(k-1)==0)//右\n\t ans=ans+n/(k-1);\n\t else if((n-biao)%(k-1)!=0) \n\t ans=ans+n/(k-1)+1;\n\t cout<\nusing namespace std;\nint a[100];\nint main()\n{\n\tint n,k,ans;\n\tcin>>n>>k;\n\tint max1=0;\n\tint biao;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tif(a[i]==n)\n\t biao=i;\n\t}\n int a=(n-1)/(k-1);\n if(a==0)\n cout<\nusing namespace std;\nint main()\n{\n\tint b, c;\n\tcin >> b >> c;\n\tint a[b];\n\tfor (int d = 0; d < b; d++) {\n\t\tcin >> a[d];\n\t}\n\tint* p=&a[0];\n\tfor (int e = 0; e < b-1; e++) {\n\t\tp = &(*p > a[e + 1] ? *p : a[e + 1]);\n\t}\n\tint changdu = sizeof(a)/4;\n\tint qiandizhi = (long long int)p - (long long int)a;\n\tint qian = qiandizhi/4;\n\tint zuidadizhi = qian + 1;\n\tint hou = changdu -qiandizhi/4-1;\n\tint cishu;\n\tint shengyv;\n\tif(qian<=c-1||hou<=c-1){\n\t\t\tif ((changdu - c) % (c - 1) == 0) {\n\t\t\t\tshengyv = (changdu - c) / (c-1);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tshengyv = (changdu - c) / (c - 1)+1;\n\t\t\t}\n\t\t\tcishu = shengyv + 1;\n\t}\n\telse {\n\t\tif (qian%(c-1)==0|| hou % (c - 1) == 0) {\n\t\t\tif (qian % (c - 1) == 0) {\n\t\t\t\tint qianshengyv = (zuidadizhi - 1) / (c - 1);\n\t\t\t\tif((changdu - zuidadizhi)%(c-1)==0){\n\t\t\t\t\tshengyv = (changdu - zuidadizhi)/(c-1);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tshengyv = (changdu - zuidadizhi) / (c - 1)+1;\n\t\t\t\t}\n\t\t\t\tcishu = qianshengyv + shengyv;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tint houshengyv = (changdu-zuidadizhi) / (c - 1);\n\t\t\t\tif ((zuidadizhi-1) % (c - 1) == 0) {\n\t\t\t\t\tshengyv = ( zuidadizhi-1) / (c - 1);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tshengyv = (zuidadizhi - 1) / (c - 1) + 1;\n\t\t\t\t}\n\t\t\t\tcishu = houshengyv + shengyv;\n\t\t\t}\n\t }\n\t\telse {\n\t\t\tif ((changdu-1) %(c - 1)==0) {\n\t\t\t\tcishu = changdu / (c - 1);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcishu = changdu / (c - 1) + 1;\n\t\t\t}\n\n\t\t}\n\t}\n\tcout << cishu;\n\treturn 0;\n}\n",ACCEPTED,857,4148 1581491016154533888,6468e8ee8099e4a82ca1af1efb7c69ca8abb9a276187b8346a4256d5adecc150,2022-10-16 11:43:35,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n\tint b, c;\n\tcin >> b >> c;\n\tint a[b];\n\tfor (int d = 0; d < b; d++) {\n\t\tcin >> a[d];\n\t}\n\tint* p=&a[0];\n\tfor (int e = 0; e < b-1; e++) {\n\t\tp = &(*p > a[e + 1] ? *p : a[e + 1]);\n\t}\n\tint changdu = sizeof(a)/4;\n\tint qiandizhi = (long long int)p - (long long int)a;\n\tint qian = qiandizhi/4;\n\tint zuidadizhi = qian + 1;\n\tint hou = changdu -qiandizhi/4-1;\n\tint cishu;\n\tint shengyv;\n\tif(qian<=c-1||hou<=c-1){\n\t\t\tif ((changdu - c) % (c - 1) == 0) {\n\t\t\t\tshengyv = (changdu - c) / (c-1);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tshengyv = (changdu - c) / (c - 1)+1;\n\t\t\t}\n\t\t\tcishu = shengyv + 1;\n\t}\n\telse {\n\t\tif (qian%(c-1)==0|| hou % (c - 1) == 0) {\n\t\t\tif (qian % (c - 1) == 0) {\n\t\t\t\tint qianshengyv = (zuidadizhi - 1) / (c - 1);\n\t\t\t\tif((changdu - zuidadizhi)%(c-1)==0){\n\t\t\t\t\tshengyv = (changdu - zuidadizhi)/(c-1);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tshengyv = (changdu - zuidadizhi) / (c - 1)+1;\n\t\t\t\t}\n\t\t\t\tcishu = qianshengyv + shengyv;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tint houshengyv = (changdu-zuidadizhi) / (c - 1);\n\t\t\t\tif ((zuidadizhi-1) % (c - 1) == 0) {\n\t\t\t\t\tshengyv = ( zuidadizhi-1) / (c - 1);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tshengyv = (zuidadizhi - 1) / (c - 1) + 1;\n\t\t\t\t}\n\t\t\t\tcishu = houshengyv + shengyv;\n\t\t\t}\n\t }\n\t\telse {\n\t\t\tif ((changdu-1) %(c - 1)==0) {\n\t\t\t\tcishu = changdu / (c - 1);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcishu = changdu / (c - 1) + 1;\n\t\t\t}\n\n\t\t}\n\t}\n\tcout << cishu;\n\treturn 0;\n}\n",ACCEPTED,860,4136 1581493223931301888,09c9ed039e50517d99f64e4b4053880e7211279ec043f23e30f99d7b9d6b8bb3,2022-10-16 11:52:21,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\n#include\nusing namespace std;\n\nint main()\n{\n int n,k;\n int a=0;\n cin>>n>>k;\n int p[1000000];\n for(int i=0;i>p[i];\n if(p[i]==n)\n {\n a++;\n }\n }\n cout<\nusing namespace std;\nint main()\n{\nint n,k;\ncin>>n>>k;\nint a[n];\nfor(int i=0;i>a[i];\ncout<<(n-1)/(k-1)+1;\n\n}",ACCEPTED,949,4044 1581565734752673792,28f8851cced66e5ceb5c30a083f9f6970dbf7264167ffd5245bb2bfda0338db5,2022-10-16 16:40:29,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint main()\n{\n float n,k;\n cin>>n>>k;\n int a[int(n)];\n for(int i=0;i>a[i];\t\t\n\t}\n cout<\nusing namespace std;\nint main()\n{\n float n,k;\n cin>>n>>k;\n int a[int(n)];\n for(int i=0;i>a[i];\t\t\n\t}\n cout<\nusing namespace std;\nint main(){\n\tint n,k;cin>>n>>k;\n\tint a[n];\n\tfor(int i=0;i>a[i];\n\tint b=(n-1)/(k-1);\n\tif((n-1)%(k-1)!=0) b++;\n\tcout<\n#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin >> n >> k;\n cout << ceil((n-1.0)/(k-1));\n return 0;\n}",ACCEPTED,35,468 1581842514797449216,c824a914478643de48ac8423f201704814072f3f12aa6e218dc194039b7352cc,2022-10-17 11:00:19,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main() {\n\tdouble n,k;\n\tcin>>n>>k;\n\tcout<\nusing namespace std;\n\nint a[10005];\n\nint main()\n{\n\tint n,k;\n\tcin>>n>>k;\n\tfor(int i=0; i>a[i];\n\t}\n\tif((n-1)%(k-1)>0){\n\tcout<<(n-1)/(k-1)+1;\n }else cout<<(n-1)/(k-1);\n\treturn 0;\n}\n",SEGMENTATION_FAULT,69,712 1581856483469742080,80e66cf1af8ee85c9ee9164a02066fc0cb85bc2c6d1471aa5e909e1fab0fcbe8,2022-10-17 11:55:49,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\n\nint a[1000005];\n\nint main()\n{\n\tint n,k;\n\tcin>>n>>k;\n\tfor(int i=0; i>a[i];\n\t}\n\tif((n-1)%(k-1)>0){\n\tcout<<(n-1)/(k-1)+1;\n }else cout<<(n-1)/(k-1);\n\treturn 0;\n}\n",ACCEPTED,870,4148 1581896219651522560,2de1cb13a66a34c2900fd50982a744d14391d660aaee4d0ec03a3bca14026600,2022-10-17 14:33:43,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \n#include \nusing namespace std;\nint main()\n{\n int min;\n double n,k;\n cin>>n>>k;\n min=ceil((n-1)/(k-1));\n cout<\nusing namespace std;\nint main()\n{\n\tint n,k,r,js=0,i,js1=0;\n\tcin>>n>>k;\n\tint a[n];\n\tfor(i=0;i>a[i];\n\t}\n\tfor(r=0;r0)\n\t\t\t{\n\t\t\t\tn=n-k+1;\n js++;\n\t\t\t}\n\t\t\tjs++;\n\t\t}\n\t\telse \n\t\t{\n\t\t\tint n1=n,r1=r;\t\t\t\n\t\t\twhile(r1+1+k-11)\n\t\t\t{\n\t\t\t\tjs++;\n\t\t\t\tr2=r2-(k-1);\n\t\t\t}\n\t\t\tjs1++;\n\t\t\t\n\t\t\t\n\t\t}\n\t}\n\tif(js==0)cout<\nusing namespace std;\nint main()\n{\n\tint n,k,r,js=0,i,js1=0;\n\tcin>>n>>k;\n\tint a[n];\n\tfor(i=0;i>a[i];\n\t}\n\tfor(r=0;r0)\n\t\t\t{\n\t\t\t\tn=n-k+1;\n\t\t\t\tjs++;\n\t\t\t}\n\t\t\tjs++;\n\t\t}\n\t\telse \n\t\t{\n\t\t\tint n1=n,r1=r;\t\t\t\n\t\t\twhile(r1+1+k-11)\n\t\t\t{\n\t\t\t\tjs++;\n\t\t\t\tr2=r2-(k-1);\n\t\t\t}\n\t\t\tjs1++;\n\t\t\t\n\t\t\tint js2=0;\n\t\t}\n\t}\n\tif(js==0&&k>2&&k%2==0)cout<\nusing namespace std;\nint main()\n{\n\tint n,k,r,js=0,i,js1=0;\n\tcin>>n>>k;\n\tint a[n];\n\tfor(i=0;i>a[i];\n\t}\n\tfor(r=0;r0)\n\t\t\t{\n\t\t\t\tn=n-k+1;\n\t\t\t\tjs++;\n\t\t\t}\n\t\t\tjs++;\n\t\t}\n\t\telse \n\t\t{\n\t\t\tint n1=n,r1=r;\t\t\t\n\t\t\twhile(r1+1+k-11)\n\t\t\t{\n\t\t\t\tjs++;\n\t\t\t\tr2=r2-(k-1);\n\t\t\t}\n\t\t\tjs1++;\n\t\t\t\n\t\t\tint js2=0;\n\t\t}\n\t}\n\tif(js==0&&k>2&&k%2==0)cout<\nusing namespace std;\nint main()\n{\n\tint n,k,r,js=0,i,js1=0,min=0;\n\tcin>>n>>k;\n\tint a[n];\n\tfor(i=0;i>a[i];\n\t}\n\tfor(r=0;r0)\n\t\t\t{\n\t\t\t\tn=n-k+1;\n\t\t\t\tjs++;\n\t\t\t}\n\t\t\tjs++;\n\t\t}\n\t\telse \n\t\t{\n\t\t\tint n1=n,r1=r;\t\t\t\n\t\t\twhile(r1+1+k-11)\n\t\t\t{\n\t\t\t\tjs++;\n\t\t\t\tr2=r2-(k-1);\n\t\t\t}\n\t\t\tjs1++;\n\t\t\t\n\t\t\tfor(i=1;i0)\n\t\t\t\t{\n\t\t\t\t\tjs2++;\n\t\t\t\t\tr4-=k-1;\n\t\t\t\t}\n\t\t\t\tjs2++;\n\t\t\t\tif(i==1)min=js2;\n\t\t\t\telse if(js2\nusing namespace std;\nint main()\n{\n\tint n,k,r,js=0,i,min=0;\n\tcin>>n>>k;\n\tint a[n];\n\tfor(i=0;i>a[i];\n\t}\n\tfor(r=0;r0)\n\t\t\t{\n\t\t\t\tn=n-k+1;\n\t\t\t\tjs++;\n\t\t\t}\n\t\t\tjs++;\n\t\t}\n\t\telse \n\t\t{\t\t\t\t\t\t\n\t\t\tfor(i=0;i0)\n\t\t\t\t{\n\t\t\t\t\tjs2++;\n\t\t\t\t\tr4-=k-1;\n\t\t\t\t}\n\t\t\t\tjs2++;\n\t\t\t\tif(i==1)min=js2;\n\t\t\t\telse if(js2\nusing namespace std;\nint main()\n{\n\tint n,k,r,js=0,i,min=0;\n\tcin>>n>>k;\n\tint a[n];\n\tfor(i=0;i>a[i];\n\t}\n\tfor(r=0;r0)\n\t\t\t{\n\t\t\t\tn=n-k+1;\n\t\t\t\tjs++;\n\t\t\t}\n\t\t\tjs++;\n\t\t}\n\t\telse \n\t\t{\t\t\t\t\t\t\n\t\t\tfor(i=0;i0)\n\t\t\t\t{\n\t\t\t\t\tjs2++;\n\t\t\t\t\tr4-=k-1;\n\t\t\t\t}\n\t\t\t\tjs2++;\n\t\t\t\tif(i==1)min=js2;\n\t\t\t\telse if(js2\nusing namespace std;\nint main()\n{\n\tint b, c;\n\tcin >> b >> c;\n\tint a[b];\n\tfor (int d = 0; d < b; d++) {\n\t\tcin >> a[d];\n\t}\n\tint* p=&a[0];\n\tfor (int e = 0; e < b-1; e++) {\n\t\tp = &(*p > a[e + 1] ? *p : a[e + 1]);\n\t}\n\tint changdu = sizeof(a)/4;\n\tint qiandizhi = (long long int)p - (long long int)a;\n\tint qian = qiandizhi/4;\n\tint zuidadizhi = qian + 1;\n\tint hou = changdu -qiandizhi/4-1;\n\tint cishu;\n\tint shengyv;\n\tif(qian<=c-1||hou<=c-1){\n\t\t\tif ((changdu - c) % (c - 1) == 0) {\n\t\t\t\tshengyv = (changdu - c) / (c-1);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tshengyv = (changdu - c) / (c - 1)+1;\n\t\t\t}\n\t\t\tcishu = shengyv + 1;\n\t}\n\telse {\n\t\tif (qian%(c-1)==0|| hou % (c - 1) == 0) {\n\t\t\tif (qian % (c - 1) == 0) {\n\t\t\t\tint qianshengyv = (zuidadizhi - 1) / (c - 1);\n\t\t\t\tif((changdu - zuidadizhi)%(c-1)==0){\n\t\t\t\t\tshengyv = (changdu - zuidadizhi)/(c-1);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tshengyv = (changdu - zuidadizhi) / (c - 1)+1;\n\t\t\t\t}\n\t\t\t\tcishu = qianshengyv + shengyv;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tint houshengyv = (changdu-zuidadizhi) / (c - 1);\n\t\t\t\tif ((zuidadizhi-1) % (c - 1) == 0) {\n\t\t\t\t\tshengyv = ( zuidadizhi-1) / (c - 1);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tshengyv = (zuidadizhi - 1) / (c - 1) + 1;\n\t\t\t\t}\n\t\t\t\tcishu = houshengyv + shengyv;\n\t\t\t}\n\t }\n\t\telse {\n\t\t\tif ((changdu-1) %(c - 1)==0) {\n\t\t\t\tcishu = changdu / (c - 1);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcishu = changdu / (c - 1) + 1;\n\t\t\t}\n\n\t\t}\n\t}\n\tcout << cishu;\n\treturn 0;\n}",ACCEPTED,933,4180 1581966199927652352,0f6c5750da5b22ac5cd562284daee438870230d5f45e88d11c79ef92c13198fe,2022-10-17 19:11:48,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint main(){\n int n,k;\n cin>>n>>k;\n int a[n]={0};\n for(int i=0;i>a[i];\n }\n int min;\n if((n-1)%(k-1)==0){\n min=(n-1)/(k-1);\n }\n else{\n min=((n-1)/(k-1))+1;\n }\n cout<\nusing namespace std;\nint main(){\n int n,k;\n cin>>n>>k;\n int a[n]={0};\n for(int i=0;i>a[i];\n }\n int min;\n if((n-1)%(k-1)==0){\n min=(n-1)/(k-1);\n }\n else{\n min=((n-1)/(k-1))+1;\n }\n cout<\nusing namespace std;\n\nint main(){\n int n,k;\n cin>>n>>k;\n int a[n]={0};\n int max;\n for(int i=0;i>a[i];\n \tif(a[i]==n){\n \t\tmax=i;\n\t }\n }\n int num;\n if(max%(k-1)==0){\n \tnum=max/(k-1);\n \tif(((n-1)-max)%(k-1)!=0){\n \t\tnum+=(((n-1)-max)/(k-1))+1;\n\t }\n\t if(((n-1)-max)%(k-1)==0){\n\t \tnum+=(((n-1)-max)/(k-1));\n\t }\n }\n else{\n \tif((n-1)%(k-1)==0){\n \t\tnum=(n-1)/(k-1);\n\t }\n\t if((n-1)%(k-1)!=0){\n\t \tnum=((n-1)/(k-1))+1;\n\t }\n }\n cout<\nusing namespace std;\n\nint main()\n{int a,b,d,c,p;\ncin>>a>>b;\nint aa[100];\ncin>>aa[100];\nd=a-1;c=b-1;\np=d/c;\ncout<\n#include\nusing namespace std;\n\nint main()\n{\n double k,n;\n cin>>n>>k;\n double m=(n-1)/(k-1);\n cout<<(int)ceil(m);\n}",ACCEPTED,42,476 1582304749479055360,02a6db220ba56dce82b06bd06c5a2dcdec7117d1310fba8dd664a6a448cab08c,2022-10-18 17:37:04,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\n\nint n,k,num;\n\nint main()\n{\n cin>>n>>k;\n for(int i=1;i<=n;++i)\n cin>>num;\n cout<<(int)ceil(1.0*(n-1)/(k-1))<\n#include\nusing namespace std;\n\nint main()\n{\n double k,n;\n cin>>n>>k;\n double m=(n-1)/(k-1);\n cout<\n#include\nusing namespace std;\n\nint main()\n{\n double k,n;\n cin>>n>>k;\n double m=(n-1)/(k-1);\n cout<<(int)m+0.99999;\n}",WRONG_ANSWER,49,476 1582347888352870400,c8178b3a2e5dafec1cf2697b741f9f82713a2870e0823e09d597d1ae2cf9023d,2022-10-18 20:28:29,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\n#include\nusing namespace std;\n\nint main()\n{\n double k,n;\n cin>>n>>k;\n double m=(n-1)/(k-1);\n cout<<(int)(m+0.99999);\n}",ACCEPTED,51,600 1582579274896695296,b64d83cdcbed8d4124a1e6000871403675e942d59550b2d13544033ded889044,2022-10-19 11:47:56,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n\tint n,k,an;\n\tcin>>n>>k;\n\tn=n-1;k=k-1;\n\tan=n/k+1;\n\tcout<\nusing namespace std;\nint main(){\n int n, k;\n cin >> n >> k;\n int a[n];\n for(int i = 0; i < n; i++){\n cin >> a[i];\n }\n int ans = (n - 1) / (k - 1);\n if((n - 1) % (k - 1)) cout << ans + 1;\n else cout << ans;\n return 0;\n}",ACCEPTED,866,4156 1582618503689326592,82e69ad9376cfe120c97fd65f26c929814fc914705dc933b298a1f003d53c04b,2022-10-19 14:23:49,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint main(){\n int n, k;\n cin >> n >> k;\n //int a[n];\n //for(int i = 0; i < n; i++){\n // cin >> a[i];\n //}\n int ans = (n - 1) / (k - 1);\n if((n - 1) % (k - 1)) cout << ans + 1;\n else cout << ans;\n return 0;\n}",ACCEPTED,39,600 1582670578091692032,460a1d3857c0171e1928179b7730b0870589622b9a48a92f8979781afecb0380,2022-10-19 17:50:45,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main() {\n int n, k; cin >> n >> k;\n cout << ceil((double)(n - 1) / (k - 1));\n return 0;\n}",ACCEPTED,38,464 1582679096190431232,2ebe94d250bb3bd306d8e27af2758ea801c235b436677a49c34f3eae459bc8b4,2022-10-19 18:24:35,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint a[100005];\nint main()\n{\n double n,k;\n cin>>n>>k;\n cout<\nusing namespace std;\nint a[100005];\nint main()\n{\n double n,k;\n cin>>n>>k;\n cout<\nusing namespace std;\nint a[100005];\nint main()\n{\n double n,k;\n cin>>n>>k;\n cout<\nusing namespace std;\nint main(){\nint qian,hou,n,k;\ncin>>n>>k;\nint arr[n],time,mintime=n;\nint ji=0;\nfor(;ji>arr[ji];\n}\nji=0;\nint max=arr[0],more=arr[0];\nji=0;\nfor(;jiarr[ji+1])?arr[ji]:arr[ji+1];\n\tif(more>max){\n\t\tmax=more;\n\t}\n}\nint m=0;\nfor(;m\nusing namespace std;\nint main(){\nint qian,hou,n,k;\ncin>>n>>k;\nint arr[n],time,mintime=n;\nint ji=0;\nfor(;ji>arr[ji];\n}\nif(n==k){\n\tcout<<\""1\"";\n\tgoto E;\n}\nji=0;\nint max=arr[0],more=arr[0];\nji=0;\nfor(;jiarr[ji+1])?arr[ji]:arr[ji+1];\n\tif(more>max){\n\t\tmax=more;\n\t}\n}\nint m=0;\nfor(;m\nusing namespace std;\nint main(){\nint qian,hou,n,k;\ncin>>n>>k;\nint arr[n],time,mintime=n;\nint ji=0;\nfor(;ji>arr[ji];\n}\nji=0;\nint max=arr[0],more=arr[0];\nji=0;\nfor(;jiarr[ji+1])?arr[ji]:arr[ji+1];\n\tif(more>max){\n\t\tmax=more;\n\t}\n}\nint m=0;\nfor(;m\nusing namespace std;\nint main(){\n int n, k;\n cin >> n >> k;\n int a[n];\n for(int i = 0; i < n; i++){\n cin >> a[i];\n }\n cout << (n-1)/(k-1) << endl;\n}",WRONG_ANSWER,896,4180 1582740863360823296,2012b168415840ee7beb2db6d8639576baa1c7a49555674408c1982ac1eb6630,2022-10-19 22:30:02,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint main(){\n int n, k;\n cin >> n >> k;\n int a[n];\n for(int i = 0; i < n; i++){\n cin >> a[i];\n }\n cout << (n-1)/(k-1)+1 << endl;\n}",ACCEPTED,863,4156 1582753848871481344,d3ba92557e7cf9bc56f70c290c60c44a708c6068ef2e74c2c094d5aadf6a5629,2022-10-19 23:21:38,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\ndouble n,k;\nint p[1000005];\ndouble ans;\nint main()\n{\n cin>>n>>k;\n for(int i=1;i<=n;i++)cin>>p[i];\n cout<\nusing namespace std;\nint main() {\n\tstring a;\n\tint n, k;\n\tcin >> n >> k;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a;\n\t}\n\tcout << (n - 1) / (k - 1)+1;\n}",ACCEPTED,615,476 1582762338788708352,da3045617c6c3c2c37517f27a563f2be735230538be23f54d4eca5dc8b7acefd,2022-10-19 23:55:22,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main() {\n\tstring a;\n\tint n, k;\n\tcin >> n >> k;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a;\n\t}\n\tif ((n - 1) % (k - 1) == 0) {\n\t\tcout << (n - 1) / (k - 1);\n\t}\n\telse {\n\t\tcout << (n - 1) / (k - 1) + 1;\n\t}\n}",ACCEPTED,596,452 1582884385992863744,3d595d652cd1c4787acb1a19f7dc8bf851b7c464fc3e1da08cfa0086900dbe11,2022-10-20 08:00:20,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \n#include \nusing namespace std;\nint main()\n{\n double a,b,c,d,f;\n cin>>a>>b;\n for(c=1;c<=a;c++)\n {\n cin>>d;\n }\n f=ceil((a-1)/(b-1));\n cout<\nusing namespace std;\nint main()\n{\n int n,k;\n \n cin>>n>>k;\n int a[n+1];\n int max=0;\n int maxi;\n int num=0;\n int x;\n for(int i=1;i<=n;i=i+1)\n {\n cin>>a[i];\n if(a[i]>max)\n {\n maxi=i;\n max=a[i];\n }\n }\n \n num=num+1;\n x=k;\n while(x\nusing namespace std;\n\nint main()\n{\n\tint n, k;\n\tint j;\n\tcin >> n >> k;\n\tif (n >= 2 && n <= 1e6&&k>=2&&k<=n)\n\t{\n\t\tint* arr = new int[n];\n\t\tfor (int i = 0;i < n;i++)\n\t\t{\n\t\t\tcin >> arr[i];\n\t\t}\n\t}\n\tj = int(n - 1) / (k - 1)+1;\n\tcout << j << endl;\n\treturn 0;\n}",ACCEPTED,830,4160 1583015622929678336,23d3070cd52c1a3fdd9e5670dc06b4d8e67a6b28c7a81c17b6a9893090048989,2022-10-20 16:41:50,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint main(){\n\tint a,b;\n\tcin>>a>>b;\n\tint m;\n\tfor(int i=a;i>=1;i--)\n\tcin>>m;\n\tcout<<(a/b)+1;\n\treturn 0;\n}",ACCEPTED,975,536 1583103603677986816,d03213eaef1e01fbfeb70ded7feb67e39c8885318a06c09bed92433eb3a2907e,2022-10-20 22:31:26,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint main()\n{\n\tint n, k;\n\tcin >> n >> k;\n\tcout << n / k + 1;\n\treturn 0;\n}",ACCEPTED,49,616 1583366362026086400,70cdb40fc7177dd32296f88cb9812bba798813175e9bc6528d4e6bcc2bde1f97,2022-10-21 15:55:32,C++,30.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint main() \n{\n int n,k,x,i,f,l;\n cin>>n>>k;\n for(x=1;1;x++)\n {\n \tcin>>i;\n \tif(n==i)\n \t{\n \t\tbreak;\n\t\t}\n\t}\n\tf=(1.0*x)/(1.0*k)>x/k?x/k+1:x/k;\n\tl=(1.0*(n-x+1))/(1.0*k)>(n-x+1)/k?(n-x+1)/k+1:(n-x+1)/k;\n\tcout<\nusing namespace std;\nint main() \n{\n int n,k,x,i,f,l;\n cin>>n>>k;\n for(x=1;1;x++)\n {\n \tcin>>i;\n \tif(n==i)\n \t{\n \t\tbreak;\n\t\t}\n\t}\n\tf=(1.0*x)/(1.0*k)>x/k?x/k+1:x/k;\n\tx+=x%k;\n\tl=(1.0*(n-x+1))/(1.0*k)>(n-x+1)/k?(n-x+1)/k+1:(n-x+1)/k;\n\tcout<\nusing namespace std;\nint main() \n{\n int n,k,x,i,f,l;\n cin>>n>>k;\n for(x=1;1;x++)\n {\n \tcin>>i;\n \tif(n==i)\n \t{\n \t\tbreak;\n\t\t}\n\t}\n\tf=(1.0*x)/(1.0*k)>x/k?x/k+1:x/k;\n\tx+=(x%k>0?x%k:-x%k);\n\tl=(1.0*(n-x+1))/(1.0*k)>(n-x+1)/k?(n-x+1)/k+1:(n-x+1)/k;\n\tcout<\nusing namespace std;\nint main() \n{\n int n,k,x,i,f,l;\n cin>>n>>k;\n for(x=1;1;x++)\n {\n \tcin>>i;\n \tif(n==i)\n \t{\n \t\tbreak;\n\t\t}\n\t}\n\tf=(1.0*x)/(1.0*k)>x/k?x/k+1:x/k;\n\tx+=k-f%k;\n\tl=(1.0*(n-x+1))/(1.0*k)>(n-x+1)/k?(n-x+1)/k+1:(n-x+1)/k;\n\tcout<\nusing namespace std;\nint main() \n{\n int n,k,x,i,f,l;\n cin>>n>>k;\n for(x=1;1;x++)\n {\n \tcin>>i;\n \tif(n==i)\n \t{\n \t\tbreak;\n\t\t}\n\t}\n\tf=(1.0*x)/(1.0*k)>x/k?x/k+1:x/k;//cout<(n-x+1)/k?(n-x+1)/k+1:(n-x+1)/k;\n\tcout<\nusing namespace std;\nint main() \n{\n int n,k,x,i,f,l;\n cin>>n>>k;\n for(x=1;1;x++)\n {\n \tcin>>i;\n \tif(n==i)\n \t{\n \t\tbreak;\n\t\t}\n\t}\n\tf=(1.0*x)/(1.0*k)>x/k?x/k+1:x/k;\n\tx+=k-x%k;\n\tl=(1.0*(n-x+1))/(1.0*k)>(n-x+1)/k?(n-x+1)/k+1:(n-x+1)/k;\n\tcout<\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n int a[n];\n for(int i=0;i>a[n];\n\t }\n\t int c=(n-1)/(k-1);\n\t if((n-1)%(k-1)!=0)\n\t {\n\t \tc=c+1;\n\t }\n\t cout<\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n int a[n+1];\n for(int i=1;i<=n;i++)\n {\n cin>>a[i];\n }\n int max=a[1],x=1;\n for(int i=2;i<=n;i++)\n {\n if(a[i]>max) max=a[i],x=i;\n }\n cout<<((n-k+1)/(k-1)+1);\n return 0;\n}\n",WRONG_ANSWER,848,4076 1583438992645156864,349c8b9d8ee83e85b738d9a18451de1db95aab7a1acf17b34eba3d17f5cf6b72,2022-10-21 20:44:09,C++,90.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint main()\n{\n int n,k,r,l,s,m;\n cin>>n>>k;\n int a[n+1];\n for(int i=1;i<=n;i++)\n {\n cin>>a[i];\n }\n int maxi=1;\n for(int i=2;i<=n;i++)\n {\n if(a[i]>a[maxi]) maxi=i;\n }\n m=100000;\n for(int i=1;i<=k;i++)\n {\n if((maxi-i)%(k-1)!=0) l=(maxi-i)/(k-1)+1;\n else l=(maxi-k+1)/(k-1);\n if((n-maxi-k+i)%(k-1)!=0) r=(n-maxi-k+i)/(k-1)+1;\n else r=(n-maxi-k+i)/(k-1);\n s=l+r+1;\n if(m>s) m=s;\n }\n cout<\nusing namespace std;\nint main()\n{\n int n,k,r,l,s,m;\n cin>>n>>k;\n int a[n+1];\n for(int i=1;i<=n;i++)\n {\n cin>>a[i];\n }\n int maxi=1;\n for(int i=2;i<=n;i++)\n {\n if(a[i]>a[maxi]) maxi=i;\n }\n m=100000;\n for(int i=1;i<=k;i++)\n {\n if((maxi-i)<0||(n-maxi-k+i)<0) continue;\n if((maxi-i)%(k-1)!=0) l=(maxi-i)/(k-1)+1;\n else l=(maxi-k+1)/(k-1);\n if((n-maxi-k+i)%(k-1)!=0) r=(n-maxi-k+i)/(k-1)+1;\n else r=(n-maxi-k+i)/(k-1);\n s=l+r+1;\n if(m>s) m=s;\n }\n cout<\nusing namespace std;\nint same(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint max=0;\n\tfor(int i=1; i=max) {\n\t\t\tmax=p[i];\n\t\t}\n\t}\n\tint l=0;\n\tint temp=0;\n\twhile(same(p,n+1)) {\n\t\tint f=0;\n\t\tl++;\n\t\tfor(int i=temp;f\nusing namespace std;\nint same(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint max=0;\n\tfor(int i=1; i=max) {\n\t\t\tmax=p[i];\n\t\t}\n\t}\n\tint l=0;\n\tint temp=0;\n\twhile(same(p,n+1)) {\n\t\tint f=0;\n\t\tl++;\n\t\tfor(int i=temp;f\nusing namespace std;\nint same(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint max=0;\n\tfor(int i=1; i=max) {\n\t\t\tmax=p[i];\n\t\t}\n\t}\n\tint l=0;\n\tint temp=0;\n\twhile(same(p,n+1)) {\n\t\tint f=0;\n\t\tl++;\n\t\tfor(int i=temp;f\nusing namespace std;\nint same(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint max=0;\n\tfor(int i=1; i=max) {\n\t\t\tmax=p[i];\n\t\t}\n\t}\n\tint l=0;\n\tint temp=0;\n\twhile(same(p,n+1)) {\n\t\tint f=0;\n\t\tl++;\n\t\tfor(int i=temp;f\n#include \nusing namespace std;\n\nint main()\n{\n int n, k;\n cin >> n >> k;\n int *arr = new int[n];\n for(int i = 0; i < n; i++)\n {\n cin >> arr[i];\n }\n cout << ceil(1.0*(n-1)/(k-1) - 1E-10) << endl;\n delete[] arr;\n return 0;\n}",ACCEPTED,958,4016 1584170569553539072,9b07e2ffe11a791274458c12a7fc2cb222da817dedd55c9d07627db301bb87a6,2022-10-23 21:11:10,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nconst int maxn = 1e6+5;\nint dp[maxn],a[maxn];\nint main()\n{\n\n int n,k,id=0;\n cin>>n>>k;\n for (int i=1; i<=n; i++)\n {\n cin>>a[i];\n if (a[i]==n) id=i;\n }\n int l,r;\n l=id-1;\n\n r=n-id;\n k--;\n int ans=0;\n if (l%k==0) ans=ans+l/k;\n else \n {\n ans=ans+l/k+1;\n r=n-(id-l%k+k);\n }\n if (r%k==0) ans=ans+r/k;\n else ans=ans+r/k+1;\n cout<\nusing namespace std;\nint main()\n{\n int n,k,L,token,flag=1;\n cin>>n>>k;\n vectorV;\n for(int a=0;a>L;\n V.push_back(L);\n }\n reverse(V.begin(),V.end());\n vector::iterator result = find( V.begin( ), V.end( ), n );\n token=-(result-V.end());\n // cout<=n){\n cout<\nusing namespace std;\nint main(){\n\tint n,k;\n\tcin >> n >> k;\n\tint tmp;\n\tfor(int i = 1;i <= n;i ++){\n\t\tint x;\n\t\tscanf(\""%d\"",&x);\n\t\tif(x == n) tmp = i;\n\t}\n\tk --;\n\tint tmp1 = tmp - 1;\n\tint ans = 0;\n\tif(tmp1 > 0)\n\t\tans = ans + (tmp1 - 1) / k + 1;\n\ttmp = tmp + (k - tmp1 % k);\n\tint tmp2 = n - tmp;\n\tif(tmp2 > 0)\n\t\tans = ans + (tmp2 - 1) / k + 1;\n\tcout << ans;\n\treturn 0;\n}\n",ACCEPTED,311,500 1584777091048402944,718bcf25e12c130e60b3155ca427b0f1a4bb76b3c87f3397767917dee95477a7,2022-10-25 13:21:16,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint n , k ;\nint main () {\n\tcin >> n >> k ;\n\tcout << ceil((double)(n - 1) / (k - 1))<< endl; \n}",ACCEPTED,33,492 1584835320197550080,17db497d47d74fbfe438e9d9de661c32f42aacfc86f315c118b45ae77cfd2de1,2022-10-25 17:12:39,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint n,k,p[1000010],cnt=1,ans=0,maxx=-1e9;\nint main(){\n\tcin>>n>>k;\n\tfor(int i=1;i<=n;i++)cin>>p[i],maxx=max(maxx,p[i]);\n\tbool flag=1;\n\twhile(flag){\n\t\tif(p[cnt]=maxx)flag=0;\n\t\tfor(int i=1;i<=k-1;i++){\n\t\t\tcnt++;\n\t\t\tif(p[cnt]=maxx)flag=0;\n\t\t}\n\t\tans++;\n\t}\n\twhile(cnt\nusing namespace std;\nint main()\n{\n\tint n,k;\n\tcin>>n>>k;\n\tfor(int i=0;i>a;\n\t}\n\tint ans=1;\n\tif((n-k)%(k-1)==0) ans+=(n-k)/(k-1);\n\telse ans+=(n-k)/(k-1)+1;\n\tcout<\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n int a[n+1]={0};\n int j=0;\n for(int i=1;i<=n;i++)\n {\n cin>>a[i];\n if(a[j]\nusing namespace std;\nint main()\n{\n\tint n,k,a;\n\tcin>>n>>k;\n\tfor(int i=0;i>a;\n\t}\n\tif((n-1)%(k-1)==0) cout<<(n-1)/(k-1);\n\telse cout<<(n-1)/(k-1)+1;\n\treturn 0;\n}",ACCEPTED,925,612 1584885179030040576,0f2ef20a088384b490c9495f8bd99ca2e04775d0c7e7ea2c09d67d96e5497296,2022-10-25 20:30:47,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n if((n-1)%(k-1)==0)\n {\n cout<<(n-1)/(k-1);\n }\n else{\n cout<<(n-1)/(k-1)+1;\n }\n return 0;\n}",ACCEPTED,55,588 1584897203294310400,09250124431d77c5fad47797f2c6fd9000101f732d4a36250137880eaa758b3f,2022-10-25 21:18:33,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main(){\n int n,k;\n cin>>n>>k;\n int a[n];\n for(int i = 0;i>a[i];\n }\n double b = ((double)n-1)/((double)k-1);\n if(b-(int)b == 0) cout<\n#include \nusing namespace std;\n\nint main() {\n\tint n,k;\n\tscanf(\""%d%d\"",&n,&k);\n\tint a[n+1];\n\tfor(int i=1;i<=n;i++) scanf(\""%d\"",&a[i]);\n\tint count=(n-1)/(k-1);\n\tif((n-1)%(k-1)!=0) count++;\n\tprintf(\""%d\"",count);\n}",ACCEPTED,318,4144 1585119831812599808,671e366d53dcb27ff2d7f07c46b08ffd966c3872df69580edd6fca9d1561d15f,2022-10-26 12:03:12,C++,0.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\n#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n int p[100010]={};\n int t=0;\n for(int i=1;i<=n;i++)\n {\n cin>>p[i];\n if(p[i]==n)\n {\n t=i;\n }\n }\n cout<\n#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n int p[2000010]={};\n int t=0;\n for(int i=1;i<=n;i++)\n {\n cin>>p[i];\n if(p[i]==n)\n {\n t=i;\n }\n }\n cout<\n#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n int p[2000010]={};\n int t=0;\n for(int i=1;i<=n;i++)\n {\n cin>>p[i];\n if(p[i]==n)\n {\n t=i;\n }\n }\n cout<<(t-1)/k+(n-t+1)/k+ceil((n-(t-1)/k*k-(n-t+1)/k+k)/k)<\n#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n int p[2000010]={};\n int t=0;\n for(int i=1;i<=n;i++)\n {\n cin>>p[i];\n if(p[i]==n)\n {\n t=i;\n }\n }\n cout<<(t-1)/k+(n-t)/k+ceil((n-(t-1)/k*k-(n-t)/k+k)/k)<\n#include\n#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n int p[2000010]={};\n int t=0;\n for(int i=1;i<=n;i++)\n {\n cin>>p[i];\n if(p[i]==n)\n {\n t=i;\n }\n }\n cout<<(t-1)/k+(n-t)/k+ceil(1.0*(n-(t-1)/k*k-(n-t)/k+k)/k)<\n#include\n#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n int p[2000010]={};\n int t=0;\n for(int i=1;i<=n;i++)\n {\n cin>>p[i];\n if(p[i]==n)\n {\n t=i;\n }\n }\n cout<<(t-1)/(k-1)+(n-t)/(k-1)+ceil(1.0*(n-(t-1)/(k-1)*(k-1)-(n-t)/(k-1)*(k-1))/(k-1))<\nusing namespace std;\nint main()\n{\n\tint n,k;cin>>n>>k;\n\tcout<<(n-1)/(k-1)+1;\n \n return 0;\n}",ACCEPTED,50,484 1585274825073356800,d7ca88c0006e4b13a61310d918a82a26326a44d36a2c1c2571f2ee155d939b47,2022-10-26 22:19:05,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\n#include\nusing namespace std;\nint main(){\n\tdouble n,k;\n\tcin>>n>>k;\n\tn--,k--;\n\tprintf(\""%d\"",int(ceil(n/k)));\n}\n",ACCEPTED,44,640 1585433194853691392,2a96ce13354a97fa705a720009a4f81efeaf33e0a91136c8c1aafc33bf7ef6e1,2022-10-27 08:48:24,C++,0.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint n,m,k,a[1000001],st,ans;\nbool pd=false;\nint main()\n{\n\tcin>>n>>k;\n\tfor (int i=1;i<=n;i++) \n\t{\n\t\tcin>>a[i];\n\t\tif (a[i]==n&&pd==false) st=i,pd=true;\n\t}\n\tif (k-st<0)\n\t{\n\t\tfor (int i=st;i>=1;i-=k) ans++;\n\t}\n\telse if (st!=1) ans++;\n\tfor (int i=st;i<=n;i+=3)\n\t{\n\t\tif (a[i+3]==m) i++;\n\t\tans++; \n\t}\n\tcout<\nusing namespace std;\nint n,m,k,a[1000001],st,ans;\nbool pd=false;\nint main()\n{\n\tcin>>n>>k;\n\tfor (int i=1;i<=n;i++) \n\t{\n\t\tcin>>a[i];\n\t\tif (a[i]==n&&pd==false) st=i,pd=true;\n\t}\n\tif (k-st<0)\n\t{\n\t\tfor (int i=st;i>=1;i-=k) ans++;\n\t}\n\telse if (st!=1) ans++;\n\tfor (int i=st;i<=n;i+=k)\n\t{\n\t\tif (a[i+3]==m) i++;\n\t\tans++; \n\t}\n\tcout<\nusing namespace std;\nint n,m,k,a[1000001],st,ans;\nbool pd=false;\nint main()\n{\n\tcin>>n>>k;\n\tfor (int i=1;i<=n;i++) \n\t{\n\t\tcin>>a[i];\n\t\tif (a[i]==n&&pd==false) st=i,pd=true;\n\t}\n\tif (st!=1)\n\t{\n\t\tif (st-k<0)\n\t\t{\n\t\t\tans++;\n\t\t\tst+=k-st;\n\t\t}\n\t\telse\n\t\tfor (int i=st;i>=1;i-=k) \n\t\t{ \n\t\t\tans++;\n\t\t}\n\t}\n\tfor (int i=st;i<=n;i+=k-1)\n\t{\n\t\tif (a[i+3]==m) i++;\n\t\tans++; \n\t}\n\tcout<\nusing namespace std;\nint n,k,a[1000001],st,ans;\nbool pd=false;\nint main()\n{\n\tcin>>n>>k;\n\tfor (int i=1;i<=n;i++) \n\t{\n\t\tcin>>a[i];\n\t\tif (a[i]==n&&pd==false) st=i,pd=true;\n\t}\n\tif (st!=1)\n\t{\n\t\tif (st-k<0)\n\t\t{\n\t\t\tans++;\n\t\t\tst+=k-st;\n\t\t}\n\t\telse\n\t\tfor (int i=st;i>=1;i-=k) \n\t\t{ \n\t\t\tans++;\n\t\t}\n\t}\n\tfor (int i=st;i<=n;i+=k-1)\n\t{\n\t\tif (a[i+3]==n) i++;\n\t\tans++; \n\t}\n\tcout<\nusing namespace std;\nint n,k,a[1000001],st,ans,sum;\nbool pd=false;\nint main()\n{\n\tcin>>n>>k;\n\tfor (int i=1;i<=n;i++) \n\t{\n\t\tcin>>a[i];\n\t\tif (a[i]==n&&pd==false) st=i,pd=true,sum++;\n\t}\n\tif (sum==n) \n\t{\n\t\tcout<<0<=1;i-=k) \n\t\t{ \n\t\t\tans++;\n\t\t}\n\t}\n\tfor (int i=st;i<=n;i+=k-1)\n\t{\n\t\tif (a[i+3]==n) i++;\n\t\tans++; \n\t}\n\tcout<\nusing namespace std;\nint n,k,a[1000001],st,ans,sum;\nbool pd=false;\nint main()\n{\n\tcin>>n>>k;\n\tfor (int i=1;i<=n;i++) \n\t{\n\t\tcin>>a[i];\n\t\tif (a[i]==n&&pd==false) st=i,pd=true,sum++;\n\t}\n\tif (st!=1)\n\t{\n\t\tif (st-k<0)\n\t\t{\n\t\t\tans++;\n\t\t\tst+=k-st;\n\t\t}\n\t\telse\n\t\tfor (int i=st;i>=1;i-=k) \n\t\t{ \n\t\t\tans++;\n\t\t}\n\t}\n\tfor (int i=st;i<=n;i+=k-1)\n\t{\n\t\tif (a[i+k-1]==n) i++;\n\t\tans++; \n\t}\n\tcout<\nusing namespace std;\nint n,k,a[1000001],st,ans,sum;\nbool pd=false;\nint main()\n{\n\tcin>>n>>k;\n\tfor (int i=1;i<=n;i++) \n\t{\n\t\tcin>>a[i];\n\t\tif (a[i]==n&&pd==false) st=i,pd=true,sum++;\n\t}\n\tif (st!=1)\n\t{\n\t\tif (st-k<0)\n\t\t{\n\t\t\tans++;\n\t\t\tst+=k-st;\n\t\t}\n\t\telse\n\t\tfor (int i=st;i>=1;i-=k) \n\t\t{ \n\t\t\tans++;\n\t\t}\n\t}\n\tfor (int i=st;i<=n;i+=k-1)\n\t{\n\t\tif (a[i+k]==n) \n\t\t{\n\t\t\ti++;\n\t\t\tcontinue;\n\t\t}\n\t\tif (n-i\nusing namespace std;\nint n,k,a[1000001],st,ans,sum;\nbool pd=false;\nint main()\n{\n\tcin>>n>>k;\n\tfor (int i=1;i<=n;i++) \n\t{\n\t\tcin>>a[i];\n\t\tif (a[i]==n&&pd==false) st=i,pd=true,sum++;\n\t}\n\tif (st!=1)\n\t{\n\t\tfor (int i=st;i>=1;i-=k-1) \n\t\t ans++;\n\t}\n\tif (st-k<0) st+=k-st; \n\tfor (int i=st;i<=n;i+=k-1)\n\t{\n\t\tif (a[i+k]==n) \n\t\t{\n\t\t\tint sum=0;\n\t\t\tfor (int j=i;j<=i+k-1;j++) \n\t\t\t if (a[j]==n) sum++;\n\t\t\tif (sum!=k) ans++;\n\t\t\ti+=k;\n\t\t\tcontinue;\n\t\t}\n\t\tif (n-i<=k-1)\n\t\t{\n\t\t\tbool p=false;\n\t\t\tfor (int j=i;j<=n;j++) if (a[j]!=n) pd=true; \n\t\t\tif (p==false) ans++;\n\t\t\tbreak;\n\t\t}\n\t\tans++; \n\t}\n\tcout<\nusing namespace std;\nint n,k,a[1000001],st,ans,sum;\nbool pd=false;\nint main()\n{\n\tcin>>n>>k;\n\tfor (int i=1;i<=n;i++) \n\t{\n\t\tcin>>a[i];\n\t\tif (a[i]==n&&pd==false) st=i,pd=true;\n\t}\n\tif (st!=1)\n\t{\n\t\tfor (int i=st;i>=1;i-=k-1) \n\t\t ans++;\n\t}\n\telse if (st-k<0) st=st+(k-st); \n\tfor (int i=st;i<=n;i+=k-1)\n\t{\n\t\tint sum=0;\n/*\t\tif (a[i+k]==n) \n\t\t{\n\t\t\tfor (int j=i;j<=i+k-1;j++) \n\t\t\t if (a[j]==n) sum++;\n\t\t\tif (sum!=k) ans++;\n\t\t\ti+=k;\n\t\t\tcontinue;\n\t\t}*/\n\t\tif (n-i<=k-1)\n\t\t{\n\t\t\tfor (int j=i;j<=n;j++) if (a[j]==n) sum++; \n\t\t\tif (sum!=n-i+1) ans++;\n\t\t\tbreak;\n\t\t}\n\t\tfor (int j=i;j<=i+k-1;j++)\n\t\t\tif (a[j]==n) sum++; \n\t\tif (sum!=k) ans++;\n\t}\n\tcout<\nusing namespace std;\nint n,k;\nint main()\n{\n\tcin>>n>>k;\n\tcout<<(n-1)/(k-1)+1;\n return 0;\n}",ACCEPTED,41,604 1585560884449505280,f83acb4dee205872e1c6bd69d86851eb0a166b0bcc06a5f13a21815689588701,2022-10-27 17:15:47,C++,0.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint main()\n{\n\tint a, b;\n\tcin >> a >> b;\n\tint x[20000];\n\tfor (int i = 0; i < a; i += 1)\n\t{\n\t\tcin >> x[i];\n\t}\n\tcout << (a - 1) / (b - 1) + 1;\n}\n",SEGMENTATION_FAULT,102,616 1585560981220491264,f83acb4dee205872e1c6bd69d86851eb0a166b0bcc06a5f13a21815689588701,2022-10-27 17:16:10,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint main()\n{\n\tint a, b;\n\tcin >> a >> b;\n\tint x[a];\n\tfor (int i = 0; i < a; i += 1)\n\t{\n\t\tcin >> x[i];\n\t}\n\tcout << (a - 1) / (b - 1) + 1;\n}\n",ACCEPTED,867,3976 1585601620150714369,022ead19dcb64d2d769e0a5f2f22ec394b24b7031ab11d98ab55b26bcf6c6024,2022-10-27 19:57:39,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main(){\n int n,k,t;\n cin >> n >> k;\n for(int i = 1;i <= n;i++) cin >> t;\n int ans = ceil(1.0 * (n - 1) / (k - 1));\n cout << ans;\n return 0;\n}\n",ACCEPTED,925,596 1585615778074198016,09c9ed039e50517d99f64e4b4053880e7211279ec043f23e30f99d7b9d6b8bb3,2022-10-27 20:53:55,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\n#include\nusing namespace std;\n\nint main()\n{\n int n,k;\n int a=0;\n cin>>n>>k;\n for(int i=0;i>t;\n if(t==n)\n {\n a++;\n }\n }\n cout<\nusing namespace std;\nint main() {\n\tint n, k;\n\tcin >> n >> k;\n\tint a[100];\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t}\n\tdouble ans1=((double)n-1)/((double)k-1);\n\tint ans=(n-1)/(k-1);\n\tif (ans1 > ans + 1e-10) {\n\t\tans++;\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}",SEGMENTATION_FAULT,51,696 1585620035330510848,7989c3c4ca9e2d75f25e5cd1e69454257047e44460e9543c48886f6f7542c801,2022-10-27 21:10:50,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint a[1000005];\nint main() {\n\tint n, k;\n\tcin >> n >> k;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t}\n\tdouble ans1=((double)n-1)/((double)k-1);\n\tint ans=(n-1)/(k-1);\n\tif (ans1 > ans + 1e-10) {\n\t\tans++;\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}",ACCEPTED,924,4164 1585639837436608512,6d65d24ed414d52033eba68d93c8da4585be28cc212cfb7e149b44bca422ef62,2022-10-27 22:29:31,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n int n,k,x,m;\n cin>>n>>k;\n for (int i=1;i<=n;i++)\n {\n \t cin>>x;\n }\n m=(n-1)/(k-1)+1;\n cout<\nusing namespace std;\nstring a,b;\nint n,La,Lb,Lm;\nint main()\n{\n cin>>La>>Lb;\n cout<\nusing namespace std;\nint main()\n{\n\tint n,k;\n\tcin>>n>>k;\n\tcout<<(n-1)/(k-1)+1;\n}\n",ACCEPTED,47,492 1585903371860967424,17ee72c2bd4bdeda0c14eeb65710f02c0374f825b38c05d4478fd8eddc56e822,2022-10-28 15:56:43,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\n\nint num_array[int(1e6)];\n\nint main()\n{\n\tint n, k;\n\tcin >> n >> k;\n\tint max_index = 0;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> num_array[i];\n\t\tif (num_array[max_index] < num_array[i])\n\t\t{\n\t\t\tmax_index = i;\n\t\t}\n\t}\n\tint right = max_index, left = n - max_index - 1;//统计左右各有多少个元素\n\tint temp_right = right % (k - 1), temp_left = left % (k - 1);\n\tint sum = right / (k - 1) + left / (k - 1);\n\tif (temp_right + temp_left <= k)\n\t{\n\t\tsum += 1;\n\t}\n\telse\n\t{\n\t\tsum += 2;\n\t}\n\tcout << sum;\n\treturn 0;\n}\n",ACCEPTED,909,4048 1585919856721399808,2e4fa7d81118476a10d9b252edfb0033f348b7389bbf422545cbdcb2f374cf6e,2022-10-28 17:02:13,C++,0.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n cout<<(n-1)/(k-1);\n return 0;\n}",WRONG_ANSWER,51,612 1585920021654016000,2e4fa7d81118476a10d9b252edfb0033f348b7389bbf422545cbdcb2f374cf6e,2022-10-28 17:02:52,C++,0.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n int num;\n for(int i=0;i>num;\n }\n cout<<(n-1)/(k-1);\n return 0;\n}",WRONG_ANSWER,899,488 1585920079250190336,2e4fa7d81118476a10d9b252edfb0033f348b7389bbf422545cbdcb2f374cf6e,2022-10-28 17:03:06,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n int num;\n for(int i=0;i>num;\n }\n cout<<(n-1)/(k-1)+1;\n return 0;\n}",ACCEPTED,967,604 1585929960170586112,48f8d527ef89aae3733689aec9b0e62e2bfdf6f9e5cbc4f29ef862561fd8eb39,2022-10-28 17:42:22,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n long long n,k;\n cin>>n>>k;\n long long p[1000005];\n\n for(long long i=1;i<=n;i++)\n {\n cin>>p[i];\n }\n if(n%k==0)\n cout<\n#include\n#include\n#include\n#include\nusing namespace std;\n\nint main()\n{\n\tint n,k;\n\tscanf(\""%d%d\"",&n,&k);\n\tint ans=(n-1)/(k-1);\n\tif((n-1)%(k-1)) ans+=1;\n\tprintf(\""%d\"",ans);\n\treturn 0;\n}",ACCEPTED,37,580 1585971551723720704,f5a8e8c2ad748ea65a7f165fe4c041a6876bea66b3442a0ef90f6024203098a8,2022-10-28 20:27:38,C++,90.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint max=-999,max_i=1;\n\tfor(int i=1; imax) {\n\t\t\tmax=p[i];\n\t\t\tmax_i=i;\n\t\t}\n\t}\n\tint sum=0;\n\tint temp=0;\n\tif(1+k-1>=max_i) {\n\t\ttemp=1;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp+k-1;\n\t\t\tsum++;\n\t\t}\n\t} \n\telse {\n\t\ttemp=max_i;\n\t\twhile(check(p,max_i+1)) {\n\t\t\tfor(int j=temp; j>=temp-k+1&&j>=1; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp-k+1;\n\t\t\tsum++;\n\t\t}\n\t\ttemp=max_i;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp+k-1;\n\t\t\tsum++;\n\t\t}\n\t}\n\tcout<\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint max=-999,max_i=1;\n\tfor(int i=1; imax) {\n\t\t\tmax=p[i];\n\t\t\tmax_i=i;\n\t\t}\n\t}\n\tint sum=0;\n\tint temp=0;\n\tif(1+k-1>=max_i) {\n\t\ttemp=1;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp+k-1;\n\t\t\tsum++;\n\t\t}\n\t} \n\telse {\n\t\ttemp=max_i;\n\t\twhile(check(p,max_i+1)) {\n\t\t\tfor(int j=temp; j>=temp-k+1&&j>=1; j--) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp-k+1;\n\t\t\tsum++;\n\t\t}\n\t\ttemp=max_i;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp+k-1;\n\t\t\tsum++;\n\t\t}\n\t}\n\tcout<\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint max=-999,max_i=1;\n\tfor(int i=1; imax) {\n\t\t\tmax=p[i];\n\t\t\tmax_i=i;\n\t\t}\n\t}\n\tint sum=0;\n\tint temp=0;\n\tif(1+k-1>=max_i) {\n\t\ttemp=1;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp+k-1;\n\t\t\tsum++;\n\t\t}\n\t} \n\telse {\n\t\ttemp=max_i;\n\t\twhile(check(p,max_i+1)) {\n\t\t\tfor(int j=temp; j>=temp-k+1&&j>=1; j--) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp-k+1;\n\t\t\tsum++;\n\t\t}\n\t\ttemp=max_i;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp+k-1;\n\t\t\tsum++;\n\t\t}\n\t}\n\tcout<\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint max=-9999,max_i=0;\n\tfor(int i=1; imax) {\n\t\t\tmax=p[i];\n\t\t\tmax_i=i;\n\t\t}\n\t}\n\tint sum=0;\n\tint temp=0;\n\tif(1+k-1>=max_i) {\n\t\ttemp=1;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp+k-1;\n\t\t\tsum++;\n\t\t}\n\t} \n\telse {\n\t\ttemp=max_i;\n\t\twhile(check(p,max_i+1)) {\n\t\t\tfor(int j=temp; j>=temp-k+1&&j>=1; j--) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp-k+1;\n\t\t\tsum++;\n\t\t}\n\t\ttemp=max_i;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp+k-1;\n\t\t\tsum++;\n\t\t}\n\t}\n\tcout<\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint max=-9999,max_i=0;\n\tfor(int i=1; imax) {\n\t\t\tmax=p[i];\n\t\t\tmax_i=i;\n\t\t}\n\t}\n\tint sum=0;\n\tint temp=0;\n\tif(1+k-1>=max_i) {\n\t\ttemp=1;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp+k-1;\n\t\t\tsum++;\n\t\t}\n\t} \n\telse {\n\t\ttemp=max_i;\n\t\twhile(check(p,max_i)) {\n\t\t\tfor(int j=temp; j>=temp-k+1&&j>=1; j--) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp-k+1;\n\t\t\tsum++;\n\t\t}\n\t\ttemp=max_i;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp+k-1;\n\t\t\tsum++;\n\t\t}\n\t}\n\tcout<\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint max=-9999,max_i=0;\n\tfor(int i=1; imax) {\n\t\t\tmax=p[i];\n\t\t\tmax_i=i;\n\t\t}\n\t}\n\tint sum=0;\n\tint temp=0;\n\tif(1+k-1>=max_i) {\n\t\ttemp=1;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp+k-1;\n\t\t\tsum++;\n\t\t}\n\t} \n\t/*else {\n\t\ttemp=max_i;\n\t\twhile(check(p,max_i)) {\n\t\t\tfor(int j=temp; j>=temp-k+1&&j>=1; j--) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp-k+1;\n\t\t\tsum++;\n\t\t}\n\t\ttemp=max_i;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp+k-1;\n\t\t\tsum++;\n\t\t}\n\t}*/\n\tcout<\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint max=-9999,max_i=0;\n\tfor(int i=1; imax) {\n\t\t\tmax=p[i];\n\t\t\tmax_i=i;\n\t\t}\n\t}\n\tint sum=0;\n\tint temp=0;\n\tif(1+k-1>=max_i) {\n\t\ttemp=1;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\tif(temp+k!=max_i)\ttemp=temp+k-1;\n\t\t\telse\ttemp=max_i;\n\t\t\tsum++;\n\t\t}\n\t} \n\telse {\n\t\ttemp=max_i;\n\t\twhile(check(p,max_i)) {\n\t\t\tfor(int j=temp; j>=temp-k+1&&j>=1; j--) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp-k+1;\n\t\t\tsum++;\n\t\t}\n\t\ttemp=max_i;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp+k-1;\n\t\t\tsum++;\n\t\t}\n\t}\n\tcout<\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint max=-9999,max_i=0;\n\tfor(int i=1; imax) {\n\t\t\tmax=p[i];\n\t\t\tmax_i=i;\n\t\t}\n\t}\n\tint sum=0;\n\tint temp=0;\n\tif(1+k-1>=max_i) {\n\t\ttemp=1;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\tif(temp+k!=max_i)\ttemp=temp+k-1;\n\t\t\telse\ttemp=max_i;\n\t\t\tsum++;\n\t\t}\n\t} \n\telse {\n\t\ttemp=max_i;\n\t\twhile(check(p,max_i+1)) {\n\t\t\tfor(int j=temp; j>=temp-k+1&&j>=1; j--) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp-k+1;\n\t\t\tsum++;\n\t\t}\n\t\ttemp=max_i;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=max;\n\t\t\t}\n\t\t\ttemp=temp+k-1;\n\t\t\tsum++;\n\t\t}\n\t}\n\tcout<\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint n_i=0;\n\tfor(int i=1; i=n_i) {\n\t\ttemp=1;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=n;\n\t\t\t}\n\t\t\tif(temp+k!=n_i)\ttemp=temp+k-1;\n\t\t\telse\ttemp=n_i;\n\t\t\tsum++;\n\t\t}\n\t} \n\telse {\n\t\ttemp=n_i;\n\t\twhile(check(p,n_i+1)) {\n\t\t\tfor(int j=temp; j>=temp-k+1&&j>=1; j--) {\n\t\t\t\tp[j]=n;\n\t\t\t}\n\t\t\ttemp=temp-k+1;\n\t\t\tsum++;\n\t\t}\n\t\ttemp=n_i;\n\t\twhile(check(p,n+1)) {\n\t\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\t\tp[j]=n;\n\t\t\t}\n\t\t\ttemp=temp+k-1;\n\t\t\tsum++;\n\t\t}\n\t}\n\tcout<\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint n_i=0;\n\tfor(int i=1; i=temp-k+1&&j>=1; j--) {\n\t\t\tp[j]=n;\n\t\t}\n\t\ttemp=temp-k+1;\n\t\tsum++;\n\t}\n\ttemp=n_i;\n\twhile(check(p,n+1)) {\n\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\tp[j]=n;\n\t\t}\n\t\ttemp=temp+k-1;\n\t\tsum++;\n\t}\n}\ncout<\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint n_i=0;\n\tfor(int i=1; i=temp-k+1&&j>=1; j--) {\n\t\t\tp[j]=n;\n\t\t}\n\t\ttemp=temp-k+1;\n\t\tsum++;\n\t}\n\ttemp=n_i;\n\twhile(check(p,n+1)) {\n\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\tp[j]=n;\n\t\t}\n\t\ttemp=temp+k-1;\n\t\tsum++;\n\t}\n\tcout<\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint n_i=0;\n\tfor(int i=1; i\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint n_i=0;\n\tfor(int i=1; i\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint n_i=0;\n\tfor(int i=1; i\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint n_i=0;\n\tfor(int i=1; i\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint n_i=0;\n\tfor(int i=1; i\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint sum=0;\n\tint temp=1;\n\twhile(check(p,n+1)) {\n\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\tp[j]=n;\n\t\t}\n\t\ttemp=temp+k-1;\n\t\tsum++;\n\t}\t//总会经过关键点，按顺序排即是最小的操作次数 \n\tcout<\n#include\n#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n cout<\n#include\n#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n cout<\n#include\n#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n cout<\n#include \nusing namespace std;\n\nint main()\n{\n double n,k;\n cin >> n >> k;\n double sum = (n-1)/(k-1);\n sum = ceil(sum);\n cout << sum;\n \n}",ACCEPTED,64,600 1586204244638044160,f5a8e8c2ad748ea65a7f165fe4c041a6876bea66b3442a0ef90f6024203098a8,2022-10-29 11:52:16,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint check(int p[],int N) {\n\tfor(int i=1; i>n>>k;\n\tint p[n+1];\n\tfor(int i=1; i>p[i];\n\t}\n\tint sum=0;\n\tint temp=1;\n\twhile(check(p,n+1)) {\n\t\tfor(int j=temp; j<=temp+k-1&&j<=n; j++) {\n\t\t\tp[j]=n;\n\t\t}\n\t\ttemp=temp+k-1;\n\t\tsum++;\n\t}\t//总会经过关键点，按顺序排即是最小的操作次数 \n\tif((n-1)%(k-1)==0&&p[n]==n)\tsum++;\n\tcout<\nusing namespace std;\n#define ll long long\n\nint main()\n{\n\tint n,k;\n\tcin>>n>>k;\n\t\n\tcout<\n#include\nusing namespace std;\n#define ll long long\n\nint main()\n{\n\tint n,k;\n\tcin>>n>>k;\n\tint a[n];\n\tfor(int i=0;i>a[i];\n\t}\n\t\n\tcout<\n#include\nusing namespace std;\n#define ll long long\n\nint main()\n{\n\tint n,k;\n\tcin>>n>>k;\n\tint a[n];\n\tfor(int i=0;i>a[i];\n\t}\n\t\n\tcout<<(n-1)/(k-1)+1;\n\t\n} ",ACCEPTED,1074,3996 1586279873467252736,0108e8cd0389531d204f35bebefdc989e15df9bce26bf3981c329696bf86dd67,2022-10-29 16:52:48,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n\tint n,k;\n\tcin>>n>>k;\n\tint a[n];\n\tfor(int i=0;i>a[i];\n\tif((n-1)%(k-1)==0)\n\tcout<<(n-1)/(k-1);\n\telse\n\tcout<<(n-1)/(k-1)+1;\n\treturn 0;\n}",ACCEPTED,1069,4044 1586305939892207616,b1930d367ba06ae0082d89d3c58b11419403cb6a48e89ac0c36c1b4ae9619fc0,2022-10-29 18:36:22,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint main(){\n\tint n,k;\n\tcin >> n >> k;\n\tint tmp;\n\tfor(int i = 1;i <= n;i ++){\n\t\tint x;\n\t\tscanf(\""%d\"",&x);\n\t\tif(x == n) tmp = i;\n\t}\n\tk --;\n\tint tmp1 = tmp - 1;\n\tint ans = 0;\n\tif(tmp1 > 0)\n\t\tans = ans + (tmp1 - 1) / k + 1;\n\ttmp = tmp + (k - tmp1 % k);\n\tint tmp2 = n - tmp;\n\tif(tmp2 > 0)\n\t\tans = ans + (tmp2 - 1) / k + 1;\n\tcout << ans;\n\treturn 0;\n}",ACCEPTED,375,604 1586312353352118272,a25da62c5d211ef14145c6ee5295f304804b12985f2cb3326ebf4d38ad70b2f6,2022-10-29 19:01:51,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\n\nint main()\n{\n int n,k;\n cin>>n>>k;\n int a[n];\n for(int i=0;i>a[i];\n cout<\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n \n printf(\""%.3lf\"",1.0*(n-1)/(k-1));\n return 0;\n}",WRONG_ANSWER,70,492 1586576085374337024,4115704a04ad581e5d8645fdca0a29dc5c1b8e7cd7bbbd9b45ad9eef8c05bc85,2022-10-30 12:29:50,C++,0.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n int n,k;\n cin>>n>>k;\n int arr[n];\n for(int i=0;i>arr[i];\n printf(\""%.3lf\"",1.0*(n-1)/(k-1));\n return 0;\n}",WRONG_ANSWER,1060,4016 1586576774800478208,4115704a04ad581e5d8645fdca0a29dc5c1b8e7cd7bbbd9b45ad9eef8c05bc85,2022-10-30 12:32:34,C++,0.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n int n, k;\n cin >> n >> k;\n int arr[6];\n for (int i = 0; i < n; i++)cin >> arr[i];\n printf(\""%d\"",(n-1+k-1-1)/(k-1));\n return 0;\n}",SEGMENTATION_FAULT,88,512 1586581154010365952,4115704a04ad581e5d8645fdca0a29dc5c1b8e7cd7bbbd9b45ad9eef8c05bc85,2022-10-30 12:49:59,C++,0.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n\tint n, j;\n\tcin >> n >> j;\n\tint arr[7]={0};\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> arr[i];\n\t}\n\tint flag = -1;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tif (arr[i] == n)\n\t\t{\n\t\t\tflag = i; break;\n\t\t}\n\t}\n\tint number = 0;\n\t//flag的作用是记录最大值出现的地方\n\tint gap = j - 1;//gap是能加到的值，j是小于号的值//写while吧 我并不需要修改数组的值\n\t//if (flag - gap <= 1)\n\t//{\n\t//\tnumber++;\n\t//}\n\t//else\n\t//{\n\n\t//}\n\t//向左~\n\tint a = flag;\n BACK:\n\tif (a - gap <= 1)\n\t{\n\t\tnumber++;\n\t}\n\telse\n\t{\n\t\tnumber++;\n\t\ta -= gap;\n\t\tgoto BACK;\n\t}\n\t//cout << number << endl;\n\ta = flag;\nBACKTO:\n\tif (a + gap >= n)\n\t{\n\t\tnumber++;\n\t}\n\telse\n\t{\n\t\tnumber++;\n\t\ta += gap;\n\t\tgoto BACKTO;\n\t}\n\tcout << number << endl;\n\treturn 0;\n}",SEGMENTATION_FAULT,133,620 1586581197920534528,4115704a04ad581e5d8645fdca0a29dc5c1b8e7cd7bbbd9b45ad9eef8c05bc85,2022-10-30 12:50:09,C++,30.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n\tint n, j;\n\tcin >> n >> j;\n\tint arr[n+1]={0};\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> arr[i];\n\t}\n\tint flag = -1;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tif (arr[i] == n)\n\t\t{\n\t\t\tflag = i; break;\n\t\t}\n\t}\n\tint number = 0;\n\t//flag的作用是记录最大值出现的地方\n\tint gap = j - 1;//gap是能加到的值，j是小于号的值//写while吧 我并不需要修改数组的值\n\t//if (flag - gap <= 1)\n\t//{\n\t//\tnumber++;\n\t//}\n\t//else\n\t//{\n\n\t//}\n\t//向左~\n\tint a = flag;\n BACK:\n\tif (a - gap <= 1)\n\t{\n\t\tnumber++;\n\t}\n\telse\n\t{\n\t\tnumber++;\n\t\ta -= gap;\n\t\tgoto BACK;\n\t}\n\t//cout << number << endl;\n\ta = flag;\nBACKTO:\n\tif (a + gap >= n)\n\t{\n\t\tnumber++;\n\t}\n\telse\n\t{\n\t\tnumber++;\n\t\ta += gap;\n\t\tgoto BACKTO;\n\t}\n\tcout << number << endl;\n\treturn 0;\n}",PARTIAL_ACCEPTED,1056,4040 1586582780393684992,4115704a04ad581e5d8645fdca0a29dc5c1b8e7cd7bbbd9b45ad9eef8c05bc85,2022-10-30 12:56:26,C++,30.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n\tint n, j;\n\tcin >> n >> j;\n\tint arr[n+1]={0};\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> arr[i];\n\t}\n\tint flag = -1;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tif (arr[i] == n)\n\t\t{\n\t\t\tflag = i; break;\n\t\t}\n\t}\n\tint number = 0;\n\t//flag的作用是记录最大值出现的地方\n\tint gap = j - 1;\n\tif (flag != 1 && flag != n)//flag不在最左最右 向左向右\n\t{ \n\t\tint a = flag;\n\tBACK:\n\t\tif (a - gap <= 1)\n\t\t{\n\t\t\tnumber++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tnumber++;\n\t\t\ta -= gap;\n\t\t\tgoto BACK;\n\t\t}\n\t\ta = flag;\n\tBACKTO:\n\t\tif (a + gap >= n)\n\t\t{\n\t\t\tnumber++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tnumber++;\n\t\t\ta += gap;\n\t\t\tgoto BACKTO;\n\t\t}\n\t}\n\telse if (flag == n)\n\t{\n\t\tint a = flag;\n\tBACK1:\n\t\tif (a - gap <= 1)\n\t\t{\n\t\t\tnumber++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tnumber++;\n\t\t\ta -= gap;\n\t\t\tgoto BACK1;\n\t\t}\n\t}\n\telse\n\t{\n\t\tint a = flag;\n\t\ta = flag;\n\tBACKTOW:\n\t\tif (a + gap >= n)\n\t\t{\n\t\t\tnumber++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tnumber++;\n\t\t\ta += gap;\n\t\t\tgoto BACKTOW;\n\t\t}\n\t}\n\tcout << number << endl;\n\treturn 0;\n}",PARTIAL_ACCEPTED,1062,4064 1586593638431723520,4115704a04ad581e5d8645fdca0a29dc5c1b8e7cd7bbbd9b45ad9eef8c05bc85,2022-10-30 13:39:35,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\n\nusing namespace std;\nint main()\n{\n\tint n, j;\n\tcin >> n >> j;\n\tint a[n+1];\n\tfor (int i = 1; i <= n; i++)\n\t\tcin >> a[i];\n\t\n\tint gap = j - 1;\n\tcout << (n-1+gap)/gap;\n\treturn 0;\n}",ACCEPTED,1047,4056 1586625813956919296,4115704a04ad581e5d8645fdca0a29dc5c1b8e7cd7bbbd9b45ad9eef8c05bc85,2022-10-30 15:47:26,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n\tint n, j;\n\tcin >> n >> j;\n\tint a[n+1];\n\tfor (int i = 1; i <= n; i++)\n\t\tcin >> a[i];\n\t\n\tint gap = j - 1;\n\tcout << (n-1+gap)/gap;\n\treturn 0;\n}",ACCEPTED,921,4064 1586625815114547200,4115704a04ad581e5d8645fdca0a29dc5c1b8e7cd7bbbd9b45ad9eef8c05bc85,2022-10-30 15:47:27,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n\tint n, j;\n\tcin >> n >> j;\n\tint a[n+1];\n\tfor (int i = 1; i <= n; i++)\n\t\tcin >> a[i];\n\t\n\tint gap = j - 1;\n\tcout << (n-1+gap)/gap;\n\treturn 0;\n}",ACCEPTED,925,4064 1586637217027981312,7405733489370d381eedc6d7ff2a893a4c8708789a95fd8bcbc1ec0a931a15c5,2022-10-30 16:32:45,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \n#include \nusing namespace std;\n\nint main() {\n\tlong int n, k;\n\n\tlong int num;\n\tcin >> n >> k;\n\tlong int a[n];\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\n\t}\n\tn = n - 1;\n\tk = k - 1;\n\tif (n % k == 0) {\n\t\tcout << n / k;\n\t} else {\n\t\tnum = n / k + 1;\n\n\t\tcout << num;\n\t}\n\n\n}",ACCEPTED,943,7772 1586887974595719168,82e69ad9376cfe120c97fd65f26c929814fc914705dc933b298a1f003d53c04b,2022-10-31 09:09:10,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\nint main(){\n int n, k;\n cin >> n >> k;\n int ans = (n - 1) / (k - 1);\n if((n - 1) % (k - 1)) cout << ans + 1;\n else cout << ans;\n return 0;\n}",ACCEPTED,43,592 1586919467854458880,17ee72c2bd4bdeda0c14eeb65710f02c0374f825b38c05d4478fd8eddc56e822,2022-10-31 11:14:19,C++,100.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include \nusing namespace std;\n\nint num_array[int(1e6)];\n\nint main()\n{\n\tint n, k;\n\tcin >> n >> k;\n\tint max_index = 0;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> num_array[i];\n\t\tif (num_array[max_index] < num_array[i])\n\t\t{\n\t\t\tmax_index = i;\n\t\t}\n\t}\n\tint right = max_index, left = n - max_index - 1;//统计左右各有多少个元素\n\tint temp_right = right % (k - 1), temp_left = left % (k - 1);\n\tint sum = right / (k - 1) + left / (k - 1);\n\tif (temp_right + temp_left + 1 <= k)\n\t{\n\t\tsum += 1;\n\t}\n\telse\n\t{\n\t\tsum += 2;\n\t}\n\tcout << sum;\n\treturn 0;\n}\n",ACCEPTED,922,4164 1587235620703301632,4e1aaef38c00e50cb2fafbc57f3efb9ebe8373146f0acf07008f259fc1808088,2022-11-01 08:10:36,C++,0.0,1581257139410436102,1580523125900832768,1039131349729988608,"#include\nusing namespace std;\nint main()\n{\n\tint m,n,sum,q=0,p=1;\n\tint A[100];\n\tcin>>m>>n;\n\tfor(int i=0;i>A[i];\n\t}\n\tsum=n-1;\n\twhile(1){\n\tp+=sum;++q;if(p>=m)break;}\n\tcout<\nusing namespace std;\nint main()\n{\n\tint m,n,sum,q=0,p=1;\n\tint A[10000000];\n\tcin>>m>>n;\n\tfor(int i=0;i>A[i];\n\t}\n\tsum=n-1;\n\twhile(1){\n\tp+=sum;++q;if(p>=m)break;}\n\tcout<\nusing namespace std;\nint main()\n{\n\tint m,n,sum,q=0,p=1;\n\tint A[99999999999];\n\tcin>>m>>n;\n\tfor(int i=0;i>A[i];\n\t}\n\tsum=n-1;\n\twhile(1){\n\tp+=sum;++q;if(p>=m)break;}\n\tcout<\nusing namespace std;\nint a[14000],b[14000];\nint main()\n{\n\tint n,i;\n double s;\n\tscanf(\""%d\"",&n);\n\twhile(n--)\n\t{\n\t\tint a,b,c,d;\n\t\tscanf(\""%d %d %d %d\"",&a,&b,&c,&d);\n\t\t\tif((abs(a-c)>1||abs(b-d)>1)&&(a==c||b==d))\n\t\t\t{\n\t\t\t\tprintf(\""yes\\n\"");\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if((a==c||b==d)&&(abs(a-c)<=1||abs(b-d)<=1))\n\t\t\t{\n\t\t\t\tprintf(\""no\\n\"");\n\t\t\t\tcontinue;\n\t\t\t}\n\t\ts=(double)(abs(b-d))/(double)(abs(a-c));\n\t\tif(a\nint main()\n{\n int a,b,n,m,i,j,q,w;\n q=0;w=0;\n scanf(\""%d\"",&n);\n if(n>100) n=100;\n for(i=1;i<=n;i++)\n {\n scanf(\""%d\"",&a);\n if(q100) m=100;\n for(j=1;j<=m;j++)\n {\n scanf(\""%d\"",&b);\n if(w\nint main()\n{\n int a,b,n,m,i,j,q,w;\n q=0;w=0;\n scanf(\""%d\"",&n);\n\n for(i=1;i<=n;i++)\n {\n scanf(\""%d\"",&a);\n if(q\n\nint max(int x,int a) {\n if (x > a) return x;\n else return a;\n}\n\nint main() {\n int n, x = 0, y = 0, a;\n scanf(\""%d\"", &n);\n for (int i = 0;i < n; i++) scanf(\""%d\"", &a), x = max(x, a);\n scanf(\""%d\"", &n);\n for (int i = 0;i < n; i++) scanf(\""%d\"", &a), y = max(y, a);\n printf(\""%d %d\"", x, y);\n return 0;\n}",ACCEPTED,93,468 1586702532122378240,d4d89a60a1e51464e3a83a7b5a3387d374033bcc3c66bb32a3a08873d696f6cf,2022-10-30 20:52:17,C,300.0,1586325773286404102,1583801490112126976,1039131349729988608,"#define _CRT_SECURE_NO_WARNINGS\n#include \n#include \n\nint gcd(int a, int b) {\n if (b) while ((a %= b) && (b %= a));\n return a + b;\n}\n\nint main() {\n int n;\n long long x1, y1, x2, y2;\n scanf(\""%d\"", &n);\n while (n--) {\n scanf(\""%lld%lld\\n%lld%lld\"", &x1, &y1, &x2, &y2);\n if (x1 == x2 && y1 == y2) { printf(\""no\\n\""); continue; }\n if (gcd(abs(x1 - x2), abs(y1 - y2)) == 1) printf(\""no\\n\"");\n else printf(\""yes\\n\"");\n }\n}",ACCEPTED,112,372 1586702601529720832,d4d89a60a1e51464e3a83a7b5a3387d374033bcc3c66bb32a3a08873d696f6cf,2022-10-30 20:52:34,C,300.0,1586325773286404102,1583801490112126976,1039131349729988608,"#define _CRT_SECURE_NO_WARNINGS\n#include \n#include \n\nint gcd(int x, int y)\n{\n if (!y) return x;\n else return gcd(y, x % y);\n}\n\nint main() {\n int n;\n long long x1, y1, x2, y2;\n scanf(\""%d\"", &n);\n while (n--) {\n scanf(\""%lld%lld\\n%lld%lld\"", &x1, &y1, &x2, &y2);\n if (x1 == x2 && y1 == y2) { printf(\""no\\n\""); continue; }\n if (gcd(abs(x1 - x2), abs(y1 - y2)) == 1) printf(\""no\\n\"");\n else printf(\""yes\\n\"");\n }\n}",ACCEPTED,117,348 1586715982882013184,2021d61e4d5b70f47394b54d769ff599b4d379946af85b696c95a2f2b426d01e,2022-10-30 21:45:44,Java,0.0,1586325773286404102,1583801490112126976,1039131349729988608,"import java.util.Scanner;\n\n/**\n * @Author yzz\n * @Date 2022/10/30 21:24\n * @PackageName:thirdCompetition\n * @ClassName: code7_7\n * @Description: TODO\n * @Version 1.0\n */\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int t = sc.nextInt();\n int x1, y1, x2, y2;\n while (t > 0) {\n x1 = sc.nextInt();\n y1 = sc.nextInt();\n x2 = sc.nextInt();\n y2 = sc.nextInt();\n if (gcd(y1 - x1, y2 - x2) != 1) {\n System.out.println(\""yes\"");\n } else {\n System.out.println(\""no\"");\n }\n t--;\n }\n }\n\n static int gcd(int a, int b) {\n return a == 0 ? b : gcd(a % b, a);\n }\n}",MULTIPLE_ERROR,9461,64092 1586718106655260672,2021d61e4d5b70f47394b54d769ff599b4d379946af85b696c95a2f2b426d01e,2022-10-30 21:54:11,Java,0.0,1586325773286404102,1583801490112126976,1039131349729988608,"import java.util.Scanner;\n\n/**\n * @Author yzz\n * @Date 2022/10/30 21:24\n * @PackageName:thirdCompetition\n * @ClassName: code7_7\n * @Description: TODO\n * @Version 1.0\n */\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int t = sc.nextInt();\n int x1, y1, x2, y2;\n while (t > 0) {\n x1 = sc.nextInt();\n y1 = sc.nextInt();\n x2 = sc.nextInt();\n y2 = sc.nextInt();\n if (gcd(y1 - x1, y2 - x2) != 1) {\n System.out.println(\""yes\"");\n } else {\n System.out.println(\""no\"");\n }\n t--;\n }\n }\n\n static int gcd(int a, int b) {\n while (b != 0) {\n int temp = a % b;\n a = b;\n b = temp;\n }\n return a;\n }\n}",WRONG_ANSWER,11710,57680 1586719240027504640,2021d61e4d5b70f47394b54d769ff599b4d379946af85b696c95a2f2b426d01e,2022-10-30 21:58:41,Java,285.0,1586325773286404102,1583801490112126976,1039131349729988608,"import java.util.Scanner;\n\n/**\n * @Author yzz\n * @Date 2022/10/30 21:24\n * @PackageName:thirdCompetition\n * @ClassName: code7_7\n * @Description: TODO\n * @Version 1.0\n */\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int t = sc.nextInt();\n int x1, y1, x2, y2;\n while (t > 0) {\n x1 = sc.nextInt();\n y1 = sc.nextInt();\n x2 = sc.nextInt();\n y2 = sc.nextInt();\n if (gcd(Math.abs(x2 - x1), Math.abs(y2 - y1)) != 1) {\n System.out.println(\""yes\"");\n } else {\n System.out.println(\""no\"");\n }\n t--;\n }\n }\n\n static int gcd(int a, int b) {\n while (b != 0) {\n int temp = a % b;\n a = b;\n b = temp;\n }\n return a;\n }\n}",PARTIAL_ACCEPTED,9384,52548 1586720018276421632,2021d61e4d5b70f47394b54d769ff599b4d379946af85b696c95a2f2b426d01e,2022-10-30 22:01:46,Java,285.0,1586325773286404102,1583801490112126976,1039131349729988608,"import java.util.Scanner;\n\n/**\n * @Author yzz\n * @Date 2022/10/30 21:24\n * @PackageName:thirdCompetition\n * @ClassName: code7_7\n * @Description: TODO\n * @Version 1.0\n */\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int t = sc.nextInt();\n int x1, y1, x2, y2;\n while (t > 0) {\n x1 = sc.nextInt();\n y1 = sc.nextInt();\n x2 = sc.nextInt();\n y2 = sc.nextInt();\n if (x1 == x2 && y1 == y2) {\n System.out.println(\""no\"");\n continue;\n }\n if (gcd(Math.abs(x2 - x1), Math.abs(y2 - y1)) != 1) {\n System.out.println(\""yes\"");\n } else {\n System.out.println(\""no\"");\n }\n t--;\n }\n }\n\n static int gcd(int a, int b) {\n while (b != 0) {\n int temp = a % b;\n a = b;\n b = temp;\n }\n return a;\n }\n}",PARTIAL_ACCEPTED,9715,60852 1586720190939140096,2021d61e4d5b70f47394b54d769ff599b4d379946af85b696c95a2f2b426d01e,2022-10-30 22:02:28,Java,300.0,1586325773286404102,1583801490112126976,1039131349729988608,"import java.util.Scanner;\n\n/**\n * @Author yzz\n * @Date 2022/10/30 21:24\n * @PackageName:thirdCompetition\n * @ClassName: code7_7\n * @Description: TODO\n * @Version 1.0\n */\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int t = sc.nextInt();\n int x1, y1, x2, y2;\n while (t > 0) {\n t--;\n x1 = sc.nextInt();\n y1 = sc.nextInt();\n x2 = sc.nextInt();\n y2 = sc.nextInt();\n if (x1 == x2 && y1 == y2) {\n System.out.println(\""no\"");\n continue;\n }\n if (gcd(Math.abs(x2 - x1), Math.abs(y2 - y1)) != 1) {\n System.out.println(\""yes\"");\n } else {\n System.out.println(\""no\"");\n }\n\n }\n }\n\n static int gcd(int a, int b) {\n while (b != 0) {\n int temp = a % b;\n a = b;\n b = temp;\n }\n return a;\n }\n}",ACCEPTED,8600,47400 1586721039438442496,2021d61e4d5b70f47394b54d769ff599b4d379946af85b696c95a2f2b426d01e,2022-10-30 22:05:50,Java,300.0,1586325773286404102,1583801490112126976,1039131349729988608,"import java.util.Scanner;\n\n/**\n * @Author yzz\n * @Date 2022/10/30 21:24\n * @PackageName:thirdCompetition\n * @ClassName: code7_7\n * @Description: TODO\n * @Version 1.0\n */\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int t = sc.nextInt();\n int x1, y1, x2, y2;\n while (t > 0) {\n t--;\n x1 = sc.nextInt();\n y1 = sc.nextInt();\n x2 = sc.nextInt();\n y2 = sc.nextInt();\n if (x1 == x2 && y1 == y2) {\n System.out.println(\""no\"");\n continue;\n }\n if (gcd(Math.abs(x2 - x1), Math.abs(y2 - y1)) != 1) {\n System.out.println(\""yes\"");\n } else {\n System.out.println(\""no\"");\n }\n\n }\n }\n\n static int gcd(int a, int b) {\n return a == 0 ? b : gcd(b % a, a);\n }\n}",ACCEPTED,8468,48612 1586721661122383872,2021d61e4d5b70f47394b54d769ff599b4d379946af85b696c95a2f2b426d01e,2022-10-30 22:08:18,Java,285.0,1586325773286404102,1583801490112126976,1039131349729988608,"import java.util.Scanner;\n\n/**\n * @Author yzz\n * @Date 2022/10/30 21:24\n * @PackageName:thirdCompetition\n * @ClassName: code7_7\n * @Description: TODO\n * @Version 1.0\n */\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int t = sc.nextInt();\n int x1, y1, x2, y2;\n while (t > 0) {\n t--;\n x1 = sc.nextInt();\n y1 = sc.nextInt();\n x2 = sc.nextInt();\n y2 = sc.nextInt();\n if (x1 == x2 && y1 == y2) {\n System.out.println(\""no\"");\n continue;\n }\n if (gcd(Math.abs(x2 - x1), Math.abs(y2 - y1)) != 1) {\n System.out.println(\""yes\"");\n } else {\n System.out.println(\""no\"");\n }\n\n }\n }\n\n static int gcd(int a, int b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n}",PARTIAL_ACCEPTED,11627,55824 1586722239646920704,2021d61e4d5b70f47394b54d769ff599b4d379946af85b696c95a2f2b426d01e,2022-10-30 22:10:36,Java,300.0,1586325773286404102,1583801490112126976,1039131349729988608,"import java.util.Scanner;\n\n/**\n * @Author yzz\n * @Date 2022/10/30 21:24\n * @PackageName:thirdCompetition\n * @ClassName: code7_7\n * @Description: TODO\n * @Version 1.0\n */\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int t = sc.nextInt();\n int x1, y1, x2, y2;\n while (t > 0) {\n t--;\n x1 = sc.nextInt();\n y1 = sc.nextInt();\n x2 = sc.nextInt();\n y2 = sc.nextInt();\n if (x1 == x2 && y1 == y2) {\n System.out.println(\""no\"");\n continue;\n }\n if (gcd(Math.abs(x2 - x1), Math.abs(y2 - y1)) != 1) {\n System.out.println(\""yes\"");\n } else {\n System.out.println(\""no\"");\n }\n\n }\n }\n static int gcd(int a, int b) {\n while (b != 0) {\n int temp = a % b;\n a = b;\n b = temp;\n }\n return a;\n }\n}",ACCEPTED,9687,58856 1587315858955177984,99f126d2048d4638923c66cbed76f1d4d74270157d5b0e21086d526e9d28f983,2022-11-01 13:29:26,C++,300.0,1586325773286404104,1583746247320023040,1039131349729988608,"#include\nusing namespace std;\n\nint main(){\n int n,m,nma,mma;\n nma=mma=0;\n cin>>n;\n for(int i=0;i>nn;\n \tif(nn>nma)\n \t\tnma=nn;\n\t}\n cin>>m;\n for(int i=0;i>mm;\n \tif(mm>mma)\n \t\tmma=mm;\n\t}\n cout<\nusing namespace std;\n\nint main(){\n int n;\n while(cin>>n){\n \tint x1,y1,x2,y2;\n \twhile(n--){\n \t\tcin>>x1>>y1;\n\t\t\tcin>>x2>>y2;\n\t\t\tif(abs(x1-x2)+abs(y1-y2)>1)\n\t\t\t\tcout<<\""yes\""<\nusing namespace std;\n\nint main(){\n int n;\n while(cin>>n){\n \tint x1,y1,x2,y2;\n \twhile(n--){\n \t\tcin>>x1>>y1;\n\t\t\tcin>>x2>>y2;\n\t\t\tif(abs(x1-x2)>1&&abs(y1-y2)>1)\n\t\t\t\tcout<<\""yes\""<\nusing namespace std;\n\nint main(){\n int n;\n while(cin>>n){\n \tint x1,y1,x2,y2;\n \twhile(n--){\n \t\tcin>>x1>>y1;\n\t\t\tcin>>x2>>y2;\n\t\t\tif(abs(x1-x2)>1||abs(y1-y2)>1)\n\t\t\t\tcout<<\""yes\""<\nusing namespace std;\nint gcd(int a,int b){\n\ta=max(a,b);\n\tb=min(a,b);\n\tcout<>n){\n \tint x1,y1,x2,y2;\n \twhile(n--){\n \t\tcin>>x1>>y1;\n\t\t\tcin>>x2>>y2;\n\t\t\tint xx=abs(x1-x2),yy=abs(y1-y2);\n\t\t\tif(xx>=2&&yy==0||xx==0&&yy>=2||xx==yy&&xx>=2)\n\t\t\t\tcout<<\""yes\""<\nusing namespace std;\nint main(){\n int n;\n while(cin>>n){\n \tint x1,y1,x2,y2;\n \twhile(n--){\n \t\tcin>>x1>>y1;\n\t\t\tcin>>x2>>y2;\n\t\t\tint xx=abs(x1-x2),yy=abs(y1-y2);\n\t\t\tif(xx>=2&&yy==0||xx==0&&yy>=2||xx==yy&&xx>=2)\n\t\t\t\tcout<<\""yes\""<\n#include \n\nint main(int argc, char *argv[])\n{\n // 请在此输入您的代码\n int n,m,a,b,i=1,maxa=0,maxb=0;\n scanf(\""%d\\n\"",&n);\n while(i<=n){\n \tscanf(\""%d\"",&a);\n \tif(a>maxa)\n \tmaxa=a;\n \ti++;\n }\n scanf(\""%d\"",&m);\n i=1;\n while(i<=m){\n \tscanf(\""%d\"",&b);\n \tif(b>maxb)\n \tmaxb=b;\n \ti++;\n }\n printf(\""%d %d\"",maxa,maxb);\n \n return 0;\n}",ACCEPTED,70,328 1587704741050757120,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 15:14:43,C,0.0,1586325773286404104,1583746247320023040,1039131349729988608,"#include\n#include\nint main() {\n int n,m,x=0,y=0,a;\n \n scanf(\""%d\"", &n);\n for (int i = 1;i <= n; i++) \n {\n scanf(\""%d\"", &a); \n x=max(x,a);\n }\n \n scanf(\""%d\"", &m);\n for (int i = 1;i <= m; i++) \n {\n scanf(\""%d\"", &a); \n y=max(y,a)\n }\n printf(\""%d %d\"", x, y);\n return 0;\n}\n",COMPILE_ERROR,0,0 1587720365848203264,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 16:16:48,C,0.0,1586325773286404104,1583746247320023040,1039131349729988608,"#include\n#include\nint main()\n{\n int n,m,x=0,y=0,a;\n \n scanf(\""%d\"", &n);\n for (int i=1;i<=n;i++) \n {\n scanf(\""%d\"", &a); \n x=max(x,a);\n }\n \n scanf(\""%d\"", &m);\n for (int i=1;i<=m;i++) \n {\n scanf(\""%d\"",&a); \n y=max(y,a);\n }\n printf(\""%d %d\"",x,y);\n return 0;\n}\n",COMPILE_ERROR,0,0 1587720391768977408,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 16:16:54,C++,0.0,1586325773286404104,1583746247320023040,1039131349729988608,"#include\n#include\nint main()\n{\n int n,m,x=0,y=0,a;\n \n scanf(\""%d\"", &n);\n for (int i=1;i<=n;i++) \n {\n scanf(\""%d\"", &a); \n x=max(x,a);\n }\n \n scanf(\""%d\"", &m);\n for (int i=1;i<=m;i++) \n {\n scanf(\""%d\"",&a); \n y=max(y,a);\n }\n printf(\""%d %d\"",x,y);\n return 0;\n}\n",COMPILE_ERROR,0,0 1587720938462969856,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 16:19:04,C++,0.0,1586325773286404104,1583746247320023040,1039131349729988608,"#include\n#include\nint main()\n{\n int n,m,x=0,y=0,a;\n \n scanf(\""%d\"", &n);\n for (int i=1;i<=n;i++) \n {\n scanf(\""%d\"", &a); \n x=max(x,a);\n }\n \n scanf(\""%d\"", &m);\n for (int i=1;i<=m;i++) \n {\n scanf(\""%d\"",&a); \n y=max(y,a);\n }\n printf(\""%d %d\"",x,y);\n return 0;\n}\n",COMPILE_ERROR,0,0 1587720996558274560,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 16:19:18,C++,0.0,1586325773286404104,1583746247320023040,1039131349729988608,"#include\n#include\nint main()\n{\n int n,m,x=0,y=0,a,max;\n \n scanf(\""%d\"", &n);\n for (int i=1;i<=n;i++) \n {\n scanf(\""%d\"", &a); \n x=max(x,a);\n }\n \n scanf(\""%d\"", &m);\n for (int i=1;i<=m;i++) \n {\n scanf(\""%d\"",&a); \n y=max(y,a);\n }\n printf(\""%d %d\"",x,y);\n return 0;\n}\n",COMPILE_ERROR,0,0 1587721732419555328,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 16:22:14,C++,0.0,1586325773286404104,1583746247320023040,1039131349729988608,"#include\n#include\nint main()\n{\n int n,m,x=0,y=0,a,max;\n \n scanf(\""%d\"", &n);\n for (int i=1;i<=n;i++) \n {\n scanf(\""%d\"", &a); \n x=max(x,a);\n }\n \n scanf(\""%d\"", &m);\n for (int i=1;i<=m;i++) \n {\n scanf(\""%d\"",&b); \n y=max(y,a);\n }\n printf(\""%d %d\"",x,y);\n return 0;\n}\n",COMPILE_ERROR,0,0 1587721836702535680,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 16:22:38,C,0.0,1586325773286404104,1583746247320023040,1039131349729988608,"#include\n#include\nint main() {\n int n,m,x=0,y=0,a;\n scanf(\""%d\"", &n);\n for (int i = 1;i <= n; i++) scanf(\""%d\"", &a), x = max(x,a);\n scanf(\""%d\"", &m);\n for (int i = 1;i <= m; i++) scanf(\""%d\"", &a), y = max(y,a);\n printf(\""%d %d\"", x, y);\n return 0;\n}",COMPILE_ERROR,0,0 1587722228811239424,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 16:24:12,C,0.0,1586325773286404104,1583746247320023040,1039131349729988608,"#include\n#include\nint main() {\n int max(int m,int n);\n int n,m,x=0,y=0,a;\n scanf(\""%d\"", &n);\n for (int i = 1;i <= n; i++) scanf(\""%d\"", &a), x = max(x,a);\n scanf(\""%d\"", &m);\n for (int i = 1;i <= m; i++) scanf(\""%d\"", &a), y = max(y,a);\n printf(\""%d %d\"", x, y);\n return 0;\n}",COMPILE_ERROR,0,0 1587727803125116928,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 16:46:21,C,300.0,1586325773286404104,1583746247320023040,1039131349729988608,"#include\n#include\nint main() {\nint max(int m, int n)\n{\n return m>n?m:n;\n}\n int n,m,x=0,y=0,a;\n scanf(\""%d\"", &n);\n for (int i=1;i<=n;i++) \n {\n scanf(\""%d\"",&a);\n x = max(x,a); \n } \n scanf(\""%d\"", &m);\n for (int i=1;i<=m;i++) \n {\n scanf(\""%d\"", &a);\n y = max(y,a); \n }\n printf(\""%d %d\"", x, y);\n return 0;\n}",ACCEPTED,65,364 1587802325278851072,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 21:42:28,C,0.0,1586325773286404102,1583801490112126976,1039131349729988608,"#include\n#include\nint main()\n{\n int gcd(int a,int b) //a和b的最大公约数\n {\n if(b==0)\n retuan a;\n else\n gcd(b,a%b);\n }\n int t,ax,bx,ay,by;\n scanf(\""%d\"",&t);\n while(t--)\n {\n scanf(\""%d %d\"",&ax,&ay);\n scanf(\""%d %d\"",&bx,&by);\n if(ax==bx&&ay==by)//两人坐标相同\n {\n printf(\""no\\n\"");\n continue;\n }\n if(gcd(abs(ax-bx),abs(ay-by))==1) //相聚一格\n printf(\""no\\n\"");\n else \n printf(\""yes\\n\""); \n }\n return 0；\n}",COMPILE_ERROR,0,0 1587803145508552704,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 21:45:44,C,0.0,1586325773286404102,1583801490112126976,1039131349729988608,"#include\n#include\nint main()\n{\n inline int gcd(int a,int b) //a和b的最大公约数\n {\n if(b==0)\n retuan a;\n else\n gcd(b,a%b);\n }\n int t,ax,bx,ay,by;\n scanf(\""%d\"",&t);\n while(t--)\n {\n scanf(\""%d %d\"",&ax,&ay);\n scanf(\""%d %d\"",&bx,&by);\n if(ax==bx&&ay==by)//两人坐标相同\n {\n printf(\""no\\n\"");\n continue;\n }\n if(gcd(abs(ax-bx),abs(ay-by))==1) //相聚一格\n printf(\""no\\n\"");\n else \n printf(\""yes\\n\""); \n }\n return 0；\n}",COMPILE_ERROR,0,0 1587804625149931520,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 21:51:37,C,0.0,1586325773286404102,1583801490112126976,1039131349729988608,"#include\n#include\ninline int gcd(int a,int b)\n{\n if(b) while((a%=b)&&(b%=a));\n return a+b;\n}\nint main()\n{\n int t,ax,bx,ay,by;\n scanf(\""%d\"",&t);\n while(t--)\n {\n scanf(\""%d %d\"",&ax,&ay);\n scanf(\""%d %d\"",&bx,&by);\n if(ax==bx&&ay==by)//两人坐标相同\n {\n printf(\""no\\n\"");\n continue;\n }\n if(gcd(abs(ax-bx),abs(ay-by))==1) //相聚一格\n printf(\""no\\n\"");\n else \n printf(\""yes\\n\""); \n }\n return 0；\n}",COMPILE_ERROR,0,0 1587808055390154752,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 22:05:15,C++,0.0,1586325773286404102,1583801490112126976,1039131349729988608,"#include\n#include\ninline int gcd(int a,int b)\n{\n if(b) while((a%=b)&&(b%=a));\n return a+b;\n}\nint main()\n{\n int t,ax,bx,ay,by;\n scanf(\""%d\"",&t);\n while(t--)\n {\n scanf(\""%d %d\"",&ax,&ay);\n scanf(\""%d %d\"",&bx,&by);\n if(ax==bx&&ay==by)//两人坐标相同\n {\n printf(\""no\\n\"");\n continue;\n }\n if(gcd(abs(ax-bx),abs(ay-by))==1) //相聚一格\n printf(\""no\\n\"");\n else \n printf(\""yes\\n\""); \n }\n return 0；\n}",COMPILE_ERROR,0,0 1587808247657074688,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 22:06:00,C++,0.0,1586325773286404102,1583801490112126976,1039131349729988608,"#include\n#include\ninline int gcd(int a,int b)；\n{\n if(b) while((a%=b)&&(b%=a));\n return a+b;\n}\nint main()\n{\n int t,ax,bx,ay,by;\n scanf(\""%d\"",&t);\n while(t--)\n {\n scanf(\""%d %d\"",&ax,&ay);\n scanf(\""%d %d\"",&bx,&by);\n if(ax==bx&&ay==by)//两人坐标相同\n {\n printf(\""no\\n\"");\n continue;\n }\n if(gcd(abs(ax-bx),abs(ay-by))==1) //相聚一格\n printf(\""no\\n\"");\n else \n printf(\""yes\\n\""); \n }\n return 0；\n}",COMPILE_ERROR,0,0 1587808707017244672,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 22:07:50,C,0.0,1586325773286404102,1583801490112126976,1039131349729988608,"#include\n#include\ninline int gcd(int a,int b)；\n{\n if(b) while((a%=b)&&(b%=a));\n return a+b;\n}\nint main()\n{\n int t,ax,bx,ay,by;\n scanf(\""%d\"",&t);\n while(t--)\n {\n scanf(\""%d %d\"",&ax,&ay);\n scanf(\""%d %d\"",&bx,&by);\n if(ax==bx&&ay==by)//两人坐标相同\n {\n printf(\""no\\n\"");\n continue;\n }\n if(gcd(fabs(ax-bx),fabs(ay-by))==1) //相聚一格\n printf(\""no\\n\"");\n else \n printf(\""yes\\n\""); \n }\n return 0；\n}",COMPILE_ERROR,0,0 1587809029051715584,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 22:09:07,C,0.0,1586325773286404102,1583801490112126976,1039131349729988608,"#include\n#include\nint main()\n{\n int t,ax,bx,ay,by;\n scanf(\""%d\"",&t);\n while(t--)\n {\n scanf(\""%d %d\"",&ax,&ay);\n scanf(\""%d %d\"",&bx,&by);\n if(ax==bx&&ay==by)//两人坐标相同\n {\n printf(\""no\\n\"");\n continue;\n }\n if(gcd(abs(ax-bx),abs(ay-by))==1) //相聚一格\n printf(\""no\\n\"");\n else \n printf(\""yes\\n\""); \n }\n return 0；\n}",COMPILE_ERROR,0,0 1587809203421515776,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 22:09:48,C,0.0,1586325773286404102,1583801490112126976,1039131349729988608,"#include\n#include\nint main()\n{\n int abs(int n);\n int t,ax,bx,ay,by;\n scanf(\""%d\"",&t);\n while(t--)\n {\n scanf(\""%d %d\"",&ax,&ay);\n scanf(\""%d %d\"",&bx,&by);\n if(ax==bx&&ay==by)//两人坐标相同\n {\n printf(\""no\\n\"");\n continue;\n }\n if(gcd(abs(ax-bx),abs(ay-by))==1) //相聚一格\n printf(\""no\\n\"");\n else \n printf(\""yes\\n\""); \n }\n return 0；\n}",COMPILE_ERROR,0,0 1587810155960532992,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 22:13:35,C,0.0,1586325773286404102,1583801490112126976,1039131349729988608,"#include\n#include\nint main()\n{\n int abs(int n);\n int t,ax,bx,ay,by;\n scanf(\""%d\"",&t);\n while(t--)\n {\n scanf(\""%d %d\"",&ax,&ay);\n scanf(\""%d %d\"",&bx,&by);\n if(ax==bx&&ay==by)//两人坐标相同\n {\n printf(\""no\\n\"");\n continue;\n }\n if(gcd(int abs(int(ax-bx)),int abs(int(ay-by)))==1;)) //相聚一格\n printf(\""no\\n\"");\n else \n printf(\""yes\\n\""); \n }\n return 0；\n}",COMPILE_ERROR,0,0 1587810331655737344,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-02 22:14:17,C,300.0,1586325773286404102,1583801490112126976,1039131349729988608,"#include\n#include\ninline int gcd(int a,int b){\n if(b) while((a%=b)&&(b%=a));\n return a+b;\n}\nint main(){\n int t,ax,bx,ay,by;\n scanf(\""%d\"",&t);\n while(t--){\n scanf(\""%d %d\"",&ax,&ay);\n scanf(\""%d %d\"",&bx,&by);\n if(ax==bx&&ay==by){\n printf(\""no\\n\"");\n continue;\n }\n if(gcd(abs(ax-bx),abs(ay-by))==1) printf(\""no\\n\"");\n else printf(\""yes\\n\"");\n }\n \n return 0;\n} ",ACCEPTED,97,472 1588509874345021440,7925f14116adf5fb3b68876bfe08d71dae7944e7bad8675409adda4b1cc615e1,2022-11-04 20:34:01,C,0.0,1586325773286404104,1583746247320023040,1039131349729988608,"#include\n#include\nint main() {\n int n,m,x=0,y=0,a;\n scanf(\""%d\"", &n);\n for (int i = 1;i <= n; i++) scanf(\""%d\"", &a), x = max(x,a);\n scanf(\""%d\"", &m);\n for (int i = 1;i <= m; i++) scanf(\""%d\"", &a), y = max(y,a);\n printf(\""%d %d\"", x, y);\n return 0;\n}",COMPILE_ERROR,0,0 1588514046066888704,7925f14116adf5fb3b68876bfe08d71dae7944e7bad8675409adda4b1cc615e1,2022-11-04 20:50:36,C,300.0,1586325773286404102,1583801490112126976,1039131349729988608,"#include\n#include\ninline int gcd(int a,int b){\n if(b) while((a%=b)&&(b%=a));\n return a+b;\n}\nint main(){\n int t,ax,bx,ay,by;\n scanf(\""%d\"",&t);\n while(t--){\n scanf(\""%d %d\"",&ax,&ay);\n scanf(\""%d %d\"",&bx,&by);\n if(ax==bx&&ay==by){\n printf(\""no\\n\"");\n continue;\n }\n if(gcd(abs(ax-bx),abs(ay-by))==1) printf(\""no\\n\"");\n else printf(\""yes\\n\"");\n }\n \n return 0;\n} ",ACCEPTED,156,512 1453923460224544768,47f98eee140f47a2c4ae71f77bc0dbdec70845fafca1721aba47f135dc3bb74e,2021-10-29 11:15:40,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tif(n%2==0) {\n\t\tn*=2;\n\t\tprintf(\""%d\"",n);\n\t}\n\telse{\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",n);\n\t}\n\treturn 0; \n}",none,0,0 1453923592672768000,47f98eee140f47a2c4ae71f77bc0dbdec70845fafca1721aba47f135dc3bb74e,2021-10-29 11:16:11,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tif(n%2==0) {\n\t\tn*=2;\n\t\tprintf(\""%d\"",n);\n\t}\n\telse{\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",n);\n\t}\n\treturn 0; \n}",none,0,0 1453925041275580416,a8df12cb77e351648371c0e1365c07683fdbc80b96ea562bf9e42a4bd7c31331,2021-10-29 11:21:57,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n if(a%2==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n esle\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1453925057163948032,a8df12cb77e351648371c0e1365c07683fdbc80b96ea562bf9e42a4bd7c31331,2021-10-29 11:22:00,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n if(a%2==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n esle\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1453925108716040192,a8df12cb77e351648371c0e1365c07683fdbc80b96ea562bf9e42a4bd7c31331,2021-10-29 11:22:13,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n if(a%2==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1453925118996770816,a8df12cb77e351648371c0e1365c07683fdbc80b96ea562bf9e42a4bd7c31331,2021-10-29 11:22:15,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n if(a%2==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1453925367261425664,a8df12cb77e351648371c0e1365c07683fdbc80b96ea562bf9e42a4bd7c31331,2021-10-29 11:23:14,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n if(a%2==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1453925381589069824,a8df12cb77e351648371c0e1365c07683fdbc80b96ea562bf9e42a4bd7c31331,2021-10-29 11:23:18,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n if(a%2==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1453925648330125312,a8df12cb77e351648371c0e1365c07683fdbc80b96ea562bf9e42a4bd7c31331,2021-10-29 11:24:21,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n if(a%2==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1453925665300672512,a8df12cb77e351648371c0e1365c07683fdbc80b96ea562bf9e42a4bd7c31331,2021-10-29 11:24:25,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n if(a%2==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1453925674993217536,a8df12cb77e351648371c0e1365c07683fdbc80b96ea562bf9e42a4bd7c31331,2021-10-29 11:24:28,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n if(a%2==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1453926026463064064,a8df12cb77e351648371c0e1365c07683fdbc80b96ea562bf9e42a4bd7c31331,2021-10-29 11:25:52,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1453926907619225600,a8df12cb77e351648371c0e1365c07683fdbc80b96ea562bf9e42a4bd7c31331,2021-10-29 11:29:22,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1453926921557143552,a8df12cb77e351648371c0e1365c07683fdbc80b96ea562bf9e42a4bd7c31331,2021-10-29 11:29:25,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1453928531503083520,a8df12cb77e351648371c0e1365c07683fdbc80b96ea562bf9e42a4bd7c31331,2021-10-29 11:35:49,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1453928623471980544,a8df12cb77e351648371c0e1365c07683fdbc80b96ea562bf9e42a4bd7c31331,2021-10-29 11:36:11,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1453928987352526848,a8df12cb77e351648371c0e1365c07683fdbc80b96ea562bf9e42a4bd7c31331,2021-10-29 11:37:37,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1453929187265638400,4a2d89bb740b012eb79b3b44b5f5280c8418c68120066c1622ed1ef208d71ad6,2021-10-29 11:38:25,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tif (n%2==0) {\n\t\tn*=2;\n\t\tprintf(\""%d\"",n);\n\t\t\n\t}\n\telse{\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的各位数是%d\"",n);\n\t}\n\treturn 0;\n}",none,0,0 1453929234879868928,4a2d89bb740b012eb79b3b44b5f5280c8418c68120066c1622ed1ef208d71ad6,2021-10-29 11:38:36,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tif (n%2==0) {\n\t\tn*=2;\n\t\tprintf(\""%d\"",n);\n\t\t\n\t}\n\telse{\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的各位数是%d\"",n);\n\t}\n\treturn 0;\n}",none,0,0 1453929321454006272,4a2d89bb740b012eb79b3b44b5f5280c8418c68120066c1622ed1ef208d71ad6,2021-10-29 11:38:57,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tif (n%2==0) {\n\t\tn*=2;\n\t\tprintf(\""%d\"",n);\n\t\t\n\t}\n\telse{\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的各位数是%d\"",n);\n\t}\n\treturn 0;\n}",none,0,0 1453929399237373952,47f98eee140f47a2c4ae71f77bc0dbdec70845fafca1721aba47f135dc3bb74e,2021-10-29 11:39:16,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tif(n%2==0) {\n\t\tn*=2;\n\t\tprintf(\""%d\"",n);\n\t}\n\telse{\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",n);\n\t}\n\treturn 0; \n}",none,0,0 1453929523183005696,47f98eee140f47a2c4ae71f77bc0dbdec70845fafca1721aba47f135dc3bb74e,2021-10-29 11:39:45,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tif(n%2==0) {\n\t\tn*=2;\n\t\tprintf(\""%d\"",n);\n\t}\n\telse{\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",n);\n\t}\n\treturn 0; \n}",none,0,0 1453929635557535744,4a2d89bb740b012eb79b3b44b5f5280c8418c68120066c1622ed1ef208d71ad6,2021-10-29 11:40:12,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tif (n%2==0) {\n\t\tn*=2;\n\t\tprintf(\""%d\"",n);\n\t\t\n\t}\n\telse{\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的各位数是%d\"",n);\n\t}\n\treturn 0;\n}",none,0,0 1453962762669256704,a8df12cb77e351648371c0e1365c07683fdbc80b96ea562bf9e42a4bd7c31331,2021-10-29 13:51:50,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454038192470355968,b299c668add57880563a2946958f1d8504f197de8e8ae68a4902651765550d2c,2021-10-29 18:51:34,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main(void)\n{\n int i;\n printf(\""请输入想要判断的数字\\n\"");\n scanf(\""%d\"",&i);\n if(i>0&&i%2==1)\n { \n printf(\""该数为奇数\\n\""); \n }\n else if(i>0&&i%2==0)\n {\n printf(\""该数为偶数\\n\"");\n }\n else\n {\n printf(\""无法判断~~~\\n\"");\n }\n\n return 0 ;\n}",none,0,0 1454038755392483328,c5859cd8147179af96fb55471158f3df5431261d3fa4b7e5fcdcd40b7e5c500c,2021-10-29 18:53:48,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main(void)\n{\n int i;\n printf(\""请输入想要判断的数字\\n\"");\n scanf(\""%d\"",&i);\n if(i>0&&i%2==1)\n { \n printf(\""该数为奇数\\n\""); \n }\n else if(i>0&&i%2==0)\n {\n printf(\""该数为偶数\\n\"");\n }\n else\n {\n printf(\""无法判断~~~\\n\"");\n }\n\n return 0 ;\n}",none,0,0 1454039819457310720,c5859cd8147179af96fb55471158f3df5431261d3fa4b7e5fcdcd40b7e5c500c,2021-10-29 18:58:02,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main(void)\n{\n int i;\n printf(\""请输入想要判断的数字\\n\"");\n scanf(\""%d\"",&i);\n if(i>0&&i%2==1)\n { \n printf(\""该数为奇数\\n\""); \n }\n else if(i>0&&i%2==0)\n {\n printf(\""该数为偶数\\n\"");\n }\n else\n {\n printf(\""无法判断~~~\\n\"");\n }\n\n return 0 ;\n}",none,0,0 1454041888097169408,1fb21588ac1722f0bd769f341550a0610df9653ab5d6a37f70b2351e2f4523f4,2021-10-29 19:06:15,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454042829843509248,34e52b8f5141d0df72b606659af3c713f6c84f811aa6c61369997e898912d559,2021-10-29 19:10:00,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \n\nint main() {\n\tint n, m;\n\tscanf(\""%d\"", &n);\n\n\tif (n % 2 == 0) {\n\t\tm = n * 2;\n\t\tprintf(\""%d\"", m);\n\t} else {\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"", n % 10);\n\t}\n\n\treturn 0;\n}",none,0,0 1454043347403845632,34e52b8f5141d0df72b606659af3c713f6c84f811aa6c61369997e898912d559,2021-10-29 19:12:03,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \n\nint main() {\n\tint n, m;\n\tscanf(\""%d\"", &n);\n\n\tif (n % 2 == 0) {\n\t\tm = n * 2;\n\t\tprintf(\""%d\"", m);\n\t} else {\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"", n % 10);\n\t}\n\n\treturn 0;\n}",none,0,0 1454052323096965120,7d84adce41cfc7369936caa6253fa72fb140752a5d2cf3de0db9db3e61d0d47e,2021-10-29 19:47:43,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main(void)\n{\n int i;\n printf(\""请输入想要判断的数字\\n\"");\n scanf(\""%d\"",&i);\n if(i>0&&i%2==1)\n { \n printf(\""该数为奇数\\n\""); \n }\n else if(i>0&&i%2==0)\n {\n printf(\""该数为偶数\\n\"");\n }\n else\n {\n printf(\""无法判断~~~\\n\"");\n }\n\n return 0 ;\n}",none,0,0 1454052675360518144,34e52b8f5141d0df72b606659af3c713f6c84f811aa6c61369997e898912d559,2021-10-29 19:49:07,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \n\nint main() {\n\tint n, m;\n\tscanf(\""%d\"", &n);\n\n\tif (n % 2 == 0) {\n\t\tm = n * 2;\n\t\tprintf(\""%d\"", m);\n\t} else {\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"", n % 10);\n\t}\n\n\treturn 0;\n}",none,0,0 1454059397466288128,53432ab628282150f6432b697e7394c191431f4f27fa2efa112152aa93fd4d4c,2021-10-29 20:15:50,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454062708667871232,972d541eb566e1fe2f3ddc067ed0d0fa1cdc1fa0d74ef12aecaa2a7ec9de5378,2021-10-29 20:28:59,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n\tint a=0;\n\tscanf(\""%d\"",&a);\n\tint c=a%2;\n\tif (c==1){\n\t\tint b=0;\n\t\tb=a%10;\n\t\tprintf(\""%d\"",b);\n\t\t\n\t}\n\telse{\n\t\tint d=0;\n\t\td=a*2;\n\t\tprintf(\""%d\"",d);\n\t\t\n\t}\n\treturn 0;\n}",none,0,0 1454064381360500736,47f98eee140f47a2c4ae71f77bc0dbdec70845fafca1721aba47f135dc3bb74e,2021-10-29 20:35:38,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tif(n%2==0) {\n\t\tn*=2;\n\t\tprintf(\""%d\"",n);\n\t}\n\telse{\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",n);\n\t}\n\treturn 0; \n}",none,0,0 1454065027589992448,f07e0ac3ecd9fd656a368fb221469c230216362bf4975546d7188038e59aef07,2021-10-29 20:38:12,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \n\nint main () {\n\tint n;\n\tscanf(\""%d\"", &n);\n\tif (n % 2)\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"", n % 10);\n\telse\n\t\tprintf(\""%d\"", n * 2);\n\treturn 0;\n}",none,0,0 1454066287008968704,126ae302aefe8a410856475b01454e870ed9a1277f2474232c235ebb552103b2,2021-10-29 20:43:12,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \n\nint main() {\n\tint n;\n\tscanf(\""%d\"", &n);\n\tif (n % 2 ) {\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"", n / 1 % 10);\n\t} else {\n\t\tprintf(\""该数为偶数，这个数的个位数是%d\"", n / 1 % 10);\n\t}\n}",none,0,0 1454067054369959936,126ae302aefe8a410856475b01454e870ed9a1277f2474232c235ebb552103b2,2021-10-29 20:46:15,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \n\nint main() {\n\tint n;\n\tscanf(\""%d\"", &n);\n\tif (n % 2 ) {\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"", n / 1 % 10);\n\t} else {\n\t\tprintf(\""该数为偶数，这个数的个位数是%d\"", n / 1 % 10);\n\t}\n}",none,0,0 1454074394946482176,972d541eb566e1fe2f3ddc067ed0d0fa1cdc1fa0d74ef12aecaa2a7ec9de5378,2021-10-29 21:15:25,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n\tint a=0;\n\tscanf(\""%d\"",&a);\n\tint c=a%2;\n\tif (c==1){\n\t\tint b=0;\n\t\tb=a%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",b);\n\t\t\n\t}\n\telse{\n\t\tint d=0;\n\t\td=a*2;\n\t\tprintf(\""该数为偶数，这个数的个位数是%d\"",d);\n\t\t\n\t}\n\treturn 0;\n}",none,0,0 1454074513625051136,972d541eb566e1fe2f3ddc067ed0d0fa1cdc1fa0d74ef12aecaa2a7ec9de5378,2021-10-29 21:15:54,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n\tint a=0;\n\tscanf(\""%d\"",&a);\n\tint c=a%2;\n\tif (c==1){\n\t\tint b=0;\n\t\tb=a%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",b);\n\t\t\n\t}\n\telse{\n\t\tint d=0;\n\t\td=a*2;\n\t\tprintf(\""该数为偶数，这个数的个位数是%d\"",d);\n\t\t\n\t}\n\treturn 0;\n}",none,0,0 1454077958729396224,972d541eb566e1fe2f3ddc067ed0d0fa1cdc1fa0d74ef12aecaa2a7ec9de5378,2021-10-29 21:29:35,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n\tint a=0;\n\tscanf(\""%d\"",&a);\n\tint c=a%2;\n\tif (c==1){\n\t\tint b=0;\n\t\tb=a%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",b);\n\t\t\n\t}\n\telse{\n\t\tint d=0;\n\t\td=a*2;\n\t\tprintf(\""该数为偶数，这个数的个位数是%d\"",d);\n\t\t\n\t}\n\treturn 0;\n}",none,0,0 1454083915266519040,c84813edc51d45594bb4de2950ccb2679f002f8ccb1d4197f05fff7e21091a6e,2021-10-29 21:53:15,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \n\nint main() {\n\tint a;\n\n\tscanf(\""%d\"", &a);\n\n\tif (a % 2) {\n\t\tprintf(\""%d\"", a % 10);\n\n\t} else {\n\t\tprintf(\""%d\"", a * 2);\n\t}\n\treturn 0;\n}",none,0,0 1454084578205134848,adca349730c67573eaa57d38cb89b765867ee945f6d03d165b8474115466ee84,2021-10-29 21:55:53,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454088799797276672,cf8aff8385022ea82820a647ea33874d9a80a4e01a608ceeb8c96c72c4ddc08f,2021-10-29 22:12:40,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \n\nint main() {\n\tint n, m;\n\tscanf(\""%d\"", &n);\n\n\tif (n % 2 == 0) {\n\t\tm = n * 2;\n\t\tprintf(\""%d\"", m);\n\t} else {\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"", n % 10);\n\t}\n\n\treturn 0;\n}",none,0,0 1454091548605804544,3e5311db9c73a4f904d7deb13dd73a8b30d1d30d82974bf363e6392fba1172fe,2021-10-29 22:23:35,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \n\nint main() {\n\tint n;\n\tscanf(\""%d\"", &n);\n\tif (n % 2 ) {\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"", n / 1 % 10);\n\t} else {\n\t\tprintf(\""该数为偶数，这个数的个位数是%d\"", n / 1 % 10);\n\t}\n}",none,0,0 1454091634404388864,1fb21588ac1722f0bd769f341550a0610df9653ab5d6a37f70b2351e2f4523f4,2021-10-29 22:23:56,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454099024264720384,d9e0f4c2bae81990dffed514c36809d6200edde800b69f056a1a0c6325184b8c,2021-10-29 22:53:17,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tif (n%2==0) {\n\t\tn*=2;\n\t\tprintf(\""%d\"",n);\n\t\t\n\t}\n\telse{\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的各位数是%d\"",n);\n\t}\n\treturn 0;\n}",none,0,0 1454099584959033344,fa73ec76d6f1e7de89a958ab5ad244b221e93cab45762135e88354f3d5569174,2021-10-29 22:55:31,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454099595328090112,fa73ec76d6f1e7de89a958ab5ad244b221e93cab45762135e88354f3d5569174,2021-10-29 22:55:34,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454104190427197440,a1e835178dae638673460063704e282e70c9962cfc7f82bd8be590ae818ce272,2021-10-29 23:13:49,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \n \nint main()\n{\n int number;\n \n printf(\""请输入一个整数: \"");\n scanf(\""%d\"", &number);\n \n // 判断这个数除以 2 的余数\n if(number % 2 == 0)\n printf(\""%d 是偶数。\"", number);\n else\n printf(\""%d 是奇数。\"", number);\n \n return 0;\n}",none,0,0 1454104445579292672,a1e835178dae638673460063704e282e70c9962cfc7f82bd8be590ae818ce272,2021-10-29 23:14:50,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \n \nint main()\n{\n int n;\n printf(\""请输入一个整数: \"");\n scanf(\""%d\"", &number);\n if(number % 2 == 0)\n printf(\""%d 是偶数。\"", n);\n else\n printf(\""%d 是奇数。\"", n);\n \n return 0;\n}",none,0,0 1454270252078329856,084d9161a881b3c79a0b3345d66b842adaa927e50d5f49fc5abdc8fc1b6bb402,2021-10-30 10:13:41,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main (){\n int a;\n scanf(\""%d\"",&a);\n if (a/2)\n}",none,0,0 1454270474888540160,084d9161a881b3c79a0b3345d66b842adaa927e50d5f49fc5abdc8fc1b6bb402,2021-10-30 10:14:34,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main (){\n int a;\n scanf(\""%d\"",&a);\n if (a/2)\n}",none,0,0 1454280137859821568,a10034e0bce19a9241c8fb2d2204a83e66bb9b80a1f8c01487174f5a78adab93,2021-10-30 10:52:58,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454280183829393408,a10034e0bce19a9241c8fb2d2204a83e66bb9b80a1f8c01487174f5a78adab93,2021-10-30 10:53:09,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454280204930691072,a10034e0bce19a9241c8fb2d2204a83e66bb9b80a1f8c01487174f5a78adab93,2021-10-30 10:53:14,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454280267015122944,a10034e0bce19a9241c8fb2d2204a83e66bb9b80a1f8c01487174f5a78adab93,2021-10-30 10:53:29,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454280703160217600,2e504415e175c121dd1122c2cedff7cbc72b3855197e51dcc754656187d6f53f,2021-10-30 10:55:13,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454280715298533376,2e504415e175c121dd1122c2cedff7cbc72b3855197e51dcc754656187d6f53f,2021-10-30 10:55:16,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454283668364636160,99e061e4004e53cc51991a212875946f342292e6645b483e3882188e7d5e3799,2021-10-30 11:07:00,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454283697817776128,99e061e4004e53cc51991a212875946f342292e6645b483e3882188e7d5e3799,2021-10-30 11:07:07,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454298538393595904,a53dfd15e65d959b7841f34a027f8b4a42ab367c7f2d3043a20d338a2b31186f,2021-10-30 12:06:05,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454298586724560896,a53dfd15e65d959b7841f34a027f8b4a42ab367c7f2d3043a20d338a2b31186f,2021-10-30 12:06:17,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454298683420045312,a53dfd15e65d959b7841f34a027f8b4a42ab367c7f2d3043a20d338a2b31186f,2021-10-30 12:06:40,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454298876579590144,a53dfd15e65d959b7841f34a027f8b4a42ab367c7f2d3043a20d338a2b31186f,2021-10-30 12:07:26,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454302523259219968,77bcb1b0f59206943db2633eea790a813cf9551c7ca13df3ca43298b110bf000,2021-10-30 12:21:55,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}\n",none,0,0 1454303404154843136,77bcb1b0f59206943db2633eea790a813cf9551c7ca13df3ca43298b110bf000,2021-10-30 12:25:25,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a,b,c,d;\n scanf(\""%d\"",&a);\n c=a%2;\n if(c==1)\n {\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n d=a*2;\n printf(\""该数为偶数，这个数的个位数是%d\"",d);\n }\n return 0;\n}\n",none,0,0 1454325857900032000,eb1bfb31620ecc3ed6c1d8835cad16bf5aac49fdf720c055fd338eb87536389d,2021-10-30 13:54:39,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1){\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else{\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454325990494564352,eb1bfb31620ecc3ed6c1d8835cad16bf5aac49fdf720c055fd338eb87536389d,2021-10-30 13:55:10,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454326399833862144,eb1bfb31620ecc3ed6c1d8835cad16bf5aac49fdf720c055fd338eb87536389d,2021-10-30 13:56:48,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",&b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",&d);\n }\n return 0;\n}",none,0,0 1454339756326121472,34994c975c5a5228037efde8769aa2a3b9d4d3b797c1cafe41a9b3b30fb1d3b7,2021-10-30 14:49:52,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n\tint a;\n\tscanf(\""%d\"",&a);\n\tif(a%2==0){\n\t\tprintf(\""该数为偶数，这个数的两倍是%d\"",a*2);\n\t}\n\telse if(a%2==1){\n\t\n\t\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",a%10);\n\t}\n } ",none,0,0 1454339822357049344,34994c975c5a5228037efde8769aa2a3b9d4d3b797c1cafe41a9b3b30fb1d3b7,2021-10-30 14:50:08,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n\tint a;\n\tscanf(\""%d\"",&a);\n\tif(a%2==0){\n\t\tprintf(\""该数为偶数，这个数的两倍是%d\"",a*2);\n\t}\n\telse if(a%2==1){\n\t\n\t\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",a%10);\n\t}\n } return 0;",none,0,0 1454340230102511616,34994c975c5a5228037efde8769aa2a3b9d4d3b797c1cafe41a9b3b30fb1d3b7,2021-10-30 14:51:45,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n\tint a;\n\tscanf(\""%d\"",&a);\n\tif(a%2==0){\n\t\tprintf(\""该数为偶数，这个数的两倍是%d\"",a*2);\n\t}\n\telse if(a%2==1){\n\t\n\t\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",a%10);\n\t}\n return 0; \n\t} ",none,0,0 1454341331387838464,34994c975c5a5228037efde8769aa2a3b9d4d3b797c1cafe41a9b3b30fb1d3b7,2021-10-30 14:56:08,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n\tint a;\n\tscanf(\""%d\"",&a);\n\tif(a%2==0){\n\t\tprintf(\""该数为偶数，这个数的两倍是%d\"",a*2);\n\t}\n\telse if(a%2==1){\n\t\n\t\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",a%10);\n\t}\n return 0; \n\t} ",none,0,0 1454343679912865792,33dfcd8c7d9a72e57f55cf2c5b198d3d1309bb6dce6a1782421d70935ef1f77a,2021-10-30 15:05:28,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454343794140639232,33dfcd8c7d9a72e57f55cf2c5b198d3d1309bb6dce6a1782421d70935ef1f77a,2021-10-30 15:05:55,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454344222269927424,33dfcd8c7d9a72e57f55cf2c5b198d3d1309bb6dce6a1782421d70935ef1f77a,2021-10-30 15:07:37,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""该数为偶数，这个数的个位数是%d\"",d);\n }\n return 0;\n}",none,0,0 1454344487123202048,33dfcd8c7d9a72e57f55cf2c5b198d3d1309bb6dce6a1782421d70935ef1f77a,2021-10-30 15:08:40,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""该数为偶数，这个数的个位数是%d\"",d);\n }\n return 0;\n}",none,0,0 1454345135886299136,33dfcd8c7d9a72e57f55cf2c5b198d3d1309bb6dce6a1782421d70935ef1f77a,2021-10-30 15:11:15,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""该数为偶数，这个数的个位数是%d\"",d);\n }\n return 0;\n}",none,0,0 1454347784689201152,d2dcecc9f61dd37bf258331121a3bc1445a79c9f2eefdd86b2809d76c868bcb0,2021-10-30 15:21:47,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \n\nint main() {\n\tint n;\n\tscanf(\""%d\"", &n);\n\tif (n % 2 == 0) {\n\t\tprintf(\""%d是偶数\"", n);\n\t} else {\n\t\tn = n % 10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"", n);\n\t}\n\treturn 0;\n}",none,0,0 1454347975274524672,d2dcecc9f61dd37bf258331121a3bc1445a79c9f2eefdd86b2809d76c868bcb0,2021-10-30 15:22:32,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \n\nint main() {\n\tint n;\n\tscanf(\""%d\"", &n);\n\tif (n % 2 == 0) {\n\t\tprintf(\""%d\"", n);\n\t} else {\n\t\tn = n % 10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"", n);\n\t}\n\treturn 0;\n}",none,0,0 1454348262588198912,d2dcecc9f61dd37bf258331121a3bc1445a79c9f2eefdd86b2809d76c868bcb0,2021-10-30 15:23:40,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \n\nint main() {\n\tint n;\n\tscanf(\""%d\"", &n);\n\tif (n%2==0) {\n\t\tprintf(\""%d\"",n);\n\t} else {\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",n);\n\t}\n\treturn 0;\n}",none,0,0 1454348432550522880,d2dcecc9f61dd37bf258331121a3bc1445a79c9f2eefdd86b2809d76c868bcb0,2021-10-30 15:24:21,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main() {\n\tint n;\n\tscanf(\""%d\"", &n);\n\tif (n%2==0) {\n\t\tprintf(\""%d\"",n);\n\t} else {\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",n);\n\t}\n\treturn 0;\n}",none,0,0 1454348489600708608,d2dcecc9f61dd37bf258331121a3bc1445a79c9f2eefdd86b2809d76c868bcb0,2021-10-30 15:24:35,C++,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main() {\n\tint n;\n\tscanf(\""%d\"", &n);\n\tif (n%2==0) {\n\t\tprintf(\""%d\"",n);\n\t} else {\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",n);\n\t}\n\treturn 0;\n}",none,0,0 1454351341966749696,d2dcecc9f61dd37bf258331121a3bc1445a79c9f2eefdd86b2809d76c868bcb0,2021-10-30 15:35:55,C++,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main() {\n\tint n;\n\tscanf(\""%d\"", &n);\n\tif (n%2==0) {\n\t\tprintf(\""%d\"",n);\n\t} else {\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",n);\n\t}\n\treturn 0;\n}",none,0,0 1454351967874347008,eb1bfb31620ecc3ed6c1d8835cad16bf5aac49fdf720c055fd338eb87536389d,2021-10-30 15:38:24,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n int a;\n scanf(\""%d\"",&a);\n if(a%2==0){\n printf(\""该数为偶数，这个数的两倍是%d\"",a*2);\n }\n else if(a%2==1){\n \n \n printf(“该数为奇数，这个数的个位数是%d\"",a%10);\n }\n return 0;\n }",none,0,0 1454353111266783232,525269683151eda93205c514b905c4e7ac5d048bacd58ef37d0f88cf45f4a890,2021-10-30 15:42:56,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main()\n{\n int n,m;\n scanf(\""%d\"",&n);\n if(n%2==1)\n printf(\""该数为奇数，这个数的个位数是7\"");\n if(n%2==0)\n printf(\""该数为偶数，这个数的个位数是7\"");\n return 0;\n}",none,0,0 1454353409871966208,6b49c4ee594a4ff2d301958e3192c518cb8cc24e8b881014adf9785b54c4e3e3,2021-10-30 15:44:08,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main() {\n\tint a;\n\tscanf(\""%d\"", &a);\n\tif (a%2==0) {\n\t\tprintf(\""%d\"",a);\n\t} else {\n\t\ta=a%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",a);\n\t}\n\treturn 0;\n}\n",none,0,0 1454353608035708928,525269683151eda93205c514b905c4e7ac5d048bacd58ef37d0f88cf45f4a890,2021-10-30 15:44:55,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main()\n{\n int n,m;\n scanf(\""%d\"",&n);\n if(n%2==1)\n printf(\""该数为奇数，这个数的个位数是n%10%\"");\n if(n%2==0)\n printf(\""该数为偶数，这个数的个位数是n%10%\"");\n return 0;\n}",none,0,0 1454354873713422336,eb1bfb31620ecc3ed6c1d8835cad16bf5aac49fdf720c055fd338eb87536389d,2021-10-30 15:49:57,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n int a;\n scanf(\""%d\"",&a);\n if(a%2==0){\n printf(\""该数为偶数，这个数的两倍是%d\"",a*2);\n }\n else if(a%2==1){\n \n \n printf(\""该数为奇数，这个数的个位数是%d\"",a%10);\n }\n return 0; \n} ",none,0,0 1454355011722801152,eb1bfb31620ecc3ed6c1d8835cad16bf5aac49fdf720c055fd338eb87536389d,2021-10-30 15:50:30,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n int a;\n scanf(\""%d\"",&a);\n if(a%2==0){\n printf(\""该数为偶数，这个数的两倍是%d\"",a*2);\n }\n else if(a%2==1){\n \n \n printf(\""该数为奇数，这个数的个位数是%d\"",a%10);\n }\n return 0;\n}",none,0,0 1454355440074387456,eb1bfb31620ecc3ed6c1d8835cad16bf5aac49fdf720c055fd338eb87536389d,2021-10-30 15:52:12,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n int a;\n scanf(\""%d\"",&a);\n if(a%2==0){\n printf(\""该数为偶数，这个数的两倍是%d\"",a*2);\n }\n else if(a%2==1){\n \n \n printf(\""该数为奇数，这个数的个位数是%d\"",a%10);\n }\n return 0;\n }",none,0,0 1454355870783025152,eb1bfb31620ecc3ed6c1d8835cad16bf5aac49fdf720c055fd338eb87536389d,2021-10-30 15:53:54,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n int a;\n scanf(\""%d\"",&a);\n if(a%2==0){\n printf(\""该数为偶数，这个数的两倍是%d\"",a*2);\n }\n else if(a%2==1){\n \n \n printf(\""该数为奇数，这个数的个位数是%d\"",a%10);\n }\n return 0;\n }",none,0,0 1454358559873298432,eb1bfb31620ecc3ed6c1d8835cad16bf5aac49fdf720c055fd338eb87536389d,2021-10-30 16:04:36,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main(){\n int a;\n scanf(\""%d\"",&a);\n if(a%2==0){\n printf(\""该数为偶数，这个数的两倍是%d\"",a*2);\n }\n else if(a%2==1){\n \n \n printf(\""该数为奇数，这个数的个位数是%d\"",a%10);\n }\n return 0;\n }",none,0,0 1454359483542827008,525269683151eda93205c514b905c4e7ac5d048bacd58ef37d0f88cf45f4a890,2021-10-30 16:08:16,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main()\n{\n int n,m;\n scanf(\""%d\"",&n);\n if(n%2==1)\n printf(\""该数为奇数，这个数的个位数是n%10%\"");\n if(n%2==0)\n printf(\""该数为偶数，这个数的个位数是n%10%\"");\n return 0;\n}",none,0,0 1454369153271721984,b1f0e9cb8d23ba2591cca5a84e5e6c3f17cc710e21f6ad3315bc437877e78ba3,2021-10-30 16:46:41,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main(){\n int a;\n scanf(\""%d\"",&a);\n if (a%2==0){\n printf(\""该数为偶数，这个数的两倍是%d\"",a*2);\n }\n else if(a%2==1){\n printf(\""该数为奇数，这个数的个位数是%d\"",a%10);\n }\n return 0;\n}\n",none,0,0 1454369576044883968,b1f0e9cb8d23ba2591cca5a84e5e6c3f17cc710e21f6ad3315bc437877e78ba3,2021-10-30 16:48:22,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main(){\n int a;\n scanf(\""%d\"",&a);\n if (a%2==0){\n printf(\""该数为偶数，这个数的两倍是%d\"",a*2);\n }\n else if(a%2==1){\n printf(\""该数为奇数，这个数的个位数是%d\"",a%10);\n }\n return 0;\n}\n",none,0,0 1454379004898996224,cda2c79d0c67a760b6051c5b5c0eb2e365c11927a6259f04b4bd15fe7f355031,2021-10-30 17:25:50,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main() {\n\tint n;\n\tscanf(\""%d\"", &n);\n\tif (n%2==0) {\n\t\tprintf(\""%d\"",n);\n\t} else {\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",n);\n\t}\n\treturn 0;\n}\n",none,0,0 1454379034888024064,cda2c79d0c67a760b6051c5b5c0eb2e365c11927a6259f04b4bd15fe7f355031,2021-10-30 17:25:57,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main() {\n\tint n;\n\tscanf(\""%d\"", &n);\n\tif (n%2==0) {\n\t\tprintf(\""%d\"",n);\n\t} else {\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",n);\n\t}\n\treturn 0;\n}\n",none,0,0 1454379054283223040,8efe64d62b0e7b439aabe70660fd8b041888ec02c7a7dd35f0999984c21af4a8,2021-10-30 17:26:02,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main() {\n\tint n;\n\tscanf(\""%d\"", &n);\n\tif (n%2==0) {\n\t\tprintf(\""%d\"",n);\n\t} else {\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",n);\n\t}\n\treturn 0;\n}",none,0,0 1454379147761676288,cda2c79d0c67a760b6051c5b5c0eb2e365c11927a6259f04b4bd15fe7f355031,2021-10-30 17:26:24,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main() {\n\tint n;\n\tscanf(\""%d\"", &n);\n\tif (n%2==0) {\n\t\tprintf(\""%d\"",n);\n\t} else {\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",n);\n\t}\n\treturn 0;\n}\n",none,0,0 1454379174545764352,525269683151eda93205c514b905c4e7ac5d048bacd58ef37d0f88cf45f4a890,2021-10-30 17:26:30,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main() {\n\tint n;\n\tscanf(\""%d\"", &n);\n\tif (n%2==0) {\n\t\tprintf(\""%d\"",n);\n\t} else {\n\t\tn=n%10;\n\t\tprintf(\""该数为奇数，这个数的个位数是%d\"",n);\n\t}\n\treturn 0;\n}",none,0,0 1454429185736601600,edc1c198f29a724af73cc8c7aaabb1c1ca8a6b5f3492bac86ed092203d05ac4a,2021-10-30 20:45:14,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main(void)\n{\n int i;\n printf(\""请输入想要判断的数字\\n\"");\n scanf(\""%d\"",&i);\n if(i>0&&i%2==1)\n { \n printf(\""该数为奇数\\n\""); \n }\n else if(i>0&&i%2==0)\n {\n printf(\""该数为偶数\\n\"");\n }\n else\n {\n printf(\""无法判断~~~\\n\"");\n }\n\n return 0 ;\n}",none,0,0 1454431683960631296,5a6bf534f93dd9a8864fbdd23f702f6c8650b243a3ca8b82d582aa27cbd4b423,2021-10-30 20:55:10,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main(void)\n{\n int i;\n printf(\""请输入想要判断的数字\\n\"");\n scanf(\""%d\"",&i);\n if(i>0&&i%2==1)\n { \n printf(\""该数为奇数\\n\""); \n }\n else if(i>0&&i%2==0)\n {\n printf(\""该数为偶数\\n\"");\n }\n else\n {\n printf(\""无法判断~~~\\n\"");\n }\n\n return 0 ;\n}",none,0,0 1454431715258920960,5a6bf534f93dd9a8864fbdd23f702f6c8650b243a3ca8b82d582aa27cbd4b423,2021-10-30 20:55:17,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main(void)\n{\n int i;\n printf(\""请输入想要判断的数字\\n\"");\n scanf(\""%d\"",&i);\n if(i>0&&i%2==1)\n { \n printf(\""该数为奇数\\n\""); \n }\n else if(i>0&&i%2==0)\n {\n printf(\""该数为偶数\\n\"");\n }\n else\n {\n printf(\""无法判断~~~\\n\"");\n }\n\n return 0 ;\n}",none,0,0 1454432081258082304,5a6bf534f93dd9a8864fbdd23f702f6c8650b243a3ca8b82d582aa27cbd4b423,2021-10-30 20:56:44,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main(void)\n{\n int i;\n printf(\""请输入想要判断的数字\\n\"");\n scanf(\""%d\"",&i);\n if(i>0&&i%2==1)\n { \n printf(\""该数为奇数\\n\""); \n }\n else if(i>0&&i%2==0)\n {\n printf(\""该数为偶数\\n\"");\n }\n else\n {\n printf(\""无法判断~~~\\n\"");\n }\n\n return 0 ;\n}",none,0,0 1454436470920192000,a1e835178dae638673460063704e282e70c9962cfc7f82bd8be590ae818ce272,2021-10-30 21:14:11,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \n \nint main()\n{\n int n;\n printf(\""请输入一个整数: \"");\n scanf(\""%d\"", &n);\n if(n % 2 == 0)\n printf(\""%d 是偶数。\"", n);\n else\n printf(\""%d 是奇数。\"", n);\n \n return 0;\n}",none,0,0 1454440615291002880,4c6c8ba84d938d784770a838f8b881c9a8fb52726d509e44c4c7fd26d65e5366,2021-10-30 21:30:39,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include \nint main(void)\n{\n int i;\n printf(\""请输入想要判断的数字\\n\"");\n scanf(\""%d\"",&i);\n if(i>0&&i%2==1)\n { \n printf(\""该数为奇数\\n\""); \n }\n else if(i>0&&i%2==0)\n {\n printf(\""该数为偶数\\n\"");\n }\n else\n {\n printf(\""无法判断~~~\\n\"");\n }\n\n return 0 ;\n}",none,0,0 1454472319347548160,6a4424649cac2060aacffeef10d9d04312156aa50a72a5c607fdc6cb54c7d35e,2021-10-30 23:36:38,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454472360162320384,6a4424649cac2060aacffeef10d9d04312156aa50a72a5c607fdc6cb54c7d35e,2021-10-30 23:36:48,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1454472400926760960,6a4424649cac2060aacffeef10d9d04312156aa50a72a5c607fdc6cb54c7d35e,2021-10-30 23:36:57,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n int b=0;\n int x=0;\n scanf(\""%d %d\"",&a, &b);\n if(a<5)\n {\n if(b<=40)\n x=b*30;\n else\n x=(b-40)*45+40*30;\n \n }\n else\n {\n if(b<=40)\n x=b*50;\n else\n x=(b-40)*75+40*50;\n }\n printf(\""%.2f\"",x);\n return 0; \n}",none,0,0 1454473072040550400,6a4424649cac2060aacffeef10d9d04312156aa50a72a5c607fdc6cb54c7d35e,2021-10-30 23:39:37,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n \n printf(\""该数为奇数，这个数的个位数是%d\"",d);\n }\n return 0;\n}",none,0,0 1454473853305167872,6a4424649cac2060aacffeef10d9d04312156aa50a72a5c607fdc6cb54c7d35e,2021-10-30 23:42:44,C,,1453904588527771648,1453744966357622784,1039132357260529664,"#include\nint main()\n{\n int a=0;\n scanf(\""%d\"",&a);\n int c=0;\n c=a%2;\n if(c==1)\n {\n int b=0;\n b=a%10;\n printf(\""该数为奇数，这个数的个位数是%d\"",b);\n }\n else\n {\n int d=0;\n d=a*2;\n printf(\""%d\"",d);\n }\n return 0;\n}",none,0,0 1584050662690131968,74e408eea1bbe16218c3f1957fd95029f1076d057b036fd338e2c3ab4f682e51,2022-10-23 13:14:42,C++,0.0,1583794898562072576,1583746247320023040,1039131349729988608,"#include\nusing namespace std;\nbool judge(int *a,int *b,int x){\n for(int i=0;a[i]!=0;++i){\n if(i==x) return false;\n }\n for(int i=0;b[i]!=0;++i){\n if(i==x) return false;\n }\n return true;\n}\n\nint main(){\n int a[14000]={0},b[14000]={0};\n int n,m;int sum;int i,j;\n cin>>n; i=n;\n while(i--) cin>>a[n];\n cin>>m; j=m;\n while(j--) cin>>b[n];\n sort(a,a+n);sort(b,b+m);\n while(n>=0&&m>=0){\n sum+=a[n]+b[m];\n if(judge(a,b,sum)==1) break;\n else \n if(a[n]>=b[m]) m--;\n else n--;\n }\n cout<\nusing namespace std;\nint main(){\n int a[14000]={0},b[14000]={0};\n int n,m;int maxi=0,maxj=0;int i,j;\n cin>>i; \n while(i--){\n cin>>n;\n maxi=maxi>=n?maxi:n;\n }\n cin>>j;\n while(j--){\n cin>>m;\n maxi=maxi>=m?maxi:m;\n }\n cout<\nusing namespace std;\nint main(){\n int a[14000]={0},b[14000]={0};\n int n,m;int maxi=0,maxj=0;int i,j;\n cin>>i; \n while(i--){\n cin>>n;\n maxi=maxi>=n?maxi:n;\n }\n cin>>j;\n while(j--){\n cin>>m;\n maxj=maxj>=m?maxj:m;\n }\n cout<\nusing namespace std;\n\nint main(){\n int n;int x1,y1,x2,y2;\n cin>>n;\n while(n--){\n cin>>x1>>y1>>x2>>y2;\n if(abs(x1-x2)!=1&&abs(y1-y2)!=1){\n if(x2*y1==x1*y2){\n cout<<\""yes\""<\nusing namespace std;\n\nint main(){\n int n;double x1,y1,x2,y2;\n cin>>n;\n while(n--){\n cin>>x1>>y1>>x2>>y2;\n if(abs(x1-x2)!=1&&abs(y1-y2)!=1){\n if(x2*y1==x1*y2){\n cout<<\""yes\""<\nusing namespace std;\n\nint main(){\n int n;double x1,y1,x2,y2;\n cin>>n;\n while(n--){\n cin>>x1>>y1>>x2>>y2;\n if(abs(x1-x2)!=1||abs(y1-y2)!=1){\n if(x2*y1==x1*y2){\n cout<<\""yes\""<\nusing namespace std;\n\nint main(){\n int n;double x1,y1,x2,y2;\n cin>>n;\n while(n--){\n cin>>x1>>y1>>x2>>y2;\n if(abs(x1-x2)!=1||abs(y1-y2)!=1){\n if(x2*y1==x1*y2||x1==x2||y1==y2){\n cout<<\""yes\""<\nusing namespace std;\n\nint main(){\n int n;double x1,y1,x2,y2;\n cin>>n;\n while(n--){\n cin>>x1>>y1>>x2>>y2;\n if(abs(x1-x2)!=1||abs(y1-y2)!=1){\n if((x2*y1==x1*y2)||x1==x2||y1==y2){\n cout<<\""yes\""<\nusing namespace std;\n\nint main(){\n int n;double x1,y1,x2,y2;\n cin>>n;\n while(n--){\n cin>>x1>>y1>>x2>>y2;\n if(abs(x1-x2)!=1||abs(y1-y2)!=1){\n if((x2*y1==x1*y2)||x1==x2||y1==y2){\n cout<<\""yes\""<\nusing namespace std;\n\nint main(){\n int n;double x1,y1,x2,y2;\n cin>>n;\n while(n--){\n cin>>x1>>y1>>x2>>y2;\n if(abs(x1-x2)!=1||abs(y1-y2)!=1){\n if((x2*y1==x1*y2)||x1==x2||y1==y2){\n cout<<\""yes\""<\nusing namespace std;\n\nint main(){\n int n;double x1,y1,x2,y2;\n cin>>n;\n while(n--){\n cin>>x1>>y1>>x2>>y2;\n if(abs(x1-x2)!=1&&abs(y1-y2)!=1){\n if((x2*y1==x1*y2)||x1==x2||y1==y2){\n cout<<\""no\""<\nusing namespace std;\n\nint main(){\n int n;int x1,y1,x2,y2;\n cin>>n;\n while(n--){\n cin>>x1>>y1>>x2>>y2;\n if(abs(x1-x2)!=1&&abs(y1-y2)!=1){\n if((x2*y1==x1*y2)||x1==x2||y1==y2){\n cout<<\""no\""<\nusing namespace std;\n\nint main(){\n int n;int x1,y1,x2,y2;\n cin>>n;\n while(n--){\n cin>>x1>>y1>>x2>>y2;\n if(abs(x1-x2)!=1&&abs(y1-y2)!=1){\n if((x2*y1==x1*y2)||x1==x2||y1==y2){\n cout<<\""yes\""<\nusing namespace std;\n\nint main(){\n int n;int x1,y1,x2,y2;\n cin>>n;\n while(n--){\n cin>>x1>>y1>>x2>>y2;\n if(abs(x1-x2)!=1&&abs(y1-y2)!=1){\n if((x2*y1==x1*y2)||x1==x2||y1==y2){\n cout<<\""yes\""<\nusing namespace std;\nint gcd(int x, int y)\n{\n while(y^=x^=y^=x%=y);\n return x;\n}\nint main(){\n int n;int x1,y1,x2,y2;\n cin>>n;\n while(n--){\n cin>>x1>>y1>>x2>>y2;\n if(gcd(abs(x1-x2),abs(y1-y2))!=1){\n cout<<\""yes\""<\nusing namespace std;\nint gcd(int x, int y)\n{\n while(y^=x^=y^=x%=y);\n return x;\n}\nint main(){\n int n;int x1,y1,x2,y2;\n bool flag=0;\n cin>>n;\n while(n--){\n cin>>x1>>y1>>x2>>y2;\n if(x1==x2){\n if(abs(y1-y2)>1) flag=~flag;\n }\n else if(y1==y2){\n if(abs(x1-x2)>1) flag=~flag;\n }\n else if(gcd(abs(x1-x2),abs(y1-y2))!=1) flag=~flag;\n \n if(flag) cout<<\""yes\""<\nusing namespace std;\nint gcd(int a,int b)//求a和b的最大公约数 \n{\n\treturn b?gcd(b,a%b):a;\n}\nint main()\n{\n\tint n;\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint a,b,c,d;\n\t\tcin>>a>>b>>c>>d;\n\t\tif(gcd(abs(a-c),abs(b-d))!=1)//判断坐标之差是否互质 \n\t\t\tcout<<\""yes\""<\nusing namespace std;\nint gcd(int x, int y)\n{\n while(y^=x^=y^=x%=y);\n return x;\n}\nint main()\n{\n\tint n;\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint a,b,c,d;\n\t\tcin>>a>>b>>c>>d;\n\t\tif(gcd(abs(a-c),abs(b-d))!=1)//判断坐标之差是否互质 \n\t\t\tcout<<\""yes\""<\nusing namespace std;\nint gcd(int a,int b)//求a和b的最大公约数 \n{\n\treturn b?gcd(b,a%b):a;\n}\nint main()\n{\n\tint n;\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint a,b,c,d;\n\t\tcin>>a>>b>>c>>d;\n\t\tif(gcd(abs(a-c),abs(b-d))!=1)//判断坐标之差是否互质 \n\t\t\tcout<<\""yes\""<\nusing namespace std;\nint gcd(int x, int y)\n{\n while(y^=x^=y^=x%=y);\n return x;\n}\nint main()\n{\n\tint n;\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint a,b,c,d;\n\t\tcin>>a>>b>>c>>d;\n\t\tif(gcd(abs(a-c),abs(b-d))!=1)//判断坐标之差是否互质 \n\t\t\tcout<<\""yes\""<\n\nusing namespace std;\n\nint main(){\n int n,m,a=0,b=0,x;\n cin >> n;\n for(int i = 0; i < n; i ++){\n cin >> x;\n a = max(x,a);\n }\n cin >> m;\n for(int i = 0; i < m; i ++){\n cin >> x;\n b = max(x,b);\n }\n cout << a << \"" \"" << b;\n return 0;\n}",ACCEPTED,130,640 1586240663146332160,70eba4afbfa4c7bd72f3976237074c9ab261e8cc5d734d2bc3bf971b59cdf744,2022-10-29 14:16:59,C,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include\n#include\nint main()\n{\n int n;\n int ax,ay,bx,by;\n scanf(\""%d\"",&n);\n for(int j=1;j<=n;j++){\n scanf(\""%d%d\"",&ax,&ay);\n scanf(\""%d%d\"",&bx,&by);\n if(abs(ax-bx)>=2||abs(ay-by)>=2)printf(\""yes\\n\"");\n else printf(\""no\\n\"");\n }\n return 0;\n}",WRONG_ANSWER,5,328 1586241833088708608,70eba4afbfa4c7bd72f3976237074c9ab261e8cc5d734d2bc3bf971b59cdf744,2022-10-29 14:21:38,C,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include\n#include\nint main()\n{\n int n;\n double ax,ay,bx,by;\n scanf(\""%d\"",&n);\n for(int j=1;j<=n;j++){\n scanf(\""%lf%lf\"",&ax,&ay);\n scanf(\""%lf%lf\"",&bx,&by);\n if(fabs(ax-bx)>=2||fabs(ay-by)>=2)printf(\""yes\\n\"");\n else printf(\""no\\n\"");\n }\n return 0;\n}",WRONG_ANSWER,9,332 1586242321674801152,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-10-29 14:23:35,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include \n\nint main()\n{\n\tlong long num1[15000],num2[15000];\n\tint n,m,n1,m1;\n\tscanf(\""%d\"",&n);\n\tn1 = n;\n\twhile(n--) scanf(\""%d\"",&num1[n]);\n\t//while(n1--) printf(\""%d \"",num1[n1]);\n\t\n\tscanf(\""%d\"",&m);\n\tm1 = m;\n\twhile(m--) scanf(\""%d\"",&num2[m]);\n\t//while(m1--) printf(\""%d \"",num2[m1]);\n\tint i,j,max = -999,a,b;\n\tfor (i = 0;i <= n1;i++)\n\t{\n\t\tfor (j = 0;j <= m1;j++)\n\t\t{\n\t\t\tint k,t = 1;\n\t\t\tfor (k = 0;k <= n1;k++) if (num1[i] + num2[j] == num1[k]) t = 0;\n\t\t\tfor (k = 0;k <= m1;k++) if (num1[i] + num2[j] == num2[k]) t = 0;\n\t\t\tif (t)\n\t\t\t{\n\t\t\t\tif (num1[i] + num2[j] > max)\n\t\t\t\t{\n\t\t\t\t\ta = i;\n\t\t\t\t\tb = j;\n\t\t\t\t \tmax = num1[i] + num2[j];\n\t\t\t\t} \n\t\t\t}\t\n\t\t}\n\t}\n\tprintf(\""%d %d\"",num1[a],num2[b]);\n\t\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,121,512 1586242802153295872,9f8da61264ed45a9a4307a5f0c88c4b98df8923ee5d381bfc8c77688ee4aaaa0,2022-10-29 14:25:29,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#define _CRT_SECURE_NO_WARNINGS 1\n#include\n#include\n#include\n#include\nint main()\n{\n int n, m;\n int a[14001], b[2001];\n scanf(\""%d\"", &n);\n for (int i = 0; i < n; i++) {\n scanf(\""%d\"", &a[i]);\n }\n scanf(\""%d\"", &m);\n for (int i = 0; i < m; i++) {\n scanf(\""%d\"", &b[i]);\n }\n for (int i = 0; i < n - 1; i++) {\n for (int j = 0; j < n - 1 - i; j++) {\n if (a[j] < a[j + 1]) {\n int temp = a[j];\n a[j] = a[j + 1];\n a[j + 1] = temp;\n }\n }\n }\n for (int i = 0; i < m - 1; i++) {\n for (int j = 0; j < m - 1 - i; j++) {\n if (b[j] \n#include\n#include\n#include\nint main()\n{\n int n, m;\n int a[14001], b[2001];\n int max1=0, max2=0;\n scanf(\""%d\"", &n);\n for (int i = 0; i < n; i++) {\n scanf(\""%d\"", &a[i]);\n if (max1 < a[i])max1 = a[i];\n }\n scanf(\""%d\"", &m);\n for (int i = 0; i < m; i++) {\n scanf(\""%d\"", &b[i]);\n if (max2 < b[i])max2 = b[i];\n }\n printf(\""%d %d\"", max1,max2);\n return 0;\n}",ACCEPTED,135,496 1586244636158853120,bf21e479b636ce34acf4cd37a5079d72864cfc35acecd8624bb4c81358d3595b,2022-10-29 14:32:46,C,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include\n#include\nint main(){\n int a,b,c,d,n,i=1;\n scanf(\""%d\"",&n);\n while(i<=n){\n scanf(\""%d%d\\n%d%d\"",&a,&b,&c,&d);\n if(pow(a-c,2)+pow(b-d,2)==1)\n printf(\""no\\n\"");\n else\n printf(\""yes\\n\"");\n i++;\n \n }\n}",WRONG_ANSWER,17,324 1586245119258787840,9f8da61264ed45a9a4307a5f0c88c4b98df8923ee5d381bfc8c77688ee4aaaa0,2022-10-29 14:34:42,C,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#define _CRT_SECURE_NO_WARNINGS 1\n#include\n#include\n#include\n#include\nint main()\n{\n int a1, b1, a2, b2;\n int n;\n scanf(\""%d\"", &n);\n while (n--) {\n scanf(\""%d %d %d %d\"", &a1, &b1, &a2, &b2);\n if (a1 == a2 && abs(b1 - b2) <= 1)printf(\""no\\n\"");\n else if (b1 == b2 && abs(a1 - a2) <= 1)printf(\""no\\n\"");\n else printf(\""yes\\n\"");\n }\n return 0;\n}",WRONG_ANSWER,7,376 1586246472999768064,bf21e479b636ce34acf4cd37a5079d72864cfc35acecd8624bb4c81358d3595b,2022-10-29 14:40:04,C,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include\n#include\nint main(){\n int a,b,c,d,n,i=1;\n scanf(\""%d\"",&n);\n while(i<=n){\n scanf(\""%d%d\\n%d%d\"",&a,&b,&c,&d);\n if(pow(a-c,2)+pow(b-d,2)==1||pow(a-c,2)+pow(b-d,2)==sqrt(2))\n printf(\""no\\n\"");\n else\n\t\t\n printf(\""yes\\n\"");\n i++;\n \n }\n}\n",WRONG_ANSWER,8,380 1586246619980759040,bf21e479b636ce34acf4cd37a5079d72864cfc35acecd8624bb4c81358d3595b,2022-10-29 14:40:39,C,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include\n#include\nint main(){\n int a,b,c,d,n,i=1;\n scanf(\""%d\"",&n);\n while(i<=n){\n scanf(\""%d%d\\n%d%d\"",&a,&b,&c,&d);\n if(pow(a-c,2)+pow(b-d,2)==1||pow(a-c,2)+pow(b-d,2)==sqrt(2)||pow(a-c,2)+pow(b-d,2)==0)\n printf(\""no\\n\"");\n else\n\t\t\n printf(\""yes\\n\"");\n i++;\n \n }\n}\n",WRONG_ANSWER,13,328 1586246761765011456,9f8da61264ed45a9a4307a5f0c88c4b98df8923ee5d381bfc8c77688ee4aaaa0,2022-10-29 14:41:13,C,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#define _CRT_SECURE_NO_WARNINGS 1\n#include\n#include\n#include\n#include\nint main()\n{\n int a1, b1, a2, b2;\n int n;\n scanf(\""%d\"", &n);\n while (n--) {\n scanf(\""%d %d %d %d\"", &a1, &b1, &a2, &b2);\n if (abs(a1 - a2) <= 1 && abs(b1 - b2) <= 1)printf(\""no\\n\"");\n else if (abs(b1 - b2) <= 1 && abs(a1 - a2) <= 1)printf(\""no\\n\"");\n else printf(\""yes\\n\"");\n }\n return 0;\n}",WRONG_ANSWER,13,640 1586247461064544256,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-10-29 14:44:00,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include \n\nint main()\n{\n\tlong long num1[100],num2[100];\n\tint n,m,n1,m1;\n\tscanf(\""%d\"",&n);\n\tn1 = n;\n\twhile(n--) scanf(\""%d\"",&num1[n]);\n\t//while(n1--) printf(\""%d \"",num1[n1]);\n\t\n\tscanf(\""%d\"",&m);\n\tm1 = m;\n\twhile(m--) scanf(\""%d\"",&num2[m]);\n\t//while(m1--) printf(\""%d \"",num2[m1]);\n\tint i,j,max = -999,a,b;\n\tfor (i = 0;i <= n1;i++)\n\t{\n\t\tfor (j = 0;j <= m1;j++)\n\t\t{\n\t\t\tint k,t = 1;\n\t\t\tfor (k = 0;k <= n1;k++) if (num1[i] + num2[j] == num1[k]) t = 0;\n\t\t\tfor (k = 0;k <= m1;k++) if (num1[i] + num2[j] == num2[k]) t = 0;\n\t\t\tif (t)\n\t\t\t{\n\t\t\t\tif (num1[i] + num2[j] > max)\n\t\t\t\t{\n\t\t\t\t\ta = i;\n\t\t\t\t\tb = j;\n\t\t\t\t \tmax = num1[i] + num2[j];\n\t\t\t\t} \n\t\t\t}\t\n\t\t}\n\t}\n\tprintf(\""%d %d\"",num1[a],num2[b]);\n\t\n\treturn 0;\n}",WRONG_ANSWER,4,200 1586247784176947200,bf21e479b636ce34acf4cd37a5079d72864cfc35acecd8624bb4c81358d3595b,2022-10-29 14:45:17,C,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include\n#include\nint main(){\n int a,b,c,d,n,i=1;\n scanf(\""%d\"",&n);\n while(i<=n){\n scanf(\""%d%d\\n%d%d\"",&a,&b,&c,&d);\n if(a-c==1||b-d==1)\n printf(\""no\\n\"");\n else\n\t\t\n printf(\""yes\\n\"");\n i++;\n \n }\n}\n\n",WRONG_ANSWER,7,200 1586248543790567424,bfcefd3551cca4300e908a6b4e72bb34de6fd1d47a163f3bf51ee061fefe1ffd,2022-10-29 14:48:18,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\nint main()\n{\n\tint a,b,c,d;\n\tscanf(\""%d\"", &a);\n\tint i;\n\tfor (i = 1; i <= a; i++) {\n\t\tscanf(\""%d\"", &b);\n\t}\n\tscanf_s(\""%d\"", &c);\n\tint j;\n\tfor (j = 1; j <= c; j++) {\n\t\tscanf_s(\""%d\"",&d);\n\t}\n\tprintf(\""%d %d\"", b, d);\n\n\treturn 0;\n}",COMPILE_ERROR,0,0 1586248579433754624,bfcefd3551cca4300e908a6b4e72bb34de6fd1d47a163f3bf51ee061fefe1ffd,2022-10-29 14:48:27,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\nint main()\n{\n\tint a,b,c,d;\n\tscanf(\""%d\"", &a);\n\tint i;\n\tfor (i = 1; i <= a; i++) {\n\t\tscanf(\""%d\"", &b);\n\t}\n\tscanf(\""%d\"", &c);\n\tint j;\n\tfor (j = 1; j <= c; j++) {\n\t\tscanf(\""%d\"",&d);\n\t}\n\tprintf(\""%d %d\"", b, d);\n\n\treturn 0;\n}",WRONG_ANSWER,5,328 1586249469108551680,70eba4afbfa4c7bd72f3976237074c9ab261e8cc5d734d2bc3bf971b59cdf744,2022-10-29 14:51:59,C,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include\n#include\nint main()\n{\n int n;\n double ax,ay,bx,by;\n scanf(\""%d\"",&n);\n for(int j=1;j<=n;j++){\n scanf(\""%lf%lf\"",&ax,&ay);\n scanf(\""%lf%lf\"",&bx,&by);\n if(fabs(ax-bx)>=2||fabs(ay-by)>=2||fabs(ax-bx)>=1&&fabs(ay-by)>=1)printf(\""yes\\n\"");\n else printf(\""no\\n\"");\n }\n return 0;\n}",WRONG_ANSWER,7,372 1586249632019513344,71c1a7fbd36b79e6a9b57c1e92b6da181ac32766b29e7205c166d1b415d5b1bb,2022-10-29 14:52:38,C++,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include \n\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n while(n --){\n int ax,ay,bx,by;\n cin >> ax >> ay >> bx >> by;\n if(abs(ax-bx)==0 || abs(ay-by)==0){\n if(abs(ax-bx)==1 || abs(ay-by)==1)\n puts(\""no\"");\n else puts(\""yse\"");\n }\n else if(__gcd(bx - ax, by - ay) == 1) puts(\""no\"");\n else puts(\""yes\"");\n }\n return 0;\n}",WRONG_ANSWER,11,460 1586249862387466240,70eba4afbfa4c7bd72f3976237074c9ab261e8cc5d734d2bc3bf971b59cdf744,2022-10-29 14:53:32,C,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include\n#include\nint main()\n{\n int n;\n double ax,ay,bx,by;\n scanf(\""%d\"",&n);\n for(int j=1;j<=n;j++){\n scanf(\""%lf%lf\"",&ax,&ay);\n scanf(\""%lf%lf\"",&bx,&by);\n if(fabs(ax-bx)>=2||fabs(ay-by)>=2)printf(\""yes\\n\"");\n else if(fabs(ax-bx)>=1&&fabs(ay-by)>=1)printf(\""yes\\n\"");\n else printf(\""no\\n\"");\n }\n return 0;\n}",WRONG_ANSWER,5,376 1586249940468629504,71c1a7fbd36b79e6a9b57c1e92b6da181ac32766b29e7205c166d1b415d5b1bb,2022-10-29 14:53:51,C++,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include \n\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n while(n --){\n int ax,ay,bx,by;\n cin >> ax >> ay >> bx >> by;\n if(abs(ax-bx)==0 || abs(ay-by)==0){\n if(abs(ax-bx)==1 || abs(ay-by)==1)\n puts(\""no\"");\n else puts(\""yse\"");\n }\n else if(__gcd(abs(bx - ax), abs(by - ay)) == 1) puts(\""no\"");\n else puts(\""yes\"");\n }\n return 0;\n}",WRONG_ANSWER,49,456 1586250412227162112,71c1a7fbd36b79e6a9b57c1e92b6da181ac32766b29e7205c166d1b415d5b1bb,2022-10-29 14:55:44,C++,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include \n\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n while(n --){\n int ax,ay,bx,by;\n cin >> ax >> ay >> bx >> by;\n if(ax==bx && ay==by) puts(\""no\"");\n else if(abs(ax-bx)==0 || abs(ay-by)==0){\n if(abs(ax-bx)==1 || abs(ay-by)==1)\n puts(\""no\"");\n else puts(\""yse\"");\n }\n else if(__gcd(abs(bx - ax), abs(by - ay)) == 1) puts(\""no\"");\n else puts(\""yes\"");\n }\n return 0;\n}",WRONG_ANSWER,49,488 1586250542632267776,71c1a7fbd36b79e6a9b57c1e92b6da181ac32766b29e7205c166d1b415d5b1bb,2022-10-29 14:56:15,C++,300.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include \n\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n while(n --){\n int ax,ay,bx,by;\n cin >> ax >> ay >> bx >> by;\n if(__gcd(abs(bx - ax), abs(by - ay)) == 1) puts(\""no\"");\n else puts(\""yes\"");\n }\n return 0;\n}",ACCEPTED,350,616 1586251762310713344,bf21e479b636ce34acf4cd37a5079d72864cfc35acecd8624bb4c81358d3595b,2022-10-29 15:01:05,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\n#include\nint main(){\n int a[10],b[10],n,m,i=1,maxa=0,maxb=0;\n scanf(\""%d\\n\"",&n);\n for(i=1;i<=n;i++){\n scanf(\""%d\\n\"",&a[i]);\n if(a[i]>maxa)\n maxa=a[i];\n }\n scanf(\""%d\\n\"",&m);\n for(i=1;i<=m;i++){\n scanf(\""%d\\n\"",&b[i]);\n if(b[i]>maxb)\n maxb=b[i];\n }\n\tprintf(\""%d %d\"",maxa,maxb); \n }\n",RUNTIME_ERROR,55,640 1586253445518458880,bfcefd3551cca4300e908a6b4e72bb34de6fd1d47a163f3bf51ee061fefe1ffd,2022-10-29 15:07:47,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\n#include\nint main()\n{\n\tint a[14001], b[2001];\n\tscanf(\""%d\"", &a[14001]);\n\tint i;\n\tint max1 = 0;\n\tint max2 = 0;\n\t\n\tfor (i = 1; i <= a[14001]; i++) {\n\t\tscanf(\""%d\"", &a[i]);\n\t\t\n\t\tif (a[i]>max1)\n\t\t\tmax1 = a[i];\n\t}\n\tscanf(\""%d\"", &b[2001]);\n\tint j;\n\tfor (j = 1; j <= b[2001]; j++) {\n\t\tscanf(\""%d\"",&b[j]);\n\t\t\n\t\tif (b[j]>max2)\n\t\t\tmax2 = b[j];\n\t}\n\tprintf(\""%d %d\"", max1, max2);\n\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,140,640 1586253710913040384,bfcefd3551cca4300e908a6b4e72bb34de6fd1d47a163f3bf51ee061fefe1ffd,2022-10-29 15:08:50,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\n#include\n#include\nint main()\n{\n\tint a[14001], b[2001];\n\tscanf(\""%d\"", &a[14001]);\n\tint i;\n\tint max1 = 0;\n\tint max2 = 0;\n\t\n\tfor (i = 1; i <= a[14001]; i++) {\n\t\tscanf(\""%d\"", &a[i]);\n\t\t\n\t\tif (a[i]>max1)\n\t\t\tmax1 = a[i];\n\t}\n\tscanf(\""%d\"", &b[2001]);\n\tint j;\n\tfor (j = 1; j <= b[2001]; j++) {\n\t\tscanf(\""%d\"",&b[j]);\n\t\t\n\t\tif (b[j]>max2)\n\t\t\tmax2 = b[j];\n\t}\n\tprintf(\""%d %d\"", max1, max2);\n\n\treturn 0;\n}",COMPILE_ERROR,0,0 1586254080460582912,71c1a7fbd36b79e6a9b57c1e92b6da181ac32766b29e7205c166d1b415d5b1bb,2022-10-29 15:10:18,C++,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include \n\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n while(n --){\n int ax,ay,bx,by;\n cin >> ax >> ay >> bx >> by;\n if(__gcd(abs(bx - ax), abs(by - ay)) == 1) puts(\""no\"");\n else puts(\""yes\"");\n }\n return 0;\n}",WRONG_ANSWER,327,640 1586254285947924480,71c1a7fbd36b79e6a9b57c1e92b6da181ac32766b29e7205c166d1b415d5b1bb,2022-10-29 15:11:07,C++,300.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include \n\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n while(n --){\n int ax,ay,bx,by;\n cin >> ax >> ay >> bx >> by;\n if(ax == bx && ay == by) puts(\""no\"");\n else if(__gcd(abs(bx - ax), abs(by - ay)) == 1) puts(\""no\"");\n else puts(\""yes\"");\n }\n return 0;\n}",ACCEPTED,296,640 1586254441699213312,bfcefd3551cca4300e908a6b4e72bb34de6fd1d47a163f3bf51ee061fefe1ffd,2022-10-29 15:11:44,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\n#include\n#include\nint main()\n{\n\tint a[14001], b[2001];\n\tscanf(\""%d\"", &a[14001]);\n\tint i;\n\tint max1 = 0;\n\tint max2 = 0;\n\t\n\tfor (i = 1; i <= a[14001]; i++) {\n\t\tscanf(\""%d\"", &a[i]);\n\t\t\n\t\tif (a[i]>max1)\n\t\t\tmax1 = a[i];\n\t}\n\tscanf(\""%d\"", &b[2001]);\n\tint j;\n\tfor (j = 1; j <= b[2001]; j++) {\n\t\tscanf(\""%d\"",&b[j]);\n\t\t\n\t\tif (b[j]>max2)\n\t\t\tmax2 = b[j];\n\t}\n\tprintf(\""%d %d\"", max1, max2);\n\n\treturn 0;\n}",WRONG_ANSWER,171,632 1586255491458007040,9284f371e83346e627f92f90fc079849e36f8c6a282f8fa1e865608956e98196,2022-10-29 15:15:55,C++,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\nusing namespace std;\nint a[14000],b[14000],c[5000];\nint main()\n{\n\tmemset(a,0,sizeof(a));\n\tmemset(b,0,sizeof(b));\n\tmemset(c,0,sizeof(c));\n\tint n,m,a0,b0,i,max=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;imax&&c[a[k]+b[j]]==0)\n\t\t\t{\n\t\t\t\tmax=a[k]+b[j];\n\t\t\t\ta0=a[k];\n\t\t\t\tb0=b[j];\n\t\t\t}\t\t\t\t\n\t}\n\tprintf(\""%d %d\\n\"",a0,b0);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,151,880 1586255958082715648,9284f371e83346e627f92f90fc079849e36f8c6a282f8fa1e865608956e98196,2022-10-29 15:17:46,C++,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\nusing namespace std;\nint a[14000],b[14000],c[5000];\nint main()\n{\n\tmemset(a,0,sizeof(a));\n\tmemset(b,0,sizeof(b));\n\tmemset(c,0,sizeof(c));\n\tint n,m,a0,b0,i,max=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;imax&&c[a[k]+b[j]]==0)\n\t\t\t{\n\t\t\t\tmax=a[k]+b[j];\n if(max>=4000)\n {\n \tprintf(\""2000 2000\\n\"");\n }\n\t\t\t\ta0=a[k];\n\t\t\t\tb0=b[j];\n\t\t\t}\t\t\t\t\n\t}\n\tprintf(\""%d %d\\n\"",a0,b0);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,170,768 1586256190178721792,bf21e479b636ce34acf4cd37a5079d72864cfc35acecd8624bb4c81358d3595b,2022-10-29 15:18:41,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\n#include\nint main(){\n int a[100],b[100],n,m,i=1,maxa=0,maxb=0;\n scanf(\""%d\\n\"",&n);\n for(i=1;i<=n;i++){\n scanf(\""%d\\n\"",&a[i]);\n if(a[i]>maxa)\n maxa=a[i];\n }\n scanf(\""%d\\n\"",&m);\n for(i=1;i<=m;i++){\n scanf(\""%d\\n\"",&b[i]);\n if(b[i]>maxb)\n maxb=b[i];\n }\n\tprintf(\""%d %d\"",maxa,maxb); \n }\n",TIME_LIMIT_EXCEEDED,27,344 1586256456965820416,9284f371e83346e627f92f90fc079849e36f8c6a282f8fa1e865608956e98196,2022-10-29 15:19:45,C++,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\nusing namespace std;\nint a[14000],b[14000],c[5000];\nint main()\n{\n\tmemset(a,0,sizeof(a));\n\tmemset(b,0,sizeof(b));\n\tmemset(c,0,sizeof(c));\n\tint n,m,a0,b0,i,max=0,maxa=0,maxb=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i\nusing namespace std;\nint a[14000],b[14000];\nint main()\n{\n\tmemset(a,0,sizeof(a));\n\tmemset(b,0,sizeof(b));\n\tint n,m,a0,b0,i,maxa=0,maxb=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i\n#include\n\nint main()\n{\n\tint a[14001], b[2001];\n\tscanf(\""%d\"", &a[14001]);\n\tint i;\n\tint max1 = 0;\n\tint max2 = 0;\n\t\n\tfor (i = 1; i <= a[14001]; i++) {\n\t\tscanf(\""%d\"", &a[i]);\n\t\t\n\t\tif (a[i]>max1)\n\t\t\tmax1 = a[i];\n\t}\n\tscanf(\""%d\"", &b[2001]);\n\tint j;\n\tfor (j = 1; j <= b[2001]; j++) {\n\t\tscanf(\""%d\"",&b[j]);\n\t\t\n\t\tif (b[j]>max2)\n\t\t\tmax2 = b[j];\n\t}\n\tprintf(\""%d %d\"", max1, max2);\n\n\treturn 0;\n}",WRONG_ANSWER,136,604 1586257455407296512,70eba4afbfa4c7bd72f3976237074c9ab261e8cc5d734d2bc3bf971b59cdf744,2022-10-29 15:23:43,C,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include\n#include\nint main()\n{\n int n;\n double ax,ay,bx,by;\n scanf(\""%d\"",&n);\n for(int j=1;j<=n;j++){\n scanf(\""%lf%lf\"",&ax,&ay);\n scanf(\""%lf%lf\"",&bx,&by);\n if(fabs(ax-bx)>=2||fabs(ay-by)>=2)printf(\""yes\\n\"");\n else if(fabs(ax-bx)==1&&fabs(ay-by)==1)printf(\""yes\\n\"");\n else printf(\""no\\n\"");\n }\n return 0;\n}",WRONG_ANSWER,6,196 1586257570599669760,bfcefd3551cca4300e908a6b4e72bb34de6fd1d47a163f3bf51ee061fefe1ffd,2022-10-29 15:24:10,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\n#include\n#include\nint main()\n{\n\tint a[14001], b[2001];\n\tscanf(\""%d\"", &a[14001]);\n\tint i;\n\tint max1 = 0;\n\tint max2 = 0;\n\n\tfor (i = 1; i <=a[14001]; i++) {\n\t\tscanf(\""%d\"", &a[i]);\n\t\t\n\t\tif (a[i]>max1)\n\t\t\tmax1 = a[i];\n\t}\n\tscanf(\""%d\"", &b[2001]);\n\tint j;\n\tfor (j = 1; j <=b[2001]; j++) {\n\t\tscanf(\""%d\"",&b[j]);\n\t\t\n\t\tif (b[j]>max2)\n\t\t\tmax2 = b[j];\n\t}\n\tif(max1!=0 && max2!=0)\n\tprintf(\""%d %d\"", max1, max2);\n\n\treturn 0;\n}",WRONG_ANSWER,126,616 1586257963782111232,70eba4afbfa4c7bd72f3976237074c9ab261e8cc5d734d2bc3bf971b59cdf744,2022-10-29 15:25:44,C,300.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\nint main()\n{\n int a,b;\n int max=0,max1=0;\n scanf(\""%d\"",&a);\n int a1[a];\n for(int j=1;j<=a;j++){\n scanf(\""%d\"",&a1[j]);\n if(a1[j]>max)max=a1[j];\n }\n scanf(\""%d\"",&b);\n int b1[b];\n for(int j=1;j<=b;j++){\n scanf(\""%d\"",&b1[j]);\n if(b1[j]>max1)max1=b1[j];\n }\n printf(\""%d %d\"",max,max1);\n return 0;\n}",ACCEPTED,151,648 1586258181374214144,bf21e479b636ce34acf4cd37a5079d72864cfc35acecd8624bb4c81358d3595b,2022-10-29 15:26:36,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\n#include\nint main(){\n int a[100],b[100],n,m,i=1,j=1,maxa=0,maxb=0;\n scanf(\""%d\\n\"",&n);\n while(i<=n){\n scanf(\""%d\\n\"",&a[i]);\n if(a[i]>maxa)\n maxa=a[i];\n i++;\n }\n scanf(\""%d\\n\"",&m);\n while(j<=m){\n scanf(\""%d\\n\"",&b[j]);\n if(b[i]>maxb)\n maxb=b[i];\n j++;\n }\n\tprintf(\""%d %d\"",maxa,maxb); \n }\n",WRONG_ANSWER,10,324 1586258520664047616,9284f371e83346e627f92f90fc079849e36f8c6a282f8fa1e865608956e98196,2022-10-29 15:27:57,C++,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include\nusing namespace std;\nint a[14000],b[14000];\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\twhile(n--)\n\t{\n\t\tint a,b,c,d;\n\t\tscanf(\""%d %d %d %d\"",&a,&b,&c,&d);\n\t\tif(abs(a-c)<=1&&abs(b-d)<=1)\n\t\t\tprintf(\""no\\n\"");\n\t\telse\n\t\t\tprintf(\""yes\\n\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,9,328 1586258756782387200,bfcefd3551cca4300e908a6b4e72bb34de6fd1d47a163f3bf51ee061fefe1ffd,2022-10-29 15:28:53,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\n#include\n#include\nint main()\n{\n\tint a[14001], b[2001];\n\tscanf(\""%d\"", &a[14001]);\n\tint i;\n\tint max1 = 0;\n\tint max2 = 0;\n\n\tfor (i = 1; i <=a[14001]; i++) {\n\t\tscanf(\""%d\"", &a[i]);\n\t\t\n\t\tif (a[i]>max1)\n\t\t\tmax1 = a[i];\n\t}\n\tscanf(\""%d\"", &b[2001]);\n\tint j;\n\tfor (j = 1; j <=b[2001]; j++) {\n\t\tscanf(\""%d\"",&b[j]);\n\t\t\n\t\tif (b[j]>max2)\n\t\t\tmax2 = b[j];\n\t}\n\tif((max1+max2)!=a[i] && (max1+max2)!=b[j])\n\tprintf(\""%d %d\"", max1, max2);\n\n\treturn 0;\n}",WRONG_ANSWER,165,512 1586258850583801856,8a60a7f5a66174b4191e824b6fe59735f6c87e03421fe41c6136ae702823d481,2022-10-29 15:29:15,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\nint main()\n{\n int a[100],b[100],n,m,i,q=0,w=0;\n scanf(\""%d\"",&n);\n for(i=1;i<=n;i++)\n {\n scanf(\""%d\"",&a[i]);\n if(q\nint main()\n{\n int a[1000],b[1000],n,m,i,q=0,w=0;\n scanf(\""%d\"",&n);\n for(i=1;i<=n;i++)\n {\n scanf(\""%d\"",&a[i]);\n if(q\n#include\n#include\nint main()\n{\n\tint a[14001], b[2001];\n\tscanf(\""%d\"", &a[14001]);\n\tint i;\n\tint max1 = 0;\n\tint max2 = 0;\n\n\tfor (i = 1; i <=a[14001]; i++) {\n\t\tscanf(\""%d\"", &a[i]);\n\t\t\n\t\tif (a[i]>max1)\n\t\t\tmax1 = a[i];\n\t}\n\tscanf(\""%d\"", &b[2001]);\n\tint j;\n\tfor (j = 1; j <=b[2001]; j++) {\n\t\tscanf(\""%d\"",&b[j]);\n\t\t\n\t\tif (b[j]>max2)\n\t\t\tmax2 = b[j];\n\t}\n\tif(max1>0 && max2>0)\n\tprintf(\""%d %d\"", max1, max2);\n\n\treturn 0;\n}",WRONG_ANSWER,167,640 1586259469801492480,bf21e479b636ce34acf4cd37a5079d72864cfc35acecd8624bb4c81358d3595b,2022-10-29 15:31:43,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\n#include\nint main(){\n int a[100],b[100],n,m,i=1,j=1,maxa=0,maxb=0;\n scanf(\""%d\\n\"",&n);\n while(i<=n){\n scanf(\""%d\"",&a[i]);\n if(a[i]>maxa)\n maxa=a[i];\n i++;\n }\n scanf(\""%d\\n\"",&m);\n while(j<=m){\n scanf(\""%d\"",&b[j]);\n if(b[j]>maxb)\n maxb=b[j];\n j++;\n }\n\tprintf(\""%d %d\"",maxa,maxb); \n }\n",SEGMENTATION_FAULT,202,632 1586259473530224640,d4d89a60a1e51464e3a83a7b5a3387d374033bcc3c66bb32a3a08873d696f6cf,2022-10-29 15:31:44,C,300.0,1585905910751457280,1583746247320023040,1039131349729988608,"#define _CRT_SECURE_NO_WARNINGS\n#include \n\nint max(int x,int a) {\n if (x > a) return x;\n else return a;\n}\n\nint main() {\n int n, x = 0, y = 0, a;\n scanf(\""%d\"", &n);\n for (int i = 0;i < n; i++) scanf(\""%d\"", &a), x = max(x, a);\n scanf(\""%d\"", &n);\n for (int i = 0;i < n; i++) scanf(\""%d\"", &a), y = max(y, a);\n printf(\""%d %d\"", x, y);\n return 0;\n}",ACCEPTED,185,500 1586259560301989888,bf21e479b636ce34acf4cd37a5079d72864cfc35acecd8624bb4c81358d3595b,2022-10-29 15:32:05,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\n#include\nint main(){\n int a[100],b[100],n,m,i=1,j=1,maxa=0,maxb=0;\n int max(int x,int y);\n scanf(\""%d\\n\"",&n);\n while(i<=n){\n scanf(\""%d\"",&a[i]);\n maxa=max(maxa,a[i]);\n i++;\n }\n scanf(\""%d\\n\"",&m);\n while(j<=m){\n scanf(\""%d\"",&b[j]);\n maxb=max(maxb,b[j]);\n j++;\n }\n\tprintf(\""%d %d\"",maxa,maxb);\n\treturn 0; \n }\n int max(int x,int y)\n{\n int z;\n if(x>y)\n z=x;\n else\n z=y;\n return(z);\n}\n\n",SEGMENTATION_FAULT,179,512 1586259838141067264,bf21e479b636ce34acf4cd37a5079d72864cfc35acecd8624bb4c81358d3595b,2022-10-29 15:33:11,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\n#include\nint main(){\n int a[100],b[100],n,m,i=1,j=1,maxa=0,maxb=0;\n int max(int x,int y);\n scanf(\""%d\\n\"",&n);\n while(i<=n){\n scanf(\""%d\"",&a[i]);\n maxa=max(maxa,a[i]);\n i++;\n }\n scanf(\""%d\\n\"",&m);\n while(j<=m){\n scanf(\""%d\"",&b[j]);\n maxb=max(maxb,b[j]);\n j++;\n }\n\tprintf(\""%d %d\"",maxa,maxb);\n\treturn 0; \n }\n int max(int x,int y)\n{\n int z;\n if(x>y)\n z=x;\n else\n z=y;\n return(z);\n}\n\n",SEGMENTATION_FAULT,172,512 1586260088767512576,bf21e479b636ce34acf4cd37a5079d72864cfc35acecd8624bb4c81358d3595b,2022-10-29 15:34:11,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\n#include\nint main(){\n int a[10],b[10],n,m,i=1,j=1,maxa=0,maxb=0;\n int max(int x,int y);\n scanf(\""%d\\n\"",&n);\n while(i<=n){\n scanf(\""%d\"",&a[i]);\n maxa=max(maxa,a[i]);\n i++;\n }\n scanf(\""%d\\n\"",&m);\n while(j<=m){\n scanf(\""%d\"",&b[j]);\n maxb=max(maxb,b[j]);\n j++;\n }\n\tprintf(\""%d %d\"",maxa,maxb);\n\treturn 0; \n }\n int max(int x,int y)\n{\n int z;\n if(x>y)\n z=x;\n else\n z=y;\n return(z);\n}\n\n",RUNTIME_ERROR,56,512 1586260132316975104,bf21e479b636ce34acf4cd37a5079d72864cfc35acecd8624bb4c81358d3595b,2022-10-29 15:34:21,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\n#include\nint main(){\n int a[50],b[50],n,m,i=1,j=1,maxa=0,maxb=0;\n int max(int x,int y);\n scanf(\""%d\\n\"",&n);\n while(i<=n){\n scanf(\""%d\"",&a[i]);\n maxa=max(maxa,a[i]);\n i++;\n }\n scanf(\""%d\\n\"",&m);\n while(j<=m){\n scanf(\""%d\"",&b[j]);\n maxb=max(maxb,b[j]);\n j++;\n }\n\tprintf(\""%d %d\"",maxa,maxb);\n\treturn 0; \n }\n int max(int x,int y)\n{\n int z;\n if(x>y)\n z=x;\n else\n z=y;\n return(z);\n}\n\n",SEGMENTATION_FAULT,196,512 1586260516146118656,bfcefd3551cca4300e908a6b4e72bb34de6fd1d47a163f3bf51ee061fefe1ffd,2022-10-29 15:35:53,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\n#include\n#include\nint main()\n{\n\tint a[14001], b[2001];\n\tscanf(\""%d\"", &a[14001]);\n\tint i;\n\tint max1 = 0;\n\tint max2 = 0;\n\n\tfor (i = 1; i <=a[14001]; i++) {\n\t\tscanf(\""%d\"", &a[i]);\n\t\t\n\t\tif (a[i]>max1)\n\t\t\tmax1 = a[i];\n\t}\n\tscanf(\""%d\"", &b[2001]);\n\tint j;\n\tfor (j = 1; j <=b[2001]; j++) {\n\t\tscanf(\""%d\"",&b[j]);\n\t\t\n\t\tif (b[j]>max2)\n\t\t\tmax2 = b[j];\n\t}\n\t\n\tprintf(\""%d %d\\n\"", max1, max2);\n\n\treturn 0;\n}",WRONG_ANSWER,143,512 1586260975468544000,d4d89a60a1e51464e3a83a7b5a3387d374033bcc3c66bb32a3a08873d696f6cf,2022-10-29 15:37:42,C,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#define _CRT_SECURE_NO_WARNINGS\n#include \n#include \n\nint main() {\n int n;\n int x1, y1, x2, y2;\n double distance;\n scanf(\""%d\"", &n);\n while (n--) {\n scanf(\""%d%d\\n%d%d\"",&x1,&y1,&x2,&y2);\n distance = fabs(sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2)));\n if ((int)distance <= 1) printf(\""no\"");\n else printf(\""yes\"");\n }\n}",WRONG_ANSWER,10,348 1586261022063067136,bf21e479b636ce34acf4cd37a5079d72864cfc35acecd8624bb4c81358d3595b,2022-10-29 15:37:53,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\nint main(){\n int a[100],b[100],n,m,i=1,j=1,maxa=0,maxb=0;\n int max(int x,int y);\n scanf(\""%d\\n\"",&n);\n while(i<=n){\n scanf(\""%d\"",&a[i]);\n i++;\n }\n scanf(\""%d\\n\"",&m);\n while(j<=m){\n scanf(\""%d\"",&b[j]);\n j++;\n }\n for(i=1;i<=max(m,n);i++){\n\t\n maxa=max(a[i],maxa);\n maxb=max(b[i],maxb);}\n\tprintf(\""%d %d\"",maxa,maxb);\n\treturn 0;\n }\n int max(int x,int y)\n{\n int z;\n if(x>y)\n z=x;\n else\n z=y;\n return(z);\n}\n\n",WRONG_ANSWER,4,328 1586261207749095424,bf21e479b636ce34acf4cd37a5079d72864cfc35acecd8624bb4c81358d3595b,2022-10-29 15:38:37,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\nint main(){\n int a[100],b[100],n,m,i=1,j=1,maxa=0,maxb=0;\n int max(int x,int y);\n scanf(\""%d\\n\"",&n);\n while(i<=n){\n scanf(\""%d\"",&a[i]);\n i++;\n }\n scanf(\""%d\\n\"",&m);\n while(j<=m){\n scanf(\""%d\"",&b[j]);\n j++;\n }\n for(i=1;i<=max(m,n);i++){\n maxa=max(a[i],maxa);\n maxb=max(b[i],maxb);}\n\tprintf(\""%d %d\"",maxa,maxb);\n }\n int max(int x,int y)\n{\n int z;\n if(x>y)\n z=x;\n else\n z=y;\n return(z);\n}\n\n",WRONG_ANSWER,9,636 1586261890594377728,d4d89a60a1e51464e3a83a7b5a3387d374033bcc3c66bb32a3a08873d696f6cf,2022-10-29 15:41:20,C,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#define _CRT_SECURE_NO_WARNINGS\n#include \n#include \n\nint main() {\n int n;\n double x1, y1, x2, y2;\n double distance;\n scanf(\""%d\"", &n);\n while (n--) {\n scanf(\""%lf%lf\\n%lf%lf\"",&x1,&y1,&x2,&y2);\n distance = fabs(sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2)));\n if ((int)distance <= 1) printf(\""no\\n\"");\n else printf(\""yes\\n\"");\n }\n}",WRONG_ANSWER,8,324 1586262010425638912,9f8da61264ed45a9a4307a5f0c88c4b98df8923ee5d381bfc8c77688ee4aaaa0,2022-10-29 15:41:49,C,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#define _CRT_SECURE_NO_WARNINGS 1\n#include\n#include\n#include\n#include\ninline int gcd(int a, int b);\nint main()\n{\n int a1, b1, a2, b2;\n int n;\n scanf(\""%d\"", &n);\n while (n--) {\n scanf(\""%d %d %d %d\"", &a1, &b1, &a2, &b2);\n a2 = abs(a2 - a1); b2 = abs(b2 - b1);\n if (a2 == 1 || b2 == 1)printf(\""no\\n\"");\n else if (gcd(a2, b2) != 1)printf(\""yes\\n\"");\n else printf(\""no\\n\"");\n }\n return 0;\n}\ninline int gcd(int a, int b)\n{\n if (b) while ((a %= b) && (b %= a));\n return a + b;\n}",WRONG_ANSWER,229,512 1586262755170451456,9284f371e83346e627f92f90fc079849e36f8c6a282f8fa1e865608956e98196,2022-10-29 15:44:46,C++,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include\nusing namespace std;\nint a[14000],b[14000];\nint main()\n{\n\tint n,s,i;\n\tscanf(\""%d\"",&n);\n\twhile(n--)\n\t{\n\t\tint a,b,c,d;\n\t\tscanf(\""%d %d %d %d\"",&a,&b,&c,&d);\n\t\ts=abs(a-c)/(double)(abs(b-d));\n\t\tif(a\n#include\n#include\n#include\n#include\nusing namespace std;\ninline int gcd(int a, int b);\nint main()\n{\n int a1, b1, a2, b2;\n int n;\n scanf(\""%d\"", &n);\n while (n--) {\n scanf(\""%d %d %d %d\"", &a1, &b1, &a2, &b2);\n a2 = abs(a2 - a1); b2 = abs(b2 - b1);\n if (a2 == 1 || b2 == 1)printf(\""no\\n\"");\n else if (gcd(a2, b2) != 1||a2==b2)printf(\""yes\\n\"");\n else printf(\""no\\n\"");\n }\n return 0;\n}\ninline int gcd(int a, int b)\n{\n if (b) while ((a %= b) && (b %= a));\n return a + b;\n}",COMPILE_ERROR,0,0 1586262933591949312,9f8da61264ed45a9a4307a5f0c88c4b98df8923ee5d381bfc8c77688ee4aaaa0,2022-10-29 15:45:29,C,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#define _CRT_SECURE_NO_WARNINGS 1\n#include\n#include\n#include\n#include\ninline int gcd(int a, int b);\nint main()\n{\n int a1, b1, a2, b2;\n int n;\n scanf(\""%d\"", &n);\n while (n--) {\n scanf(\""%d %d %d %d\"", &a1, &b1, &a2, &b2);\n a2 = abs(a2 - a1); b2 = abs(b2 - b1);\n if (a2 == 1 || b2 == 1)printf(\""no\\n\"");\n else if (gcd(a2, b2) != 1||a2==b2)printf(\""yes\\n\"");\n else printf(\""no\\n\"");\n }\n return 0;\n}\ninline int gcd(int a, int b)\n{\n if (b) while ((a %= b) && (b %= a));\n return a + b;\n}",WRONG_ANSWER,178,640 1586263404838780928,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-10-29 15:47:21,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include \n\nint main()\n{\n\tlong num1[100],num2[100];\n\tint n,m,i;\n\tscanf(\""%d\"",&n);\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tscanf(\""%d\"",&num1[i]);\n\t}\n\t\n\tscanf(\""%d\"",&m);\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tscanf(\""%d\"",&num2[i]);\n\t}\n\t\n\tint max1 = num1[0],max2 =num2[0];\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tif (num1[i] > max1) max1 = num1[i];\n\t}\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tif (num2[i] > max2) max2 = num2[i];\n\t}\n\tprintf(\""%d %d\"",max1,max2);\n\t\n\treturn 0;\n}",WRONG_ANSWER,8,200 1586263415999823872,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-10-29 15:47:24,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include \n\nint main()\n{\n\tlong num1[100],num2[100];\n\tint n,m,i;\n\tscanf(\""%d\"",&n);\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tscanf(\""%d\"",&num1[i]);\n\t}\n\t\n\tscanf(\""%d\"",&m);\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tscanf(\""%d\"",&num2[i]);\n\t}\n\t\n\tint max1 = num1[0],max2 =num2[0];\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tif (num1[i] > max1) max1 = num1[i];\n\t}\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tif (num2[i] > max2) max2 = num2[i];\n\t}\n\tprintf(\""%d %d\"",max1,max2);\n\t\n\treturn 0;\n}",WRONG_ANSWER,4,196 1586263567485497344,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-10-29 15:48:00,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include \n\nint main()\n{\n\tlong long num1[10000],num2[10000];\n\tlong long n,m,i;\n\tscanf(\""%lld\"",&n);\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tscanf(\""%lld\"",&num1[i]);\n\t}\n\t\n\tscanf(\""%lld\"",&m);\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tscanf(\""%lld\"",&num2[i]);\n\t}\n\t\n\tint max1 = num1[0],max2 =num2[0];\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tif (num1[i] > max1) max1 = num1[i];\n\t}\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tif (num2[i] > max2) max2 = num2[i];\n\t}\n\tprintf(\""%lld %lld\"",max1,max2);\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,159,640 1586263635529695232,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-10-29 15:48:16,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include \n\nint main()\n{\n\tlong long num1[1000000],num2[1000000];\n\tlong long n,m,i;\n\tscanf(\""%lld\"",&n);\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tscanf(\""%lld\"",&num1[i]);\n\t}\n\t\n\tscanf(\""%lld\"",&m);\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tscanf(\""%lld\"",&num2[i]);\n\t}\n\t\n\tint max1 = num1[0],max2 =num2[0];\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tif (num1[i] > max1) max1 = num1[i];\n\t}\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tif (num2[i] > max2) max2 = num2[i];\n\t}\n\tprintf(\""%lld %lld\"",max1,max2);\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,9,220 1586263831965732864,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-10-29 15:49:03,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include \n\nint main()\n{\n\tlong long num1[1000],num2[1000];\n\tlong long n,m,i;\n\tscanf(\""%lld\"",&n);\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tscanf(\""%lld\"",&num1[i]);\n\t}\n\t\n\tscanf(\""%lld\"",&m);\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tscanf(\""%lld\"",&num2[i]);\n\t}\n\t\n\tint max1 = num1[0],max2 =num2[0];\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tif (num1[i] > max1) max1 = num1[i];\n\t}\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tif (num2[i] > max2) max2 = num2[i];\n\t}\n\tprintf(\""%lld %lld\"",max1,max2);\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,131,512 1586263914283139072,12aa33ee8db8cc8975920bb2e9fd4d4223b232e7be516e0ce206117b1000ec62,2022-10-29 15:49:23,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include \nint main()\n{\nint a[100],b[1400];\nint n,m,mx,max,i,j;\nscanf(\""%d\"",&n);\nfor(i=1;i<=n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n}\nscanf(\""%d\"",&m);\nfor(j=1;j<=m;j++)\n{\n\tscanf(\""%d\"",&b[j]);\n}\nmax=a[1];\nfor(i=1;i<=n;i++)\n{\n\tif(max<=a[i]) max=a[i];\n}\nmx=b[1];\nfor(i=1;i<=m;i++)\n{\n\tif(mx<=b[i]) mx=b[i];\n}\nprintf(\""%d %d\"",max,mx);\n}",SEGMENTATION_FAULT,166,512 1586263925926522880,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-10-29 15:49:25,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include \n\nint main()\n{\n\tlong num1[1000],num2[1000];\n\tlong n,m,i;\n\tscanf(\""%ld\"",&n);\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tscanf(\""%ld\"",&num1[i]);\n\t}\n\t\n\tscanf(\""%ld\"",&m);\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tscanf(\""%ld\"",&num2[i]);\n\t}\n\t\n\tint max1 = num1[0],max2 =num2[0];\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tif (num1[i] > max1) max1 = num1[i];\n\t}\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tif (num2[i] > max2) max2 = num2[i];\n\t}\n\tprintf(\""%ld %ld\"",max1,max2);\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,176,512 1586263987893170176,12aa33ee8db8cc8975920bb2e9fd4d4223b232e7be516e0ce206117b1000ec62,2022-10-29 15:49:40,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include \nint main()\n{\nint a[1400],b[1400];\nint n,m,mx,max,i,j;\nscanf(\""%d\"",&n);\nfor(i=1;i<=n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n}\nscanf(\""%d\"",&m);\nfor(j=1;j<=m;j++)\n{\n\tscanf(\""%d\"",&b[j]);\n}\nmax=a[1];\nfor(i=1;i<=n;i++)\n{\n\tif(max<=a[i]) max=a[i];\n}\nmx=b[1];\nfor(i=1;i<=m;i++)\n{\n\tif(mx<=b[i]) mx=b[i];\n}\nprintf(\""%d %d\"",max,mx);\n}",SEGMENTATION_FAULT,179,640 1586264039541833728,d4d89a60a1e51464e3a83a7b5a3387d374033bcc3c66bb32a3a08873d696f6cf,2022-10-29 15:49:53,C++,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#define _CRT_SECURE_NO_WARNINGS\n#include \n#include \n\nint gcd(int x, int y)\n{\n if (!y) return x;\n else return gcd(y, x % y);\n}\n\nint main() {\n int n;\n int x1, y1, x2, y2;\n scanf(\""%d\"", &n);\n while (n--) {\n scanf(\""%d%d\\n%d%d\"",&x1,&y1,&x2,&y2);\n if (gcd(abs(x1 - x2), abs(y1 - y2)) == 1) printf(\""no\\n\"");\n else printf(\""yes\\n\"");\n }\n}",WRONG_ANSWER,184,512 1586264074803347456,12aa33ee8db8cc8975920bb2e9fd4d4223b232e7be516e0ce206117b1000ec62,2022-10-29 15:50:01,C,300.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include \nint main()\n{\nint a[14000],b[14000];\nint n,m,mx,max,i,j;\nscanf(\""%d\"",&n);\nfor(i=1;i<=n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n}\nscanf(\""%d\"",&m);\nfor(j=1;j<=m;j++)\n{\n\tscanf(\""%d\"",&b[j]);\n}\nmax=a[1];\nfor(i=1;i<=n;i++)\n{\n\tif(max<=a[i]) max=a[i];\n}\nmx=b[1];\nfor(i=1;i<=m;i++)\n{\n\tif(mx<=b[i]) mx=b[i];\n}\nprintf(\""%d %d\"",max,mx);\n}",ACCEPTED,147,476 1586264108525551616,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-10-29 15:50:09,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include \n\nint main()\n{\n\tint num1[1000],num2[1000];\n\tint n,m,i;\n\tscanf(\""%d\"",&n);\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tscanf(\""%d\"",&num1[i]);\n\t}\n\t\n\tscanf(\""%d\"",&m);\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tscanf(\""%d\"",&num2[i]);\n\t}\n\t\n\tint max1 = num1[0],max2 =num2[0];\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tif (num1[i] > max1) max1 = num1[i];\n\t}\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tif (num2[i] > max2) max2 = num2[i];\n\t}\n\tprintf(\""%d %d\"",max1,max2);\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,224,500 1586264151940796416,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-10-29 15:50:19,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include \n\nint main()\n{\n\tint num1[1000],num2[1000];\n\tint n,m,i;\n\tscanf(\""%d\"",&n);\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tscanf(\""%d\"",&num1[i]);\n\t}\n\t\n\tscanf(\""%d\"",&m);\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tscanf(\""%d\"",&num2[i]);\n\t}\n\t\n\tint max1 = num1[0],max2 =num2[0];\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tif (num1[i] > max1) max1 = num1[i];\n\t}\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tif (num2[i] > max2) max2 = num2[i];\n\t}\n\tprintf(\""%d %d\"",max1,max2);\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,125,512 1586264387639705600,9284f371e83346e627f92f90fc079849e36f8c6a282f8fa1e865608956e98196,2022-10-29 15:51:16,C++,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include\nusing namespace std;\nint a[14000],b[14000];\nint main()\n{\n\tint n,s,i;\n\tscanf(\""%d\"",&n);\n\twhile(n--)\n\t{\n\t\tint a,b,c,d;\n\t\tscanf(\""%d %d %d %d\"",&a,&b,&c,&d);\n\t\tif(a==c||b==d)\n\t\t{\n\t\t\tif(abs(a-c)>1||abs(b-d)>1)\n\t\t\t{\n\t\t\t\tprintf(\""yes\\n\"");\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tprintf(\""no\\n\"");\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\t\t\n\t\t}\n\t\ts=(double)(abs(b-d))/abs(a-c);\n\t\tif(a\n\nint main()\n{\n\tint num1[500],num2[500];\n\tint n,m,i;\n\tscanf(\""%d\"",&n);\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tscanf(\""%d\"",&num1[i]);\n\t}\n\t\n\tscanf(\""%d\"",&m);\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tscanf(\""%d\"",&num2[i]);\n\t}\n\t\n\tint max1 = num1[0],max2 =num2[0];\n\tfor (i = 0;i < n;i++)\n\t{\n\t\tif (num1[i] > max1) max1 = num1[i];\n\t}\n\tfor (i = 0;i < m;i++)\n\t{\n\t\tif (num2[i] > max2) max2 = num2[i];\n\t}\n\tprintf(\""%d %d\"",max1,max2);\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,156,512 1586264432875274240,d4d89a60a1e51464e3a83a7b5a3387d374033bcc3c66bb32a3a08873d696f6cf,2022-10-29 15:51:26,C++,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#define _CRT_SECURE_NO_WARNINGS\n#include \n#include \n\nint gcd(int x, int y)\n{\n if (!y) return x;\n else return gcd(y, x % y);\n}\n\nint main() {\n int n;\n long long x1, y1, x2, y2;\n scanf(\""%d\"", &n);\n while (n--) {\n scanf(\""%lld%lld\\n%lld%lld\"",&x1,&y1,&x2,&y2);\n if (gcd(abs(x1 - x2), abs(y1 - y2)) == 1) printf(\""no\\n\"");\n else printf(\""yes\\n\"");\n }\n}",WRONG_ANSWER,242,768 1586264799709102080,8a60a7f5a66174b4191e824b6fe59735f6c87e03421fe41c6136ae702823d481,2022-10-29 15:52:54,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\nint main()\n{\n int a[100],b[100],n,m,i,q,w;\n q=0;w=0;\n scanf(\""%d\"",&n);\n for(i=1;i<=n;i++)\n {\n scanf(\""%d\"",&a[i]);\n if(q\nusing namespace std;\nint a[14000],b[14000];\nint main()\n{\n\tint n,s,i;\n\tscanf(\""%d\"",&n);\n\twhile(n--)\n\t{\n\t\tint a,b,c,d;\n\t\tscanf(\""%d %d %d %d\"",&a,&b,&c,&d);\n\t\tif(a==c||b==d)\n\t\t{\n\t\t\tif(abs(a-c)>1||abs(b-d)>1)\n\t\t\t{\n\t\t\t\tprintf(\""yes\\n\"");\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tprintf(\""no\\n\"");\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\t\n\t\t}\n\t\ts=(double)(abs(b-d))/abs(a-c);\n\t\tif(a\nint main()\n{\n int a[100],b[100],n,m,i,a,b;\n a=0;b=0;\n scanf(\""%d\"",&n);\n for(i=1;i<=n;i++)\n {\n scanf(\""%d\"",&a[i]);\n if(a\n\nint main()\n{\n\tint num1[500],num2[500];\n\tint n,m,i;\n\tscanf(\""%d\"",&n);\n\tfor (i = 1;i <= n;i++)\n\t{\n\t\tscanf(\""%d\"",&num1[i]);\n\t}\n\t\n\tscanf(\""%d\"",&m);\n\tfor (i = 1;i <= m;i++)\n\t{\n\t\tscanf(\""%d\"",&num2[i]);\n\t}\n\t\n\tint max1 = num1[1],max2 =num2[1];\n\tfor (i = 1;i <= n;i++)\n\t{\n\t\tif (num1[i] > max1) max1 = num1[i];\n\t}\n\tfor (i = 1;i <= m;i++)\n\t{\n\t\tif (num2[i] > max2) max2 = num2[i];\n\t}\n\tprintf(\""%d %d\"",max1,max2);\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,204,640 1586265320138342400,8a60a7f5a66174b4191e824b6fe59735f6c87e03421fe41c6136ae702823d481,2022-10-29 15:54:58,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\nint main()\n{\n int a[100],b[100],n,m,i,j,q,w;\n scanf(\""%d\"",&n);\n for(i=1;i<=n;i++)\n {\n scanf(\""%d\"",&a[i]);\n if(q\nint main()\n{\n int a[100],b[100],n,m,i,j,q,w;\n scanf(\""%d\"",&n);\n for(i=1;i<=n;i++)\n {\n scanf(\""%d\"",&a[i]);\n if(q\nusing namespace std;\nint a[14000],b[14000];\nint main()\n{\n\tint n,s,i;\n\tscanf(\""%d\"",&n);\n\twhile(n--)\n\t{\n\t\tint a,b,c,d;\n\t\tscanf(\""%d %d %d %d\"",&a,&b,&c,&d);\n\t\t\tif((abs(a-c)>1||abs(b-d)>1)&&(a==c||b==d))\n\t\t\t{\n\t\t\t\tprintf(\""yes\\n\"");\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if((a==c||b==d)&&(abs(a-c)<=1||abs(b-d)<=1))\n\t\t\t{\n\t\t\t\tprintf(\""no\\n\"");\n\t\t\t\tcontinue;\n\t\t\t}\n\t\ts=(double)(abs(b-d))/abs(a-c);\n\t\tif(a\n#include\nint main()\n{\n int n;\n double ax,ay,bx,by;\n scanf(\""%d\"",&n);\n for(int j=1;j<=n;j++){\n scanf(\""%lf%lf\"",&ax,&ay);\n scanf(\""%lf%lf\"",&bx,&by);\n if(fabs(ax-bx)>=2||fabs(ay-by)>=2)printf(\""yes\\n\"");\n else printf(\""no\\n\"");\n }\n return 0;\n}",WRONG_ANSWER,7,192 1586265776583479296,8a60a7f5a66174b4191e824b6fe59735f6c87e03421fe41c6136ae702823d481,2022-10-29 15:56:47,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\nint main()\n{\n int a[100],b[100],n,m,i,j,q,w;\n a=0;w=0;\n scanf(\""%d\"",&n);\n for(i=1;i<=n;i++)\n {\n scanf(\""%d\"",&a[i]);\n if(q\nint main()\n{\n int a[100],b[100],n,m,i,j,q,w;\n q=0;w=0;\n scanf(\""%d\"",&n);\n for(i=1;i<=n;i++)\n {\n scanf(\""%d\"",&a[i]);\n if(q\n\nint main()\n{\n\tint num1[500],num2[500];\n\tint n,m,i,max1 = -1,max2 = -1;\n\tscanf(\""%d\"",&n);\n\tfor (i = 1;i <= n;i++)\n\t{\n\t\tscanf(\""%d\"",&num1[i]);\n\t\tif (num1[i] > max1) max1 = num1[i];\n\t}\n\t\n\tscanf(\""%d\"",&m);\n\tfor (i = 1;i <= m;i++)\n\t{\n\t\tscanf(\""%d\"",&num2[i]);\n\t\tif (num2[i] > max2) max2 = num2[i];\n\t}\n\t\n\t/*int max1 = num1[1],max2 =num2[1];\n\tfor (i = 1;i <= n;i++)\n\t{\n\t\tif (num1[i] > max1) max1 = num1[i];\n\t}\n\tfor (i = 1;i <= m;i++)\n\t{\n\t\tif (num2[i] > max2) max2 = num2[i];\n\t}\n\t*/\n\tprintf(\""%d %d\"",max1,max2);\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,192,624 1586266030821216256,8a60a7f5a66174b4191e824b6fe59735f6c87e03421fe41c6136ae702823d481,2022-10-29 15:57:47,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\nint main()\n{\n int a[101],b[101],n,m,i,j,q,w;\n q=0;w=0;\n scanf(\""%d\"",&n);\n for(i=1;i<=n;i++)\n {\n scanf(\""%d\"",&a[i]);\n if(q\n\nint main()\n{\n\tint num1[500],num2[500];\n\tint n,m,i,max1 = -1,max2 = -1;\n\tscanf(\""%d\"",&n);\n\tfor (i = 1;i <= n;i++)\n\t{\n\t\tscanf(\""%d\"",&num1[i]);\n\t\tif (num1[i] > max1) max1 = num1[i];\n\t}\n\t\n\tscanf(\""%d\"",&m);\n\tfor (i = 1;i <= m;i++)\n\t{\n\t\tscanf(\""%d\"",&num2[i]);\n\t\tif (num2[i] > max2) max2 = num2[i];\n\t}\n\t\n\t/*int max1 = num1[1],max2 =num2[1];\n\tfor (i = 1;i <= n;i++)\n\t{\n\t\tif (num1[i] > max1) max1 = num1[i];\n\t}\n\tfor (i = 1;i <= m;i++)\n\t{\n\t\tif (num2[i] > max2) max2 = num2[i];\n\t}\n\t*/\n\tprintf(\""%d %d\"",max1,max2);\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,154,512 1586266226451935232,8a60a7f5a66174b4191e824b6fe59735f6c87e03421fe41c6136ae702823d481,2022-10-29 15:58:34,C,0.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include\nint main()\n{\n int a[101],b[101],n,m,i,j,q,w;\n q=0;w=0;\n scanf(\""%d\"",&n);\n if(n>100) n=100;\n for(i=1;i<=n;i++)\n {\n scanf(\""%d\"",&a[i]);\n if(q100) m=100;\n for(j=1;j<=m;j++)\n {\n scanf(\""%d\"",&b[j]);\n if(w\n\nint main()\n{\n\tint num1[3000],num2[3000];\n\tint n,m,i,max1 = -1,max2 = -1;\n\t\n\tscanf(\""%d\"",&n);\n\tfor (i = 1;i <= n;i++)\n\t{\n\t\tscanf(\""%d\"",&num1[i]);\n\t\tif (num1[i] > max1) max1 = num1[i];\n\t}\n\t\n\tscanf(\""%d\"",&m);\n\tfor (i = 1;i <= m;i++)\n\t{\n\t\tscanf(\""%d\"",&num2[i]);\n\t\tif (num2[i] > max2) max2 = num2[i];\n\t}\n\tprintf(\""%d %d\"",max1,max2);\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,205,608 1586266340587343872,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-10-29 15:59:01,C,300.0,1585905910751457280,1583746247320023040,1039131349729988608,"#include \n\nint main()\n{\n\tint num1[15000],num2[15000];\n\tint n,m,i,max1 = -1,max2 = -1;\n\t\n\tscanf(\""%d\"",&n);\n\tfor (i = 1;i <= n;i++)\n\t{\n\t\tscanf(\""%d\"",&num1[i]);\n\t\tif (num1[i] > max1) max1 = num1[i];\n\t}\n\t\n\tscanf(\""%d\"",&m);\n\tfor (i = 1;i <= m;i++)\n\t{\n\t\tscanf(\""%d\"",&num2[i]);\n\t\tif (num2[i] > max2) max2 = num2[i];\n\t}\n\tprintf(\""%d %d\"",max1,max2);\n\t\n\treturn 0;\n}",ACCEPTED,205,512 1586266408367292416,9284f371e83346e627f92f90fc079849e36f8c6a282f8fa1e865608956e98196,2022-10-29 15:59:17,C++,0.0,1585905910751457281,1583801490112126976,1039131349729988608,"#include\nusing namespace std;\nint a[14000],b[14000];\nint main()\n{\n\tint n,s,i;\n\tscanf(\""%d\"",&n);\n\twhile(n--)\n\t{\n\t\tint a,b,c,d;\n\t\tscanf(\""%d %d %d %d\"",&a,&b,&c,&d);\n\t\t\tif((abs(a-c)>1||abs(b-d)>1)&&(a==c||b==d))\n\t\t\t{\n\t\t\t\tprintf(\""yes\\n\"");\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if((a==c||b==d)&&(abs(a-c)<=1||abs(b-d)<=1))\n\t\t\t{\n\t\t\t\tprintf(\""no\\n\"");\n\t\t\t\tcontinue;\n\t\t\t}\n\t\ts=(double)(abs(b-d))/(double)(abs(a-c));\n\t\tif(a\nint main()\n{\n int a[100],b[100],n,m,i,j,q,w;\n q=0;w=0;\n scanf(\""%d\"",&n);\n if(n>100) n=100;\n for(i=1;i<=n;i++)\n {\n scanf(\""%d\"",&a[i]);\n if(q100) m=100;\n for(j=1;j<=m;j++)\n {\n scanf(\""%d\"",&b[j]);\n if(w=sqrt(2)){\n \tprintf(\""yes\\n\"");\n\t\t}else{\n\t\t\tprintf(\""no\\n\"");\n\t\t}\n }\n}",WRONG_ANSWER,8,384 1558446207910088704,0f95f53863c5479aef8458dfe6e31498d3aff27bbd8143ded10fa55846493ec6,2022-08-13 21:31:45,C++,4.0,1558440794758361088,1558434369063665664,1039132542241918976,"#include \n\nusing namespace std;\n\n#define LL long long\n#define endl '\\n'\n\nvoid solve()\n{\n int n, m;\n cin >> n >> m;\n string s;\n cin >> s;\n vector st;\n for (int i = 0; i < s.size(); ++i)\n {\n while (st.size() && st.back() > s[i] && m)\n {\n st.pop_back();\n m--;\n }\n st.push_back(s[i]);\n }\n // reverse(st.begin(), st.end());\n while (m--)\n {\n st.pop_back();\n }\n // reverse(st.begin(), st.end());\n for (auto x : st)\n cout << x;\n cout << endl;\n}\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n int T;\n cin >> T;\n while (T--)\n solve();\n return 0;\n}",PARTIAL_ACCEPTED,54,836 1558795077601005568,703837df59e85f82787843c231b7724f3807a747b1531d6538e1d4c38be53871,2022-08-14 20:38:02,C++,0.0,1558440794758361088,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nconst int N=2e5+5;\n\nint a[N];\nint stk[N];\n\nvoid solve(){\n int n,m;cin>>n>>m;\n for(int i=1;i<=n;i++){\n char c;cin>>c;\n a[i]=c-'0';\n }\n sort(a+1,a+1+n);\n for(int i=1;i<=n-m;i++) cout<>_;\n while(_--){\n solve();\n }\n \n return 0;\n}\n",WRONG_ANSWER,365,1720 1558795180248293376,703837df59e85f82787843c231b7724f3807a747b1531d6538e1d4c38be53871,2022-08-14 20:38:26,C++,20.0,1558440794758361088,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nconst int N=2e5+5;\n\nint a[N];\nint stk[N];\n\nvoid solve(){\n int n,m;cin>>n>>m;\n for(int i=1;i<=n;i++){\n char c;cin>>c;\n a[i]=c-'0';\n }\n int tot=0;\n for(int i=1;i<=n;i++){\n if(tot==0) stk[++tot]=a[i];\n else{\n // if(stk[tot]a[i] && m){\n tot--;\n i--;\n m--;\n }\n else{\n stk[++tot]=a[i];\n }\n }\n }\n while(m){\n tot--;\n m--;\n }\n for(int i=1;i<=tot;i++) cout<>_;\n while(_--){\n solve();\n }\n \n return 0;\n}\n",ACCEPTED,304,2108 1558796502284513280,703837df59e85f82787843c231b7724f3807a747b1531d6538e1d4c38be53871,2022-08-14 20:43:41,C++,0.0,1558440794758361088,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\ntypedef pair PII;\nconst int N=2e5+5;\n\nPII a[N];\n// int stk[N];\nbool vis[N];\n\nbool cmp(PII a,PII b){\n if(a.first==b.first) return a.second>n>>m;\n memset(vis, 0, sizeof vis);\n for(int i=1;i<=n;i++){\n char c;cin>>c;\n a[i].first=c-'0';\n a[i].second=i;\n }\n sort(a+1,a+1+n,cmp);\n for(int i=1;i<=n-m;i++) cout<>_;\n while(_--){\n solve();\n }\n \n return 0;\n}\n",WRONG_ANSWER,735,2600 1558796570962046976,703837df59e85f82787843c231b7724f3807a747b1531d6538e1d4c38be53871,2022-08-14 20:43:58,C++,0.0,1558440794758361088,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\ntypedef pair PII;\nconst int N=2e5+5;\n\nPII a[N];\n// int stk[N];\nbool vis[N];\n\nbool cmp(PII a,PII b){\n if(a.first==b.first) return a.second>n>>m;\n memset(vis, 0, sizeof vis);\n for(int i=1;i<=n;i++){\n char c;cin>>c;\n a[i].first=c-'0';\n a[i].second=i;\n }\n sort(a+1,a+1+n,cmp);\n for(int i=1;i<=n-m;i++) cout<>_;\n while(_--){\n solve();\n }\n \n return 0;\n}\n",WRONG_ANSWER,738,2616 1574366295099531264,703837df59e85f82787843c231b7724f3807a747b1531d6538e1d4c38be53871,2022-09-26 19:52:29,C++,20.0,1558440794758361088,1558434369063665664,1039132542241918976,"// #include\n// using namespace std;\n// const int N=2e5+5;\n\n// int a[N];\n// int stk[N];\n\n// void solve(){\n// int n,m;cin>>n>>m;\n// for(int i=1;i<=n;i++){\n// char c;cin>>c;\n// a[i]=c-'0';\n// }\n// int tot=0;\n// for(int i=1;i<=n;i++){\n// if(tot==0) stk[++tot]=a[i];\n// else{\n// // if(stk[tot]a[i] && m){\n// tot--;\n// i--;\n// m--;\n// }\n// else{\n// stk[++tot]=a[i];\n// }\n// }\n// }\n// while(m){\n// tot--;\n// m--;\n// }\n// for(int i=1;i<=tot;i++) cout<>_;\n// while(_--){\n// solve();\n// }\n \n// return 0;\n// }\n#include\nusing namespace std;\nconst int N=2e5+5;\n\nint a[N];\nint stk[N];\n\nvoid solve(){\n int n,m;cin>>n>>m;\n for(int i=1;i<=n;i++){\n char c;cin>>c;\n a[i]=c-'0';\n }\n int top=0;\n for(int i=1;i<=n;i++){\n if(top==0) stk[++top]=a[i];\n else{\n while(stk[top]>a[i] && m){\n top--;\n m--;\n }\n stk[++top]=a[i];\n }\n }\n while(m--){\n top--;\n }\n for(int i=1;i<=top;i++) cout<>_;\n while(_--) solve();\n \n return 0;\n}\n",ACCEPTED,225,2348 1574367527092445184,703837df59e85f82787843c231b7724f3807a747b1531d6538e1d4c38be53871,2022-09-26 19:57:23,C++,0.0,1558440794758361088,1558434369063665664,1039132542241918976,"// #include\n// using namespace std;\n// const int N=2e5+5;\n\n// int a[N];\n// int stk[N];\n\n// void solve(){\n// int n,m;cin>>n>>m;\n// for(int i=1;i<=n;i++){\n// char c;cin>>c;\n// a[i]=c-'0';\n// }\n// int tot=0;\n// for(int i=1;i<=n;i++){\n// if(tot==0) stk[++tot]=a[i];\n// else{\n// // if(stk[tot]a[i] && m){\n// tot--;\n// i--;\n// m--;\n// }\n// else{\n// stk[++tot]=a[i];\n// }\n// }\n// }\n// while(m){\n// tot--;\n// m--;\n// }\n// for(int i=1;i<=tot;i++) cout<>_;\n// while(_--){\n// solve();\n// }\n \n// return 0;\n// }\n#include\nusing namespace std;\nconst int N=2e5+5;\n\nint a[N];\n// int stk[N];\nstack stk;\n\nvoid solve(){\n int n,m;cin>>n>>m;\n for(int i=1;i<=n;i++){\n char c;cin>>c;\n a[i]=c-'0';\n }\n // int top=0;\n for(int i=1;i<=n;i++){\n if(stk.size()==0){\n // stk[++top]=a[i];\n stk.push(a[i]);\n }\n else{\n // while(stk[top]>a[i] && m){\n while(stk.top()>a[i] && m){\n // top--;\n stk.pop();\n m--;\n }\n // stk[++top]=a[i];\n stk.push(a[i]);\n }\n }\n while(m--){\n // top--;\n stk.pop();\n }\n // for(int i=1;i<=top;i++) cout< vec;\n while(stk.size()){\n vec.push_back(stk.top());\n stk.pop();\n }\n reverse(vec.begin(),vec.end());\n for(auto& x:vec) cout<>_;\n while(_--) solve();\n \n return 0;\n}\n",SEGMENTATION_FAULT,49,1216 1574367675910545408,703837df59e85f82787843c231b7724f3807a747b1531d6538e1d4c38be53871,2022-09-26 19:57:58,C++,20.0,1558440794758361088,1558434369063665664,1039132542241918976,"// #include\n// using namespace std;\n// const int N=2e5+5;\n\n// int a[N];\n// int stk[N];\n\n// void solve(){\n// int n,m;cin>>n>>m;\n// for(int i=1;i<=n;i++){\n// char c;cin>>c;\n// a[i]=c-'0';\n// }\n// int tot=0;\n// for(int i=1;i<=n;i++){\n// if(tot==0) stk[++tot]=a[i];\n// else{\n// // if(stk[tot]a[i] && m){\n// tot--;\n// i--;\n// m--;\n// }\n// else{\n// stk[++tot]=a[i];\n// }\n// }\n// }\n// while(m){\n// tot--;\n// m--;\n// }\n// for(int i=1;i<=tot;i++) cout<>_;\n// while(_--){\n// solve();\n// }\n \n// return 0;\n// }\n#include\nusing namespace std;\nconst int N=2e5+5;\n\nint a[N];\n// int stk[N];\nstack stk;\n\nvoid solve(){\n int n,m;cin>>n>>m;\n for(int i=1;i<=n;i++){\n char c;cin>>c;\n a[i]=c-'0';\n }\n // int top=0;\n for(int i=1;i<=n;i++){\n if(stk.size()==0){\n // stk[++top]=a[i];\n stk.push(a[i]);\n }\n else{\n // while(stk[top]>a[i] && m){\n while(stk.size() && stk.top()>a[i] && m){\n // top--;\n stk.pop();\n m--;\n }\n // stk[++top]=a[i];\n stk.push(a[i]);\n }\n }\n while(m--){\n // top--;\n stk.pop();\n }\n // for(int i=1;i<=top;i++) cout< vec;\n while(stk.size()){\n vec.push_back(stk.top());\n stk.pop();\n }\n reverse(vec.begin(),vec.end());\n for(auto& x:vec) cout<>_;\n while(_--) solve();\n \n return 0;\n}\n",ACCEPTED,316,4100 1574368196926984192,0f95f53863c5479aef8458dfe6e31498d3aff27bbd8143ded10fa55846493ec6,2022-09-26 20:00:03,C++,20.0,1558440794758361088,1558434369063665664,1039132542241918976,"#include \n\nusing namespace std;\n\n#define LL long long\n#define endl '\\n'\n\nvoid solve()\n{\n int n, m;\n cin >> n >> m;\n string s;\n cin >> s;\n vector st;\n for (int i = 0; i < s.size(); ++i)\n {\n while (st.size() && st.back() > s[i] && m)\n {\n st.pop_back();\n m--;\n }\n st.push_back(s[i]);\n }\n // reverse(st.begin(), st.end());\n while (m--)\n {\n st.pop_back();\n }\n // reverse(st.begin(), st.end());\n for (auto x : st)\n cout << x;\n cout << endl;\n}\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n int T;\n cin >> T;\n while (T--)\n solve();\n return 0;\n}",ACCEPTED,162,1524 1574368739443433472,703837df59e85f82787843c231b7724f3807a747b1531d6538e1d4c38be53871,2022-09-26 20:02:12,C++,20.0,1558440794758361088,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nconst int N=2e5+5;\n\nchar s[N];\nchar stk[N];\n\nvoid solve(){\n int n,m;cin>>n>>m;\n for(int i=1;i<=n;i++) cin>>s[i];\n\n int top=0;\n for(int i=1;i<=n;i++){\n if(top==0) stk[++top]=s[i];\n else{\n while(top && stk[top]>s[i] && m){\n top--;\n m--;\n }\n stk[++top]=s[i];\n }\n }\n while(m--){\n top--;\n }\n for(int i=1;i<=top;i++) cout<>_;\n while(_--) solve();\n \n return 0;\n}",ACCEPTED,179,1324 1575001306450452480,0870b9957c44e698b6c76945073583e7f26c2d9239d4052805dc98ff59192b2b,2022-09-28 13:55:48,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \ntypedef long long ll;\nusing namespace std;\n\nint main()\n{\n ll t;\n cin >> t;\n while (t--)\n {\n int n, m;\n cin >> n >> m;\n string str;\n cin >> str;\n char now = '9';\n while (m)\n {\n while (str.find(now) != str.npos)\n {\n str.erase(str.find(now), 1);\n m--;\n if (m == 0)\n break;\n }\n now--;\n }\n cout << str << '\\n';\n }\n return 0;\n}",MULTIPLE_ERROR,2023,1200 1575002835278872576,0e58fb7206a30fe8338896de0f4234d303419c4b3aeb2ae1edddfbda4f71c36f,2022-09-28 14:01:52,C++,20.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\n\n\nint q[1000010],head,rear;\nint main(){\n int T;\n cin>>T;\n while(T--){\n string s;\n int n,m;\n cin>>n>>m>>s;\n\n if(m>=n){\n cout<<0<<'\\n';\n continue;\n }\n head=0,rear=0;\n for(int i=0;is[i]-'0')rear--;\n q[rear++]=s[i]-'0';\n // cout<s[i]-'0')rear--;\n q[rear++]=s[i]-'0';\n cout< ord(s[r]): # shan l\n flag[l] = 0\n l = pre(l)\n k -= 1\n if l == -1:\n l, r = r, next(r)\n else:\n l, r = r, next(r)\n #print([l,r,flag])\n i = pre(n )\n while k != 0:\n k -= 1\n flag[i] = 0\n i = pre(i)\n ans = \""\""\n for i in range(n):\n if flag[i]:\n ans += s[i]\n print(ans)\n",PARTIAL_ACCEPTED,5511,8640 1575003146819190784,ff1e863afd74be6c4dcb19aa00e3a5093a666e0568745a4e6cdb63c805f63c86,2022-09-28 14:03:07,Python,20.0,1574986221175025670,1558434369063665664,1039132542241918976,"from functools import reduce\nfrom operator import mul\n\n\ndef next(index):\n for i in range(index + 1, n):\n if flag[i] == 1:\n return i\n return n\n\n\ndef pre(index):\n for i in range(index - 1, -1, -1):\n\n if flag[i] == 1:\n return i\n return -1\n\n\nfor tt in range(int(input())):\n n, k = map(int, input().split())\n s = input()\n flag = [1] * n\n l, r = 0, 1\n\n while r < n and k != 0:\n if ord(s[l]) > ord(s[r]): # shan l\n flag[l] = 0\n l = pre(l)\n k -= 1\n if l == -1:\n l, r = r, next(r)\n else:\n l, r = r, next(r)\n #print([l,r,flag])\n i = pre(n )\n while k != 0:\n k -= 1\n flag[i] = 0\n i = pre(i)\n ans = \""\""\n for i in range(n):\n if flag[i]:\n ans += s[i]\n print(ans)\n",ACCEPTED,5185,8520 1575003151914848256,ff1e863afd74be6c4dcb19aa00e3a5093a666e0568745a4e6cdb63c805f63c86,2022-09-28 14:03:08,Python,18.0,1574986221175025670,1558434369063665664,1039132542241918976,"from functools import reduce\nfrom operator import mul\n\n\ndef next(index):\n for i in range(index + 1, n):\n if flag[i] == 1:\n return i\n return n\n\n\ndef pre(index):\n for i in range(index - 1, -1, -1):\n\n if flag[i] == 1:\n return i\n return -1\n\n\nfor tt in range(int(input())):\n n, k = map(int, input().split())\n s = input()\n flag = [1] * n\n l, r = 0, 1\n\n while r < n and k != 0:\n if ord(s[l]) > ord(s[r]): # shan l\n flag[l] = 0\n l = pre(l)\n k -= 1\n if l == -1:\n l, r = r, next(r)\n else:\n l, r = r, next(r)\n #print([l,r,flag])\n i = pre(n )\n while k != 0:\n k -= 1\n flag[i] = 0\n i = pre(i)\n ans = \""\""\n for i in range(n):\n if flag[i]:\n ans += s[i]\n print(ans)\n",PARTIAL_ACCEPTED,5519,8720 1575003155606257664,ff1e863afd74be6c4dcb19aa00e3a5093a666e0568745a4e6cdb63c805f63c86,2022-09-28 14:03:09,Python,18.0,1574986221175025670,1558434369063665664,1039132542241918976,"from functools import reduce\nfrom operator import mul\n\n\ndef next(index):\n for i in range(index + 1, n):\n if flag[i] == 1:\n return i\n return n\n\n\ndef pre(index):\n for i in range(index - 1, -1, -1):\n\n if flag[i] == 1:\n return i\n return -1\n\n\nfor tt in range(int(input())):\n n, k = map(int, input().split())\n s = input()\n flag = [1] * n\n l, r = 0, 1\n\n while r < n and k != 0:\n if ord(s[l]) > ord(s[r]): # shan l\n flag[l] = 0\n l = pre(l)\n k -= 1\n if l == -1:\n l, r = r, next(r)\n else:\n l, r = r, next(r)\n #print([l,r,flag])\n i = pre(n )\n while k != 0:\n k -= 1\n flag[i] = 0\n i = pre(i)\n ans = \""\""\n for i in range(n):\n if flag[i]:\n ans += s[i]\n print(ans)\n",PARTIAL_ACCEPTED,5447,8628 1575003156344037376,ff1e863afd74be6c4dcb19aa00e3a5093a666e0568745a4e6cdb63c805f63c86,2022-09-28 14:03:09,Python,18.0,1574986221175025670,1558434369063665664,1039132542241918976,"from functools import reduce\nfrom operator import mul\n\n\ndef next(index):\n for i in range(index + 1, n):\n if flag[i] == 1:\n return i\n return n\n\n\ndef pre(index):\n for i in range(index - 1, -1, -1):\n\n if flag[i] == 1:\n return i\n return -1\n\n\nfor tt in range(int(input())):\n n, k = map(int, input().split())\n s = input()\n flag = [1] * n\n l, r = 0, 1\n\n while r < n and k != 0:\n if ord(s[l]) > ord(s[r]): # shan l\n flag[l] = 0\n l = pre(l)\n k -= 1\n if l == -1:\n l, r = r, next(r)\n else:\n l, r = r, next(r)\n #print([l,r,flag])\n i = pre(n )\n while k != 0:\n k -= 1\n flag[i] = 0\n i = pre(i)\n ans = \""\""\n for i in range(n):\n if flag[i]:\n ans += s[i]\n print(ans)\n",PARTIAL_ACCEPTED,5799,8588 1575003157044903936,ff1e863afd74be6c4dcb19aa00e3a5093a666e0568745a4e6cdb63c805f63c86,2022-09-28 14:03:09,Python,20.0,1574986221175025670,1558434369063665664,1039132542241918976,"from functools import reduce\nfrom operator import mul\n\n\ndef next(index):\n for i in range(index + 1, n):\n if flag[i] == 1:\n return i\n return n\n\n\ndef pre(index):\n for i in range(index - 1, -1, -1):\n\n if flag[i] == 1:\n return i\n return -1\n\n\nfor tt in range(int(input())):\n n, k = map(int, input().split())\n s = input()\n flag = [1] * n\n l, r = 0, 1\n\n while r < n and k != 0:\n if ord(s[l]) > ord(s[r]): # shan l\n flag[l] = 0\n l = pre(l)\n k -= 1\n if l == -1:\n l, r = r, next(r)\n else:\n l, r = r, next(r)\n #print([l,r,flag])\n i = pre(n )\n while k != 0:\n k -= 1\n flag[i] = 0\n i = pre(i)\n ans = \""\""\n for i in range(n):\n if flag[i]:\n ans += s[i]\n print(ans)\n",ACCEPTED,5279,8640 1575003174266716160,ff1e863afd74be6c4dcb19aa00e3a5093a666e0568745a4e6cdb63c805f63c86,2022-09-28 14:03:13,Python,18.0,1574986221175025670,1558434369063665664,1039132542241918976,"from functools import reduce\nfrom operator import mul\n\n\ndef next(index):\n for i in range(index + 1, n):\n if flag[i] == 1:\n return i\n return n\n\n\ndef pre(index):\n for i in range(index - 1, -1, -1):\n\n if flag[i] == 1:\n return i\n return -1\n\n\nfor tt in range(int(input())):\n n, k = map(int, input().split())\n s = input()\n flag = [1] * n\n l, r = 0, 1\n\n while r < n and k != 0:\n if ord(s[l]) > ord(s[r]): # shan l\n flag[l] = 0\n l = pre(l)\n k -= 1\n if l == -1:\n l, r = r, next(r)\n else:\n l, r = r, next(r)\n #print([l,r,flag])\n i = pre(n )\n while k != 0:\n k -= 1\n flag[i] = 0\n i = pre(i)\n ans = \""\""\n for i in range(n):\n if flag[i]:\n ans += s[i]\n print(ans)\n",PARTIAL_ACCEPTED,5617,8560 1575005640919699456,0870b9957c44e698b6c76945073583e7f26c2d9239d4052805dc98ff59192b2b,2022-09-28 14:13:01,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \ntypedef long long ll;\nusing namespace std;\n\nint main()\n{\n ll t;\n cin >> t;\n while (t--)\n {\n int n, m;\n cin >> n >> m;\n string str, cpy;\n cin >> str;\n stack ans;\n for (auto ch : str)\n {\n if (ans.size())\n {\n while (ch < ans.top() && m)\n {\n m--;\n ans.pop();\n }\n }\n ans.push(ch);\n }\n string s;\n while (m && ans.size())\n {\n ans.pop();\n m--;\n }\n while (ans.size())\n {\n s = ans.top() + s;\n ans.pop();\n }\n cout << s << '\\n';\n }\n return 0;\n}",SEGMENTATION_FAULT,60,984 1575005750978658304,0870b9957c44e698b6c76945073583e7f26c2d9239d4052805dc98ff59192b2b,2022-09-28 14:13:27,C++,10.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \ntypedef long long ll;\nusing namespace std;\n\nint main()\n{\n ll t;\n cin >> t;\n while (t--)\n {\n int n, m;\n cin >> n >> m;\n string str, cpy;\n cin >> str;\n stack ans;\n for (auto ch : str)\n {\n while (ans.size() && ch < ans.top() && m)\n {\n m--;\n ans.pop();\n }\n ans.push(ch);\n }\n string s;\n while (m && ans.size())\n {\n ans.pop();\n m--;\n }\n while (ans.size())\n {\n s = ans.top() + s;\n ans.pop();\n }\n cout << s << '\\n';\n }\n return 0;\n}",PARTIAL_ACCEPTED,2022,1020 1575005857958158336,0870b9957c44e698b6c76945073583e7f26c2d9239d4052805dc98ff59192b2b,2022-09-28 14:13:53,C++,10.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \ntypedef long long ll;\nusing namespace std;\n\nint main()\n{\n ios::sync_with_stdio(0);\n cin.tie(0), cout.tie(0);\n ll t;\n cin >> t;\n while (t--)\n {\n int n, m;\n cin >> n >> m;\n string str, cpy;\n cin >> str;\n stack ans;\n for (auto ch : str)\n {\n while (ans.size() && ch < ans.top() && m)\n {\n m--;\n ans.pop();\n }\n ans.push(ch);\n }\n string s;\n while (m && ans.size())\n {\n ans.pop();\n m--;\n }\n while (ans.size())\n {\n s = ans.top() + s;\n ans.pop();\n }\n cout << s << '\\n';\n }\n return 0;\n}",PARTIAL_ACCEPTED,2021,1032 1575006241531453440,0870b9957c44e698b6c76945073583e7f26c2d9239d4052805dc98ff59192b2b,2022-09-28 14:15:24,C++,10.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \ntypedef long long ll;\nusing namespace std;\n\nint main()\n{\n ios::sync_with_stdio(0);\n cin.tie(0), cout.tie(0);\n ll t;\n cin >> t;\n while (t--)\n {\n int n, m;\n cin >> n >> m;\n string str, cpy;\n cin >> str;\n deque ans;\n for (auto ch : str)\n {\n while (ans.size() && ch < ans.back() && m)\n {\n m--;\n ans.pop_back();\n }\n ans.push_back(ch);\n }\n string s;\n while (m && ans.size())\n {\n ans.pop_back();\n m--;\n }\n while (ans.size())\n {\n s = s + ans.front();\n ans.pop_front();\n }\n cout << s << '\\n';\n }\n return 0;\n}",PARTIAL_ACCEPTED,2026,1132 1575006429860315136,9d6ea4463d7d8f235cb75bc5cac741b5ff9b608a1e770c8632190b93722b2be1,2022-09-28 14:16:09,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#define ll long long\n#define pb push_back\nusing namespace std;\n\nstruct node{\n\tint index;\n\tint num;\n};\n\nint cmp1(struct node a,struct node b){\n\tif(a.num==b.num)return a.indexb.num;\n}\n\nint cmp2(struct node a,struct node b){\n\treturn a.index>n>>m;\n\tvectorv;\n\tfor(int i=0;i>ch;\n\t\ttemp.num=ch-'0';\n\t\tv.pb(temp);\n\t}\n\tsort(v.begin(),v.end(),cmp1);\n\tsort(v.begin()+m,v.end(),cmp2);\n\tfor(int i=m;i>t;\n\tfor(int i=0;i\ntypedef long long ll;\nusing namespace std;\n\nint main()\n{\n ios::sync_with_stdio(0);\n cin.tie(0), cout.tie(0);\n ll t;\n cin >> t;\n while (t--)\n {\n int n, m;\n cin >> n >> m;\n string str;\n cin >> str;\n string ans;\n for (auto ch : str)\n {\n while (ans.size() && ch < ans.back() && m)\n {\n m--;\n ans.pop_back();\n }\n ans.push_back(ch);\n }\n while (m && ans.size())\n {\n ans.pop_back();\n m--;\n }\n cout << ans << '\\n';\n }\n return 0;\n}",ACCEPTED,100,1604 1575008641809997824,d422a86eafa7b5906d122605b3127d2191dd6e407fc784bbd577a9cea9dca2d0,2022-09-28 14:24:57,C++,20.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint t,n,m;\nstacks;\nint main(){\n cin>>t;\n while(t--){\n cin>>n>>m;\n while(n--){\n char num1;\n cin>>num1;\n while(!s.empty()&&num10){\n s.pop();\n m--;\n }\n s.push(num1);\n }\n while(m>0&&!s.empty()){\n s.pop();\n m--;\n }\n stackt;\n while(!s.empty()){\n t.push(s.top());\n// cout<\nusing namespace std;\nint main()\n{\n \n int n;\n cin>>n;\n for(int i=0;i>a>>b;\n string str;\n stacks;\n cin>>str;\n for(int j=0;j0){\n s.pop();\n b--;\n }\n }\n //cout<0)\n {\n s.pop();\n b--;\n }\n string ans;\n while(!s.empty())\n {\n ans+=s.top();\n s.pop();\n }\n reverse(ans.begin(),ans.end());\n cout<\nusing namespace std;\nint main()\n{\n int n;\n cin>>n;\n for(int i=0;i>a>>b;\n string str;\n stacks;\n cin>>str;\n for(int j=0;j0){\n s.pop();\n b--;\n }\n }\n while(!s.empty()&&b>0)\n {\n s.pop();\n b--;\n }\n string ans;\n while(!s.empty())\n {\n ans+=s.top();\n s.pop();\n }\n reverse(ans.begin(),ans.end());\n cout<\n\n\n\nint main()\n{\n\tint n,i,x,s=1;\n\tscanf(\""%d%d\"",&n,&x);\n\tint number[n],b[n];\n\tfor(i=0;i\n#include \n#include \n#include \nusing namespace std;\nbool cmp(const char& a,const char& b);\nint main(){\n int T;\n cin >> T;\n for(int i=0;i v;\n cin >> n >> m;\n for(int j=0;j> ch;\n v.push_back(ch);\n }\n sort(v.begin(),v.end(),cmp);\n vector::iterator it = v.begin();\n for(int i=0;i\n#include \n#include \n#include \nusing namespace std;\nbool cmp(const char& a,const char& b);\nint main(){\n int T;\n cin >> T;\n for(int i=0;i v;\n cin >> n >> m;\n for(int j=0;j> ch;\n v.push_back(ch);\n }\n sort(v.begin(),v.end(),cmp);\n vector::iterator it = v.begin();\n for(int i=0;i\n#include \n#include \n#include \nusing namespace std;\nbool cmp(const char& a,const char& b);\nint main(){\n int T;\n cin >> T;\n for(int i=0;i v;\n cin >> n >> m;\n for(int j=0;j> ch;\n v.push_back(ch);\n }\n sort(v.begin(),v.end(),cmp);\n vector::iterator it = v.begin();\n for(int i=0;i\nusing namespace std;\nint main()\n{\n int n;\n cin>>n;\n for(int i=0;i>a>>b;\n string str;\n string s;\n cin>>str;\n for(int j=0;j0){\n s.pop_back();\n b--;\n }\n }\n //cout<0)\n {\n s.pop_back();\n b--;\n }\n cout<\nusing namespace std;\nchar a[200005];\nint T,n,m;\nint fget(){\n\tint v=0;char ch;bool f=false;\n\twhile(!isdigit(ch=getchar()))if(ch=='-')break;\n\tif(ch=='-')f=true;else v=ch-'0';\n\twhile(isdigit(ch=getchar()))v=v*10+ch-'0';\n\treturn f?-v:v;\n}\nchar findMAX(){\n\tchar MAX='0';\n\tfor(int i=0;ia[i+1]){\n\t\t\ta[i]=0;\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\n} \nint main(){\n\tcin>>T;\n\twhile(T--){\n\t\tcin>>n>>m;\n\t\tcin>>a;\n//\t\tfor(;m>=0;m--)if(findNX())break;\n\t\tif(m>0){\n\t\t\twhile(m--){\n\t\t\t\tchar t=findMAX();\n\t\t\t\tfor(int i=0;i\n#include\nusing namespace std;\n\nint main()\n{\n int t;\n cin>>t;\n for(int i=0;i>n>>m;\n char ch=getchar();\n char str[n],s1[n];\n cin>>str;\n for(int j=0;j=n-m;q--){\n if(str[a]==s1[q]){\n cnt++;\n break;\n }\n if(cnt<=m)\n cout<\n#include \n#include \n#include \nusing namespace std;\nbool cmp(const char& a,const char& b);\nint main(){\n int T;\n cin >> T;\n for(int i=0;i v;\n cin >> n >> m;\n for(int j=0;j> ch;\n v.push_back(ch);\n }\n sort(v.begin(),v.end(),cmp);\n vector::iterator it = v.begin();\n for(int i=0;i\n#include\n#include\n#include\n#define MAX 10001\nusing namespace std;\nint main()\n{\n\tstring s;\n\tint n, m, t;\n\tcin >> t;\n\tfor (int i = 0; i < t; i++)\n\t{\n\t\tint b, red;\n\t\tcin >> b >> red;\n\t\tcin >> s;\n\t\t\n\t\tfor (int k = 0; k < red; k++)\n\t\t{\n\t\t\tint max = -1, index;\n\t\t\tfor (int j = 0; j < s.length(); j++)\n\t\t\t{\n\t\t\t\tif (s[j] > max)\n\t\t\t\t{\n\t\t\t\t\tmax = s[j];\n\t\t\t\t\tindex = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts[index] = -1;\n\t\t}\n\t\tfor (int i = 0; i < s.length(); i++)\n\t\t{\n\t\t\tif (s[i] != -1)\n\t\t\t\tcout << s[i];\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,2029,820 1575010247339655168,95c79ad43eb647e358640bf25a0b5c9f947e02cd0bb619646427440fc53f737f,2022-09-28 14:31:19,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nchar a[200005];\nint T,n,m;\nint fget(){\n\tint v=0;char ch;bool f=false;\n\twhile(!isdigit(ch=getchar()))if(ch=='-')break;\n\tif(ch=='-')f=true;else v=ch-'0';\n\twhile(isdigit(ch=getchar()))v=v*10+ch-'0';\n\treturn f?-v:v;\n}\nchar findMAX(){\n\tchar MAX='0';\n\tfor(int i=0;ia[i+1]){\n\t\t\ta[i]=0;\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\n} \nint main(){\n\tcin>>T;\n\twhile(T--){\n\t\tcin>>n>>m;\n\t\tcin>>a;\n\t\tfor(;m>=0;m--)if(findNX())break;\n\t\tif(m>0){\n\t\t\twhile(m--){\n\t\t\t\tchar t=findMAX();\n\t\t\t\tfor(int i=0;i\nusing namespace std;\ntypedef long long ll;\nconst int maxn=5e5+10; \n#define rep(i,a,b) for(int i=a;i<=b;i++)\n#define repd(i,a,b) for(int i=a;i>=b;i--)\n#define pb push_back\n\nint main(){\n\tint T;\n\tcin>>T;\n\twhile(T--){\n\t\tstring s;\n\t\tint n,m;\n\t\tcin>>n>>m>>s;\n\t\twhile(m--){\n\t\t\tint x=s[0]-'0',y=s[1]-'0';\n\t\t\tstring t=\""\"";\n\t\t\tif(x>y){\n\t\t\t\trep(i,1,s.size()-1) t+=s[i];\n\t\t\t\ts=t;\n\t\t\t} \n\t\t\telse{\n\t\t\t\tint idx=0,mx=0;\n\t\t\t\trep(i,1,s.size()-1){\n\t\t\t\t\tint temp=s[i]-'0';\n\t\t\t\t\tmx=max(mx,temp);\n\t\t\t\t}\n\t\t\t\tt+=s[0];\n\t\t\t\tbool flag=false;\n\t\t\t\trep(i,1,s.size()-1){\n\t\t\t\t\tint temp=s[i]-'0';\n\t\t\t\t\tif(temp==mx&&!flag){\n\t\t\t\t\t\tflag=true;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t} \n\t\t\t\t\tt+=s[i];\n\t\t\t\t}\n\t\t\t\ts=t;\n\t\t\t}\n\t\t}\n\t\tcout<\nusing namespace std;\nchar a[200005];\nint T,n,m;\nint fget(){\n\tint v=0;char ch;bool f=false;\n\twhile(!isdigit(ch=getchar()))if(ch=='-')break;\n\tif(ch=='-')f=true;else v=ch-'0';\n\twhile(isdigit(ch=getchar()))v=v*10+ch-'0';\n\treturn f?-v:v;\n}\nchar findMAX(){\n\tchar MAX='0';\n\tfor(int i=0;ia[i+1]){\n\t\t\ta[i]=0;\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\n} \nint main(){\n\tcin>>T;\n\twhile(T--){\n\t\tcin>>n>>m;\n\t\tcin>>a;\n\t\tfor(;m>=0;m--)if(findNX())break;\n\t\tif(m>0){\n\t\t\twhile(m--){\n\t\t\t\tchar t=findMAX();\n\t\t\t\tfor(int i=0;i\nusing namespace std;\nchar a[200005];\nint T,n,m;\nint fget(){\n\tint v=0;char ch;bool f=false;\n\twhile(!isdigit(ch=getchar()))if(ch=='-')break;\n\tif(ch=='-')f=true;else v=ch-'0';\n\twhile(isdigit(ch=getchar()))v=v*10+ch-'0';\n\treturn f?-v:v;\n}\nchar findMAX(){\n\tchar MAX='0';\n\tfor(int i=0;ia[i+1]){\n\t\t\ta[i]=0;\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\n} \nint main(){\n\tcin>>T;\n\twhile(T--){\n\t\tcin>>n>>m;\n\t\tcin>>a;\n\t\tfor(;m>=0;m--)if(findNX())break;\n\t\tif(m>0){\n\t\t\twhile(m--){\n\t\t\t\tchar t=findMAX();\n\t\t\t\tfor(int i=0;i1)printf(\""\\n\"");\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,2029,588 1575010491519033344,ba8e35f3b23dfa9787b88722bf9b263d9e21fff543ab1b7928bb7240681e23bf,2022-09-28 14:32:18,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n#include \n#include \nusing namespace std;\nbool cmp(const char& a,const char& b);\nint main(){\n int T;\n cin >> T;\n for(int i=0;i v;\n cin >> n >> m;\n for(int j=0;j> ch;\n v.push_back(ch);\n }\n sort(v.begin(),v.end(),cmp);\n vector::iterator it = v.begin();\n for(int i=0;i\n#include\n#include\n#include\n#define MAX 10001\nusing namespace std;\nint main()\n{\n\tstring s;\n\tint n, m, t;\n\tcin >> t;\n\tfor (int i = 0; i < t; i++)\n\t{\n\t\tint b, red;\n\t\tcin >> b >> red;\n\t\tcin >> s;\n\t\t\n\t\tfor (int k = 0; k < red; k++)\n\t\t{\n\t\t\tint max = -1, index;\n\t\t\tfor (int j = 0; j < b; j++)\n\t\t\t{\n\t\t\t\tif (s[j] > max)\n\t\t\t\t{\n\t\t\t\t\tmax = s[j];\n\t\t\t\t\tindex = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts[index] = -1;\n\t\t}\n\t\tfor (int m = 0; m < b; m++)\n\t\t{\n\t\t\tif (s[m] != -1)\n\t\t\t\tcout << s[m];\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,2025,880 1575010839067447296,147710752d8e8081300c289a748f858e03386bd89e19cc4b252f6fc5b9bd7b4f,2022-09-28 14:33:40,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main()\n{\n\tint t;\n\tlong long m,n;\n\tint a[200000];\n\tcin>>t;\n\tfor(int i = 0; i < t;i++)\n\t{\n\t\tcin>>n>>m;\n\t\tmemset(a,0,sizeof(a));\n\t\tint max = 0;\n\t\tlong long count = 0;\n\t\tlong long index = -1;\n\t\tfor(int j = 0; j < n; j++)\n\t\t{\n\t\t\tcin>>a[j];\n\t\t}\n\t\twhile(count max)\n\t\t\t\t{\n\t\t\t\t\tmax = a[k];\n\t\t\t\t\tindex = k;\n\t\t\t\t}\n\t\t\t}\n\t\t\ta[index] = 0;\n\t\t\tcount++;\n\t\t}\n\t}\n\tfor(int s = 0; s < n; s++)\n\t{\n\t\tif(a[s] == 0){\n\t\t\tcontinue;\n\t\t}\n\t\telse{\n\t\t\tcout<\nusing namespace std;\nconst int maxn =1e6+10;\ntypedef pair pii;\ntypedef long long ll ;\ntypedef pair pll;\n#define all(x) (x).begin(),(x).end();\n#define endl '\\n';\n\nvoid solve()\n{\n int n,k;\n cin >> n>>k;\n vector a(n);\n vector vis(n);\n vis.back() = 1;\n int idx = n - 1,sz=0;\n for(auto &x:a)\n cin >> x;\n for (int i = a.size()-2;i>=0;i--)\n {\n \n while(a[i]>a[idx])\n {\n vis[i] = vis[i - 1] + 1;\n i--;\n if(i==0)\n break;\n }\n idx = i;\n }\n\n vector f(n);\n for (int i = 0; i < n;i++)\n if(vis[i]&&k>=vis[i])\n {\n for (int j = 0; j < vis[i];j++)\n f[i+j] = 1;\n k -= vis[i];\n // cout << vis[i] <<\"" \"" << i << \"" \"" << i + vis[i] - 1 << endl;\n i = i + vis[i] - 1;\n }\n\n // for (auto x : vis)\n // cout << x << \"" \"";\n\n for (int i = 0; i < n;i++)\n if(!f[i])\n cout << a[i];\n cout << endl;\n}\n\nint main()\n{\n cin.tie(0);\n int _;\n cin>>_;\n while(_--)\n solve();\n return 0;\n}",WRONG_ANSWER,260,2780 1575011147801776128,43c1996d6543440ca26cbb8948afe5c5dc698016c58f3ebbe738834403f782a9,2022-09-28 14:34:54,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nconst int maxn =1e6+10;\ntypedef pair pii;\ntypedef long long ll ;\ntypedef pair pll;\n#define all(x) (x).begin(),(x).end();\n#define endl '\\n';\n\nvoid solve()\n{\n int n,k;\n cin >> n>>k;\n vector a(n);\n vector vis(n);\n vis.back() = 1;\n int idx = n - 1,sz=0;\n for(auto &x:a)\n cin >> x;\n for (int i = a.size()-2;i>=0;i--)\n {\n \n while(a[i]>a[idx])\n {\n vis[i] = vis[i - 1] + 1;\n i--;\n if(i==0)\n break;\n }\n idx = i;\n }\n\n vector f(n);\n for (int i = 0; i < n;i++)\n if(vis[i]&&k>=vis[i])\n {\n for (int j = 0; j < vis[i];j++)\n f[i+j] = 1;\n k -= vis[i];\n // cout << vis[i] <<\"" \"" << i << \"" \"" << i + vis[i] - 1 << endl;\n i = i + vis[i] - 1;\n }\n\n // for (auto x : vis)\n // cout << x << \"" \"";\n\n for (int i = 0; i < n;i++)\n if(!f[i])\n cout << a[i];\n \n}\n\nint main()\n{\n cin.tie(0);\n int _;\n cin>>_;\n while(_--)\n {\n solve();\n if(_!=0)\n cout << endl;\n }\n return 0;\n}",WRONG_ANSWER,260,2868 1575011344640466944,1e41caa05363208038aad462978acb100e10bc1ea122715bb93ff4915f6370ad,2022-09-28 14:35:41,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main(){\n int T;\n scanf(\""%d\"",&T);\n for(int t=0;t0;i--)\n {\n p[i]=prise/(10^i);\n }\n int min=prise;\n printf(\""%d\\n\"",prise/10);\n }\n}",FLOAT_POINT_EXCEPTION,45,1060 1575011392719773696,1e41caa05363208038aad462978acb100e10bc1ea122715bb93ff4915f6370ad,2022-09-28 14:35:52,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main(){\n int T;\n scanf(\""%d\"",&T);\n for(int t=0;t0;i--)\n {\n p[i]=prise/(10^i);\n }\n int min=prise;\n printf(\""%d\\n\"",prise/10);\n }\n}",FLOAT_POINT_EXCEPTION,48,1088 1575011400080773120,d131eb656cb972fa529cb2cf81eb1fc806d8401b711f0dad36caa579d16c110b,2022-09-28 14:35:54,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\n#include\n#include\n#define MAX 10001\nusing namespace std;\nint main()\n{\n\tstring s;\n\tint n, m, t;\n\tcin >> t;\n\tfor (int i = 0; i < t; i++)\n\t{\n\t\tint b, red;\n\t\tcin >> b >> red;\n\t\tcin >> s;\n\t\t\n\t\tfor (int k = 0; k < red; k++)\n\t\t{\n\t\t\tint max = -1, index;\n\t\t\tfor (int j = 0; j < b; j++)\n\t\t\t{\n\t\t\t\tif (s[j] > max)\n\t\t\t\t{\n\t\t\t\t\tmax = s[j];\n\t\t\t\t\tindex = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts[index] = -1;\n\t\t}\n\t\tfor (int m = 0; m < b; m++)\n\t\t{\n\t\t\tif (s[m] != -1)\n\t\t\t\tcout << s[m];\n\t\t}\n if(i!=t-1)\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,2030,824 1575011443533766656,ba8e35f3b23dfa9787b88722bf9b263d9e21fff543ab1b7928bb7240681e23bf,2022-09-28 14:36:05,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n#include \n#include \nusing namespace std;\nbool cmp(const char& a,const char& b);\nint main(){\n int T;\n cin >> T;\n for(int i=0;i v;\n cin >> n >> m;\n for(int j=0;j> ch;\n v.push_back(ch);\n }\n sort(v.begin(),v.end(),cmp);\n vector::iterator it = v.begin();\n for(int i=0;i\nint main(){\n int T;\n scanf(\""%d\"",&T);\n for(int t=0;t0;i--)\n {\n p[i]=prise/(10^i);\n }\n int min=prise;\n printf(\""%d\\n\"",prise/100);\n }\n}",FLOAT_POINT_EXCEPTION,35,1084 1575011554959642624,1e41caa05363208038aad462978acb100e10bc1ea122715bb93ff4915f6370ad,2022-09-28 14:36:31,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main(){\n int T;\n scanf(\""%d\"",&T);\n for(int t=0;t0;i--)\n {\n p[i]=prise/(10^i);\n }\n int min=prise;\n printf(\""%d\\n\"",prise/hongbao);\n }\n}",FLOAT_POINT_EXCEPTION,42,1228 1575011694009208832,1e41caa05363208038aad462978acb100e10bc1ea122715bb93ff4915f6370ad,2022-09-28 14:37:04,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main(){\n int T;\n scanf(\""%d\"",&T);\n for(int t=0;t0;i--)\n {\n p[i]=prise/(10^i);\n }\n int min=prise;\n printf(\""%d\\n\"",prise);\n }\n}",FLOAT_POINT_EXCEPTION,42,1052 1575011806085206016,1e41caa05363208038aad462978acb100e10bc1ea122715bb93ff4915f6370ad,2022-09-28 14:37:31,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main(){\n int T;\n scanf(\""%d\"",&T);\n for(int t=0;t0;i--)\n {\n p[i]=prise/(10^i);\n }\n int min=prise;\n printf(\""%d\\n\"",prise/(10^hongbao));\n }\n}",FLOAT_POINT_EXCEPTION,37,1084 1575011835701608448,1572914b98b9cabe271b6a776a5f0f5c057da420cfa77c67981eb9d6f95f90c8,2022-09-28 14:37:38,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main()\n{\n int T;\n scanf(\""%d\"",&T);\n int n,m;\n for(int i=0;imax){\n max=a[h];\n j=h;\n }\n }\n a[j]=0;\n max=0;\n }\n for(int j=0;j\n#include \n#include \n#include \nusing namespace std;\nbool cmp(const char& a,const char& b);\nint main(){\n int T;\n cin >> T;\n for(int i=0;i v;\n cin >> n >> m;\n for(int j=0;j> ch;\n v.push_back(ch);\n }\n sort(v.begin(),v.end(),cmp);\n v.erase(v.begin()+n-m,v.end());\n for(char c:v){\n cout<::iterator it = v.begin();\n for(int i=0;i\nusing namespace std;\nconst int N = 2e5 +10;\nint main()\n{\n int t;\n cin>>t;\n int a[N];\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n string s;\n cin>>s;\n for(int i=0;i\n#include\n#include\n#include\n#define MAX 10001\nusing namespace std;\nint main()\n{\n\tstring s;\n\tint n, m, t;\n\tcin >> t;\n\tfor (int i = 0; i < t; i++)\n\t{\n\t\tint b, red;\n\t\tcin >> b >> red;\n\t\tcin >> s;\n\t\t\n\t\tfor (int k = 0; k < red; k++)\n\t\t{\n\t\t\tint max = -1, index;\n\t\t\tfor (int j = 0; j < b; j++)\n\t\t\t{\n\t\t\t\tif (s[j] > max)\n\t\t\t\t{\n\t\t\t\t\tmax = s[j];\n\t\t\t\t\tindex = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts[index] = -1;\n\t\t}\n\t\tfor (int m = 0; m < b; m++)\n\t\t{\n\t\t\tif (s[m] != -1)\n\t\t\t\tcout << s[m]-'0';\n\t\t}\n if(i!=t-1)\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,2025,828 1575012153327443968,b05c819c39b3a8243c4686f2570d731cb50bc9248212f52544ff9acf4aa4d67b,2022-09-28 14:38:54,C++,20.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\n#define ll long long \nll f(ll a,ll b,ll c){\n if(b==0) return 1;\n ll t=1;\n t=f(a,b/2,c);\n if(b%2)\n return (((t*t)%c)*a)%c;\n else return (t*t)%c;\n}\nint main(){\n int T;\n cin>>T;\n while(T--){\n int n,m,g=0,p;\n string s;\n cin>>n>>m;\n cin>>s;\n s+=\""0\"";\n stackv;\n for(int i=0;i\nint main(){\n int n,m,T;\n char c[200000];\n scanf(\""%d\"",&T);\n for(int i=0;i\nusing namespace std;\nconst int N = 2e5 +10;\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int a[N];\n int n,m;\n cin>>n>>m;\n string s;\n cin>>s;\n for(int i=0;i\nusing namespace std;\nchar a[200005];\nint T,n,m;\nint fget(){\n\tint v=0;char ch;bool f=false;\n\twhile(!isdigit(ch=getchar()))if(ch=='-')break;\n\tif(ch=='-')f=true;else v=ch-'0';\n\twhile(isdigit(ch=getchar()))v=v*10+ch-'0';\n\treturn f?-v:v;\n}\nchar findMAX(){\n\tchar MAX='0';\n\tfor(int i=0;ia[i+1]){\n\t\t\tif(a[i]-a[i+1]>maxnow){\n\t\t\t\tmaxnow=a[i]-a[i+1];\n\t\t\t\tmaxpos=i;\n\t\t\t}\n\t\t}\n\t}\n\tif(maxpos!=-1){\n\t\ta[maxpos]=0;\n\t\treturn 0;\n\t}\n\treturn 1;\n} \nint main(){\n\tcin>>T;\n\twhile(T--){\n\t\tcin>>n>>m;\n\t\tcin>>a;\n\t\tfor(;m>=0;m--)if(findNX())break;\n\t\tif(m>0){\n\t\t\twhile(m--){\n\t\t\t\tchar t=findMAX();\n\t\t\t\tfor(int i=0;i=1)printf(\""\\n\"");\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,2029,580 1575012462129299456,0ef18d5eb8dc04fa244d851360ac6778060dfd1c4b0eca5d4436b320153d0780,2022-09-28 14:40:07,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,#include\nint main()\n{\n \n \n return 0;\n},WRONG_ANSWER,24,352 1575012480382492672,0ef18d5eb8dc04fa244d851360ac6778060dfd1c4b0eca5d4436b320153d0780,2022-09-28 14:40:12,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,#include\nint main()\n{\n \n \n return 0;\n},WRONG_ANSWER,39,640 1575012686910017536,1572914b98b9cabe271b6a776a5f0f5c057da420cfa77c67981eb9d6f95f90c8,2022-09-28 14:41:01,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main()\n{\n int T;\n scanf(\""%d\"",&T);\n int n,m;\n for(int i=0;imax){\n max=a[h];\n j=h;\n }\n }\n a[j]=0;\n max=0;\n }\n for(int j=0;j\nint main()\n{\n int T;\n scanf(\""%d\"",&T);\n int n,m;\n for(int i=0;imax){\n max=a[h];\n j=h;\n }\n }\n a[j]=0;\n max=0;\n }\n for(int j=0;j\nint main()\n{\n int T;\n scanf(\""%d\"",&T);\n int n,m;\n for(int i=0;imax){\n max=a[h];\n j=h;\n }\n }\n a[j]=0;\n max=0;\n }\n for(int j=0;j\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n\nusing namespace std;\nvector v[10];\n\n\nint main() {\n\t\n\tint t;\n\tcin >> t;\n\twhile (t--)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tstring s;\n\t\tcin >> s;\n\t\tfor (int i = 0; i < 10; i++)\n\t\t{\n\t\t\tv[i].clear();\n\t\t}\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tv[s[i] - '0'].push_back(i);\n\t\t}\n\t\tstring ans;\n\t\tint ma = -1;\n\t\tfor (int i = 1; i <= 9; i++)\n\t\t{\n\t\t\tif (ans.size() == m)break;\n\t\t\t\n\t\t\tfor (auto& p : v[i])\n\t\t\t{\n\t\t\t\t//cout << i << ' ' << p << endl;\n\t\t\t\tif (p>ma&&p <= n - m + ans.size())\n\t\t\t\t{\n\t\t\t\t\tans += s[p];\n\t\t\t\t\tma = max(ma, p);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,149,2212 1575013158664359936,1572914b98b9cabe271b6a776a5f0f5c057da420cfa77c67981eb9d6f95f90c8,2022-09-28 14:42:54,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main()\n{\n int T;\n scanf(\""%d\"",&T);\n int n,m;\n for(int i=0;imax){\n max=a[h];\n j=h;\n }\n }\n a[j]=0;\n max=0;\n }\n for(int j=0;j\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n\nusing namespace std;\nvector v[10];\n\n\nint main() {\n\t\n\tint t;\n\tcin >> t;\n\twhile (t--)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tstring s;\n\t\tcin >> s;\n\t\tfor (int i = 0; i < 10; i++)\n\t\t{\n\t\t\tv[i].clear();\n\t\t}\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tv[s[i] - '0'].push_back(i);\n\t\t}\n\t\tstring ans=\""\"";\n\t\tint ma = -1;\n\t\tfor (int i = 1; i <= 9; i++)\n\t\t{\n\t\t\tif (ans.size() == m)break;\n\t\t\t\n\t\t\tfor (auto& p : v[i])\n\t\t\t{\n\t\t\t\tif (ans.size() == m)break;\n\t\t\t\t//cout << i << ' ' << p << endl;\n\t\t\t\tif (p>ma&&p <= n - m + ans.size())\n\t\t\t\t{\n\t\t\t\t\tans += s[p];\n\t\t\t\t\tma = max(ma, p);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,138,2220 1575013450202464256,12a0c3e3139864c089fff9ab0441d15e809ae5b694bffa6d90eff6698d364540,2022-09-28 14:44:03,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nusing namespace std;\n#define el '\\n'\n#define ll long long\nint t,n,m,num;\nint main(){\n cin>>t;\n while (t--){\n cin>>n>>m;\n cin>>num;\n int a[n];\n int cnt=n-1;\n while (num){\n a[cnt--]=num%10;\n num/=10;\n }\n int flag=0,ks=0;\n for (int i=9;i>0;i--){\n for (int j=0;j\nint main()\n{\n int T;\n scanf(\""%d\"",&T);\n int n,m;\n for(int i=0;imax){\n max=a[h];\n j=h;\n }\n }\n a[j]=0;\n max=0;\n }\n for(int j=0;j\nint main()\n{\n int t;\n scanf(\""%d\"",&t);\n while(t>0)\n {\n long int n,m,b;\n scanf(\""%ld %ld\"",&n,&m);\n b=m;\n char a[n];\n for(int i=0;i0)\n {\n for(int i=1;i\nusing namespace std;\n#define el '\\n'\n#define ll long long\nint t,n,m,num;\nint main(){\n cin>>t;\n while (t--){\n cin>>n>>m;\n cin>>num;\n int a[n];\n int cnt=n-1;\n while (num){\n a[cnt--]=num%10;\n num/=10;\n }\n int flag=0,ks=0;\n for (int i=9;i>0;i--){\n for (int j=0;j\n#define ll long long\n#define ull signed long long\n#define maxn 200020\nusing namespace std;\n\nll n, m, T;\n\nstruct node{\n int data;\n int pos;\n};\nnode a[maxn];\nint position[maxn];\n\nbool c(node a,node b){\n if(a.data!=b.data){\n return a.data>b.data;\n }\n else{\n return a.pos>T;\n while(T--){\n cin>>n>>m;\n string s;\n cin>>s;\n for(int i=0;i\nusing namespace std;\n#define el '\\n'\n#define ll long long\nint t,n,m,num;\nint main(){\n cin>>t;\n while (t--){\n cin>>n>>m;\n cin>>num;\n int a[n];\n int cnt=n-1;\n while (num){\n a[cnt--]=num%10;\n num/=10;\n }\n int flag=0,ks=0;\n for (int i=9;i>0;i--){\n for (int j=0;j\nusing namespace std;\n\n// int getNext(string &s, int l, int nums[]) {\n// while(nums[l] == 1) l++;\n// }\n\nint main() {\n\tint t;\n cin >> t;\n while (t--) {\n int n, m;\n int nums[200009] = { 0 };\n cin >> n >> m;\n string s;\n cin >> s;\n int l = 0, r = 1, p = m;\n while (m > 0 && r < s.size()) {\n while(nums[l] == 1) l++;\n if (l == r) r++;\n// cout << l << \"" \"" << r << endl;\n if (s[l] > s[r]) {\n nums[l] = 1;\n m--;\n l = max(l - 1, 0);\n }else {\n r++;\n l++;\n }\n }\n int cnt = n - p;\n for (int i = 0; i < s.size(); i++) {\n if (cnt == 0) break;\n if (nums[i] == 0) {\n cout << s[i];\n cnt--;\n }\n }\n cout << endl;\n }\n\treturn 0;\n}",PARTIAL_ACCEPTED,227,2148 1575014540880465920,8de0fd024873b9ef829fc08bca46721f6a925694f0213d6c625a113b272c126d,2022-09-28 14:48:23,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#define ll long long\n#define ull signed long long\n#define maxn 200020\nusing namespace std;\n\nll n, m, T;\n\nstruct node{\n int data;\n int pos;\n};\nnode a[maxn];\nint position[maxn];\n\nbool c(node a,node b){\n if(a.data!=b.data){\n return a.data>b.data;\n }\n else{\n return a.pos>T;\n while(T--){\n cin>>n>>m;\n string s;\n cin>>s;\n for(int i=0;i\nint main(){\n int n,m,T;\n char c[200000];\n scanf(\""%d\"",&T);\n for(int i=0;i\nint main()\n{\n int t;\n scanf(\""%d\"",&t);\n while(t>0)\n {\n long int n,m;\n scanf(\""%ld %ld\"",&n,&m);\n char a[n];\n for(int i=0;i\n#define ll long long\n#define ull signed long long\n#define maxn 200020\nusing namespace std;\n\nll n, m, T;\n\nstruct node{\n int data;\n int pos;\n};\nnode a[maxn];\nint position[maxn];\n\nbool c(node a,node b){\n if(a.data!=b.data){\n return a.data>b.data;\n }\n else{\n return a.pos>T;\n while(T--){\n cin>>n>>m;\n string s;\n cin>>s;\n for(int i=0;i\nint main(){\n int n,m,T;\n char c[200000];\n scanf(\""%d\"",&T);\n for(int i=0;i\n#include\n#include\nusing namespace std;\ntypedef long long ll;\nll a[200010];\nint main()\n{\n int t;\n cin >> t;\n while (t--)\n {\n string x;\n int n,m;\n cin >> n >> m;\n cin >> x;\n memset(a,0,sizeof(a));\n for(int i=0;i=max)\n {\n max=a[j];\n flag=j;\n }\n }\n a[flag]=0;\n }\n for(int i=0;i\n#include \n#include \n#include \nusing namespace std;\nbool cmp(const char& a,const char& b);\nint main(){\n int T;\n cin >> T;\n for(int i=0;i v;\n cin >> n >> m;\n for(int j=0;j> ch;\n v.push_back(ch);\n }\n \n for(int j=0;j::iterator max = v.begin();\n vector::iterator it = v.begin()+1;\n for(int k=0;k*max) max=it;\n it++;\n }\n v.erase(max);\n }\n for(char c:v){\n cout<\n#include\n#include\nusing namespace std;\n\nconst int N = 2e5 + 10;\n\nint t;\nbool st[N];\n\nint findMax(int n, char money[])\n{\n char temp = '0';\n int index = -1;\n \n for(int i=0; i temp)\n {\n temp = money[i];\n index = i;\n }\n\n return index;\n}\n\nint main()\n{\n cin >> t;\n \n while(t --)\n {\n int n, m;\n char money[n+1];\n cin >> n >> m;\n cin >> money;\n \n\n for(int i=0; i\n#include \n#include \n#include \nusing namespace std;\nbool cmp(const char& a,const char& b);\nint main(){\n int T;\n cin >> T;\n for(int i=0;i v;\n cin >> n >> m;\n for(int j=0;j> ch;\n v.push_back(ch);\n }\n \n for(int j=0;j::iterator max = v.begin();\n vector::iterator it = v.begin()+1;\n for(int k=0;k*max) max=it;\n it++;\n }\n v.erase(max);\n }\n for(char c:v){\n cout<\nusing namespace std;\nint main()\n{\n int t,a[200010]={0},n,m;\n cin>>t;\n for(int i=1;i<=t;i++)\n {\n cin>>n>>m;\n for(int k=1;k<=n;k++)\n {\n cin>>a[k];\n }\n while(m)\n {\n for(int j=1;j<=n;j++)\n {\n if(a[j]==9)\n {\n a[j]=0;m--;\n }\n if(m==0) break;\n }\n for(int j=1;j<=n;j++)\n {\n if(a[j]==8)\n {\n a[j]=0;m--;\n }\n if(m==0) break;\n }\n for(int j=1;j<=n;j++)\n {\n if(a[j]==7)\n {\n a[j]=0;m--;\n }\n if(m==0) break;\n }\n for(int j=1;j<=n;j++)\n {\n if(a[j]==6)\n {\n a[j]=0;m--;\n }\n if(m==0) break;\n }\n for(int j=1;j<=n;j++)\n {\n if(a[j]==5)\n {\n a[j]=0;m--;\n }\n if(m==0) break;\n }\n for(int j=1;j<=n;j++)\n {\n if(a[j]==4)\n {\n a[j]=0;m--;\n }\n if(m==0) break;\n }\n for(int j=1;j<=n;j++)\n {\n if(a[j]==3)\n {\n a[j]=0;m--;\n }\n if(m==0) break;\n }\n for(int j=1;j<=n;j++)\n {\n if(a[j]==2)\n {\n a[j]=0;m--;\n }\n if(m==0) break;\n }\n for(int j=1;j<=n;j++)\n {\n if(a[j]==1)\n {\n a[j]=0;m--;\n }\n if(m=0) break;\n }\n }\n for(int j=1;j<=n;j++)\n {\n if(a[j]!=0)\n cout< list=new ArrayList<>();\n for (int i1 = n-1; i1 >=0; i1--) {\n if(m==0)break;\n list.add(a[i1]);\n m--;\n }\n for (int i1 = 0; i1 < n; i1++) {\n if(list.contains(b[i1])){\n continue;\n }else {\n System.out.print(b[i1]);\n }\n }\n System.out.println();\n\n }\n\n }\n},MULTIPLE_ERROR,4810,30272 1575015325211119616,d594b7ccc23cf89932e24a903c87b66d8548b4321184297daf9b5244c133db27,2022-09-28 14:51:30,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\n#include\nusing namespace std;\n\nconst int N = 2e5 + 10;\n\nint t;\nbool st[N];\nchar money[N];\n\nint findMax(int n)\n{\n char temp = '0';\n int index = -1;\n \n for(int i=0; i temp)\n {\n temp = money[i];\n index = i;\n }\n\n return index;\n}\n\nint main()\n{\n cin >> t;\n \n while(t --)\n {\n int n, m;\n cin >> n >> m;\n cin >> money;\n \n\n for(int i=0; i\nusing namespace std;\n\n// int getNext(string &s, int l, int nums[]) {\n// while(nums[l] == 1) l++;\n// }\n\nint main() {\n\tint t;\n cin >> t;\n while (t--) {\n int n, m;\n int nums[200009] = { 0 };\n cin >> n >> m;\n string s;\n cin >> s;\n int l = 0, r = 1, p = m;\n while (m > 0 && r < s.size()) {\n while(nums[l] == 1) l++;\n if (l == r) r++;\n// cout << l << \"" \"" << r << endl;\n if (s[l] > s[r]) {\n nums[l] = 1;\n m--;\n while(nums[l] == 1 && l > 0) l--;\n }else {\n r++;\n l++;\n }\n }\n int cnt = n - p;\n for (int i = 0; i < s.size(); i++) {\n if (cnt == 0) break;\n if (nums[i] == 0) {\n cout << s[i];\n cnt--;\n }\n }\n cout << endl;\n }\n\treturn 0;\n}",ACCEPTED,238,2276 1575015424599347200,4523cc430c4795f808a1cbc9a621be9340e9d1aa07c6b2181b5c0d1a9ab6feb3,2022-09-28 14:51:54,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nmap mp;\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n string s;\n cin>>s;\n for(int i=0;i\nusing namespace std;\nint main()\n{\n int t,a[200010]={0},n,m;\n cin>>t;\n for(int i=1;i<=t;i++)\n {\n cin>>n>>m;\n for(int k=1;k<=n;k++)\n {\n cin>>a[k];\n }\n for(int j=1;j<=n;j++)\n {\n cout<\n#include\n#include\n#include\nusing namespace std;\n#define ll long long\nint arr[200005];\nint vis[200005];\nint tree[1000000];\n#pragma warning(disable:4996)\n#define mid ((l+r)>>1)\n#define ls (node<<1)\n#define rs ((node<<1)|1)\n#define inf 0x7fffffff\nvoid pu(int node)\n{\n\ttree[node] = min(tree[ls], tree[rs]);\n}\nvoid build(int l, int r,int node)\n{\n\tif (l == r)\n\t{\n\t\ttree[node] = arr[l];\n\t\treturn;\n\t}\n\tbuild(l, mid, ls);\n\tbuild(mid + 1, r, rs);\n\tpu(node);\n}\nint ask(int l, int r, int node,int x,int y)\n{\n\tif (x >= l && y <= r)\n\t{\n\t\treturn tree[node];\n\t}\n\tint res = inf;\n\tif (x <= mid)\n\t\tres=ask(x, mid, ls, x, y);\n\tif (y > mid)\n\t\tres = min(res, ask(mid + 1, y, rs, x, y));\n}\nint main()\n{\n\tint t;cin >> t;\n\tint flag = 1;\n\t//printf(\""%02d\"", flag);\n\twhile (t--)\n\t{\n\t\tint n;cin >> n;int m;cin >> m;\n\t\tstring s;\n\t\t//for (int i = 0;i < n;i++)\n\t\t//{\n\t\t//\tarr[i + 1] = s[i] - '0';\n\t\t//}\n\t\tint now = 0;int r = n - m;\n\t\tstring ans = \""\"";int i1=0;\n\t\tcin >> s;\n\t\tfor (int i = 0;i < m;i++)\n\t\t{\n\t\t\tfor ( ;i1 < s.size();i1++)\n\t\t\t{\n\t\t\t\tif (s[i1] > s[i1 + 1])\n\t\t\t\t{\n\t\t\t\t\ts.erase(s.begin()+i1);\n\t\t\t\t\ti1--;\n\t\t\t\t\tif (i1 < 0)\n\t\t\t\t\t\ti1++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << s << endl;\n\t}\n\n\treturn 0;\n}",PARTIAL_ACCEPTED,2022,1212 1575015742540595200,02f8d0fdc995e18e093dffd10d8c3b3b6b0b7ca2e039bb28b1c5795c3f51842a,2022-09-28 14:53:10,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int t=sc.nextInt();\n for (int i = 0; i < t; i++) {\n int n=sc.nextInt();\n int m=sc.nextInt();\n sc.nextLine();\n String s=sc.nextLine();\n char[] chars = s.toCharArray();\n int[] a=new int[n];\n int[] b=new int[n];\n for (int i1 = 0; i1 < n; i1++) {\n a[i1]=chars[i1]-'0';\n b[i1]=a[i1];\n }\n Arrays.sort(a);\n List list=new ArrayList<>();\n for (int i1 = n-1; i1 >=0; i1--) {\n if(m==0)break;\n list.add(a[i1]);\n m--;\n }\n for (int i1 = 0; i1 < n; i1++) {\n if(list.contains(b[i1])){\n list.remove(list.indexOf(b[i1]));\n continue;\n }else {\n System.out.print(b[i1]);\n }\n }\n System.out.println();\n\n }\n\n }\n},MULTIPLE_ERROR,4831,34696 1575015996627337216,4e88d420afbdce2e2bad1d5ff0cb8518e973e74adc4479a7071cb6c098feb897,2022-09-28 14:54:10,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n\nusing namespace std;\nvector v[10];\n\n\nint main() {\n\t\n\tint t;\n\tcin >> t;\n\twhile (t--)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tstring s;\n\t\tcin >> s;\n\t\tfor (int i = 0; i < 10; i++)\n\t\t{\n\t\t\tv[i].clear();\n\t\t}\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tv[s[i] - '0'].push_back(i);\n\t\t}\n\t\tstring ans=\""\"";\n\t\tint ma = -1;\n\t\twhile (ans.size() < n - m)\n\t\t{\n\t\t\tfor (int i = 1; i <= 9; i++)\n\t\t\t{\n\t\t\t\tif (ans.size() == n - m)break;\n\t\t\t\tfor (auto& p : v[i])\n\t\t\t\t{\n\t\t\t\t\tif (ans.size() == n - m)break;\n\t\t\t\t\t//cout << i << ' ' << p << endl;\n\t\t\t\t\tif (p > ma && p <= n - m + ans.size())\n\t\t\t\t\t{\n\t\t\t\t\t\tans += s[p];\n\t\t\t\t\t\tma = max(ma, p);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,4000,1620 1575016014356238336,02f8d0fdc995e18e093dffd10d8c3b3b6b0b7ca2e039bb28b1c5795c3f51842a,2022-09-28 14:54:14,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int t=sc.nextInt();\n for (int i = 0; i < t; i++) {\n int n=sc.nextInt();\n int m=sc.nextInt();\n sc.nextLine();\n String s=sc.nextLine();\n char[] chars = s.toCharArray();\n int[] a=new int[n];\n int[] b=new int[n];\n for (int i1 = 0; i1 < n; i1++) {\n a[i1]=chars[i1]-'0';\n b[i1]=a[i1];\n }\n Arrays.sort(a);\n List list=new ArrayList<>();\n for (int i1 = n-1; i1 >=0; i1--) {\n if(m==0)break;\n list.add(a[i1]);\n m--;\n }\n for (int i1 = 0; i1 < n; i1++) {\n if(list.contains(b[i1])){\n list.remove(list.indexOf(b[i1]));\n continue;\n }else {\n System.out.print(b[i1]);\n }\n }\n if(i==n-1){\n \n }else {\n System.out.println();\n }\n \n\n }\n\n }\n},MULTIPLE_ERROR,4911,27676 1575016171248377856,02f8d0fdc995e18e093dffd10d8c3b3b6b0b7ca2e039bb28b1c5795c3f51842a,2022-09-28 14:54:52,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int t=sc.nextInt();\n for (int i = 0; i < t; i++) {\n int n=sc.nextInt();\n int m=sc.nextInt();\n sc.nextLine();\n String s=sc.nextLine();\n char[] chars = s.toCharArray();\n int[] a=new int[n];\n int[] b=new int[n];\n for (int i1 = 0; i1 < n; i1++) {\n a[i1]=chars[i1]-'0';\n b[i1]=a[i1];\n }\n Arrays.sort(a);\n List list=new ArrayList<>();\n for (int i1 = n-1; i1 >=0; i1--) {\n if(m==0)break;\n list.add(a[i1]);\n m--;\n }\n for (int i1 = 0; i1 < n; i1++) {\n if(list.contains(b[i1])){\n list.remove(list.indexOf(b[i1]));\n continue;\n }else {\n System.out.print(b[i1]);\n }\n }\n if(i==t-1){\n \n }else {\n System.out.println();\n }\n \n\n }\n\n }\n},MULTIPLE_ERROR,4852,28072 1575016208351191040,4905d4c5efe6e16009f93519337d5e0254fc0e5490e8d6e475f970a98bfd5035,2022-09-28 14:55:01,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\n#include\nusing namespace std;\ntypedef long long ll;\nll a[200010];\nint main()\n{\n int t;\n cin >> t;\n while (t--)\n {\n string x;\n int n,m;\n cin >> n >> m;\n cin >> x;\n memset(a,0,sizeof(a));\n for(int i=0;imax)\n {\n max=a[j];\n flag=j;\n }\n }\n a[flag]=0;\n }\n for(int i=0;i\n\nint main(){ \n int t;\n scanf(\""%d\"",&t);\n int n,m;\n int p[n];\n for(int cnt = 0; cnt <= t;cnt++){\n scanf(\""%d %d\"",&n,&m);\n for(int cmt = 0;cmt < n;cmt++){\n scanf(\""%d\"",&p[cmt]);\n }\n int ms = 2;\n for(int count = 0;count < m;count++){\n for(;ms < n;n--){\n p[ms] = p[ms+1];\n ms++;\n }\n }\n }\n\n return 0;\n}",SEGMENTATION_FAULT,57,728 1575016488480362496,ba8e35f3b23dfa9787b88722bf9b263d9e21fff543ab1b7928bb7240681e23bf,2022-09-28 14:56:07,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n#include \n#include \nusing namespace std;\nbool cmp(const char& a,const char& b);\nint main(){\n int T;\n cin >> T;\n for(int i=0;i v;\n cin >> n >> m;\n for(int j=0;j> ch;\n v.push_back(ch);\n }\n \n for(int j=0;j::iterator max = v.begin();\n vector::iterator it = v.begin()+1;\n for(;it!=v.end();it++){\n if(*it>*max) max=it;\n }\n v.erase(max);\n }\n for(vector::iterator ii = v.begin();ii!=v.end();ii++){\n cout<<*ii;\n }\n cout<<'\\n';\n }\n return 0;\n}",MULTIPLE_ERROR,2025,988 1575016675416719360,8ce5505f707bf73fd327548cd953a7a49bf70cd9f5dac40aa342d40aabde19fa,2022-09-28 14:56:52,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n\nint main(){ \n int t;\n scanf(\""%d\"",&t);\n int n,m;\n int p[n];\n for(int cnt = 0; cnt <= t;cnt++){\n scanf(\""%d %d\"",&n,&m);\n for(int cmt = 0;cmt < n;cmt++){\n scanf(\""%d\"",&p[cmt]);\n }\n int ms = 2;\n for(int count = 0;count < m;count++){\n for(;ms + 1 < n;n--){\n p[ms] = p[ms+1];\n ms++;\n }\n }\n }\n\n return 0;\n}",SEGMENTATION_FAULT,50,612 1575016696035500032,d3ed49602ea2a965f8e0528674ac8769ddb4dc7fa3368be5cdcb889717cc390c,2022-09-28 14:56:57,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main()\n{\n\tint T;\n\tint n,m,sum=0,abs;\n\tchar a[200000];\n\tint dig[12]={0};\n\tint k;\n\tcin>>T;\n\tfor(int i=0;i>n>>m;\n\t\tfor(int j=0;j>a[j];\n\t\t\tdig[a[j]-'0']++;\n\t\t}\n\t\tfor(k=9;k>=0;k--)\n\t\t{\n\t\t\t\n\t\t\tif(sum+dig[k]>=m)\n\t\t\t{\n\t\t\t\tabs=m-dig[k];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tsum+=dig[k];\n\t\t} \n\t\tcout<k+'0')\n\t\t\tcontinue;\n\t\t\telse if(a[l]==k+'0'&&abs>=0)\n\t\t\t{\n\t\t\t\tabs--;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse\n\t\t\tcout<\n\nint main(){ \n int t;\n scanf(\""%d\"",&t);\n int n,m;\n int p[n];\n for(int cnt = 0; cnt <= t;cnt++){\n scanf(\""%d %d\"",&n,&m);\n for(int cmt = 0;cmt < n;cmt++){\n scanf(\""%d\"",&p[cmt]);\n }\n int ms = 2;\n for(int count = 0;count < m;count++){\n for(;ms + 1 < n;n--){\n p[ms] = p[ms+1];\n ms++;\n }\n }\n }\n\n return 0;\n}",SEGMENTATION_FAULT,53,564 1575016803393323008,d3ed49602ea2a965f8e0528674ac8769ddb4dc7fa3368be5cdcb889717cc390c,2022-09-28 14:57:22,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main()\n{\n\tint T;\n\tint n,m,sum=0,abs;\n\tchar a[200000];\n\tint dig[12]={0};\n\tint k;\n\tcin>>T;\n\tfor(int i=0;i>n>>m;\n\t\tfor(int j=0;j>a[j];\n\t\t\tdig[a[j]-'0']++;\n\t\t}\n\t\tfor(k=9;k>=0;k--)\n\t\t{\n\t\t\t\n\t\t\tif(sum+dig[k]>=m)\n\t\t\t{\n\t\t\t\tabs=m-dig[k];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tsum+=dig[k];\n\t\t} \n\t\t//cout<k+'0')\n\t\t\tcontinue;\n\t\t\telse if(a[l]==k+'0'&&abs>=0)\n\t\t\t{\n\t\t\t\tabs--;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse\n\t\t\tcout<\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tv.push_back(num%10);\n\t\t\tnum = num/10;\n\t\t}\n\t\tsort(v.begin(),v.end());\n\t\tfor(int j=0;j<(rate-bag);j++){\n\t\t\tcout << v[j];\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,68,740 1575016952437497856,4055a39629f4a54cd1ff8c48f34f76367b1e83c9d467b9f9a5a4b0961dc05f38,2022-09-28 14:57:58,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\n#include\n#include\nusing namespace std;\nint main()\n{\n int T;\n cin>>T;\n while(T--)\n {\n int m,n;\n cin>>m>>n;\n string s;\n cin>>s;\n priority_queue q;\n for(int i=0;i\n\nint main(){ \n int t;\n scanf(\""%d\"",&t);\n int n,m;\n int p[n];\n for(int cnt = 0; cnt <= t;cnt++){\n scanf(\""%d %d\"",&n,&m);\n for(int cmt = 0;cmt < n;cmt++){\n scanf(\""%d\"",&p[cmt]);\n }\n int ms = 2;\n for(int count = 0;count < m;count++){\n for(;ms + 1 < n;n--){\n p[ms] = p[ms+1];\n ms++;\n if( ms + 1 == n - 1){\n ms = 0;\n }\n }\n }\n }\n\n return 0;\n}",SEGMENTATION_FAULT,44,828 1575017215541993472,2dd7bb66c80a138fb2462b44a4d99cbdf9ad0975e33734cf9f0d90e880c85eb8,2022-09-28 14:59:01,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tv.push_back(num%10);\n\t\t\tnum = num/10;\n\t\t}\n\t\tsort(v.begin(),v.end());\n\t\tfor(int j=0;j<(rate-bag);j++){\n\t\t\tcout << v[j];\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,64,612 1575017394928177152,d7fce42f050848869e4e859b7b415731045f22f294129a53dff31c6955576c7c,2022-09-28 14:59:44,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"\nimport java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner in=new Scanner(System.in);\n int n=in.nextInt();\n for(int i=0;i t=new Stack<>();\n t.push(a2.charAt(0));\n for(int j=1;j0){\n t.pop();\n w--;\n }\n else {\n break;\n }\n }\n t.push(a2.charAt(j));\n }\n while(w>0){\n t.pop();\n w--;\n }\n String r=\""\"";\n while (!t.empty()){\n r=String.valueOf(t.pop())+r;\n }\n System.out.println(Integer.valueOf(r));\n }\n }\n}",MULTIPLE_ERROR,3923,131072 1575017565422440448,d594b7ccc23cf89932e24a903c87b66d8548b4321184297daf9b5244c133db27,2022-09-28 15:00:24,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\n#include\nusing namespace std;\n\nconst int N = 2e5 + 10;\n\nint t;\nbool st[N];\nchar money[N];\n\nint findMax(int n)\n{\n char temp = '0';\n int index = -1;\n \n for(int i=0; i temp)\n {\n temp = money[i];\n index = i;\n }\n\n return index;\n}\n\nint main()\n{\n cin >> t;\n \n while(t --)\n {\n int n, m;\n cin >> n >> m;\n getchar();\n cin >> money;\n \n\n for(int i=0; i\nusing namespace std;\nint main()\n{\n\tint T;\n\tint n,m,sum=0,abs;\n\tchar a[200000];\n\tint dig[12]={0};\n\tint k;\n\tcin>>T;\n\tfor(int i=0;i>n>>m;\n\t\tfor(int j=0;j>a[j];\n\t\t\tdig[a[j]-'0']++;\n\t\t}\n\t\tfor(k=9;k>=0;k--)\n\t\t{\n\t\t\t\n\t\t\tif(sum+dig[k]>=m)\n\t\t\t{\n\t\t\t\tabs=m-sum;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tsum+=dig[k];\n\t\t} \n\t\t//cout<k+'0')\n\t\t\tcontinue;\n\t\t\telse if(a[l]==k+'0'&&abs>0)\n\t\t\t{\n\t\t\t\tabs--;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse\n\t\t\tcout<\n#include \nusing namespace std;\nint main(){\n\tint n;\n cin>>n;\n int a,b;\n char c[200000];\n for(int i=0;i>a>>b;\n \n for(int j=0;j>c[j];\n }\n for(int j=0;jc[k+1]){\n c[k]='0'-1; //去掉\n k++;\n break;\n }\n \n }\n }\n for(int j=0;j='0')\n cout<\nusing namespace std;\n#define LL long long\n#define maxn 1e5+7\n#define fori(i,n) for(int i=0;i>t;\n while(t--)\n {\n int n, m;\n cin>>n>>m;\n string s;\n cin>>s;\n deque ans;\n fori(i, n)\n {\n while(m > 0 && !ans.empty() && s[i] < ans.back())\n {\n m--;\n ans.pop_back();\n }\n ans.push_back(s[i]);\n }\n while(m--)\n {\n ans.pop_back();\n }\n for(char i : ans)\n cout<\n#include\n#include\nusing namespace std;\n\nconst int N = 2e5 + 10;\n\nint t;\nbool st[N];\nchar money[N];\n\nvoid findMax(int n)\n{\n char temp = '0';\n int index = -1;\n \n for(int i=0; i temp)\n {\n temp = money[i];\n index = i;\n }\n \n st[index] = true;\n}\n\nint main()\n{\n cin >> t;\n \n while(t --)\n {\n int n, m;\n cin >> n >> m;\n cin >> money;\n \n for(int i=0; i\nusing namespace std;\nint main()\n{\n\tint T;\n\tint n,m,sum=0,abs;\n\tchar a[200000];\n\tint dig[12]={0};\n\tint k;\n\tcin>>T;\n\tfor(int i=0;i>n>>m;\n\t\tfor(int j=0;j>a[j];\n\t\t\tdig[a[j]-'0']++;\n\t\t}\n\t\tfor(k=9;k>=0;k--)\n\t\t{\n\t\t\t\n\t\t\tif(sum+dig[k]>=m)\n\t\t\t{\n\t\t\t\tabs=m-sum;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tsum+=dig[k];\n\t\t} \n\t\t//cout<k+'0')\n\t\t\tcontinue;\n\t\t\telse if(a[l]==k+'0'&&abs>0)\n\t\t\t{\n\t\t\t\tabs--;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse\n\t\t\tcout<\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tv.push_back(num%10);\n\t\t\tnum = num/10;\n\t\t}\n\t\tsort(v.begin(),v.end());\n\t\tfor(int j=0;j<(rate-bag);j++){\n\t\t\tcout << v[j];\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,55,576 1575018536168939520,248aeeb7c799cae1004d3591a04b02db11348e7617322bb6066f91aadaa20296,2022-09-28 15:04:16,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nchar max(vector a){\n int max=a[0];\n for(int i=0;ia[0])\n max=a[i];\n return max;\n}\nint main(){\n int n;\n cin>>n;\n for(int i=0;i s;\n int a,b;\n cin>>a>>b;\n for(int j=0;j\nusing namespace std;\nchar max(vector a){\n int max=a[0];\n for(int i=0;ia[0])\n max=a[i];\n return max;\n}\nint main(){\n int n;\n cin>>n;\n for(int i=0;i s;\n int a,b;\n cin>>a>>b;\n for(int j=0;j\nusing namespace std;\nconst int N = 2e5 +10;\n\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n string s;\n cin>>s;\n int a[N];\n for(int i=0;i\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n\nusing namespace std;\nvector v[10];\nint pos[10];\n\nint main() {\n\t\n\tint t;\n\tcin >> t;\n\twhile (t--)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tstring s;\n\t\tcin >> s;\n\t\tfor (int i = 0; i < 10; i++)\n\t\t{\n\t\t\tv[i].clear();\n\t\t\tpos[i] = 0;\n\t\t}\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tv[s[i] - '0'].push_back(i);\n\t\t\t\n\t\t}\n\t\tstring ans=\""\"";\n\t\tint ma = -1;\n\t\tfor (int tmp = 0; tmp < n - m; tmp++)\n\t\t{\n\t\t\tfor (int i = 1; i <= 9; i++)\n\t\t\t{\n\t\t\t\twhile (pos[i] t=new Stack<>();\n t.push(a2.charAt(0));\n for(int j=1;j0){\n t.pop();\n w--;\n }\n else {\n break;\n }\n }\n t.push(a2.charAt(j));\n }\n while(w>0){\n t.pop();\n w--;\n }\n String r=String.valueOf(t.pop());\n while (!t.empty()){\n r=String.valueOf(t.pop())+r;\n }\n System.out.println(Integer.valueOf(r));\n }\n }\n},MULTIPLE_ERROR,3937,131072 1575018751282626560,4905d4c5efe6e16009f93519337d5e0254fc0e5490e8d6e475f970a98bfd5035,2022-09-28 15:05:07,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\n#include\nusing namespace std;\ntypedef long long ll;\nll a[200010];\nint main()\n{\n int t;\n cin >> t;\n while (t--)\n {\n string x;\n int n,m;\n cin >> n >> m;\n cin >> x;\n memset(a,0,sizeof(a));\n for(int i=0;imax)\n {\n max=a[j];\n flag=j;\n }\n }\n a[flag]=0;\n }\n for(int i=0;i\nint main()\n{\n int t,i;\n int n,m;\n scanf(\""%d\"",&t);\n for(i=1;i<=t;i++){\n \n }\n return 0;\n}",WRONG_ANSWER,36,476 1575018893376839680,8ce5505f707bf73fd327548cd953a7a49bf70cd9f5dac40aa342d40aabde19fa,2022-09-28 15:05:41,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n\nint main(){ \n int t;\n scanf(\""%d\"",&t);\n int n,m;\n int p[n];\n for(int cnt = 0; cnt <= t;cnt++){\n scanf(\""%d %d\"",&n,&m);\n for(int cmt = 0;cmt < n;cmt++){\n scanf(\""%d\"",&p[cmt]);\n }\n int ms = 2;\n for(int count = 0;count < m;count++){\n for(;ms + 1 < n;n--){\n p[ms] = p[ms+1];\n ms++;\n if(ms + 1 == n - 1){\n ms = 2;\n }\n }\n }\n for(int cnt2 = 0;cnt2 < n;cnt2++){\n if(p[cnt2] == 0){\n break;\n } else {\n printf(\""%d\"",p[cnt2]);\n }\n }\n }\n\n return 0;\n}",MULTIPLE_ERROR,725,764 1575019029306261504,cafe684e9d8e6b7f14c1be34a7de24e55ed28687a90e559f1a079f57a2ec49c5,2022-09-28 15:06:13,C++,10.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n#include \n#include \n\nusing namespace std;\n\n#define ll long long\n\nint getin()\n{\n int n = 0;\n char c = getchar();\n while (c > '9' || c < '0')\n c = getchar();\n while (c <= '9' && c >= '0')\n n = (n << 1) + (n << 3) + (c ^ '0'), c = getchar();\n return n;\n}\n\nint main()\n{\n int T = getin();\n while (T--)\n {\n int n = getin();\n int m = getin();\n vector v{};\n\n for (int i = 0; i < n; i++)\n v.push_back(getchar());\n\n while(m)\n {\n int i = 1;\n int size = v.size();\n auto it = v.begin();\n while(i\nusing namespace std;\nint a[11];\nchar s[90];\nint main(){\n int t;\n cin>>t;\n while(t--){\n// \tt--;\n int n,m;\n scanf(\""%d%d\"",&n,&m);\n getchar();\n scanf(\""%s\"",s);\n int len=strlen(s);\n int lens=lens;\n for(int i=0;i0;i--){\n \tif(a[index]>0){\n\t\t\ta[index]--;\n\t\t}\n\t\telse index--,i++;\n\t}\n for(int i=0;i<12;i++){\n if(a[i])printf(\""%d\"",i);\n };\n };\n return 0;\n\t}",SEGMENTATION_FAULT,43,584 1575019187963781120,2dd7bb66c80a138fb2462b44a4d99cbdf9ad0975e33734cf9f0d90e880c85eb8,2022-09-28 15:06:51,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n\t\tsort(v.begin(),v.end());\n\t\tfor(int j=0;j<(rate-bag);j++){\n\t\t\tcout << v[j];\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,71,588 1575019230590910464,4cdf9efef9133a54e4b2da059723b068fdde34b97998387016b5631ae19c4573,2022-09-28 15:07:01,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \nint main(){\n int T,n,m,x,a,b,t,i,c;\n t=0;\n int count=0;\n b=0;\n scanf(\""%d\\n\"",&T);\n for(a=1;a<=T;a++){\n scanf(\""%d %d\\n\"",&n,&m);\n scanf(\""%d\\n\"",&x);\n do{\n count++;\n for(i=n;i>0;i--){\n c=x/pow(10,n);\n if(b<=c){\n printf(\""%d\"",b);\n t=t+b*pow(10,n);\n b=c;\n }\n else {\n printf(\""%d\"",c);\n t=t+c*pow(10,n);\n }\n x=x-c*pow(10,n);\n }\n x=t;\n n--;\n }while(count!=m);\n printf(\""%d\\n\"",x);\n }\n return 0;\n}",TIME_LIMIT_EXCEEDED,4000,2360 1575019242548453376,2dd7bb66c80a138fb2462b44a4d99cbdf9ad0975e33734cf9f0d90e880c85eb8,2022-09-28 15:07:04,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n\t\tsort(v.begin(),v.end());\n\t\tfor(int j=0;j<(rate-bag);j++){\n\t\t\tcout << v[j];\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,63,644 1575019344927215616,396148cfae7524856ec5ae16472dfea70c5cc1a6ee2a30bfba94a59ee40fd4fc,2022-09-28 15:07:28,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n\tlong long n;\n cin>>n;\n long long m;\n cin>>m;\n long long arr[n]={0};\n long long sum=1;\n for(int i=0;i>arr[i];\n sum*=arr[i];\n }\n long long b[n];\n for(int j=0;j\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n\t\tsort(v.begin(),v.end());\n\t\tfor(int j=0;j<(rate-bag);j++){\n\t\t\tcout << v[j];\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,69,580 1575019811648393216,27d26e76d37de037dc307795981186768ad9ee1cd4523ae31c7b2a119332ccef,2022-09-28 15:09:20,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n\nint main(){\n int T = 0;\n int n = 0,m = 0;\n scanf(\""%d\"",&T);\n for(int i = 0;i0){\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = x;\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j++){\n printf(\""%d\"",c[j]);\n }\n printf(\""\\n\"");\n }\n \n return 0;\n}",MULTIPLE_ERROR,114,1476 1575019832590553088,72c931a1e7902607f487002f240eeafc7b62cb4cc5e3331fef34b50750044fe9,2022-09-28 15:09:25,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int t= sc.nextInt();\n for (int i = 0; i Integer.parseInt(s.substring(k+1,k+2))){\n s=s.substring(k+1);\n break;\n }else{\n\n }\n }\n }\n System.out.println(s);\n }\n }\n}\n",MULTIPLE_ERROR,2676,131072 1575019836206465024,4e88d420afbdce2e2bad1d5ff0cb8518e973e74adc4479a7071cb6c098feb897,2022-09-28 15:09:26,C++,20.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n\nusing namespace std;\nvector v[10];\nint pos[10];\n\nint main() {\n\t\n\tint t;\n\tcin >> t;\n\twhile (t--)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tstring s;\n\t\tcin >> s;\n\t\tfor (int i = 0; i < 10; i++)\n\t\t{\n\t\t\tv[i].clear();\n\t\t\tpos[i] = 0;\n\t\t}\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tv[s[i] - '0'].push_back(i);\n\t\t\t\n\t\t}\n\t\tstring ans=\""\"";\n\t\tint ma = -1;\n\t\tfor (int tmp = 0; tmp < n - m; tmp++)\n\t\t{\n\t\t\tfor (int i = 1; i <= 9; i++)\n\t\t\t{\n\t\t\t\twhile (pos[i]\n\nint main(){ \n int t;\n scanf(\""%d\"",&t);\n int n,m;\n int p[n];\n for(int cnt = 0; cnt <= t;cnt++){\n scanf(\""%d %d\"",&n,&m);\n for(int cmt = 0;cmt < n;cmt++){\n scanf(\""%d\"",&p[cmt]);\n }\n int ms = 2;\n for(int count = 0;count < m;count++){\n for(;ms + 1 < n;n--){\n p[ms] = p[ms+1];\n ms++;\n if(ms + 1 == n - 1){\n ms = 2;\n break;\n }\n }\n }\n for(int cnt2 = 0;cnt2 < n;cnt2++){\n if(p[cnt2] == 0){\n break;\n } else {\n printf(\""%d\"",p[cnt2]);\n }\n }\n }\n\n return 0;\n}",SEGMENTATION_FAULT,42,580 1575020341250576384,1572914b98b9cabe271b6a776a5f0f5c057da420cfa77c67981eb9d6f95f90c8,2022-09-28 15:11:26,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main()\n{\n int T;\n scanf(\""%d\"",&T);\n int n,m;\n for(int i=0;imax){\n max=a[h];\n j=h;\n }\n }\n a[j]=0;\n max=0;\n }\n for(int j=0;j\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n\t\tsort(v.begin(),v.end());\n\t\t//for(int j=0;j<(rate-bag);j++){\n\t\t//\tcout << v[j];\n\t\t//}\n\t\tcout << endl;\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,63,604 1575020454086164480,2dd7bb66c80a138fb2462b44a4d99cbdf9ad0975e33734cf9f0d90e880c85eb8,2022-09-28 15:11:53,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n\t\tsort(v.begin(),v.end());\n\t\tfor(int j=0;j<(rate-bag);j++){\n\t\t//\tcout << v[j];\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,66,596 1575020490152984576,2dd7bb66c80a138fb2462b44a4d99cbdf9ad0975e33734cf9f0d90e880c85eb8,2022-09-28 15:12:01,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n\t\tsort(v.begin(),v.end());\n\t\tfor(int j=0;j<(rate-bag);j++){\n\t\t\tcout << v[j];\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,70,580 1575020564945813504,61bf8a3882552630582b70c6da81c99c715096b8fec33ce4e4805b94b240642f,2022-09-28 15:12:19,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n\n\n\nint main()\n{\n\tint n,i,t,z,min,p,m,cnt=0;\n\tscanf(\""%d\"",&p);\n\tint money[200000];\n\tint mi[200000];\n\tfor(z=0;z=n-m)\n\t\t\t\t{\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tif(cnt==n-1)\n\t\t\t\t\t{\n\t\t\t\t\t\tmi[i+1]=money[t+1];\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(i=0;i\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n\t\tsort(v.begin(),v.end());\n\t\tfor(int j=0;j<(rate-bag);j++){\n\t\t\tcout << v[0];\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,66,728 1575020662077505536,d7fce42f050848869e4e859b7b415731045f22f294129a53dff31c6955576c7c,2022-09-28 15:12:42,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,\nimport java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner in=new Scanner(System.in);\n int n=in.nextInt();\n for(int i=0;i t=new Stack<>();\n t.push(a2.charAt(0));\n for(int j=1;j0){\n t.pop();\n w--;\n }\n else {\n break;\n }\n }\n t.push(a2.charAt(j));\n }\n while(w>0){\n t.pop();\n w--;\n }\n int q=1;\n int r=Integer.valueOf(t.pop()-'0')*q;\n q=q*10;\n while (!t.empty()){\n r=r+q*Integer.valueOf(t.pop()-'0');\n q=q*10;\n }\n System.out.println(Integer.valueOf(r));\n }\n }\n},WRONG_ANSWER,3658,36232 1575020672005001216,0d6581f8ebab0939b2b44c70f672a701baefde04eb8639de08e06c8a566f695e,2022-09-28 15:12:45,C++,20.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\nconst int N = 1e5 + 5;\n\nint top = 0;\nusing namespace std;\nint main() {\n\n int T, n, m;\n cin >> T;\n while (T--) {\n cin >> n >> m;\n top = 0;\n int sta[2 * N];\n memset(sta, 0x3f3f3f3f, sizeof sta);\n string str;\n cin >> str;\n int t = m;\n for (int i = 0; i < n; i++) {\n \n int x = str[i] - '0';\n while (m && top && x < sta[top]) {\n m--;\n sta[top--] = 0x3f3f3f3f;\n }\n sta[++top] = x;\n }\n for (int i = 1; i <= n-t; i++)\n cout << sta[i];\n cout << endl;\n }\n\n\n return 0;\n}",ACCEPTED,250,2176 1575020708659023872,c3e3d0bb4a932501c94859a7ef9870287581c406db568b9f448d64bac32db7dd,2022-09-28 15:12:54,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \nusing namespace std;\nint main()\n{\n\tint n;\n\tcin>>n;\n\twhile (n--)\n\t{\n int len,num;\n\t\tcin>>len>>num;\n\t\tstring s;\n\t\tcin>>s;\n sort(s.begin(),s.end());\n string res=s.substr(0,len-num);\n cout< t=new Stack<>();\n t.push(a2.charAt(0));\n for(int j=1;j0){\n t.pop();\n w--;\n }\n else {\n break;\n }\n }\n t.push(a2.charAt(j));\n }\n while(w>0){\n t.pop();\n w--;\n }\n int q=1;\n int r=Integer.valueOf(t.pop()-'0')*q;\n q=q*10;\n while (!t.empty()){\n r=r+q*Integer.valueOf(t.pop()-'0');\n q=q*10;\n }\n System.out.println(r);\n }\n }\n},WRONG_ANSWER,3799,35292 1575021182456414208,786cdcc7dc329957d21c95c10b8bb0becf62fe5783b7ad5588e931dd06123a83,2022-09-28 15:14:47,C++,20.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nusing namespace std;\n#define rep(i, a, b) for(int i=a; i<=b; i++)\n#define lop(i, a, b) for(int i=a; i=b; i--)\n#define debug(n) cout << #n << ':' << n << el;\n#define tule() cout << 'T' << el\n#define el '\\n'\ntypedef long long LL;\ntypedef pair PII;\nconst int N = 2e5+10;\nint T=0, n=0, m=0, t;\n\n//vector G[N];\nint a[N];\n\nstack st;\nstack ans;\n\nint main()\n{\n\tcin.tie(0);\n\tcout.tie(0); \n\tcin >> T;\n\twhile(T--)\n\t{\n\t\twhile(!st.empty())\n\t\t\tst.pop();\n\t\tcin >> n >> m;\n\t\trep(i, 1, n)\n\t\t{\n\t\t\tscanf(\""%1d\"",&a[i]);\n\t\t\tif(st.empty())\n\t\t\t\tst.push(a[i]);\n\t\t\telse\n\t\t\t{\n\t\t\t\tif(a[i]>=st.top())\n\t\t\t\t{\n\t\t\t\t\tst.push(a[i]);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\twhile(!st.empty()&&a[i]\nint main(){\n int t;\n scanf(\""%d\"",&t);\n int i;\n for(i=0;i 0; i1--) {\n if(m==0)break;\n for (int i2 = 0; i2 < n; i2++) {\n if(m==0)break;\n if(chars[i2]==(char)(i1+'0')){\n m--;\n chars[i2]='0';\n }\n }\n }\n for (int i1 = 0; i1 < n; i1++) {\n if(chars[i1]!='0'){\n System.out.print(chars[i1]);\n }\n }\n System.out.println();\n\n\n }\n }\n},MULTIPLE_ERROR,4808,45300 1575021351440728064,1572914b98b9cabe271b6a776a5f0f5c057da420cfa77c67981eb9d6f95f90c8,2022-09-28 15:15:27,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main()\n{\n int T;\n scanf(\""%d\"",&T);\n int n,m;\n for(int i=0;imax){\n max=a[h];\n j=h;\n }\n }\n a[j]=0;\n max=0;\n }\n for(int j=0;j\nint main()\n{\n int T;\n scanf(\""%d\"",&T);\n int n,m;\n for(int i=0;imax){\n max=a[h];\n j=h;\n }\n }\n a[j]=0;\n max=0;\n }\n for(int j=0;j \nint main()\n{\n\tprintf(\""35\n112\n1114\"");\n return 0;\n}",COMPILE_ERROR,0,0 1575021494256361472,61c901c84484e650e7344cad6a5814072ecef06d395030c2b34b425aad62bd4a,2022-09-28 15:16:01,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nint main(){\n int T;\n long long m,n,o,count=0;\n scanf(\""%d\"",&T);\n for(int i=0;ibigsmall[0]) {\n bigsmall[0] = (s.charAt(j)-'0');\n Arrays.sort(bigsmall);\n }\n }\n int resout[] = new int[numc];\n int y=0;\n while ((bag -y) > 0){\n for(int t=0;t\nint main(){\n int t;\n scanf(\""%d\"",&t);\n int i;\n for(i=0;i\nint main()\n{\n int T;\n scanf(\""%d\"",&T);\n int n,m;\n for(int i=0;imax){\n max=a[h];\n j=h;\n }\n }\n a[j]=0;\n max=0;\n }\n for(int j=0;j \nint main()\n{\n\tprintf(\""35\\n\n 112\\n\n 1114\\n\"");\n return 0;\n}",COMPILE_ERROR,0,0 1575021584068993024,61c901c84484e650e7344cad6a5814072ecef06d395030c2b34b425aad62bd4a,2022-09-28 15:16:22,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nint main(){\n int T;\n long long m,n,o,count=0;\n scanf(\""%d\"",&T);\n for(int i=0;i 0; i1--) {\n if(m==0)break;\n i2=Arrays.binarySearch(chars,(char)(i1+'0'));\n for (int i2 = 0; i2 < n; i2++) {\n if(m==0)break;\n if(chars[i2]==(char)(i1+'0')){\n m--;\n chars[i2]='0';\n }\n }\n }\n for (int i1 = 0; i1 < n; i1++) {\n if(chars[i1]!='0'){\n System.out.print(chars[i1]);\n }\n }\n System.out.println();\n\n\n }\n }\n}",COMPILE_ERROR,0,0 1575021676289150976,02f8d0fdc995e18e093dffd10d8c3b3b6b0b7ca2e039bb28b1c5795c3f51842a,2022-09-28 15:16:44,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int t = sc.nextInt();\n for (int i = 0; i < t; i++) {\n int n = sc.nextInt();\n int m = sc.nextInt();\n sc.nextLine();\n String s = sc.nextLine();\n char[] chars = s.toCharArray();\n for (int i1 = 9; i1 > 0; i1--) {\n if(m==0)break;\n i1=Arrays.binarySearch(chars,(char)(i1+'0'));\n for (int i2 = 0; i2 < n; i2++) {\n if(m==0)break;\n if(chars[i2]==(char)(i1+'0')){\n m--;\n chars[i2]='0';\n }\n }\n }\n for (int i1 = 0; i1 < n; i1++) {\n if(chars[i1]!='0'){\n System.out.print(chars[i1]);\n }\n }\n System.out.println();\n\n\n }\n }\n}",MULTIPLE_ERROR,4800,42116 1575021798108938240,e0d4c328e81858258074a68a5fe9fee9c7615dd4b9fd887a1b3d9a2dca1a1c51,2022-09-28 15:17:13,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n System.out.println(\""0\"");\n\n }\n}",WRONG_ANSWER,728,17040 1575021851573313536,4f122aa4d0bb69e68eb3eb8122637aec702bbe44101b0488871c98c2f85cf185,2022-09-28 15:17:26,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int T=sc.nextInt();\n for(int i=0;istr.charAt(k+1)){\n min=str.charAt(k+1);\n flag=k;\n }\n arr[k]=min;\n str.replace(str.charAt(flag),'9');\n }\n }\n System.out.println(arr);\n\n }\n }\n}",MULTIPLE_ERROR,3660,131072 1575021851896692736,e0d4c328e81858258074a68a5fe9fee9c7615dd4b9fd887a1b3d9a2dca1a1c51,2022-09-28 15:17:26,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int tot = scanner.nextInt();\n int numc,bag;\n scanner.nextLine();\n\n for(int i = 0;ibigsmall[0]) {\n bigsmall[0] = (s.charAt(j)-'0');\n Arrays.sort(bigsmall);\n }\n }\n int resout[] = new int[numc];\n int y=0;\n while ((bag -y) > 0){\n for(int t=0;t\n#include\nint main(){\n int T;\n long long m,n,o,count=0;\n scanf(\""%d\"",&T);\n for(int i=0;i 0; i1--) {\n if(m==0)break;\n int i2;\n i2=Arrays.binarySearch(chars,(char)(i1+'0'));\n for (i2 = 0; i2 < n; i2++) {\n if(m==0)break;\n if(chars[i2]==(char)(i1+'0')){\n m--;\n chars[i2]='0';\n }\n }\n }\n for (int i1 = 0; i1 < n; i1++) {\n if(chars[i1]!='0'){\n System.out.print(chars[i1]);\n }\n }\n System.out.println();\n\n\n }\n }\n}",MULTIPLE_ERROR,4779,45804 1575021953666867200,451e08ea58c9135697886a783d7a1720e2b8d19ebe5ed54f5efafb912ee9897e,2022-09-28 15:17:50,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main()\n{\n\n\tprintf(\""35\\n112\\n1114\"");\n return 0;\n}\n",WRONG_ANSWER,36,364 1575022049011781632,61bf8a3882552630582b70c6da81c99c715096b8fec33ce4e4805b94b240642f,2022-09-28 15:18:13,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n\n\n\nint main()\n{\n\tint n,i,t,z,min,p,m,cnt=0;\n\tscanf(\""%d\"",&p);\n\tchar money[200000];\n\tchar mi[200000];\n\tfor(z=0;z=n-m)\n\t\t\t\t{\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tif(cnt==n-1)\n\t\t\t\t\t{\n\t\t\t\t\t\tmi[i+1]=money[t+1];\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(i=0;i\nusing namespace std;\nint a[191];\nchar s[90];\nint main(){\n int t;\n cin>>t;\n while(t--){\n memset(a,0,sizeof(a));\n// \tt--;\n int n,m;\n scanf(\""%d%d\"",&n,&m);\n getchar();\n scanf(\""%s\"",s);\n int len=n;\n int lens=lens;\n for(int i=0;i0;i--){\n \tif(a[index]>0){\n\t\t\ta[index]--;\n// printf(\""%d^\"",index);\n\t\t}\n\t\telse index--,i++;\n\t};\n// printf(\""\\n\"");\n// for(int i=1;i<=9;i++){\n// printf(\""%d&%d \"",a[i],i);\n// }\n for(int i=0;i<12;i++){\n while(a[i]){\n printf(\""%d\"",i);\n a[i]--;\n }\n };\n printf(\""\\n\"");\n };\n return 0;\n\t}",MULTIPLE_ERROR,1236,7580 1575022233070424064,2e4cfaba33ff0823e0f5bf02b8b2faebebba18c57e21542326745fc022af7360,2022-09-28 15:18:57,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int t=sc.nextInt();\n int n,m;\n while(t>0){\n Map map=new HashMap<>();\n StringBuilder ans=new StringBuilder();\n n=Integer.valueOf(sc.next());\n m=Integer.valueOf(sc.next());\n String s=sc.next();\n char[] ch=s.toCharArray();\n Arrays.sort(ch);\n int len=s.length();\n for(int i=len-1;i>=len-m;i--){\n int value=map.getOrDefault(ch[i],0)+1;\n map.put(ch[i],value);\n }\n for(int i=0;i\nint main(){\n int T,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n for(int l=x_1; l\n#define ll long long\n#define ull signed long long\n#define maxn 200020\nusing namespace std;\n\nll n, m, T;\n\n\n\nint main()\n{\n\n cin>>T;\n while(T--){\n cin>>n>>m;\n string s;\n cin>>s;\n int start=0;\n int status=0;\n for(int i=1;i=0){\n s=s.substr(0,b)+s.substr(b+1);\n a-=1;\n b-=2;\n i-=1;\n }\n }\n cout<\nusing namespace std;\nint main()\n{\n int t,a[200010]={0},n,m;\n\n cin>>t;\n for(int i=1;i<=t;i++)\n {\n string c;\n cin>>n>>m>>c;\n for(int j=0;j0)\n {\n for(int j=0;j\nusing namespace std;\nint main()\n{\n int t,a[200010]={0},n,m;\n\n cin>>t;\n for(int i=1;i<=t;i++)\n {\n string c;\n cin>>n>>m>>c;\n for(int j=0;j0)\n {\n for(int j=0;j\nint main()\n{\n printf(\""35\\n112\\n1114\\n\"");\n}",WRONG_ANSWER,32,312 1575022578068709376,2dd7bb66c80a138fb2462b44a4d99cbdf9ad0975e33734cf9f0d90e880c85eb8,2022-09-28 15:20:19,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,#include\n#include\nusing namespace std;\nint main()\n{\n \tvector v;\n\tfor(int i=0;i<5;i++){\n\t \tv.push_back(i);\n\t}\n\tcout << v[0] << endl; \n\treturn 0;\n},WRONG_ANSWER,48,640 1575022626231902208,2dd7bb66c80a138fb2462b44a4d99cbdf9ad0975e33734cf9f0d90e880c85eb8,2022-09-28 15:20:31,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n\t\tsort(v.begin(),v.end());\n\t\tfor(int j=0;j<(rate-bag);j++){\n\t\t\tcout << v[0];\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,75,600 1575022670687326208,cafe684e9d8e6b7f14c1be34a7de24e55ed28687a90e559f1a079f57a2ec49c5,2022-09-28 15:20:41,C++,16.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n#include \n#include \n\nusing namespace std;\n\n#define ll long long\n\nint getin()\n{\n int n = 0;\n char c = getchar();\n while (c > '9' || c < '0')\n c = getchar();\n while (c <= '9' && c >= '0')\n n = (n << 1) + (n << 3) + (c ^ '0'), c = getchar();\n return n;\n}\n\nint main()\n{\n int T = getin();\n while (T--)\n {\n int n = getin();\n int m = getin();\n char a[n];\n for (int i = 0; i < n; i++)\n a[i] = getchar();\n\n int head = 0;\n for (int now = 0, next = 1; now < n && m;)\n {\n if (a[now] > a[next])\n {\n m--;\n a[now] = -1;\n if (now == head)\n head = now = next++;\n else\n {\n while (a[now] == -1)\n now--;\n }\n }\n else\n now = next++;\n }\n\n for (int i = 0, l = n-m;i\nusing namespace std;\nint main()\n{\n int t,a[200010]={0},n,m;\n cin>>t;\n for(int i=1;i<=t;i++)\n {\n string c;\n cin>>n>>m>>c;\n for(int j=0;j0)\n {\n for(int j=0;j\n#include \nint main(){\n int T,n,m,x,a,b,t,i,c;\n b=0;\n scanf(\""%d\"",&T);\n for(a=1;a<=T;a++){\n t=0;\n scanf(\""%d %d\"",&n,&m);\n scanf(\""%d\"",&x);\n while (m!=0){\n m--;\n for(i=n;i>=0;i--){\n c=x/pow(10,n);\n if(b<=c){\n t=t+b*pow(10,n-1);\n b=c;\n }\n else {\n t=t+c*pow(10,n-1);\n }\n x=x-c*pow(10,n);\n }\n x=t;\n n--;\n }\n printf(\""%d\\n\"",x);\n }\n return 0;\n}",MULTIPLE_ERROR,2509,704 1575022732813357056,8ce5505f707bf73fd327548cd953a7a49bf70cd9f5dac40aa342d40aabde19fa,2022-09-28 15:20:56,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n\nint main(){ \n int t;\n scanf(\""%d\"",&t);\n int n,m;\n int p[n];\n for(int cnt = 0; cnt <= t;cnt++){\n scanf(\""%d %d\"",&n,&m);\n for(int cmt = 0;cmt < n;cmt++){\n scanf(\""%d\"",&p[cmt]);\n }\n int ms = 2;\n int x = n;\n for(int count = 1;count <= m;count++){\n for(;ms + 1 < x;x--){\n p[ms] = p[ms+1];\n ms++;\n if(ms + 1 == x - 1){\n ms = 2;\n break;\n }\n }\n }\n for(int cnt2 = 0;cnt2 < n;cnt2++){\n if(p[cnt2] == 0){\n break;\n } else {\n printf(\""%d\"",p[cnt2]);\n }\n }\n }\n\n return 0;\n}",SEGMENTATION_FAULT,60,608 1575022770729865216,09ac3712625843651bd1b9960e076f4e559191d6333bcf53a21995dba0cd6859,2022-09-28 15:21:05,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main()\n{\n int t,a[200010]={0},n,m;\n cin>>t;\n for(int i=1;i<=t;i++)\n {\n string c;\n cin>>n>>m>>c;\n for(int j=0;j0)\n {\n for(int j=0;j\n\nint main(){ \n int t;\n scanf(\""%d\"",&t);\n int n,m;\n int p[n];\n for(int cnt = 0; cnt <= t;cnt++){\n scanf(\""%d %d\"",&n,&m);\n for(int cmt = 0;cmt < n;cmt++){\n scanf(\""%d\"",&p[cmt]);\n }\n int ms = 2;\n int x = n;\n for(int count = 1;count <= m;count++){\n for(;ms + 1 < x;x--){\n p[ms] = p[ms+1];\n ms++;\n if(ms + 1 == x - 1){\n ms = 2;\n break;\n }\n }\n }\n for(int cnt2 = 0;cnt2 < n;cnt2++){\n if(p[cnt2] == 0){\n break;\n } else {\n printf(\""%d\"",p[cnt2]);\n }\n }\n }\n\n return 0;\n}",SEGMENTATION_FAULT,44,580 1575022872974835712,7f9bd102aa4d164c73acdebbe49d9bff335557e85e4ab7961a78aa496911eebd,2022-09-28 15:21:30,Python,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"time = int(input())\n\nfor i in range(time):\n n, m = map(int, input().split())\n s = input()\n ls = [_ for _ in s]\n\n for _ in range(m):\n ls.remove(max(ls))\n print(''.join(ls))",MULTIPLE_ERROR,6691,4460 1575022874119880704,0059036b8c4353a2e67a312dd24215f6f8890aa3c7d6f2b19b089cc2d146046b,2022-09-28 15:21:30,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main(){\n int T,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n for(int l=x_1; lbigsmall[0]) {\n bigsmall[0] = (s.charAt(j)-'0');\n Arrays.sort(bigsmall);\n }\n }\n int resout[] = new int[numc];\n int y=0;\n while ((bag -y) > 0){\n for(int t=0;tbigsmall[0]) {\n bigsmall[0] = (s.charAt(j)-'0');\n Arrays.sort(bigsmall);\n }\n }\n int resout[] = new int[numc];\n int y=0;\n while ((bag -y) > 0){\n for(int t=0;t\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n\t\tsort(v.begin(),v.end());\n\t\tfor(int j=0;j<(rate-bag);j++){\n\t\t\tcout << v[j];\n\t\t}\n\t\tcout << endl;\n\t\tv.clear();\n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,65,740 1575023166571499520,0059036b8c4353a2e67a312dd24215f6f8890aa3c7d6f2b19b089cc2d146046b,2022-09-28 15:22:40,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main(){\n int T,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n for(int l=x_1; l\nint main(){\n int T,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n for(int l=x_1; l\n\nint main(){ \n int t;\n scanf(\""%d\"",&t);\n int n,m;\n for(int cnt = 0; cnt <= t;cnt++){\n scanf(\""%d %d\"",&n,&m);\n int p[n];\n for(int cmt = 0;cmt < n;cmt++){\n scanf(\""%d\"",&p[cmt]);\n }\n int ms = 2;\n int x = n;\n for(int count = 1;count <= m;count++){\n for(;ms + 1 < x;x--){\n p[ms] = p[ms+1];\n ms++;\n if(ms + 1 == x - 1){\n ms = 2;\n break;\n }\n }\n }\n for(int cnt2 = 0;cnt2 < n;cnt2++){\n if(p[cnt2] == 0){\n break;\n } else {\n printf(\""%d\"",p[cnt2]);\n }\n }\n }\n\n return 0;\n}",MULTIPLE_ERROR,2088,804 1575023260289449984,4cdf9efef9133a54e4b2da059723b068fdde34b97998387016b5631ae19c4573,2022-09-28 15:23:02,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \nint main(){\n int T,n,m,x,a,b,t,i,c;\n b=0;\n scanf(\""%d\"",&T);\n for(a=1;a<=T;a++){\n t=0;\n scanf(\""%d %d\"",&n,&m);\n scanf(\""%d\"",&x);\n while (m!=0){\n m--;\n for(i=n;i>=0;i--){\n c=x/pow(10,i);\n if(b<=c){\n t=t+b*pow(10,i-1);\n b=c;\n }\n else {\n t=t+c*pow(10,i-1);\n }\n x=x-c*pow(10,i);\n }\n x=t;\n n--;\n }\n printf(\""%d\\n\"",x);\n }\n return 0;\n}",MULTIPLE_ERROR,2551,736 1575023298838880256,61c901c84484e650e7344cad6a5814072ecef06d395030c2b34b425aad62bd4a,2022-09-28 15:23:11,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nint main(){\n int T;\n long long m,n,o,count=0,s;\n scanf(\""%d\"",&T);\n for(int i=0;i\n#include\nint main(){\n int T;\n long long m,n,o,count=0,s;\n scanf(\""%d\"",&T);\n for(int i=0;i\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n \n\t\t//sort(v.begin(),v.end());\n\t\tfor(int j=0;j<(rate-bag);j++){\n\t\t\tcout << v[j];\n\t\t}\n\t\tcout << endl;\n\t\tv.clear();\n \n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,67,592 1575023595871518720,0059036b8c4353a2e67a312dd24215f6f8890aa3c7d6f2b19b089cc2d146046b,2022-09-28 15:24:22,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main(){\n int T,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n for(int l=x_1; l\n#include\nint main(){\n int T;\n long long m,n,o,count=0,s;\n scanf(\""%d\"",&T);\n for(int i=0;i\nint main(){\n int T,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(int l=x_1; l\n#include \n\nint main(){\n int T = 0;\n int n = 0,m = 0;\n scanf(\""%d\"",&T);\n for(int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%d\"",c[j]);\n }\n printf(\""\\n\"");\n free(a);\n free(c);\n }\n \n return 0;\n}",RUNTIME_ERROR,92,1476 1575023946036764672,cafe684e9d8e6b7f14c1be34a7de24e55ed28687a90e559f1a079f57a2ec49c5,2022-09-28 15:25:45,C++,8.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n#include \n#include \n\nusing namespace std;\n\n#define ll long long\n\nint getin()\n{\n int n = 0;\n char c = getchar();\n while (c > '9' || c < '0')\n c = getchar();\n while (c <= '9' && c >= '0')\n n = (n << 1) + (n << 3) + (c ^ '0'), c = getchar();\n return n;\n}\n\nint main()\n{\n int T = getin();\n while (T--)\n {\n int n = getin();\n int m = getin();\n char a[n];\n for (int i = 0; i < n; i++)\n a[i] = getchar();\n\n for (int head = 0, now = 0, next = 1; next < n && m;)\n {\n if (a[now] > a[next])\n {\n m--;\n a[now] = -1;\n if (now == head)\n head = now = next++;\n else\n {\n while (a[now] == -1)\n now--;\n }\n }\n else\n now = next++;\n }\n\n for (int i = 0, l = n - m; i < l; i++)\n if (a[i] != -1)\n putchar(a[i]);\n putchar('\\n');\n }\n}\n",PARTIAL_ACCEPTED,111,1188 1575024080506150912,09ac3712625843651bd1b9960e076f4e559191d6333bcf53a21995dba0cd6859,2022-09-28 15:26:17,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main()\n{\n int t,a[200010]={0},n,m;\n cin>>t;\n for(int i=1;i<=t;i++)\n {\n string c;\n cin>>n>>m>>c;\n for(int j=0;j0)\n {\n for(int j=0;j\n#include\nusing namespace std;\nint main() {\n\tint T;\n\tcin >> T;\n\tfor (int i = 0; i < T; i++) {\n\t\tint n, m;\n\t\tcin >> n >> m;\n\n\t\tchar a[200002];\n\t\tfor (int i = 0; i <= 200000; i++) {\n\t\t\ta[i] = 0;\n\t\t}\n\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tcin >> a[j];\n\t\t\t//cout << a[j] << \"" \""< (a[k]-'0')) {\n\t\t\t\t\ta[zhizhen] = 'x';\n\t\t\t\t\tzhizhen--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t//什么问题都没有\n\t\t\t\tzhizhen = k;\n\t\t\t}\n\t\t\tm--;\n\t\t}\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tif (a[j] != 'x') {\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\t//cout << a[j] << \"" \""<\n#include \n\nint main(){\n int T = 0;\n int n = 0,m = 0;\n scanf(\""%d\"",&T);\n for(int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%d\"",c[j]);\n }\n printf(\""\\n\"");\n }\n \n return 0;\n}",WRONG_ANSWER,498,2340 1575024171744841728,2dd7bb66c80a138fb2462b44a4d99cbdf9ad0975e33734cf9f0d90e880c85eb8,2022-09-28 15:26:39,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n \n\t\tsort(v.begin(),v.end());\n\t\tfor(int j=0;j<(rate-bag);j++){\n\t\t\tcout << v[j];\n\t\t}\n if(i!=n-1)\n\t\tcout << endl;\n\t\tv.clear();\n \n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,55,704 1575024203021766656,0059036b8c4353a2e67a312dd24215f6f8890aa3c7d6f2b19b089cc2d146046b,2022-09-28 15:26:47,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main(){\n int T,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(int l=x_1; l\nvoid deleteMinNum(char s[]);\nvoid Print(char s[]);\n\nint main(){\n\tchar s[200000];\n\tint t;\n\tint n;//n组数据 \n\tscanf(\""%d\"",&n);\n\tfor(int cnt=0;cnt0&&t<10) {\n\t\t\tmin=t;\n\t\t\tmin1=cnt;\n\t\t}\n\t}\n\ts[cnt]='0';\n}\n\nvoid Print(char s[]){\n\tfor(int cnt=0;s[cnt]!=0;cnt++){\n\t\tif(s[cnt]=='0');\n\t\telse printf(\""%c\"",s[cnt]);\n\t}\n\tprintf(\""\\n\"");\n}",COMPILE_ERROR,0,0 1575024298966470656,2dd7bb66c80a138fb2462b44a4d99cbdf9ad0975e33734cf9f0d90e880c85eb8,2022-09-28 15:27:10,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n \n\t\tsort(v.begin(),v.end());\n\t\tfor(int j=0;j<(rate-bag);j++){\n\t\t\tcout << v[j];\n\t\t}\n //if(i!=n-1)\n\t\tcout << endl;\n\t\tv.clear();\n \n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,70,608 1575024322005782528,ba8e35f3b23dfa9787b88722bf9b263d9e21fff543ab1b7928bb7240681e23bf,2022-09-28 15:27:15,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n#include \n#include \nusing namespace std;\nvoid findAnddelete(vector& v,int m);\nint main(){\n int T;\n cin >> T;\n for(int i=0;i v;\n cin >> n >> m;\n for(int j=0;j> ch;\n v.push_back(ch);\n }\n for(int j=0;j::iterator ii = v.begin();ii!=v.end();ii++){\n cout<<*ii;\n }\n cout<<'\\n';\n }\n return 0;\n}\nvoid findAnddelete(vector& v,int m){\n vector::iterator max=v.begin();\n for(vector::iterator it=v.begin();it!=v.end();it++){\n if(*it>*max){\n max=it;\n }\n }\n v.erase(max);\n}",MULTIPLE_ERROR,2022,828 1575024351878037504,b9f5c8e2bc21b9ef93c2c496d19a6d9554d3d9536feefc06f53be1be22a6b5fb,2022-09-28 15:27:22,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nvoid deleteMinNum(char s[]);\nvoid Print(char s[]);\n\nint main(){\n\tchar s[200000];\n\tint t;\n\tint n;//n组数据 \n\tscanf(\""%d\"",&n);\n\tfor(int cnt=0;cnt0&&t<10) {\n\t\t\tmin=t;\n\t\t\tmin1=cnt;\n\t\t}\n\t}\n\ts[min1]='0';\n}\n\nvoid Print(char s[]){\n\tfor(int cnt=0;s[cnt]!=0;cnt++){\n\t\tif(s[cnt]=='0');\n\t\telse printf(\""%c\"",s[cnt]);\n\t}\n\tprintf(\""\\n\"");\n}",MULTIPLE_ERROR,2038,488 1575024405741289472,fae23f87d1e3769cd91d6a4aaab17c6316b1bad3cc11b98ce7e37bdc2fa54ea2,2022-09-28 15:27:35,C++,18.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main() {\n\tint T;\n\tcin >> T;\n\tfor (int i = 0; i < T; i++) {\n\t\tint n, m;\n\t\tcin >> n >> m;\n\n\t\tchar a[200002];\n\t\tfor (int i = 0; i <= 200000; i++) {\n\t\t\ta[i] = 0;\n\t\t}\n\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tcin >> a[j];\n\t\t\t//cout << a[j] << \"" \""< (a[k]-'0')) {\n\t\t\t\t\ta[zhizhen] = 'x';\n\t\t\t\t\tzhizhen--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t//什么问题都没有\n\t\t\t\tzhizhen = k;\n\t\t\t}\n\t\t\tm--;\n\t\t}\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tif (a[j] != 'x') {\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\t//cout << a[j] << \"" \""<\n#include \n#include \n#include \n\nusing namespace std;\n\nvoid solve()\n{\n\t// 蛮力法\n\tint T;\n\tcin >> T;\n\twhile(T--)\n\t{\n\t\tint len, m;\n\t\tcin >> len >> m;\n\t\tstring str;\n\t\tcin >> str;\n\t\tvector price;\n\t\tfor(int i = 0; i < len; i++)\n\t\t{\n\t\t\tint num = str[i]-'0';\n\t\t\tprice.push_back(num);\n\t\t}\n//\t\t114514\n//\t\t3\n//\t\t贪心算法\n//\t\t先删最大数，相同数删第一个 \n\t\t\n\t\tint cnt = 0;\n\t\twhile(cnt < m)\n\t\t{\n\t\t\tint maxIndex = 0;\n\t\t\tfor(int i = 0; i < price.size(); i++)\n\t\t\t{\n\t\t\t\tif(price[i] > price[maxIndex])\n\t\t\t\t{\n\t\t\t\t\tmaxIndex = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//删掉 maxIndex处的元素\n//\t\t\t2 3 4\n//\t\t\tmaxIndex\n\t\t\tfor(int i = maxIndex, j = maxIndex + 1; i < price.size() - 1; i++, j++)\n\t\t\t{\n\t\t\t\tprice[i] = price[j];\n\t\t\t}\n\t\t\tprice.pop_back();\t//把尾巴删了 \n\t\t\tcnt++; \n\t\t}\n\t\t// 输出 price 的内容\n\t\tfor(int i = 0; i < price.size(); i++)\n\t\t{\n\t\t\tcout << price[i];\n\t\t } \n\t\tcout << endl;\n\t\t\n\t}\n}\n\nint main()\n{\n\tsolve();\n//\tvector test;\n//\ttest.push_back(2);\n//\ttest.push_back(2);\n//\ttest.pop_back();\n//\tfor(int i = 0; i < test.size(); i++)\n//\t{\n//\t\tcout << test[i] << \"" \"" << test.size();\n//\t}\n\treturn 0;\n}",MULTIPLE_ERROR,2024,1768 1575024437584027648,147710752d8e8081300c289a748f858e03386bd89e19cc4b252f6fc5b9bd7b4f,2022-09-28 15:27:43,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nlong long num;\nint main()\n{\n\tint index,min,count;\n\tint t,m,n,i,j,k;\n\tcin>>t;\n\tint a[200000];\n\tint b[200000];\n\tfor(i = 0; i < t; i++)\n\t{\n\t\tmemset(a,0,sizeof(a));\n\t\tmemset(b,0,sizeof(b));\n\t\tcin>>n>>m;\n\t\tcin>>num;\n\t\tfor(j = n-1; j >= 0; j--)\n\t\t{\n\t\t\ta[j] = num % 10;\n\t\t\tnum /= 10;\n\t\t}\n\t\tindex = -1;\n\t\tmin = 1000;\n\t\tcount = 0;\n\t\twhile(count<(n-m)){\n\t\t\tfor(k = 0; k < n; k++)\n\t\t\t{\n\t\t\t\tif(a[k]<=min){\n\t\t\t\t\tmin = a[k];\n\t\t\t\t\tindex = k;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcount++;\n\t\t\tb[index] = min;\n\t\t\ta[index] = 10;\n\t\t\tmin = 10;\n\t\t}\n\t\tfor(j = 0; j < n; j++)\n\t\t{\n\t\t\tif(b[j]!=0){\n\t\t\t\tcout<\n#include \n\nint main(){\n int T = 0;\n int n = 0,m = 0;\n scanf(\""%d\"",&T);\n for(int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%d\"",c[j]);\n }\n printf(\""\\n\"");\n free(a);\n free(c);\n }\n \n return 0;\n}",WRONG_ANSWER,531,2444 1575024494093885440,8ce5505f707bf73fd327548cd953a7a49bf70cd9f5dac40aa342d40aabde19fa,2022-09-28 15:27:56,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n\nint main(){ \n int t;\n scanf(\""%d\"",&t);\n int n,m;\n for(int cnt = 0; cnt <= t;cnt++){\n scanf(\""%d %d\"",&n,&m);\n int p[n];\n int lt;\n int cmt = 0;\n do{\n scanf(\""%d\"",lt);\n p[cmt] = lt % 10;\n lt /= 10; \n cmt++;\n } while(lt != 0);\n int ms = 2;\n int x = n;\n for(int count = 1;count <= m;count++){\n for(;ms + 1 < x;x--){\n p[ms] = p[ms+1];\n ms++;\n if(ms + 1 == x - 1){\n ms = 2;\n break;\n }\n }\n }\n for(int cnt2 = 0;cnt2 < n;cnt2++){\n if(p[cnt2] == 0){\n break;\n } else {\n printf(\""%d\"",p[cnt2]);\n }\n }\n }\n\n return 0;\n}",SEGMENTATION_FAULT,45,696 1575024526692433920,147710752d8e8081300c289a748f858e03386bd89e19cc4b252f6fc5b9bd7b4f,2022-09-28 15:28:04,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nlong long num;\nint main()\n{\n\tint index,min,count;\n\tint t,m,n,i,j,k;\n\tcin>>t;\n\tint a[2000];\n\tint b[2000];\n\tfor(i = 0; i < t; i++)\n\t{\n\t\tmemset(a,0,sizeof(a));\n\t\tmemset(b,0,sizeof(b));\n\t\tcin>>n>>m;\n\t\tcin>>num;\n\t\tfor(j = n-1; j >= 0; j--)\n\t\t{\n\t\t\ta[j] = num % 10;\n\t\t\tnum /= 10;\n\t\t}\n\t\tindex = -1;\n\t\tmin = 1000;\n\t\tcount = 0;\n\t\twhile(count<(n-m)){\n\t\t\tfor(k = 0; k < n; k++)\n\t\t\t{\n\t\t\t\tif(a[k]<=min){\n\t\t\t\t\tmin = a[k];\n\t\t\t\t\tindex = k;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcount++;\n\t\t\tb[index] = min;\n\t\t\ta[index] = 10;\n\t\t\tmin = 10;\n\t\t}\n\t\tfor(j = 0; j < n; j++)\n\t\t{\n\t\t\tif(b[j]!=0){\n\t\t\t\tcout<\n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n \n\t\tsort(v.begin(),v.end());\n\t\tfor(j=0;j<(rate-bag);j++){\n\t\t\tcout << v[j];\n\t\t}\n if(i!=n-1)\n\t\tcout << endl;\n\t\tv.clear();\n \n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,67,608 1575024630618476544,b9f5c8e2bc21b9ef93c2c496d19a6d9554d3d9536feefc06f53be1be22a6b5fb,2022-09-28 15:28:29,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nvoid deleteMinNum(char s[]);\nvoid Print(char s[]);\n\nint main(){\n\tchar s[200000];\n\tint t;\n\tint n;//n组数据 \n\tscanf(\""%d\"",&n);\n\tfor(int cnt=0;cntmin&&t>0&&t<10) {\n\t\t\tmin=t;\n\t\t\tmin1=cnt;\n\t\t}\n\t}\n\ts[min1]='0';\n}\n\nvoid Print(char s[]){\n\tfor(int cnt=0;s[cnt]!=0;cnt++){\n\t\tif(s[cnt]=='0');\n\t\telse printf(\""%c\"",s[cnt]);\n\t}\n\tprintf(\""\\n\"");\n}",MULTIPLE_ERROR,2053,604 1575024676479000576,4cdf9efef9133a54e4b2da059723b068fdde34b97998387016b5631ae19c4573,2022-09-28 15:28:40,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \nint main(){\n int T,n,m,x,a,b,t,i,c;\n b=0;\n scanf(\""%d\"",&T);\n for(a=1;a<=T;a++){\n t=0;\n scanf(\""%d %d\"",&n,&m);\n scanf(\""%d\"",&x);\n while (m!=0){\n m--;\n for(i=n;i>0;i--){\n c=x/pow(10,i);\n if(b<=c){\n t=t+b*pow(10,i-1);\n b=c;\n }\n else {\n t=t+c*pow(10,i-1);\n }\n x=x-c*pow(10,i);\n }\n x=t;\n n--;\n }\n printf(\""%d\\n\"",x);\n }\n return 0;\n}",MULTIPLE_ERROR,2568,604 1575024725296504832,2dd7bb66c80a138fb2462b44a4d99cbdf9ad0975e33734cf9f0d90e880c85eb8,2022-09-28 15:28:51,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n \n\t\tsort(v.begin(),v.end());\n\t\tfor(j=0;j<(rate-bag);j++){\n\t\t\tcout << v[j];\n\t\t}\n if(i!=n-1)\n\t\tcout << endl;\n\t\tv.clear();\n \n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,63,640 1575024738265710592,b9f5c8e2bc21b9ef93c2c496d19a6d9554d3d9536feefc06f53be1be22a6b5fb,2022-09-28 15:28:54,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nvoid deleteMinNum(char s[]);\nvoid Print(char s[]);\n\nint main(){\n\tchar s[200000];\n\tint t;\n\tint n;//n组数据 \n\tscanf(\""%d\"",&n);\n\tfor(int cnt=0;cntmin&&t>0&&t<10) {\n\t\t\tmin=t;\n\t\t\tmin1=cnt;\n\t\t}\n\t}\n\ts[min1]='a';\n}\n\nvoid Print(char s[]){\n\tfor(int cnt=0;s[cnt]!=0;cnt++){\n\t\tif(s[cnt]=='0');\n\t\telse printf(\""%c\"",s[cnt]);\n\t}\n\tprintf(\""\\n\"");\n}",MULTIPLE_ERROR,2054,628 1575024772310454272,cafe684e9d8e6b7f14c1be34a7de24e55ed28687a90e559f1a079f57a2ec49c5,2022-09-28 15:29:02,C++,20.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n#include \n#include \n\nusing namespace std;\n\n#define ll long long\n\nint getin()\n{\n int n = 0;\n char c = getchar();\n while (c > '9' || c < '0')\n c = getchar();\n while (c <= '9' && c >= '0')\n n = (n << 1) + (n << 3) + (c ^ '0'), c = getchar();\n return n;\n}\n\nint main()\n{\n int T = getin();\n while (T--)\n {\n int n = getin();\n int m = getin();\n char a[n+1];\n for (int i = 0; i < n; i++)\n a[i] = getchar();\n a[n]=0;\n for (int head = 0, now = 0, next = 1; next <= n && m;)\n {\n if (a[now] > a[next])\n {\n m--;\n a[now] = -1;\n if (now == head)\n head = now = next++;\n else\n {\n while (a[now] == -1)\n now--;\n }\n }\n else\n now = next++;\n }\n\n for (int i = 0, l = n - m; i < n; i++)\n if (a[i] != -1)\n putchar(a[i]);\n putchar('\\n');\n }\n}\n",ACCEPTED,104,1092 1575024820151107584,2dd7bb66c80a138fb2462b44a4d99cbdf9ad0975e33734cf9f0d90e880c85eb8,2022-09-28 15:29:14,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n \n\t\tsort(v.begin(),v.end());\n\t\tfor(j=0;j<(rate-bag);j++){\n\t\t\tcout << v[j];\n\t\t}\n if(i!=n-1){\n \tcout << endl;\n }\n\t\n\t\tv.clear();\n \n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,74,588 1575024826287374336,b9f5c8e2bc21b9ef93c2c496d19a6d9554d3d9536feefc06f53be1be22a6b5fb,2022-09-28 15:29:15,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nvoid deleteMinNum(char s[]);\nvoid Print(char s[]);\n\nint main(){\n\tchar s[200000];\n\tint t;\n\tint n;//n组数据 \n\tscanf(\""%d\"",&n);\n\tfor(int cnt=0;cntmin&&t>0&&t<10) {\n\t\t\tmin=t;\n\t\t\tmin1=cnt;\n\t\t}\n\t}\n\ts[min1]='a';\n}\n\nvoid Print(char s[]){\n\tfor(int cnt=0;s[cnt]!=0;cnt++){\n\t\tif(s[cnt]=='a');\n\t\telse printf(\""%c\"",s[cnt]);\n\t}\n\tprintf(\""\\n\"");\n}",MULTIPLE_ERROR,2065,448 1575024836516859904,09ac3712625843651bd1b9960e076f4e559191d6333bcf53a21995dba0cd6859,2022-09-28 15:29:18,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main()\n{\n int t,a[200010]={0},n,m;\n cin>>t;\n for(int i=1;i<=t;i++)\n {\n string c,s;\n cin>>n>>m>>c;\n for(int j=0;j0)\n {\n for(int j=0;j\n#include \n#include \n#include \n\nusing namespace std;\n\n#define ll long long\n\nint getin()\n{\n int n = 0;\n char c = getchar();\n while (c > '9' || c < '0')\n c = getchar();\n while (c <= '9' && c >= '0')\n n = (n << 1) + (n << 3) + (c ^ '0'), c = getchar();\n return n;\n}\n\nint main()\n{\n int T = getin();\n while (T--)\n {\n int n = getin();\n int m = getin();\n char a[n+1];\n \n for (int i = 0; i < n; i++)\n a[i] = getchar();\n a[n]=0;\n\n for (int head = 0, now = 0, next = 1; next <= n && m;)\n {\n if (a[now] > a[next])\n {\n m--;\n a[now] = -1;\n if (now == head)\n head = now = next++;\n else\n {\n while (a[now] == -1)\n now--;\n }\n }\n else\n now = next++;\n }\n\n for (int i = 0; i < n; i++)\n if (a[i] != -1)\n putchar(a[i]);\n putchar('\\n');\n }\n}\n",ACCEPTED,114,1248 1575024906419552256,8155e119b8800f713f143ddd24fc9246c3c587b7d746741f1266c43d542bf023,2022-09-28 15:29:34,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n#include \n#include \n\nusing namespace std;\n\nvoid solve()\n{\n\t// 蛮力法\n\tint T;\n\tcin >> T;\n\twhile(T--)\n\t{\n\t\tint len, m;\n\t\tcin >> len >> m;\n\t\tstring str;\n\t\tcin >> str;\n\t\tvector price;\n\t\tfor(int i = 0; i < len; i++)\n\t\t{\n\t\t\tint num = str[i]-'0';\n\t\t\tprice.push_back(num);\n\t\t}\n//\t\t114514\n//\t\t3\n//\t\t贪心算法\n//\t\t先删最大数，相同数删第一个 \n\t\t\n\t\tint cnt = 0;\n\t\twhile(cnt < m)\n\t\t{\n\t\t\tint maxIndex = 0;\n\t\t\tfor(int i = 0; i < price.size(); i++)\n\t\t\t{\n\t\t\t\tif(price[i] > price[maxIndex])\n\t\t\t\t{\n\t\t\t\t\tmaxIndex = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//删掉 maxIndex处的元素\n//\t\t\t2 3 4\n//\t\t\tmaxIndex\n\t\t\tfor(int i = maxIndex, j = maxIndex + 1; i < price.size() - 1; i++, j++)\n\t\t\t{\n\t\t\t\tprice[i] = price[j];\n\t\t\t}\n\t\t\tprice.pop_back();\t//把尾巴删了 \n\t\t\tcnt++; \n\t\t}\n\t\t// 输出 price 的内容\n\t\tfor(int i = 0; i < price.size(); i++)\n\t\t{\n\t\t\tcout << price[i];\n\t\t } \n\t\tcout << endl;\n\t\t\n\t}\n}\n\nint main()\n{\n\tsolve();\n//\tvector test;\n//\ttest.push_back(2);\n//\ttest.push_back(2);\n//\ttest.pop_back();\n//\tfor(int i = 0; i < test.size(); i++)\n//\t{\n//\t\tcout << test[i] << \"" \"" << test.size();\n//\t}\n\treturn 0;\n}",MULTIPLE_ERROR,2023,1880 1575024923955519488,147710752d8e8081300c289a748f858e03386bd89e19cc4b252f6fc5b9bd7b4f,2022-09-28 15:29:39,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nlong long num;\nint main()\n{\n\tint index,min,count;\n\tint t,m,n,i,j,k;\n\tcin>>t;\n\tint a[2000];\n\tint b[2000];\n\tfor(i = 0; i < t; i++)\n\t{\n\t\tmemset(a,0,sizeof(a));\n\t\tmemset(b,0,sizeof(b));\n\t\tcin>>n>>m;\n\t\tcin>>num;\n\t\tfor(j = n-1; j >= 0; j--)\n\t\t{\n\t\t\ta[j] = num % 10;\n\t\t\tnum /= 10;\n\t\t}\n\t\tindex = -1;\n\t\tmin = 1000;\n\t\tcount = 0;\n\t\twhile(count<(n-m)){\n\t\t\tfor(k = 0; k < n; k++)\n\t\t\t{\n\t\t\t\tif(a[k]<=min){\n\t\t\t\t\tmin = a[k];\n\t\t\t\t\tindex = k;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcount++;\n\t\t\tb[index] = min;\n\t\t\ta[index] = 10;\n\t\t\tmin = 10;\n\t\t}\n\t\tfor(j = 0; j < n; j++)\n\t\t{\n\t\t\tif(b[j]!=0){\n\t\t\t\tcout<\n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n \n\t\t//sort(v.begin(),v.end());\n\t\tfor(j=0;j<(rate-bag);j++){\n\t\t\tcout << v[j];\n\t\t}\n if(i!=n-1){\n \tcout << endl;\n }\n\t\n\t\tv.clear();\n \n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,68,576 1575025089466949632,2dd7bb66c80a138fb2462b44a4d99cbdf9ad0975e33734cf9f0d90e880c85eb8,2022-09-28 15:30:18,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,#include\n#include\nusing namespace std;\nint main()\n{\n \tvector v;\n\tfor(int i=0;i<5;i++){\n\t \tv.push_back(i);\n\t}\n\tcout << v[i] << endl; \n\treturn 0;\n},COMPILE_ERROR,0,0 1575025094819299328,8de0fd024873b9ef829fc08bca46721f6a925694f0213d6c625a113b272c126d,2022-09-28 15:30:19,C++,10.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#define ll long long\n#define ull signed long long\n#define maxn 200020\nusing namespace std;\n\nll n, m, T;\n\n\n\nint main()\n{\n\n cin>>T;\n while(T--){\n cin>>n>>m;\n string s;\n cin>>s;\n for(int i=1;i=0&&m>0&&s[a]=0&&m>0;i--,m--){\n s=s.substr(0,i);\n }\n cout<\n\nint main(){ \n int t;\n scanf(\""%d\"",&t);\n int n,m;\n for(int cnt = 0; cnt <= t;cnt++){\n scanf(\""%d %d\"",&n,&m);\n int p[n];\n int lt;\n for(int cmt = 0;cmt < n;cmt++){\n scanf(\""%d\"",&p[cmt]);\n }\n int ms = 2;\n int x = n;\n for(int count = 1;count <= m;count++){\n for(;ms + 1 < x;x--){\n p[ms] = p[ms+1];\n ms++;\n if(ms + 1 == x - 1){\n ms = 2;\n break;\n }\n }\n }\n for(int cnt2 = 0;cnt2 < n;cnt2++){\n if(p[cnt2] == 0){\n break;\n } else {\n printf(\""%d\"",p[cnt2]);\n }\n }\n }\n\n return 0;\n}",MULTIPLE_ERROR,2088,716 1575025233638178816,4523cc430c4795f808a1cbc9a621be9340e9d1aa07c6b2181b5c0d1a9ab6feb3,2022-09-28 15:30:52,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nconst int N = 2e5 +10;\nmap mp;\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n string s;\n cin>>s;\n int count=0;\n for(int i=0;i\nusing namespace std;\nconst int N = 2e5 +10;\nmap mp;\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n string s;\n cin>>s;\n int count=0;\n for(int i=0;i\nvoid deleteMinNum(char s[]);\nvoid Print(char s[]);\n\nint main(){\n\tchar s[200000];\n\tint t;\n\tint n;//n组数据 \n\tscanf(\""%d\"",&n);\n\tfor(int cnt=0;cntmin&&t>0&&t<10) {\n\t\t\tmin=t;\n\t\t\tmin1=cnt;\n\t\t}\n\t}\n\ts[min1]='a';\n}\n\nvoid Print(char s[]){\n\tfor(int cnt=0;s[cnt]!=0;cnt++){\n\t\tif(s[cnt]=='a');\n\t\telse printf(\""%c\"",s[cnt]);\n\t}\n\tprintf(\""\\n\"");\n}",MULTIPLE_ERROR,2032,436 1575025531806638080,27d26e76d37de037dc307795981186768ad9ee1cd4523ae31c7b2a119332ccef,2022-09-28 15:32:03,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n\nint main(){\n int T = 0;\n int n = 0,m = 0;\n scanf(\""%d\"",&T);\n for(int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%d\"",c[j]);\n }\n printf(\""\\n\"");\n free(a);\n free(c);\n }\n \n return 0;\n}",WRONG_ANSWER,517,2536 1575025591550300160,4523cc430c4795f808a1cbc9a621be9340e9d1aa07c6b2181b5c0d1a9ab6feb3,2022-09-28 15:32:18,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nconst int N = 1e7 +10;\nmap mp;\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n string s;\n cin>>s;\n int count=0;\n for(int i=0;i\n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n \n for(int k=0;k\n#include\nusing namespace std;\nstruct num{\n\tint n=99;\n\tint loc;\n};\nvector nums(200004);\nvoid shifdown(int i,int len){\n\tint t = i;\n\tif(i*2<=len && nums[i].n>nums[i*2].n) t = i*2;\n\tif(i*2+1<=len && nums[t].n>nums[i*2+1].n) t = i*2+1;\n\tstruct num numt;\n\tnumt.n = nums[i].n;\n\tnumt.loc = nums[i].loc;\n\tnums[i].n = nums[t].n;\n\tnums[i].loc = nums[t].loc;\n\tnums[t].loc = numt.loc;\n\tnums[t].n = numt.n;\n}\nint main(){\n\tcin.tie(0);\n\tcout.tie(0);\n\tint T,n,m,min=10,minloc=0;\n\tcin>>T;\n\twhile(T--){\n\t\tcin>>n>>m;\n\t\tvector book(n+10);\n\t\tvector s(n+10);\n\t\tgetchar();\n\t\tfor(int i=0;i>s[i];\n\t\t\tif(inums[1].n){\n\t\t\t\tnums[1].n = s[i-1]-'0';\n\t\t\t\tnums[1].loc = i-1;\n\t\t\t\tshifdown(1,m);\n\t\t\t}\n\t\t}\n\t\tfor(int i=1;i<=m;i++){\n\t\t\tbook[nums[i].loc] = 1;\n\t\t}\n\t\tfor(int i=0;i\n#include \n\nint main(){\n int T = 0;\n int n = 0,m = 0;\n scanf(\""%d\"",&T);\n for(int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%d\"",c[j]);\n }\n printf(\""\\n\"");\n free(a);\n free(c);\n }\n \n return 0;\n}",WRONG_ANSWER,561,2476 1575026011542736896,72c931a1e7902607f487002f240eeafc7b62cb4cc5e3331fef34b50750044fe9,2022-09-28 15:33:58,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int t= sc.nextInt();\n for (int i = 0; i Integer.parseInt(s.substring(1,2))){\n s=s.substring(1);\n n--;\n }\n\n int max=0;\n for (int l = 0; l < n; l++) {\n max=Math.max(Integer.parseInt(s.substring(l,l+1)),max);\n }\n for (int l = 0; l \nvoid deleteMinNum(char s[]);\nvoid Print(char s[]);\n\nint main(){\n\tchar s[200000];\n\tint t;\n\tint n;//n组数据 \n\tscanf(\""%d\"",&n);\n\tfor(int cnt=0;cntmin&&t>0&&t<10) {\n\t\t\tmin=t;\n\t\t\tmin1=cnt;\n\t\t}\n\t}\n\ts[min1]='a';\n}\n\nvoid Print(char s[]){\n\tfor(int cnt=0;s[cnt]!=0;cnt++){\n\t\tif(s[cnt]=='a');\n\t\telse printf(\""%c\"",s[cnt]);\n\t}\n\tprintf(\""\\n\"");\n}",MULTIPLE_ERROR,2035,584 1575026021000896512,f0cdc2ebeae7f2f79bd78fafe45199a81f6afcbf7c00a8fbd6308842dfab999b,2022-09-28 15:34:00,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nstruct num{\n\tint n=99;\n\tint loc;\n};\nvector nums(200004);\nvoid shifdown(int i,int len){\n\tint t = i;\n\tif(i*2<=len && nums[i].n>nums[i*2].n) t = i*2;\n\tif(i*2+1<=len && nums[t].n>nums[i*2+1].n) t = i*2+1;\n\tstruct num numt;\n\tnumt.n = nums[i].n;\n\tnumt.loc = nums[i].loc;\n\tnums[i].n = nums[t].n;\n\tnums[i].loc = nums[t].loc;\n\tnums[t].loc = numt.loc;\n\tnums[t].n = numt.n;\n}\nint main(){\n\tcin.tie(0);\n\tcout.tie(0);\n\tint T,n,m,min=10,minloc=0;\n\tcin>>T;\n\twhile(T--){\n\t\tcin>>n>>m;\n\t\tvector book(n+10);\n\t\tvector s(n+10);\n\t\tgetchar();\n\t\tfor(int i=0;i>s[i];\n\t\t\tif(i=nums[1].n){\n\t\t\t\tnums[1].n = s[i-1]-'0';\n\t\t\t\tnums[1].loc = i-1;\n\t\t\t\tshifdown(1,m);\n\t\t\t}\n\t\t}\n\t\tfor(int i=1;i<=m;i++){\n\t\t\tbook[nums[i].loc] = 1;\n\t\t}\n\t\tfor(int i=0;iInteger.parseInt(s.substring(1,2))){\n s=s.substring(1);\n n--;\n break;\n }\n\n int max=0;\n for (int l = 0; l < n; l++) {\n max=Math.max(Integer.parseInt(s.substring(l,l+1)),max);\n }\n for (int l = 0; l \n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n \n \n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n \n\t\t//sort(v.begin(),v.end());\n\t\tfor(j=0;j<2;j++){\n\t\t\tcout << v[j];\n\t\t}\n if(i!=n-1){\n \tcout << endl;\n }\n\t\n\t\tv.clear();\n **/\n\t}\n\t\n\treturn 0;\n}",COMPILE_ERROR,0,0 1575026313566183424,2dd7bb66c80a138fb2462b44a4d99cbdf9ad0975e33734cf9f0d90e880c85eb8,2022-09-28 15:35:10,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n \n \n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n \n\t\t//sort(v.begin(),v.end());\n\t\tfor(j=0;j<2;j++){\n\t\t\tcout << v[j];\n\t\t}\n if(i!=n-1){\n \tcout << endl;\n }\n\t\n\t\tv.clear();\n \n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,70,728 1575026376166166528,61c901c84484e650e7344cad6a5814072ecef06d395030c2b34b425aad62bd4a,2022-09-28 15:35:25,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nint main(){\n int T;\n long long m,n,o,count=0,s;\n scanf(\""%d\"",&T);\n for(int i=0;i t=new Stack<>();\n t.push(a2.charAt(0));\n for(int j=1;j0){\n t.pop();\n w--;\n }\n else {\n break;\n }\n }\n t.push(a2.charAt(j));\n }\n while(w>0){\n t.pop();\n w--;\n }\n int q=1;\n int r=Integer.valueOf(t.pop()-'0')*q;\n q=q*10;\n while (!t.empty()){\n r=r+q*Integer.valueOf(t.pop()-'0');\n q=q*10;\n }\n if(i\n#include\nvoid fun(char a[],int n,int m){\n int j;\n if(m==0){\n printf(\""%s\\n\"",a);\n return ;\n }\n for(j=0;ja[j+1]){\n break;\n }\n }\n if(j!=n-1){\n for(;j\n#include \n\nint main(){\n int T = 0;\n int n = 0,m = 0;\n scanf(\""%d\"",&T);\n for(int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%d\"",c[j]);\n }\n printf(\""\\n\"");\n free(a);\n free(c);\n }\n \n return 0;\n}",WRONG_ANSWER,524,2440 1575026534060740608,4905d4c5efe6e16009f93519337d5e0254fc0e5490e8d6e475f970a98bfd5035,2022-09-28 15:36:02,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\n#include\nusing namespace std;\ntypedef long long ll;\nll a[200010];\nint main()\n{\n int t;\n cin >> t;\n while (t--)\n {\n string x;\n int n,m;\n cin >> n >> m;\n cin >> x;\n memset(a,0,sizeof(a));\n for(int i=0;imax)\n {\n max=a[j];\n flag=j;\n }\n }\n a[flag]=0;\n }\n for(int i=0;iInteger.parseInt(s.substring(1,2))){\n s=s.substring(1);\n n--;\n break;\n }\n int max=0;\n for (int l = 0; l < n; l++) {\n max=Math.max(Integer.parseInt(s.substring(l,l+1)),max);\n }\n for (int l = 0; l \n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n \n \n\t\twhile(num!=0){\n\t\t\tint temp = num%10;\n\t\t\tv.push_back(temp);\n\t\t\tnum = num/10;\n\t\t}\n \n\t\tsort(v.begin(),v.end());\n /**\n\t\tfor(j=0;j<(rate-bag);j++){\n\t\t\tcout << v[j];\n\t\t}\n if(i!=n-1){\n \tcout << endl;\n }\n\t**/\n cout << v[0];\n\t\tv.clear();\n \n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,65,624 1575026764298674176,02f8d0fdc995e18e093dffd10d8c3b3b6b0b7ca2e039bb28b1c5795c3f51842a,2022-09-28 15:36:57,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int t = sc.nextInt();\n for (int i = 0; i < t; i++) {\n int n = sc.nextInt();\n int m = sc.nextInt();\n sc.nextLine();\n String s = sc.nextLine();\n char[] chars = s.toCharArray();\n for (int i1 = 0; i1 < m; i1++) {\n for (int i2 = 1; i2 < n; i2++) {\n if(chars[i2]>chars[i2-1]){\n chars[i2-1]=0;\n m--;\n }\n }\n }\n for (int i1 = 9; i1 > 0; i1--) {\n if(m==0)break;\n int i2;\n i2=Arrays.binarySearch(chars,(char)(i1+'0'));\n for (i2 = 0; i2 < n; i2++) {\n if(m==0)break;\n if(chars[i2]==(char)(i1+'0')){\n m--;\n chars[i2]='0';\n }\n }\n }\n for (int i1 = 0; i1 < n; i1++) {\n if(chars[i1]!='0'){\n System.out.print(chars[i1]);\n }\n }\n System.out.println();\n\n\n }\n }\n}",MULTIPLE_ERROR,4788,44720 1575026773404925952,27d26e76d37de037dc307795981186768ad9ee1cd4523ae31c7b2a119332ccef,2022-09-28 15:37:00,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n\nint main(){\n int T = 0;\n int n = 0,m = 0;\n scanf(\""%d\"",&T);\n for(int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%d\"",c[j]);\n }\n printf(\""\\n\"");\n free(a);\n free(c);\n }\n \n return 0;\n}",WRONG_ANSWER,484,2568 1575026893529374720,88b80152288602f35363fbcf695ca1d7eed093d6c31cb9b2a39595f09c2481ce,2022-09-28 15:37:28,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\n\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\tint o;\n\t\n\t\n\tscanf(\""%d\"",&o);\n\t\n\t \n\t\t\n\t\t\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\n\t\tfor(int i=0;inumber[j])\n\t\t\t{\n\t\t\ts=j;\n\t\t\ttemp=number[i];\n\t\t\tnumber[i]=number[s];\n\t\t\tnumber[s]=temp;\t\n\t\t\t}\n\t\t}\n\t\t\n}\t\t\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tfor(int i=0;i\n#include \n\nint main(){\n int T = 0;\n int n = 0,m = 0;\n scanf(\""%d\"",&T);\n for(int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%d\"",c[j]);\n }\n printf(\""\\n\"");\n free(a);\n free(c);\n }\n \n return 0;\n}",WRONG_ANSWER,513,2412 1575026933681446912,2e4cfaba33ff0823e0f5bf02b8b2faebebba18c57e21542326745fc022af7360,2022-09-28 15:37:38,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int t=sc.nextInt();\n int n,m;\n while(t>0){\n StringBuilder ans=new StringBuilder();\n n=Integer.valueOf(sc.next());\n m=Integer.valueOf(sc.next());\n Map map=new HashMap<>();\n int[][] num=new int[n][2];\n String s=sc.next();\n int len=s.length();\n for(int i=0;i{\n if (a[0]!=b[0])return a[0]-b[0];\n else return b[1]-a[1];\n });\n for(int i= num.length-1;i>=num.length-m;i--){\n map.put(num[i][1],0);\n }\n for(int i=0;i\n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n \n \n\t\t for(int k=0;k\nint main(){\n int T,temp,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0;iarr[y]){\n temp = arr[x];\n arr[x] = arr[y];\n arr[y] = temp;\n }\n }\n }\n for(int z = 0;z<(n-m);z++){\n printf(\""%d\"",arr[z]);\n }\n printf(\""\\n\"");\n }\n return 0;\n}",MULTIPLE_ERROR,2022,1052 1575027205103665152,8de0fd024873b9ef829fc08bca46721f6a925694f0213d6c625a113b272c126d,2022-09-28 15:38:42,C++,10.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#define ll long long\n#define ull signed long long\n#define maxn 200020\nusing namespace std;\n\nll n, m, T;\n\n\n\nint main()\n{\n\n cin>>T;\n while(T--){\n cin>>n>>m;\n string s;\n cin>>s;\n for(int i=1;i=0&&m>0&&s[a]=0&&m>0;i--,m--){\n s=s.substr(0,i);\n }\n cout<\nint main(){\n int T,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(int l=x_1; lInteger.parseInt(s.substring(1,2))){\n s=s.substring(1);\n n--;\n flag=1;\n break;\n }\n int max=0;\n for (int l = 0; l < n; l++) {\n max=Math.max(Integer.parseInt(s.substring(l,l+1)),max);\n }\n for (int l = 0; l \nusing namespace std;\n\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\tint o;\n\tscanf(\""%d\"",&o);\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\tfor(int i=0;inumber[j])\n\t\t\t{\n\t\t\ts=j;\n\t\t\ttemp=number[i];\n\t\t\tnumber[i]=number[s];\n\t\t\tnumber[s]=temp;\t\n\t\t\t}\n\t\t}\n\t\t\n}\t\t\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\t\tfor(int i=0;i\nint main(){\n int T,temp,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0;iarr[y]){\n temp = arr[x];\n arr[x] = arr[y];\n arr[y] = temp;\n }\n }\n }\n for(int z = 0;z<(n-m);z++){\n printf(\""%d\"",arr[z]);\n }\n if(i\n#include\nusing namespace std;\nstruct num{\n\tint n=99;\n\tint loc;\n};\nvector nums(200004);\nvoid shifdown(int i,int len){\n\tint t = i;\n\tif(i*2<=len && nums[i].n>nums[i*2].n) t = i*2;\n\tif(i*2+1<=len && nums[t].n>nums[i*2+1].n) t = i*2+1;\n\tstruct num numt;\n\tnumt.n = nums[i].n;\n\tnumt.loc = nums[i].loc;\n\tnums[i].n = nums[t].n;\n\tnums[i].loc = nums[t].loc;\n\tnums[t].loc = numt.loc;\n\tnums[t].n = numt.n;\n}\nint main(){\n\tcin.tie(0);\n\tcout.tie(0);\n\tint T,n,m,min=10,minloc=0;\n\tcin>>T;\n\twhile(T--){\n\t\tcin>>n>>m;\n\t\tvector book(n+10);\n\t\tvector s(n+10);\n\t\tgetchar();\n\t\tfor(int i=0;i>s[i];\n\t\t\tif(inums[1].n){\n\t\t\t\tnums[1].n = s[i-1]-'0';\n\t\t\t\tnums[1].loc = i-1;\n\t\t\t\tshifdown(1,m);\n\t\t\t\tflag = 0;\n\t\t\t}else if((s[i-1]-'0')==nums[1].n){\n\t\t\t\tif(!flag){\n\t\t\t\t\tnums[1].n = s[i-1]-'0';\n\t\t\t\t\tnums[1].loc = i-1;\n\t\t\t\t\tshifdown(1,m);\n\t\t\t\t\tflag = 0;\n\t\t\t\t}else flag =1;\n\t\t\t}else flag =1;\n\t\t}\n\t\tfor(int i=1;i<=m;i++){\n\t\t\tbook[nums[i].loc] = 1;\n\t\t}\n\t\tfor(int i=0;i\n#define ll long long\n#define ull signed long long\n#define maxn 200020\nusing namespace std;\n\nll n, m, T;\n\n\n\nint main()\n{\n\n cin>>T;\n while(T--){\n cin>>n>>m;\n string s;\n cin>>s;\n for(int i=1;i=0&&m>0&&s[a]\nint main(){\n int T,temp,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0;iarr[y]){\n temp = arr[x];\n arr[x] = arr[y];\n arr[y] = temp;\n }\n }\n }\n for(int z = 0;z<(n-m);z++){\n printf(\""%d\"",arr[z]);\n }\n if(i\n#include \n\nint main(){\n int T = 0;\n int n = 0,m = 0;\n scanf(\""%d\"",&T);\n for(int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%d\"",c[j]);\n }\n printf(\""\\n\"");\n free(a);\n free(c);\n }\n \n return 0;\n}",WRONG_ANSWER,492,2532 1575027788623208448,88b80152288602f35363fbcf695ca1d7eed093d6c31cb9b2a39595f09c2481ce,2022-09-28 15:41:02,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\n\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\tint o;\n\t\n\t\n\tscanf(\""%d\"",&o);\n\t\n\t \n\t\t\n\t\t\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\n\t\tfor(int i=0;inumber[j])\n\t\t\t{\n\t\t\ts=j;\n\t\t\ttemp=number[i];\n\t\t\tnumber[i]=number[s];\n\t\t\tnumber[s]=temp;\t\n\t\t\t}\n\t\t}\n\t\t\n}\t\t\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tfor(int i=0;i\nusing namespace std;\n\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\tint o;\n\t\n\t\n\tscanf(\""%d\"",&o);\n\t\n\t \n\t\t\n\t\t\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\n\t\tfor(int i=0;inumber[j])\n\t\t\t{\n\t\t\ts=j;\n\t\t\ttemp=number[i];\n\t\t\tnumber[i]=number[s];\n\t\t\tnumber[s]=temp;\t\n\t\t\t}\n\t\t}\n\t\t\n}\t\t\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tfor(int i=0;i\n#include \n\nint main(){\n \n int T;\n scanf(\""%d\\n\"",&T);\n long n,m;\n long min = 0;\n long oriprice;\n long newprice;\n \n \n int i = 1;\n \n for ( ; i<=T ;i++){\n \n scanf(\""%d %d\\n\"",&n,&m);\n scanf(\""%lf\"",&oriprice);\n \n int num[n+1];\n \n for ( ; m>0 ;m--){\n \n int j = 1;\n for ( ; j<=n ;j++){\n \n num[j] = oriprice / pow(10,j-1) % 10\n \n }\n \n \n \n }\n \n \n \n }\n}",COMPILE_ERROR,0,0 1575027911843467264,be2e545b6c5b79b41fea22acf0286e5e6632a4650c08c8338fa08c68ff4da153,2022-09-28 15:41:31,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n\nint main(){\n \n int T;\n scanf(\""%d\\n\"",&T);\n long n,m;\n long min = 0;\n long oriprice;\n long newprice;\n \n \n int i = 1;\n \n for ( ; i<=T ;i++){\n \n scanf(\""%d %d\\n\"",&n,&m);\n scanf(\""%lf\"",&oriprice);\n \n int num[n+1];\n \n for ( ; m>0 ;m--){\n \n int j = 1;\n for ( ; j<=n ;j++){\n \n num[j] = oriprice / pow(10,j-1) % 10\n \n }\n \n \n \n }\n \n \n \n }\n}",COMPILE_ERROR,0,0 1575028002918588416,592057737fc3599e5601bfce55e0bfb4da7006a436deca9a35e24ebb019b4a39,2022-09-28 15:41:53,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nint main(){\n\tint t,n,m,i,j,k;\n\tchar a[200000];\n\tscanf(\""%d\"",t);\n\tfor(i=0;i0){\n\t \ta[j]=getchar();\n\t \tj--;\n\t }\n\t \n\t}\n\t\n\treturn 0;\n} ",SEGMENTATION_FAULT,40,584 1575028201225699328,be2e545b6c5b79b41fea22acf0286e5e6632a4650c08c8338fa08c68ff4da153,2022-09-28 15:42:40,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n\nint main(){\n \n int T;\n scanf(\""%d\\n\"",&T);\n long n,m;\n long min = 0;\n long oriprice;\n long newprice;\n long power;\n \n int i = 1;\n \n for ( ; i<=T ;i++){\n \n scanf(\""%d %d\\n\"",&n,&m);\n scanf(\""%lf\"",&oriprice);\n \n int num[n+1];\n \n for ( ; m>0 ;m--){\n \n int j = 1;\n for ( ; j<=n ;j++){\n \n power = pow(10,j-1);\n num[j] = oriprice / power % 10;\n \n }\n \n \n \n }\n \n \n \n }\n}",RUNTIME_ERROR,41,608 1575028202340966400,2dd7bb66c80a138fb2462b44a4d99cbdf9ad0975e33734cf9f0d90e880c85eb8,2022-09-28 15:42:40,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n \n \n\t\t for(int k=0;kInteger.parseInt(s.substring(1,2))){\n s=s.substring(1);\n n--;\n flag=1;\n continue;\n }\n int max=0;\n for (int l = 0; l < n; l++) {\n max=Math.max(Integer.parseInt(s.substring(l,l+1)),max);\n }\n for (int l = 0; l \n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n \n \n\t\t for(int k=0;k\n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n \n \n\t\t for(int k=0;k\n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n \n \n\t\t for(int k=0;k\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n cin>>n;\n for(int i=0;i>m>>h;\n string str;\n for(int k=0;k>str;\n if(str[j]>maxn)\n {\n maxn=str[j];\n str[j]='0';\n }\n for(int l=0;l\nusing namespace std;\nconst int N = 2e5 +10;\nmap mp;\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n int s;\n cin>>s;\n while(s!=0)\n {\n mp[s%10]++;\n s/=10;\n }\n int cnt = 0;\n for(int i=1;i<=9;i++)\n {\n for(int j=1;j<=mp[i]&&cnt0){\n StringBuilder ans=new StringBuilder();\n n=Integer.valueOf(sc.next());\n m=Integer.valueOf(sc.next());\n Map map=new HashMap<>();\n int[][] num=new int[n][2];\n String s=sc.next();\n int len=s.length();\n for(int i=0;i{\n if (a[0]!=b[0])return a[0]-b[0];\n else return b[1]-a[1];\n });\n for(int i= num.length-1;i>=num.length-m;i--){\n map.put(num[i][1],0);\n }\n for(int i=0;i 0; i1--) {\n if(m==0)break;\n int i2;\n i2=Arrays.binarySearch(chars,(char)(i1+'0'));\n for (i2 = 0; i2 < n; i2++) {\n if(m==0)break;\n if(chars[i2]==(char)(i1+'0')){\n m--;\n chars[i2]='0';\n }\n }\n }\n for (int i1 = 0; i1 < n; i1++) {\n if(chars[i1]!='0'){\n System.out.print(chars[i1]);\n }\n }\n System.out.println();\n\n\n }\n }\n}",MULTIPLE_ERROR,4783,42436 1575029273705037824,72c931a1e7902607f487002f240eeafc7b62cb4cc5e3331fef34b50750044fe9,2022-09-28 15:46:56,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int t= sc.nextInt();\n for (int i = 0; i =Integer.parseInt(s.substring(1,2))){\n s=s.substring(1);\n n--;\n flag=1;\n continue;\n }\n int max=0;\n for (int l = 0; l < n; l++) {\n max=Math.max(Integer.parseInt(s.substring(l,l+1)),max);\n }\n for (int l = 0; l \n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n \n \n\t\t for(int k=0;k\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n cin>>n;\n for(int i=0;i>m>>h;\n string str;\n cin>>str;\n for(int k=0;kmaxn)\n {\n maxn=str[j];\n str[j]=0;\n }\n }\n for(int l=0;l\nusing namespace std;\ntypedef long long ll;\nconst int maxn=5e5+10; \n#define rep(i,a,b) for(int i=a;i<=b;i++)\n#define repd(i,a,b) for(int i=a;i>=b;i--)\n#define pb push_back\n\nint main(){\n\tint T;\n\tcin>>T;\n\twhile(T--){\n\t\tstring s;\n\t\tint n,m;\n\t\tcin>>n>>m>>s;\n\t\tvector v[10];\n\t\trep(i,0,n-1) v[s[i]-'0'].pb(i);\n\t\tint last=0;\n\t\tstring ans=\""\"";\n\t\tbool flag=false;\n\t\trep(i,1,9){\n\t\t\tfor(int j=0;j\n\n\n\nint main()\n{\n\tint n,i,t,z,min,p,m,cnt=0;\n\tscanf(\""%d\"",&p);\n\tchar money[200000];\n\tchar mi[200000];\n\tfor(z=0;z=n-m)\n\t\t\t\t{\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tif(cnt==n)\n\t\t\t\t\t{\n\t\t\t\t\t\tmi[i+1]=money[t+1];\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(i=1;i\n#include \n\nint main(){\n \n int T;\n scanf(\""%d\\n\"",&T);\n long n,m;\n long min = 0;\n long oriprice;\n long newprice;\n long power;\n \n int i = 1;\n \n for ( ; i<=T ;i++){\n \n scanf(\""%d %d\\n\"",&n,&m);\n scanf(\""%lf\"",&oriprice);\n \n int num[n+1];\n \n for ( ; m>0 ;m--){\n \n int j = 1;\n for ( ; j<=n ;j++){\n \n power = pow(10,j-1);\n num[j] = oriprice / power % 10;\n \n for (int f = 1 ;f<=n ;f++){\n newprice = 0;\n for (int k = 1;k<=n && k!= f;k++){\n newprice += num[k] * pow(10,k-1);\n }\n \n if (newprice < min){\n\n min = newprice;\n \n }\n }\n \n oriprice = min;\n }\n \n printf(\""%ld\\n\"",newprice);\n \n \n \n }\n \n \n \n }\n \n return 0;\n}",RUNTIME_ERROR,47,604 1575030398269243392,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-09-28 15:51:24,Java,10.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\n \n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int t = sc.nextInt();\n for (int i = 0; i < t; i++) {\n //外卖价格长度 红包数量\n int n = sc.nextInt(),m = sc.nextInt();\n\n String s = sc.next();\n// System.out.println(s);\n\n int lastIndex = -1;\n char[] chars = s.toCharArray();\n for (int j = 0; j < n - m; j++) {\n int minNum = 10;\n int l = lastIndex + 1;\n int r = m + j;\n for (int k = l; k <= r; k++) {\n if(Integer.valueOf(Character.toString(chars[k]))\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n cin>>n;\n for(int i=0;i>m>>h;\n string str;\n cin>>str;\n int x;\n for(int k=0;kmaxn)\n {\n maxn=str[j];\n x=j;\n }\n }\n str[x]='0';\n }\n for(int l=0;l\n#include\nusing namespace std;\nstruct num{\n\tint n=99;\n\tint loc;\n};\nvector nums(200004);\nvoid shifdown(int i,int len){\n\tint t = i;\n\tif(i*2<=len && nums[i].n>nums[i*2].n) t = i*2;\n\tif(i*2+1<=len && nums[t].n>nums[i*2+1].n) t = i*2+1;\n\tstruct num numt;\n\tnumt.n = nums[i].n;\n\tnumt.loc = nums[i].loc;\n\tnums[i].n = nums[t].n;\n\tnums[i].loc = nums[t].loc;\n\tnums[t].loc = numt.loc;\n\tnums[t].n = numt.n;\n}\nint main(){\n\tcin.tie(0);\n\tcout.tie(0);\n\tint T,n,m,min=10,minloc=0;\n\tcin>>T;\n\twhile(T--){\n\t\tcin>>n>>m;\n\t\tvector book(n+10);\n\t\tvector s(n+10);\n\t\tgetchar();\n\t\tfor(int i=0;i>s[i];\n\t\t\tif(inums[1].n){\n\t\t\t\tbook[nums[1].loc] =0;\n\t\t\t\tbook[i-1] = 1;\n\t\t\t\tnums[1].n = s[i-1]-'0';\n\t\t\t\tnums[1].loc = i-1;\n\t\t\t\tshifdown(1,m);\n\t\t\t\t\n\t\t\t}else if((s[i-1]-'0')==nums[1].n){\n\t\t\t\tint flag =0;\n\t\t\t\tfor(int j=nums[1].loc+1;j<=i-2;j++){\n\t\t\t\t\tif(book[j]==0) flag = 1;\n\t\t\t\t}\n\t\t\t\tif(!flag){\n\t\t\t\t\tbook[nums[1].loc] =0;\n\t\t\t\t\tbook[i-1] = 1;\n\t\t\t\t\tnums[1].n = s[i-1]-'0';\n\t\t\t\t\tnums[1].loc = i-1;\n\t\t\t\t\tshifdown(1,m);\n\t\t\t\t\t\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n//\t\tfor(int i=1;i<=m;i++){\n//\t\t\tbook[nums[i].loc] = 1;\n//\t\t}\n\t\tfor(int i=0;i\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n cin>>n;\n for(int i=0;i>m>>h;\n string str;\n cin>>str;\n int x;\n for(int k=0;kmaxn)\n {\n maxn=str[j];\n x=j;\n }\n }\n str[x]='0';\n }\n for(int l=0;l\n#include\n#include\n#include\n#define MAX 10001\nusing namespace std;\nint main()\n{\n\tstring s;\n\tlong long int n, m, t;\n\tcin >> t;\n\tfor (int i = 0; i < t; i++)\n\t{\n\t\t\n\t\tcin >> n >> m;\n\t\tcin >> s;\n\n\t\tfor (int k = 0; k < m; k++)\n\t\t{\n\t\t\tlong long int max = -1, index;\n\t\t\tfor (int j = 0; j < n; j++)\n\t\t\t{\n\t\t\t\tif (s[j] > max)\n\t\t\t\t{\n\t\t\t\t\tmax = s[j];\n\t\t\t\t\tindex = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts[index] = -1;\n\t\t}\n\t\tfor (int m = 0; m < n; m++)\n\t\t{\n\t\t\tif (s[m] != -1)\n\t\t\t\tcout << s[m] - '0';\n\t\t}\n\t\tif (i != t - 1)\n\t\t\tcout << endl;\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,2029,872 1575030708886396928,396148cfae7524856ec5ae16472dfea70c5cc1a6ee2a30bfba94a59ee40fd4fc,2022-09-28 15:52:38,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n cin>>n;\n for(int i=0;i>m>>h;\n string str;\n cin>>str;\n int x;\n for(int k=0;kmaxn)\n {\n maxn=str[j];\n x=j;\n }\n }\n str[x]='0';\n }\n for(int l=0;l\n\n\n\nint main()\n{\n\tint n,i,t,z,min,p,m,cnt=1;\n\tscanf(\""%d\"",&p);\n\tchar money[200000];\n\tchar mi[200000];\n\tfor(z=0;zn-m)\n\t\t\t\t{\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tif(cnt==n)\n\t\t\t\t\t{\n\t\t\t\t\t\tmi[i+1]=money[t+1];\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(i=0;i\n\n\n\nint main()\n{\n\tint n,i,t,z,min,p,m,cnt=1;\n\tscanf(\""%d\"",&p);\n\tchar money[200000];\n\tchar mi[200000];\n\tfor(z=0;zn-m)\n\t\t\t\t{\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tif(cnt==n)\n\t\t\t\t\t{\n\t\t\t\t\t\tmi[i+1]=money[t+1];\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(i=0;i\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n cin>>n;\n for(int i=0;i>m>>h;\n string str;\n cin>>str;\n long long x;\n for(long long k=0;kmaxn)\n {\n maxn=str[j];\n x=j;\n }\n }\n str[x]='0';\n }\n for(long long l=0;l\nusing namespace std;\n\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\tlong int o;\n\t\n\t\n\tcin>>o;\n\t\n\t \n\t\t\n\t\t\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\n\t\tfor(int i=0;inumber[j])\n\t\t\t{\n\t\t\ts=j;\n\t\t\ttemp=number[i];\n\t\t\tnumber[i]=number[s];\n\t\t\tnumber[s]=temp;\t\n\t\t\t}\n\t\t}\n\t\t\n}\t\t\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tfor(int i=0;i\n#include \n\nint main(){\n \n int T;\n scanf(\""%d\\n\"",&T);\n long n,m;\n long min = 0;\n long oriprice;\n long newprice;\n long power;\n \n int i = 1;\n \n for ( ; i<=T ;i++){\n \n scanf(\""%d %d\\n\"",&n,&m);\n scanf(\""%lf\\n\"",&oriprice);\n \n int num[n+1];\n \n //\n for ( ; m>0 ;m--){\n \n int j = 1;\n for ( ; j<=n ;j++){\n \n power = pow(10,j-1);\n num[j] = oriprice / power % 10;\n }\n // record every number on each position\n for (int f = 1 ;f<=n ;f++){\n newprice = 0;\n for (int k = 1;k<=n && k!= f;k++){\n newprice += num[k] * pow(10,k-1);\n }\n \n if (newprice < min){\n\n min = newprice;\n \n }\n }\n \n oriprice = min;\n \n printf(\""%ld\\n\"",oldprice);\n \n }\n \n }\n //every cases\n \n return 0;\n}",COMPILE_ERROR,0,0 1575031515874680832,569a6db1313d25f282bd0ed487c37a89c1bd48433e81dbc2951ddaf1a4ee6ccb,2022-09-28 15:55:50,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[200000]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t cin>>str;\n \t \n \t for(int e=0;e=max){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t\t\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j0;v--){\n\t\t \t\tif(str[v]\n#include \n\nint main(){\n \n int T;\n scanf(\""%d\\n\"",&T);\n long n,m;\n long min = 0;\n long oriprice;\n long newprice;\n long power;\n \n int i = 1;\n \n for ( ; i<=T ;i++){\n \n scanf(\""%d %d\\n\"",&n,&m);\n scanf(\""%lf\\n\"",&oriprice);\n \n int num[n+1];\n \n //\n for ( ; m>0 ;m--){\n \n int j = 1;\n for ( ; j<=n ;j++){\n \n power = pow(10,j-1);\n num[j] = oriprice / power % 10;\n }\n // record every number on each position\n for (int f = 1 ;f<=n ;f++){\n newprice = 0;\n for (int k = 1;k<=n && k!= f;k++){\n newprice += num[k] * pow(10,k-1);\n }\n \n if (newprice < min){\n\n min = newprice;\n \n }\n }\n \n oriprice = min;\n \n printf(\""%ld\\n\"",oriprice);\n \n }\n \n }\n //every cases\n \n return 0;\n}",RUNTIME_ERROR,34,584 1575031563685552128,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-09-28 15:56:02,Java,10.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\n\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int t = sc.nextInt();\n for (int i = 0; i < t; i++) {\n //外卖价格长度 红包数量\n int n = sc.nextInt(),m = sc.nextInt();\n\n String s = sc.next();\n// System.out.println(s);\n\n int lastIndex = -1;\n for (int j = 0; j < n - m; j++) {\n int minNum = 10;\n int l = lastIndex + 1;\n int r = m + j;\n \n for (int k = l; k <= r; k++) {\n int c = Integer.valueOf(Character.toString(s.charAt(k)));\n if(c\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[200000]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t cin>>str;\n \t \n \t for(int e=0;e=max){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t\t\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j0;v--){\n\t\t \t\tif(str[v]\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[18]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t cin>>str;\n \t \n \t for(int e=0;e=max){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t\t\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j0;v--){\n\t\t \t\tif(str[v]\nusing namespace std;\ntypedef long long ll;\nconst int maxn=5e5+10; \n#define rep(i,a,b) for(int i=a;i<=b;i++)\n#define repd(i,a,b) for(int i=a;i>=b;i--)\n#define pb push_back\n\nint main(){\n\tint T;\n\tcin>>T;\n\twhile(T--){\n\t\tstring s;\n\t\tint n,m;\n\t\tcin>>n>>m>>s;\n\t\tint mm=m;\n\t\tvector v[10];\n\t\trep(i,0,n-1) v[s[i]-'0'].pb(i);\n\t\tint last=0;\n\t\tstring ans=\""\"";\n\t\tbool flag=false;\n\t\trep(i,1,9){\n\t\t\tfor(int j=0;j=n-mm) break;\n\t\t\t\tif(v[i][j]=n-mm) break;\t\t\n\t\t\t}\n\t\t\tif(ans.size()>=n-mm) break;\n\t\t}\n\t\tcout< list = new ArrayList<>();\n char[] chars = s.toCharArray();\n for (char aChar : chars) {\n list.add(aChar);\n }\n\n char z='9';\n while(true){\n int q = list.indexOf(z);\n if(q!=-1){\n list.remove(q);\n m--;\n if(m==0)break;\n }else{\n z--;\n if(z=='0')break;\n }\n }\n\n for (Character character : list) {\n System.out.print(character);\n }\n System.out.print(\""\\n\"");\n }\n\n sc.close();\n }\n}\n",MULTIPLE_ERROR,4903,50280 1575032179120390144,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-09-28 15:58:28,Java,10.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n \n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int t = sc.nextInt();\n \n int n , m ;\n String s;\n for (int i = 0; i < t; i++) {\n //外卖价格长度 红包数量\n n = sc.nextInt();m = sc.nextInt();\n\n s = sc.next();\n// System.out.println(s);\n\n int lastIndex = -1;\n for (int j = 0; j < n - m; j++) {\n int minNum = 10;\n int l = lastIndex + 1;\n int r = m + j;\n\n for (int k = l; k <= r; k++) {\n int c = Integer.parseInt(Character.toString(s.charAt(k)));\n if(c\n#include\n#include\nusing namespace std;\n\nint main() {\n\n\tint T = 0;\n\tint price;\n\tint n, m;\n\tn = 0;\n\tm = 0;\n\tint tmp;\n\tint size;\n\tcin >> T;\n\tvectorarr;\n\tfor (int k = 0; k < T; k++){\n\t\tcin >> n >> m;\n\t\tcin >> price;\n\t\tsize = n - m;\n\n\t\t//将数字拆分成字符串\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ttmp = price % 10;\n\t\t\tprice /= 10;\n\t\t\tarr.push_back(tmp);\n\t\t}\n\t\tsort(arr.begin(), arr.end());\n\t\tarr.resize(size);\n\t\tfor (int i = 0; i < arr.size(); i++) {\n\t\t\tcout << arr[i];\n\t\t}\n cout<\n#include \nint main(){\n int T,n,m,x,a,b,t,i,c;\n b=0;\n scanf(\""%d\"",&T);\n for(a=1;a<=T;a++){\n b=0;\n t=0;\n scanf(\""%d %d\"",&n,&m);\n scanf(\""%d\"",&x);\n do{\n m--;\n for(i=n;i>0;i--){\n c=x/pow(10,i);\n if(i==n){\n b=c;\n }\n if(b<=c){\n t=t+b*pow(10,i-1);\n b=c;\n }\n else {\n t=t+c*pow(10,i-1);\n }\n x=x-c*pow(10,i);\n }\n x=t;\n n--;\n }while(m!=0);\n printf(\""%d\\n\"",x);\n }\n return 0;\n}",MULTIPLE_ERROR,3355,580 1575032364554342400,569a6db1313d25f282bd0ed487c37a89c1bd48433e81dbc2951ddaf1a4ee6ccb,2022-09-28 15:59:13,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[18]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t cin>>str;\n \t \n \t for(int e=0;e=max){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t\t\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j0;v--){\n\t\t \t\tif(str[v]\nusing namespace std;\nint main()\n{\n int t,a[200010]={0},n,m;\n cin>>t;\n for(int i=1;i<=t;i++)\n {\n string c,s;\n cin>>n>>m>>c;\n for(int j=0;j0)\n {\n for(int j=0;j\nusing namespace std;\nint a[191];\nchar s[90];\nint main(){\n int t;\n cin>>t;\n while(t--){\n memset(a,0,sizeof(a));\n int n,m;\n scanf(\""%d%d\"",&n,&m);\n getchar();\n scanf(\""%s\"",s);\n// printf(\""%s\"",s);\n for(int i=0;i=1;i--){\n// printf(\""%d \"",a[i]);\n while(m>0&&a[i]){\n a[i]--;\n m--;\n }\n };\n\n for(int i=0;i\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[20000]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t cin>>str;\n \t \n \t for(int e=0;e=max){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t\t\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j0;v--){\n\t\t \t\tif(str[v]\nusing namespace std;\ntypedef long long ll;\nconst int maxn=5e5+10; \n#define rep(i,a,b) for(int i=a;i<=b;i++)\n#define repd(i,a,b) for(int i=a;i>=b;i--)\n#define pb push_back\n\nint main(){\n\tint T;\n\tcin>>T;\n\twhile(T--){\n\t\tstring s;\n\t\tint n,m;\n\t\tcin>>n>>m>>s;\n\t\tint mm=m;\n\t\tvector v[10];\n\t\trep(i,0,n-1) v[s[i]-'0'].pb(i);\n\t\tint last=-1;\n\t\tstring ans=\""\"";\n\t\trep(i,1,9){\n\t\t\tfor(int j=0;j=n-mm) break;\n\t\t\t\tif(v[i][j]=n-mm) break;\t\t\n\t\t\t}\n\t\t\tif(ans.size()>=n-mm) break;\n\t\t}\n\t\tcout<\nusing namespace std;\n\nstruct c1\n{\n bool operator()(const int &a,const int &b)\n {\n return a>b;\n }\n};\n\nint main()\n{\n cout<<\""35\""<\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[20000]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t char str[n]={0};\n \t cin>>str;\n \t \n \t for(int e=0;e=max){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t\t\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j0;v--){\n\t\t \t\tif(str[v]\nusing namespace std;\n\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\tlong int o;\n\t\n\t\n\tcin>>o;\n\t\n\t \n\t\t\n\t\t\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\n\t\tfor(int i=0;inumber[j])\n\t\t\t\n\t\t\ts=j;\n\t\t\ttemp=number[i];\n\t\t\tnumber[i]=number[s];\n\t\t\tnumber[s]=temp;\t\t\n\t\t\t\n\t\t}\n\t\t\n}\t\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tfor(int i=0;i\nusing namespace std;\n\nstruct c1\n{\n bool operator()(const int &a,const int &b)\n {\n return a>b;\n }\n};\n\nint main()\n{\n cout<<\""35\""<\nusing namespace std;\ntypedef long long ll;\nconst int maxn=5e5+10; \n#define rep(i,a,b) for(int i=a;i<=b;i++)\n#define repd(i,a,b) for(int i=a;i>=b;i--)\n#define pb push_back\n\nint main(){\n\tint T;\n\tcin>>T;\n\twhile(T--){\n\t\tstring s;\n\t\tint n,m;\n\t\tcin>>n>>m>>s;\n\t\tint mm=m;\n\t\tvector v[10];\n\t\trep(i,0,n-1) v[s[i]-'0'].pb(i);\n\t\tint last=-1;\n\t\tstring ans=\""\"";\n\t\trep(i,1,9){\n\t\t\tfor(int j=0;j=n-mm) break;\n\t\t\t\tif(v[i][j]=n-mm) break;\t\t\n\t\t\t}\n\t\t\tif(ans.size()>=n-mm) break;\n\t\t}\n\t\tcout<\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n cin>>n;\n for(int i=0;i>m>>h;\n string str;\n \n cin>>str;\n \n long long x;\n for(long long k=0;kmaxn)\n {\n maxn=str[j];\n x=j;\n }\n }\n str[x]='0';\n }\n for(long long l=0;lInteger.parseInt(s.substring(k+1,k+2))){\n s=s.substring(1);\n n--;\n flag=1;\n k=0;\n break;\n }\n\n if(flag==1){\n continue;\n }\n int max=0;\n for (int l = 0; l < n; l++) {\n max=Math.max(Integer.parseInt(s.substring(l,l+1)),max);\n }\n for (int l = 0; l \nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[20000]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t char str[n]={0};\n \t cin>>str;\n \t \n \t for(int e=0;e=max){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t\t\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j0;v--){\n\t\t \t\tif(str[v]\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[20000]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t char str[n]={0};\n \t cin>>str;\n \t \n \t for(int e=0;e=max){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t\t\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j0;v--){\n\t\t \t\tif(str[v]0&&(ans[modi]-'0')>x&&m>0){\n modi--;\n m--;\n }\n ans[++modi] = (char)(x+'0');\n }\n while (m>0){modi--;m--;}\n for(int k=0;k<=modi;k++)System.out.print(ans[k]);\n System.out.println();\n }\n }\n},MULTIPLE_ERROR,4103,41592 1575033677715427328,88b80152288602f35363fbcf695ca1d7eed093d6c31cb9b2a39595f09c2481ce,2022-09-28 16:04:26,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\n\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\tlong int o;\n\t\n\t\n\tcin>>o;\n\t\n\t \n\t\t\n\t\t\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\n\t\tfor(int i=0;inumber[j])\n\t\t\t\n\t\t\ts=j;\n\t\t\ttemp=number[i];\n\t\t\tnumber[i]=number[s];\n\t\t\tnumber[s]=temp;\t\t\n\t\t\t\n\t\t}\n\t\t\n}\t\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tfor(int i=0;i list =new ArrayList<>();\n for (int i1 = 0; i1 < n; i1++) {\n list.add(chars[i1]-'0');\n }\n for (int i1 = 0; i1 < m; i1++) {\n for (int i2 = 1; i2 < list.size(); i2++) {\n if(list.get(i2)\n\n\n\nint main()\n{\n\tint n,i,t,z,min,p,m,cnt=1,count=0;\n\tscanf(\""%d\"",&p);\n\tchar money[200000];\n\tchar mi[200000];\n\tfor(z=0;zn-m)\n\t\t\t\t{\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tcount++;\n\t\t\t\t\tif(cnt==n)\n\t\t\t\t\t{\n\t\t\t\t\t\tmi[i+1]=money[t+1];\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(i=0;iInteger.parseInt(s.substring(k+1,k+2))){\n s=s.substring(1);\n n--;\n flag=1;\n k=0;\n continue;\n }\n\n\n int max=0;\n for (int l = 0; l < n; l++) {\n max=Math.max(Integer.parseInt(s.substring(l,l+1)),max);\n }\n for (int l = 0; l \nusing namespace std;\nint main(){\n int n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n int i1=0;\n while(num>0){\n a[i1]=num%10;\n num=num/10;\n i1++;\n }\n\n for(int j=0;ja[k+1])swap(a[k],a[k+1]);\n \n }\n }\n for(int j=0;j<(len-shan);j++){\n cout<\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n cin>>n;\n for(int i=0;i>m>>h;\n string str;\n \n cin>>str;\n \n long long x;\n for(long long k=0;kmaxn)\n {\n maxn=str[j];\n x=j;\n }\n }\n str[x]='0';\n }\n for(long long l=0;l\n#include\nusing namespace std;\nint main()\n{\n\tint n;\n cin>>n;\n for(int i=0;i>m>>h;\n string str;\n \n cin>>str;\n \n long long x;\n for(long long k=0;kmaxn)\n {\n maxn=str[j];\n x=j;\n }\n }\n str[x]='0';\n }\n for(long long l=0;l\nusing namespace std;\n\nint main()\n{\n\tint count;\n\tcin >> count;\n\tint num[100000];\n\tfor (int i = 0; i < count; i++)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tstring s;\n\t\tcin >> s;\n\t\tint c = n - m;\n\t\tfor (int i = 0; i < s.size(); i++) {\n\t\t\tnum[i] = s[i] - '0';\n\t\t}\n\t\tint min[10000]={10,10,10,10,10,10,10,10,10};\n\t\tfor (int i = 0; i < c; i++) {\n\t\t\tfor (int j = 0; j < s.size(); j++)\n\t\t\t{\n\t\t\t\tif (min[i] > num[j])\n\t\t\t\t{\n\t\t\t\t\tmin[i] = num[j];\n\t\t\t\t\tnum[j] = 10;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < c; i++)\n\t\t{\n\t\t\tcout << min[i];\n\t\t}\n if(i!=count-1)\n cout<\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n\nusing namespace std;\nint snum[200005];\n\nstruct pp\n{\n\tchar ch;\n\tint num;\n\tstring::iterator it;\n}ppx[200005];\n\nbool cmp(pp a, pp b) {\n\tif(a.ch == b.ch) {\n\t\treturn a.num < b.num;\n\t}\n\treturn a.ch > b.ch;\n}\n\nint main() {\n\tint T, n, m, i = 0;\n\tstring price;\n\tcin >> T;\n\twhile (T--) {\n\t\tcin >> n >> m >> price;\n\t\ti = 0;\n\t\tfor (auto it = price.begin(); it != price.end(); it++, i++) {\n\t\t\tppx[i].ch = price[i];\n\t\t\tppx[i].num = i;\n\t\t\tppx[i].it = it;\n\t\t}\n\t\tsort(ppx, ppx + n, cmp);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcout << ppx[i].ch;\n\t\t}\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tprice.erase(ppx[i].it);\n\t\t}\n\t\tcout << price <\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n\nusing namespace std;\nint snum[200005];\n\nstruct pp\n{\n\tchar ch;\n\tint num;\n\tstring::iterator it;\n}ppx[200005];\n\nbool cmp(pp a, pp b) {\n\tif(a.ch == b.ch) {\n\t\treturn a.num < b.num;\n\t}\n\treturn a.ch > b.ch;\n}\n\nint main() {\n\tint T, n, m, i = 0;\n\tstring price;\n\tcin >> T;\n\twhile (T--) {\n\t\tcin >> n >> m >> price;\n\t\ti = 0;\n\t\tfor (auto it = price.begin(); it != price.end(); it++, i++) {\n\t\t\tppx[i].ch = price[i];\n\t\t\tppx[i].num = i;\n\t\t\tppx[i].it = it;\n\t\t}\n\t\tsort(ppx, ppx + n, cmp);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcout << ppx[i].ch;\n\t\t}\n\t\tcout << price <\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n int i1=0;\n while(num>0){\n a[i1]=num%10;\n num=num/10;\n i1++;\n }\n\n for(int j=0;ja[k+1])swap(a[k],a[k+1]);\n\n }\n }\n for(int j=0;j<(len-shan);j++){\n cout<\n#include\n#include\nusing namespace std;\n\nint main() {\n\n\tint T = 0;\n\tint price;\n\tint n, m;\n\tn = 0;\n\tm = 0;\n\tint tmp;\n\tint size;\n\tcin >> T;\n\tvectorarr;\n\tfor (int k = 0; k < T; k++){\n\t\tcin >> n >> m;\n\t\tcin >> price;\n\t\tsize = n - m;\n\t\t//将数字拆分成字符串\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ttmp = price % 10;\n\t\t\tprice /= 10;\n\t\t\tarr.push_back(tmp);\n\t\t}\n\t\tsort(arr.begin(), arr.end());\n\t\tarr.resize(size);\n\t\tfor (int i = 0; i < arr.size(); i++) {\n\t\t\tcout << arr[i];\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,284,2476 1575034696487124992,2555d9a6e7da4e4edb2636d888179ba745458c96d56479bfde81d986b9d75fea,2022-09-28 16:08:29,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\n\nint main()\n{\n\tint count;\n\tcin >> count;\n\tint num[100000];\n\tfor (int i = 0; i < count; i++)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tstring s;\n\t\tcin >> s;\n\t\tint c = n - m;\n\t\tfor (int i = 0; i < s.size(); i++) {\n\t\t\tnum[i] = s[i] - '0';\n\t\t}\n\t\tint min[10000];\n\t\tfor (int i = 0; i < 10000; i++)\n\t\t{\n\t\t\tmin[i] = 10;\n\t\t}\n\t\tfor (int i = 0; i < c; i++) {\n\t\t\tfor (int j = 0; j < s.size(); j++)\n\t\t\t{\n\t\t\t\tif (min[i] > num[j])\n\t\t\t\t{\n\t\t\t\t\tmin[i] = num[j];\n\t\t\t\t\tnum[j] = 10;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < c; i++)\n\t\t{\n\t\t\tcout << min[i];\n\t\t}\n\t\tif(i!=count-1)\n\t\tcout << endl;\n\t}\n\t\n}",MULTIPLE_ERROR,492,1388 1575034894545932288,2555d9a6e7da4e4edb2636d888179ba745458c96d56479bfde81d986b9d75fea,2022-09-28 16:09:16,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\n\nint main()\n{\n\tint count;\n\tcin >> count;\n\tint num[200000];\n\tfor (int i = 0; i < count; i++)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tstring s;\n\t\tcin >> s;\n\t\tint c = n - m;\n\t\tfor (int i = 0; i < s.size(); i++) {\n\t\t\tnum[i] = s[i] - '0';\n\t\t}\n\t\tint min[200000];\n\t\tfor (int i = 0; i < 200000; i++)\n\t\t{\n\t\t\tmin[i] = 10;\n\t\t}\n\t\tfor (int i = 0; i < c; i++) {\n\t\t\tfor (int j = 0; j < s.size(); j++)\n\t\t\t{\n\t\t\t\tif (min[i] > num[j])\n\t\t\t\t{\n\t\t\t\t\tmin[i] = num[j];\n\t\t\t\t\tnum[j] = 10;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < c; i++)\n\t\t{\n\t\t\tcout << min[i];\n\t\t}\n\t\tif(i!=count-1)\n\t\tcout << endl;\n\t}\n\t\n}",MULTIPLE_ERROR,2038,2124 1575034972870369280,5d338a55296aacf170ec902fe147805b1758eded7794d099f63670b8f2503676,2022-09-28 16:09:34,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n\nusing namespace std;\nint snum[200005];\n\nstruct pp\n{\n\tchar ch;\n\tint num;\n}ppx[200005];\n\nbool cmp(pp a, pp b) {\n\tif(a.ch == b.ch) {\n\t\treturn a.num < b.num;\n\t}\n\treturn a.ch > b.ch;\n}\n\nint main() {\n\tint T, n, m, i = 0;\n\tstring price;\n\tcin >> T;\n\twhile (T--) {\n\t\tcin >> n >> m >> price;\n\t\ti = 0;\n\t\tfor (auto it = price.begin(); it != price.end(); it++, i++) {\n\t\t\tppx[i].ch = price[i];\n\t\t\tppx[i].num = i;\n\t\t}\n\t\tsort(ppx, ppx + n, cmp);\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tprice[ppx[i].num] = '#';\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (price[i] != '#')cout << price[i];\n\t\t}\n\t\tcout << endl;\n\t}\n\n\treturn 0;\n}",WRONG_ANSWER,695,2892 1575035164407451648,4cdf9efef9133a54e4b2da059723b068fdde34b97998387016b5631ae19c4573,2022-09-28 16:10:20,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \nint main(){\n int T,n,m,x,a,b,t,i,c;\n b=0;\n scanf(\""%d\"",&T);\n for(a=1;a<=T;a++){\n b=0;\n t=0;\n scanf(\""%d %d\"",&n,&m);\n scanf(\""%d\"",&x);\n do{\n m--;\n t=0;\n for(i=n;i>=2;i--){\n c=x/pow(10,i-1);\n if(i==n){\n b=c;\n }\n if(b<=c){\n t=t+b*pow(10,i-2);\n b=c;\n }\n else {\n t=t+c*pow(10,i-2);\n }\n x=x-c*pow(10,i-1);\n }\n x=t;\n n--;\n }while(m!=0);\n printf(\""%d\\n\"",x);\n }\n return 0;\n}",MULTIPLE_ERROR,3342,596 1575035230644322304,62ec1a35f0c09191112dcec541f79565effe065e31a0e421127d7d937a40f28b,2022-09-28 16:10:36,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint a[191];\nchar s[90];\nint vis[9999];\nint main(){\n int t;\n cin>>t;\n while(t--){\n memset(a,0,sizeof(a));\n memset(vis,0,sizeof(vis));\n int n,m;\n scanf(\""%d%d\"",&n,&m);\n getchar();\n scanf(\""%s\"",s);\n int index=0;\n for(int i=1;i<=m;i++){\n int mins=0;\n for(int k=0;kmins&&vis[k]==0){\n mins=s[k]-'0';\n index=k;\n }\n };\n vis[index]=1;\n }\n for(int i=0;i\nint main()\n{\n int t,n,m;\n scanf(\""%d\"",&t);\n for(int i=0;is[k+1])\n {\n temp=s[k];\n s[k]=s[k+1];\n s[k+1]=temp;\n }\n \n }\n for(int j=0;j\n\n\n\nint main()\n{\n\tint n,i,t,z,min,p,m,cnt=1,count=0;\n\tscanf(\""%d\"",&p);\n\tchar money[200000];\n\tchar mi[200000];\n\tfor(z=0;zn-m)\n\t\t\t\t{\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tcount++;\n\t\t\t\t\tif(cnt==n)\n\t\t\t\t\t{\n\t\t\t\t\t\tmi[i+1]=money[t+1];\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(i=0;i\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n\nusing namespace std;\nint snum[200005];\n\nstruct pp\n{\n\tchar ch;\n\tint num;\n}ppx[200005];\n\nbool cmp(pp a, pp b) {\n\tif(a.ch == b.ch) {\n\t\treturn a.num < b.num;\n\t}\n\treturn a.ch > b.ch;\n}\n\nint main() {\n\tint T, n, m;\n\tstring price;\n\tcin >> T;\n\twhile (T--) {\n\t\tcin >> n >> m >> price;\n\t\tfor (int i = 0; i < n;i++) {\n\t\t\tppx[i].ch = price[i];\n\t\t\tppx[i].num = i;\n\t\t}\n\t\tsort(ppx, ppx + n, cmp);\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tprice[ppx[i].num] = '#';\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (price[i] != '#')cout << price[i];\n\t\t}\n\t\tcout << endl;\n\t}\n\n\treturn 0;\n}",WRONG_ANSWER,709,2900 1575035714365014016,2555d9a6e7da4e4edb2636d888179ba745458c96d56479bfde81d986b9d75fea,2022-09-28 16:12:31,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\n\nint main()\n{\n\tint count;\n\tcin >> count;\n\tint num[10000];\n\tfor (int i = 0; i < count; i++)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tstring s;\n\t\tcin >> s;\n\t\tint c = n - m;\n\t\tfor (int i = 0; i < s.size(); i++) {\n\t\t\tnum[i] = s[i] - '0';\n\t\t}\n\t\tint min[10000];\n\t\tfor (int i = 0; i < 10000; i++)\n\t\t{\n\t\t\tmin[i] = 10;\n\t\t}\n\t\tfor (int i = 0; i < c; i++) {\n\t\t\tfor (int j = 0; j < s.size(); j++)\n\t\t\t{\n\t\t\t\tif (min[i] > num[j])\n\t\t\t\t{\n\t\t\t\t\tmin[i] = num[j];\n\t\t\t\t\tnum[j] = 10;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < c; i++)\n\t\t{\n\t\t\tsum = sum * 10 + min[i];\n\t\t}\n\t\tcout << sum;\n\t\tif(i!=count-1)\n\t\tcout << endl;\n\t}\n\t\n}",MULTIPLE_ERROR,64,852 1575035721926926336,e0d4c328e81858258074a68a5fe9fee9c7615dd4b9fd887a1b3d9a2dca1a1c51,2022-09-28 16:12:33,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int tot = scanner.nextInt();\n int numc,bag;\n scanner.nextLine();\n\n for(int i = 0;ibigsmall[0]) {\n bigsmall[0] = (s.charAt(j)-'0');\n Arrays.sort(bigsmall);\n }\n }\n int resout[] = new int[numc];\n int y=0;\n while ((bag -y) > 0){\n for(int t=0;tbigsmall[0]) {\n bigsmall[0] = (s.charAt(j)-'0');\n Arrays.sort(bigsmall);\n }\n }\n int resout[] = new int[numc];\n int y=0;\n while ((bag -y) > 0){\n for(int t=0;tInteger.parseInt(s.substring(k+1,k+2))){\n s=s.substring(1);\n n--;\n flag=1;\n k=0;\n continue;\n }\n\n\n int max=0;\n for (int l = 0; l < n; l++) {\n max=Math.max(Integer.parseInt(s.substring(l,l+1)),max);\n }\n for (int l = 0; l \n#include\n#include\n#include\nusing namespace std;\n\nint main() {\n\n\tint T = 0;\n\tint price;\n\tint n, m;\n\tn = 0;\n\tm = 0;\n\tint tmp;\n\tint size;\n\tcin >> T;\n\tvectorarr;\n\tfor (int k = 0; k < T; k++){\n\t\tcin >> n >> m;\n\t\tcin >> price;\n\t\tsize = n - m;\n\t\t//将数字拆分成字符串\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ttmp = price % 10;\n\t\t\tprice /= 10;\n\t\t\tarr.push_back(tmp);\n\t\t}\n\t\tsort(arr.begin(), arr.end());\n\t\tarr.resize(size);\n\t\tint j = 0;\n\t\tint res = 0;\n\t\tint ans = 0;\n\t\tfor (int i = arr.size()-1,j=0; i >=0; i--,j++) {\n\t\t\tres = pow(10, j);\n\t\t\tans += arr[i]*res;\n\t\t}\n\t\t//1114\n\t\tcout <\nint main()\n{\n int t,n,m;\n scanf(\""%d\"",&t);\n for(int i=0;is[k+1])\n {\n temp=s[k];\n s[k]=s[k+1];\n s[k+1]=temp;\n }\n if(k==m-1&&temp='0')\n {\n isfind=1;\n break;\n }\n \n }\n if(isfind)\n break;\n }\n for(int j=0;j\nchar max(char a[],int b){\n int max=a[0];\n for(int i=0;ia[0])\n max=a[i];\n return max;\n}\nint main(){\n int n;\n scanf(\""%d\"",&n);\n for(int i=0;i\nint main(){\n int T,temp,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0;iarr[y]){\n temp = arr[x];\n arr[x] = arr[y];\n arr[y] = temp;\n }\n }\n }\n for(int z = 0;z<(n-m);z++){\n printf(\""%d\"",arr[z]);\n }\n if(i\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[20000]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t char str[n]={0};\n \t cin>>str;\n \t for(int e=0;e=max){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j0;v--){\n\t\t \t\tif(str[v]\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n int i1=0;\n while(num>0){\n a[num%10]++;\n num=num/10;\n i1++;\n }\n int len1=0;\n int flag=1;\n for(int j=1;j<10;j++){\n for(int k=0;k\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[20000]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t char str[n]={0};\n \t cin>>str;\n \t for(int l=0;l=max){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j0;v--){\n\t\t \t\tif(str[v]\nchar max(char a[],int b){\n int max=a[0];\n for(int i=0;ia[0])\n max=a[i];\n return max;\n}\nint main(){\n int n;\n scanf(\""%d\"",&n);\n for(int i=0;i\nusing namespace std;\nint main(){\n int T,temp,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0;iarr[y]){\n temp = arr[x];\n arr[x] = arr[y];\n arr[y] = temp;\n }\n }\n }\n for(int z = 0;z<(n-m);z++){\n cout<\nusing namespace std;\n#define all(x) std::begin(x), std::end(x)\ntemplate constexpr T inf = std::numeric_limits::max() / 2;\nusing ll = long long;\nusing ld = long double;\n#ifndef ONLINE_JUDGE\n#define debug(x) std::cerr << #x << \""=\"" << x << '\\n'\n#else\n#define debug(x)\n#endif\n\nvoid Solution() {\n int n, m;\n cin >> n >> m;\n vector a(n + 1);\n for (int i = 0; i < n; i ++) {\n char x;\n cin >> x;\n a[i] = x - '0';\n }\n stack st;\n for (int i = 0; i <= n + 1; i ++) {\n // debug(i);\n while (!st.empty() && a[st.top()] > a[i] && m) {\n // debug(st.top());\n a[st.top()] = 0;\n st.pop();\n m --;\n }\n st.push(i);\n }\n for (int i = 0; i < n; i ++) \n if (a[i])\n cout << a[i];\n cout << '\\n';\n}\n\nint32_t main() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n int t; std::cin >> t; while (t --)\n Solution();\n}",ACCEPTED,235,2312 1575037437036552192,d5862d0ae0f0dc3eda0fd18dad72ed9b77aaf94258569bf44c8a4dde1fe339d3,2022-09-28 16:19:22,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main(){\n int T,temp,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0;iarr[y]){\n temp = arr[x];\n arr[x] = arr[y];\n arr[y] = temp;\n }\n }\n }\n for(int z = 0;z<(n-m);z++){\n cout<\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[20000]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t cin>>str;\n \t for(int l=0;l=max){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j0;v--){\n\t\t \t\tif(str[v]\nusing namespace std;\nint main(){\n int T,temp,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0;iarr[y]){\n temp = arr[x];\n arr[x] = arr[y];\n arr[y] = temp;\n }\n }\n }\n for(int z = 0;z<(n-m);z++){\n cout<\nchar max(char a[],int b){\n int max=a[0];\n for(int i=0;imax&&a[i]!='*')\n max=a[i];\n return max;\n}\nint main(){\n int n;\n scanf(\""%d\"",&n);\n for(int i=0;i\n#define ll long long\n#define ull signed long long\n#define maxn 2000200\nusing namespace std;\n\nll n, m, T;\n\n\n\nint main()\n{\n\n cin>>T;\n while(T--){\n cin>>n>>m;\n string s;\n cin>>s;\n for(int i=1;i=0&&m>0&&s[a]\nchar max(char a[],int b){\n int max=a[0];\n for(int i=0;imax&&a[i]!='*')\n max=a[i];\n return max;\n}\nint main(){\n int n;\n scanf(\""%d\"",&n);\n for(int i=0;i\n#include\n#include\n#include\nusing namespace std;\n\nint main() {\n\n\tint T = 0;\n\tint price;\n\tint n, m;\n\tn = 0;\n\tm = 0;\n\tint tmp;\n\tint size;\n\tcin >> T;\n\tvectorarr;\n\tfor (int k = 0; k < T; k++){\n\t\tcin >> n >> m;\n\t\tcin >> price;\n\t\tsize = n - m;\n\t\t//将数字拆分成字符串\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ttmp = price % 10;\n\t\t\tprice /= 10;\n\t\t\tarr.push_back(tmp);\n\t\t}\n\t\tsort(arr.begin(), arr.end());\n\t\tarr.resize(size);\n\t\tint j = 0;\n\t\tint res = 0;\n\t\tint ans = 0;\n\t\tfor (int i = arr.size()-1,j=0; i >=0; i--,j++) {\n\t\t\tres = pow(10, j);\n\t\t\tans += arr[i]*res;\n\t\t}\n\t\t//1114\n\t\tif (k == T - 1)cout << ans;\n\t\telse cout << ans << endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,305,1608 1575037761914753024,0059036b8c4353a2e67a312dd24215f6f8890aa3c7d6f2b19b089cc2d146046b,2022-09-28 16:20:39,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main(){\n int T,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(int l=x_1; l\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n int i1=0;\n while(num>0){\n a[num%10]++;\n num=num/10;\n i1++;\n }\n int len1=0;\n int ans=0;\n int flag=1;\n for(int j=1;j<10;j++){\n for(int k=0;k\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[20000]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t cin>>str;\n \t for(int l=0;l=max){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j0;v--){\n\t\t \t\tif(str[v]\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[20000]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t cin>>str;\n \t for(int l=0;l=max){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j0;v--){\n\t\t \t\tif(str[v]\n#include \nint main(){\n int T,n,m,x,a,b,t,i,c;\n b=0;\n scanf(\""%d\"",&T);\n for(a=1;a<=T;a++){\n b=0;\n t=0;\n scanf(\""%d %d\"",&n,&m);\n scanf(\""%d\"",&x);\n do{\n m--;\n t=0;\n for(i=n;i>=1;i--){\n c=x/pow(10,i-1);\n if(i==n){\n b=c;\n }\n else{\n if(b<=c){\n t=t+b*pow(10,i-1);\n b=c;\n }\n else {\n t=t+c*pow(10,i-1);\n }\n }\n x=x-c*pow(10,i-1);\n }\n x=t;\n n--;\n }while(m!=0);\n printf(\""%d\\n\"",x);\n }\n return 0;\n}",MULTIPLE_ERROR,3353,568 1575038539551301632,569a6db1313d25f282bd0ed487c37a89c1bd48433e81dbc2951ddaf1a4ee6ccb,2022-09-28 16:23:45,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[20000]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t cin>>str;\n \t for(int l=0;lmax){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j\nusing namespace std;\n\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\tlong int o;\n\t\n\t\n\tcin>>o;\n\t\n\t \n\t\t\n\t\t\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\n\t\tfor(int i=0;inumber[j+1])\n\t\t{\n\t\t\tint temp2=number[j];\n\t\t\tnumber[j]=number[j+1];\n\t\t\tnumber[j+1]=temp2;\n\t\t}\n\t}\n\t\n}\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tfor(int i=0;i\n#include \nint main(){\n int T,n,m,x,a,b,t,i,c;\n b=0;\n scanf(\""%d\"",&T);\n for(a=1;a<=T;a++){\n b=0;\n t=0;\n scanf(\""%d %d\"",&n,&m);\n scanf(\""%d\"",&x);\n do{\n m--;\n t=0;\n for(i=n;i>=1;i--){\n c=x/pow(10,i-1);\n if(i==n){\n b=c;\n }\n else{\n if(b<=c){\n t=t+b*pow(10,i-1);\n b=c;\n }\n else {\n t=t+c*pow(10,i-1);\n }\n }\n x=x-c*pow(10,i-1);\n }\n x=t;\n n--;\n }while(m!=0);\n if(a!=T){\n printf(\""%d\\n\"",x);\n }\n else{\n printf(\""%d\"",x);\n }\n }\n return 0;\n}",MULTIPLE_ERROR,3357,756 1575038660548583424,2555d9a6e7da4e4edb2636d888179ba745458c96d56479bfde81d986b9d75fea,2022-09-28 16:24:14,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\n\nint main()\n{\n\tint count;\n\tcin >> count;\n\tint num[10000];\n\tfor (int i = 0; i < count; i++)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tstring s;\n\t\tcin >> s;\n\t\tfor (int i = 0; i < s.size(); i++) {\n\t\t\tnum[i] = s[i] - '0';\n\t\t}\n\t\tfor (int i = 0; i < m; i++)\n\t\t{\n\t\t\tint dex = 0;\n\t\t\tint max = 0;\n\t\t\tfor (int j = 0; j < s.size(); j++)\n\t\t\t{\n\t\t\t\tif(num[j]!=10)\n\t\t\t\tif (max < num[j])\n\t\t\t\t{\n\t\t\t\t\tmax = num[j];\n\t\t\t\t\tdex = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tnum[dex] = 10;\n\t\t}\n\t\tfor (int i = 0; i < s.size(); i++)\n\t\t{\n\t\t\tif (num[i] != 10)\n\t\t\t\tcout << num[i];\n\t\t}\n\t\tif(i!=count-1)\n\t\tcout << endl;\n\t}\n\t\n}",MULTIPLE_ERROR,77,972 1575038775891939328,3e35440465ef1b146f6de6261a3b3436ed194651543e180868c207aba8a1c6b0,2022-09-28 16:24:41,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nint main()\n{\n int t,n,m;\n scanf(\""%d\"",&t);\n for(int i=0;is[k+1])\n {\n temp=s[k];\n s[k]=s[k+1];\n s[k+1]=temp;\n }\n if(j>=m)\n {\n isfind=1;\n break;\n }\n \n }\n if(isfind)\n break;\n }\n for(int j=0;j\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n int i1=0;\n while(num>0){\n a[num%10]++;\n num=num/10;\n i1++;\n }\n int len1=0;\n int ans=0;\n int flag=1;\n for(int j=1;j<10;j++){\n for(int k=0;k\nusing namespace std;\n\nint main()\n{\n\tint count;\n\tcin >> count;\n\tint num[10000];\n\tfor (int i = 0; i < count; i++)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tstring s;\n\t\tcin >> s;\n\t\tfor (int i = 0; i < s.size(); i++) {\n\t\t\tnum[i] = s[i] - '0';\n\t\t}\n\t\tfor (int i = 0; i < m; i++)\n\t\t{\n\t\t\tint dex = 0;\n\t\t\tint max = 0;\n\t\t\tfor (int j = 0; j < s.size(); j++)\n\t\t\t{\n\t\t\t\tif(num[j]!=10)\n\t\t\t\tif (max < num[j])\n\t\t\t\t{\n\t\t\t\t\tmax = num[j];\n\t\t\t\t\tdex = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tnum[dex] = 10;\n\t\t}\n\t\tfor (int i = 0; i < s.size(); i++)\n\t\t{\n\t\t\tif (num[i] != 10)\n\t\t\t\tcout << num[i];\n\t\t}\n\t\tif(i!=count-1)\n\t\tcout << endl;\n\t}\n\t\n}",MULTIPLE_ERROR,62,1004 1575038878585700352,2555d9a6e7da4e4edb2636d888179ba745458c96d56479bfde81d986b9d75fea,2022-09-28 16:25:06,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\n\nint main()\n{\n\tint count;\n\tcin >> count;\n\tint num[10000];\n\tfor (int i = 0; i < count; i++)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tstring s;\n\t\tcin >> s;\n\t\tfor (int i = 0; i < s.size(); i++) {\n\t\t\tnum[i] = s[i] - '0';\n\t\t}\n\t\tfor (int i = 0; i < m; i++)\n\t\t{\n\t\t\tint dex = 0;\n\t\t\tint max = 0;\n\t\t\tfor (int j = 0; j < s.size(); j++)\n\t\t\t{\n\t\t\t\tif(num[j]!=10)\n\t\t\t\tif (max < num[j])\n\t\t\t\t{\n\t\t\t\t\tmax = num[j];\n\t\t\t\t\tdex = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tnum[dex] = 10;\n\t\t}\n\t\tfor (int i = 0; i < s.size(); i++)\n\t\t{\n\t\t\tif (num[i] != 10)\n\t\t\t\tcout << num[i];\n\t\t}\n\t\tif(i!=count-1)\n\t\tcout << endl;\n\t}\n\t\n}",MULTIPLE_ERROR,69,864 1575038880434966528,e0d4c328e81858258074a68a5fe9fee9c7615dd4b9fd887a1b3d9a2dca1a1c51,2022-09-28 16:25:06,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class s8 {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int tot = scanner.nextInt();\n int numc,bag;\n scanner.nextLine();\n\n for(int i = 0;ibigsmall[0]) {\n bigsmall[0] = (s.charAt(j)-'0');\n Arrays.sort(bigsmall);\n }\n }\n int resout[] = new int[numc];\n int y=0;\n while ((bag -y) > 0){\n for(int t=0;tbigsmall[0]) {\n bigsmall[0] = (s.charAt(j)-'0');\n Arrays.sort(bigsmall);\n }\n }\n int resout[] = new int[numc];\n int y=0;\n while ((bag -y) > 0){\n for(int t=0;t\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[20000]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t cin>>str;\n \t for(int l=0;lmax){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j\nint main(){\n int T,n,m;\n scanf(\""%d\"",&T);\n for(int i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(int l=x_1; l\nint main()\n{\n int t,n,m;\n scanf(\""%d\"",&t);\n for(int i=0;is[k+1])\n {\n temp=s[k];\n s[k]=s[k+1];\n s[k+1]=temp;\n }\n if(j>=m)\n {\n isfind=1;\n break;\n }\n \n }\n \n if(isfind)\n break;\n }\n \n for(int j=0;j\nusing namespace std;\n\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\tlong int o;\n\t\n\t\n\tcin>>o;\n\t\n\t \n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\n\t\tfor(int i=0;inumber[j+1])\n\t\t{\n\t\t\tint temp2=number[j];\n\t\t\tnumber[j]=number[j+1];\n\t\t\tnumber[j+1]=temp2;\n\t\t}\n\t}\n\t\n}\n\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tfor(int i=0;i\nint main()\n{\n int t,n,m;\n scanf(\""%d\"",&t);\n \n for(int i=0;is[k+1])\n {\n temp=s[k];\n s[k]=s[k+1];\n s[k+1]=temp;\n }\n if(j>=m)\n {\n isfind=1;\n break;\n }\n \n }\n \n if(isfind)\n break;\n }\n \n for(int j=0;j\n#include \nint main(){\n int T,n,m,x,a,b,t,i,c;\n b=0;\n scanf(\""%d\"",&T);\n for(a=1;a<=T;a++){\n b=0;\n t=0;\n scanf(\""%d %d\"",&n,&m);\n scanf(\""%d\"",&x);\n do{\n m--;\n t=0;\n for(i=n;i>=1;i--){\n c=x/pow(10,i-1);\n if(i==n){\n b=c;\n }\n else{\n if(b<=c){\n t=t+b*pow(10,i-1);\n b=c;\n }\n else {\n t=t+c*pow(10,i-1);\n }\n }\n x=x-c*pow(10,i-1);\n }\n x=t;\n n--;\n }while(m!=0);\n if(a!=T){\n printf(\""%d\\n\"",x);\n }\n else{\n printf(\""%d\"",x);\n }\n }\n return 0;\n}",MULTIPLE_ERROR,3346,572 1575039381956706304,248aeeb7c799cae1004d3591a04b02db11348e7617322bb6066f91aadaa20296,2022-09-28 16:27:06,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nchar max(char a[],int b){\n int max=a[0];\n for(int i=0;imax&&a[i]!='0')\n max=a[i];\n return max;\n}\nint main(){\n int n;\n scanf(\""%d\"",&n);\n for(int i=0;i\nchar max(char a[],int b){\n int max=a[0];\n for(int i=0;imax&&a[i]!='0')\n max=a[i];\n return max;\n}\nint main(){\n int n;\n scanf(\""%d\"",&n);\n for(int i=0;i\nint main()\n{\n int t,n,m;\n scanf(\""%d\"",&t);\n \n for(int i=0;is[k+1])\n {\n temp=s[k];\n s[k]=s[k+1];\n s[k+1]=temp;\n }\n if(j>=m)\n {\n isfind=1;\n break;\n }\n \n }\n \n if(isfind)\n break;\n }\n \n for(int j=0;j\nint main(){\n long T,n,m;\n scanf(\""%ld\"",&T);\n for(long i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(long l=x_1; l=0;j--){\n if((s.charAt(j)-'0') < bigsmall[bag-1]) {\n bigsmall[bag-1] = (s.charAt(j)-'0');\n Arrays.sort(bigsmall);\n }\n }\n int resout[] = new int[numc];\n int y=0;\n while ((bag -y) > 0){\n for(int t=numc-1;t>=0;t--){\n if(((s.charAt(t)-'0') == bigsmall[y]) && (resout[t]!=1)){\n resout[t] = 1;\n y++;\n break;\n }\n }\n }\n for(int u=0;u=0;j--){\n if((s.charAt(j)-'0') < bigsmall[bag-1]) {\n bigsmall[bag-1] = (s.charAt(j)-'0');\n Arrays.sort(bigsmall);\n }\n }\n int resout[] = new int[numc];\n int y=0;\n while ((bag -y) > 0){\n for(int t=numc-1;t>=0;t--){\n if(((s.charAt(t)-'0') == bigsmall[y]) && (resout[t]!=1)){\n resout[t] = 1;\n y++;\n break;\n }\n }\n }\n for(int u=0;u\nint main(){\n long T,n,m;\n scanf(\""%ld\"",&T);\n for(long i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(long l=x_1; l\nint main()\n{\n int t,n,m;\n scanf(\""%d\"",&t);\n \n for(int i=0;is[k+1])\n {\n temp=s[k];\n s[k]=s[k+1];\n s[k+1]=temp;\n }\n if(j>=m)\n {\n isfind=1;\n break;\n }\n \n }\n \n if(isfind)\n break;\n }\n \n for(int j=0;j\nint main()\n{\n int t,n,m;\n scanf(\""%d\"",&t);\n \n for(int i=0;is[k+1])\n {\n temp=s[k];\n s[k]=s[k+1];\n s[k+1]=temp;\n }\n if(j>m-2)\n {\n isfind=1;\n break;\n }\n \n }\n \n if(isfind)\n break;\n }\n \n for(int j=0;j\nusing namespace std;\nint main(){\n long long n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n int i1=0;\n while(num>0){\n a[num%10]++;\n num=num/10;\n i1++;\n }\n long long len1=0;\n long long ans=0;\n long long flag=1;\n for(int j=1;j<10;j++){\n for(int k=0;k\nint main(){\n long T,n,m;\n scanf(\""%ld\"",&T);\n for(long i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(long l=x_1; l\nusing namespace std;\nint main(){\n long long n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n int i1=0;\n while(num>0){\n a[num%10]++;\n num=num/10;\n i1++;\n }\n long long len1=0;\n long long ans=0;\n long long flag=1;\n for(int j=1;j<10;j++){\n for(int k=0;k\nint main(){\n long T,n,m;\n scanf(\""%ld\"",&T);\n for(long i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(long l=x_1; l\nint main()\n{\n int t,n,m;\n scanf(\""%d\"",&t);\n \n for(int i=0;is[k+1])\n {\n temp=s[k];\n s[k]=s[k+1];\n s[k+1]=temp;\n }\n if(j>m)\n {\n isfind=1;\n break;\n }\n \n }\n \n if(isfind)\n break;\n }\n \n for(int j=0;j\nusing namespace std;\nint main(){\n long long n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n int i1=0;\n while(num>0){\n a[num%10]++;\n num=num/10;\n i1++;\n }\n long long len1=0;\n long long ans=0;\n long long flag=1;\n for(int j=1;j<10;j++){\n for(int k=0;k\nusing namespace std;\nint main(){\n long long n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n int i1=0;\n while(num>0){\n a[num%10]++;\n num=num/10;\n i1++;\n }\n long long len1=0;\n long long ans=0;\n long long flag=1;\n for(int j=1;j<10;j++){\n for(int k=0;k\nint main()\n{\n int t,n,m;\n scanf(\""%d\"",&t);\n \n for(int i=0;is[k+1])\n {\n temp=s[k];\n s[k]=s[k+1];\n s[k+1]=temp;\n }\n \n }\n \n }\n \n for(int j=0;j\nint main()\n{\n int t,n,m;\n scanf(\""%d\"",&t);\n \n for(int i=0;is[k+1])\n {\n temp=s[k];\n s[k]=s[k+1];\n s[k+1]=temp;\n }\n \n }\n \n }\n \n for(int j=0;j\nint main(){\n long T,n,m;\n scanf(\""%ld\"",&T);\n for(long i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(long l=x_1; l=0;j--){\n if((s.charAt(j)-'0') < bigsmall[bag-1]) {\n bigsmall[bag-1] = (s.charAt(j)-'0');\n Arrays.sort(bigsmall);\n }\n }\n int resout[] = new int[numc];\n int y=0;\n while ((bag -y) > 0){\n for(int t=numc-1;t>=0;t--){\n if(((s.charAt(t)-'0') == bigsmall[y]) && (resout[t]!=1)){\n resout[t] = 1;\n y++;\n break;\n }\n }\n }\n int p=0;\n int qwe[]=new int[numc];\n for(int u=0;u\n#include\nint main(){\n int T;\n long long m,n,o,count=0,s;\n scanf(\""%d\"",&T);\n for(int i=0;i\nusing namespace std;\nint main(){\n long long n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n long long i1=0;\n while(num>0){\n a[num%10]++;\n num=num/10;\n i1++;\n }\n long long len1=0;\n long long ans=0;\n long long flag=1;\n for(int j=1;j<10;j++){\n for(int k=0;k\nusing namespace std;\nint main(){\n long long n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n long long i1=0;\n while(num>0){\n a[num%10]++;\n num=num/10;\n i1++;\n }\n long long len1=0;\n long long ans=0;\n long long flag=1;\n for(int j=1;j<10;j++){\n for(int k=0;k\nusing namespace std;\nint main(){\n long long n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n long long i1=0;\n while(num>0){\n a[num%10]++;\n num=num/10;\n i1++;\n }\n long long len1=0;\n long long ans=0;\n long long flag=1;\n for(int j=1;j<10;j++){\n for(int k=0;k\nint main()\n{\n int t,n,m;\n scanf(\""%d\"",&t);\n \n for(int i=0;is[k+1])\n {\n temp=s[k];\n s[k]=s[k+1];\n s[k+1]=temp;\n }\n \n }\n \n }\n \n for(int j=0;j\nusing namespace std;\n\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\tlong int o;\n\n\tcin>>o; \n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\n\t\tfor(int i=0;inumber2[j+1])\n\t\t{\n\t\t\tint temp2=number2[j];\n\t\t\tnumber2[j]=number2[j+1];\n\t\t\tnumber2[j+1]=temp2;\n\t\t}\n\t}\n\t\n}\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tfor(int i=0;i\nusing namespace std;\nint main(){\n long long n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n long long i1=0;\n while(num>0){\n a[num%10]++;\n num=num/10;\n i1++;\n }\n long long len1=0;\n long long ans=0;\n long long flag=1;\n for(int j=0;j<10;j++){\n for(int k=0;k\nusing namespace std;\nconst int maxn =1e6+10;\ntypedef pair pii;\ntypedef long long ll ;\ntypedef pair pll;\n#define all(x) (x).begin(),(x).end();\n#define endl '\\n';\n#define int long long\n\nvoid solve()\n{\n int n,k;\n cin >> n>>k;\n vector a(n);\n vector vis(n);\n vis.back() = 1;\n int idx = n - 1,sz=0;\n for(auto &x:a)\n cin >> x;\n for (int i = a.size()-2;i>=0;i--)\n {\n \n while(a[i]>a[idx])\n {\n vis[i] = vis[i - 1] + 1;\n i--;\n if(i==0)\n break;\n }\n idx = i;\n }\n\n vector f(n);\n for (int i = 0; i < n;i++)\n if(vis[i]&&k>=vis[i])\n {\n for (int j = 0; j < vis[i];j++)\n f[i+j] = 1;\n k -= vis[i];\n // cout << vis[i] <<\"" \"" << i << \"" \"" << i + vis[i] - 1 << endl;\n i = i + vis[i] - 1;\n }\n\n // for (auto x : vis)\n // cout << x << \"" \"";\n\n for (int i = 0; i < n;i++)\n if(!f[i])\n cout << a[i];\n \n}\n\nsigned main()\n{\n cin.tie(0);\n int _;\n cin>>_;\n while(_--)\n {\n solve();\n if(_!=0)\n cout << endl;\n }\n return 0;\n}",WRONG_ANSWER,280,4420 1575041084059373568,d131eb656cb972fa529cb2cf81eb1fc806d8401b711f0dad36caa579d16c110b,2022-09-28 16:33:51,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n#include\n#include\n#include\n#define MAX 10001\nusing namespace std;\nint main()\n{\n\tstring s;\n\tlong long int n, m, t;\n\tcin >> t;\n\tfor (int i = 0; i < t; i++)\n\t{\n\t\t\n\t\tcin >> n >> m;\n\t\tcin >> s;\n\n\t\tfor (int k = 0; k < m; k++)\n\t\t{\n\t\t\tlong long int max = -1, index;\n\t\t\tfor (int j = 0; j < n; j++)\n\t\t\t{\n\t\t\t\tif (s[j] > max)\n\t\t\t\t{\n\t\t\t\t\tmax = s[j];\n\t\t\t\t\tindex = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts[index] = 0;\n\t\t}\n\t\tfor (int m = 0; m < n; m++)\n\t\t{\n\t\t\tif (s[m] != 0)\n\t\t\t\tcout << s[m] - '0';\n\t\t}\n\t\tif (i != t-1)\n\t\t\tcout << endl;\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,2027,836 1575041094238953472,0059036b8c4353a2e67a312dd24215f6f8890aa3c7d6f2b19b089cc2d146046b,2022-09-28 16:33:54,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n#define max 10000\nint main(){\n long T,n,m;\n char b[n][n+1];\n scanf(\""%ld\"",&T);\n for(long i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(long l=x_1; l\nusing namespace std;\nint main(){\n long long n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n long long i1=0;\n while(num>0){\n a[num%10]++;\n num=num/10;\n i1++;\n }\n long long len1=0;\n long long ans=0;\n long long flag=1;\n for(int j=0;j<10;j++){\n for(int k=0;k\nint main(){\n long T,n,m;\n scanf(\""%ld\"",&T);\n for(long i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(long l=x_1; l\nusing namespace std;\nint main(){\n long long n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n long long i1=0;\n while(num>0){\n a[num%10]++;\n num=num/10;\n i1++;\n }\n long long len1=0;\n long long ans=0;\n long long flag=1;\n for(int j=1;j<10;j++){\n for(int k=0;k\nusing namespace std;\n\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\tlong int o;\n\n\tcin>>o; \n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\n\t\tfor(int i=0;inumber[j+1])\n\t\t{\n\t\t\tint temp2=number[j];\n\t\t\tnumber[j]=number[j+1];\n\t\t\tnumber[j+1]=temp2;\n\t\t}\n\t}\n\t\n}\n\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tfor(int i=0;i\nint main(){\n long T,n,m;\n scanf(\""%ld\"",&T);\n for(long i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(long l=x_1; l\nint main()\n{\n int t,n,m,i,j,k,x,s;\n scanf(\""%d\"",&t);\n for(i=0;ich[k])\n {\n max=ch[x];\n ch[x]=ch[k];\n ch[k]=max;\n }\n }\n }\n }\n for(s=0;s list = new LinkedList();\n for (char c : chars) {\n list.add(c);\n }\n\n for (int j = 1; j < list.size(); j++) {\n if(m==0)break;\n Character c2 = list.get(j);\n Character c1 = list.get(j - 1);\n if(c2=0; j--) {\n if(m==0)break;\n list.removeLast();\n m--;\n }\n }\n for (Character character : list) {\n System.out.print(character);\n }\n System.out.print(\""\\n\"");\n\n }\n\n sc.close();\n }\n}\n",MULTIPLE_ERROR,1927,27688 1575041579427651584,0059036b8c4353a2e67a312dd24215f6f8890aa3c7d6f2b19b089cc2d146046b,2022-09-28 16:35:50,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main(){\n long T,n,m;\n scanf(\""%ld\"",&T);\n for(long i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(long l=x_1; l\nusing namespace std;\n\nint main()\n{\n\tint count;\n\tcin >> count;\n\tint num[10000];\n\tfor (int i = 0; i < count; i++)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tstring s;\n\t\tcin >> s;\n\t\tfor (int i = 0; i < s.size(); i++) {\n\t\t\tnum[i] = s[i] - '0';\n\t\t}\n\t\tfor (int i = 0; i < m; i++)\n\t\t{\n\t\t\tint dex = 0;\n\t\t\tint max = 0;\n\t\t\tfor (int j = 0; j < s.size(); j++)\n\t\t\t{\n\t\t\t\tif(num[j]!=10)\n\t\t\t\tif (max < num[j])\n\t\t\t\t{\n\t\t\t\t\tmax = num[j];\n\t\t\t\t\tdex = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tnum[dex] = 10;\n\t\t}\n\t\tfor (int i = 0; i < s.size(); i++)\n\t\t{\n\t\t\tif (num[i] != 10)\n\t\t\t\tcout << (char)num[i];\n\t\t}\n\t\tif(i!=count-1)\n\t\tcout << endl;\n\t}\n\t\n}",MULTIPLE_ERROR,64,856 1575041622159220736,8ae7ffb144ed063ef3eec40c8d947586bf02afb7bd1379c59a5239f483624d9f,2022-09-28 16:36:00,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main()\n{\n int t,n,m,i,j,k,x,s;\n scanf(\""%d\"",&t);\n for(i=0;i=ch[k])\n {\n max=ch[x];\n ch[x]=ch[k];\n ch[k]=max;\n }\n }\n }\n }\n for(s=0;s\nint main()\n{\n int t,n,m,i,j,k,x,s;\n scanf(\""%d\"",&t);\n for(i=0;i=ch[k])\n {\n max=ch[x];\n ch[x]=ch[k];\n ch[k]=max;\n }\n }\n }\n }\n for(s=0;s\nint main()\n{\n int t,n,m,i,j,k,x,s;\n scanf(\""%d\"",&t);\n for(i=0;i=ch[k])\n {\n max=ch[x];\n ch[x]=ch[k];\n ch[k]=max;\n }\n }\n }\n }\n for(s=0;s\n#include\n#include\n#include\nusing namespace std;\n\nint main() {\n\n\tint T = 0;\n\tint price;\n\tint n, m;\n\tn = 0;\n\tm = 0;\n\tint tmp;\n\tint size;\n\tcin >> T;\n\tvectorarr;\n\tfor (int k = 0; k < T; k++){\n\t\tcin >> n >> m;\n\t\tcin >> price;\n\t\tsize = n - m;\n\t\t//将数字拆分成字符串\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ttmp = price % 10;\n\t\t\tprice /= 10;\n\t\t\tarr.push_back(tmp);\n\t\t}\n\t\tsort(arr.begin(), arr.end());\n\t\tarr.resize(size);\n\t\tint j = 0;\n\t\tint res = 0;\n\t\tint ans = 0;\n\t\tfor (int i = arr.size()-1,j=0; i >=0; i--,j++) {\n\t\t\tres = pow(10, j);\n\t\t\tans += arr[i]*res;\n\t\t}\n\t\t//1114\n\t\tif (k == T - 1)cout << ans;\n\t\telse cout << ans << endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,308,1752 1575041733174476800,0059036b8c4353a2e67a312dd24215f6f8890aa3c7d6f2b19b089cc2d146046b,2022-09-28 16:36:26,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main(){\n long T,n,m;\n scanf(\""%ld\"",&T);\n for(long i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(long l=x_1; l\nusing namespace std;\ntypedef long long ll;\nconst int maxn=5e5+10; \n#define rep(i,a,b) for(int i=a;i<=b;i++)\n#define repd(i,a,b) for(int i=a;i>=b;i--)\n#define pb push_back\n\nint main(){\n\tint T;\n\tcin>>T;\n\twhile(T--){\n\t\tstring s;\n\t\tint n,m;\n\t\tcin>>n>>m>>s;\n\t\tint mm=m;\n\t\tvector v[10];\n\t\tmap mp;\n\t\trep(i,0,n-1) v[s[i]-'0'].pb(i);\n\t\tint last=-1;\n\t\tstring ans=\""\"";\n\t\twhile(ans.size()!=n-mm){\n\t\t\trep(i,1,9){\n\t\t\t\tfor(int j=mp[i];j=n-mm) break;\n\t\t\t\t\tif(v[i][j]=n-mm) break;\t\t\n\t\t\t\t}\n\t\t\t\tif(ans.size()>=n-mm) break;\n\t\t\t}\n\t\t}\n\t\tcout<\nint main(){\n long T,n,m;\n scanf(\""%ld\"",&T);\n for(long i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(long l=x_1; l\nint main(){\n long T,n,m;\n scanf(\""%ld\"",&T);\n for(long i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(long l=x_1; l\nusing namespace std;\ntypedef long long ll;\nconst int maxn=5e5+10; \n#define rep(i,a,b) for(int i=a;i<=b;i++)\n#define repd(i,a,b) for(int i=a;i>=b;i--)\n#define pb push_back\n\nint main(){\n\tint T;\n\tcin>>T;\n\twhile(T--){\n\t\tstring s;\n\t\tint n,m;\n\t\tcin>>n>>m>>s;\n\t\tint mm=m;\n\t\tvector v[10];\n\t\tmap mp;\n\t\trep(i,0,n-1) v[s[i]-'0'].pb(i);\n\t\tint last=-1;\n\t\tstring ans=\""\"";\n\t\twhile(ans.size()!=n-mm){\n\t\t\trep(i,1,9){\n\t\t\t\tfor(int j=0;j=n-mm) break;\n\t\t\t\t\tif(v[i][j]=n-mm) break;\t\t\n\t\t\t\t}\n\t\t\t\tif(ans.size()>=n-mm) break;\n\t\t\t}\n\t\t}\n\t\tcout<\nusing namespace std;\n\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\tlong int o;\n\t\n\t\n\tcin>>o;\n\t\n\t \n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\n\t\tfor(int i=0;inumber[j+1])\n\t\t{\n\t\t\tint temp2=number[j];\n\t\t\tnumber[j]=number[j+1];\n\t\t\tnumber[j+1]=temp2;\n\t\t}\n\t}\n\t\n}\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tfor(int i=0;i\nint main(){\n long T,n,m;\n scanf(\""%ld\"",&T);\n for(long i = 0; ix){\n x = a[z];\n x_1 = z;\n } \n \n }\n for(long l=x_1; l\nint main()\n{\n int t,n,m,i,j,k,x,s;\n scanf(\""%d\"",&t);\n for(i=0;ich[k]&&ch[x]！=’0‘)\n {\n max=ch[x];\n ch[x]=ch[k];\n ch[k]=max;\n }\n }\n }\n }\n for(s=0;s\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n int i1=0;\n while(num>0){\n a[num%10]++;\n num=num/10;\n i1++;\n }\n int len1=0;\n int ans=0;\n int flag=1;\n for(int j=1;j<10;j++){\n for(int k=0;k\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n int i1=0;\n while(num>0){\n a[num%10]++;\n num=num/10;\n i1++;\n }\n int len1=0;\n int ans=0;\n int flag=1;\n for(int j=1;j<10;j++){\n for(int k=0;k=0;j--){\n if((s.charAt(j)-'0') < bigsmall[bag-1]) {\n bigsmall[bag-1] = (s.charAt(j)-'0');\n Arrays.sort(bigsmall);\n }\n }\n int resout[] = new int[numc];\n int y=0;\n while ((bag -y) > 0){\n for(int t=numc-1;t>=0;t--){\n if(((s.charAt(t)-'0') == bigsmall[y]) && (resout[t]!=1)){\n resout[t] = 1;\n y++;\n break;\n }\n }\n }\n int p=0;\n int qwe[]=new int[numc];\n int asd[]=new int[numc];\n\n for(int h= numc-1;h>=0;h--){\n if(resout[h] == 1){\n if(s.charAt(h)-'0'== bigsmall[0]){\n if((numc-1-h)>bag){\n for(int o=h;oasd[o]) {\n sign = 1;\n break;\n }else {\n break;\n }\n\n }\n if (sign ==0) {\n for(int u=0;u\nusing namespace std;\nconst int maxn = 1e6 + 10;\ntypedef pair pii;\ntypedef long long ll;\ntypedef pair pll;\n#define all(x) (x).begin(), (x).end();\n#define endl '\\n';\n\nvoid solve()\n{\n int n, k;\n cin >> n >> k;\n vector a(n);\n vector vis(n);\n vis.back() = 1;\n int idx = n - 1, sz = 0;\n for (auto &x : a)\n cin >> x;\n for (int i = a.size() - 2; i >= 0; i--)\n {\n\n while (a[i] > a[idx])\n {\n // if(i==0)\n // cout << \""s\"" << endl;\n \n vis[i] = 1;\n if (i == 0)\n break;\n i--;\n \n }\n idx = i;\n }\n\n vector f(n);\n for (int i = 0; i < n; i++)\n if (vis[i] && k >= vis[i])\n {\n for (int j = 0; j < vis[i]; j++)\n f[i + j] = 1;\n k -= vis[i];\n i = i + vis[i] - 1;\n }\n\n // for(auto x:vis)\n // cout << x <<\"" \"";\n\n for (int i = 0; i < n; i++)\n if (!f[i])\n cout << a[i];\n cout << endl;\n}\n\nint main()\n{\n cin.tie(0);\n int _;\n cin >> _;\n while (_--)\n solve();\n return 0;\n}",WRONG_ANSWER,274,2780 1575044343545286656,4523cc430c4795f808a1cbc9a621be9340e9d1aa07c6b2181b5c0d1a9ab6feb3,2022-09-28 16:46:49,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nconst int N = 2e5 +10;\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n string s,res;\n cin>>s;\n int a[N];\n for(int i=0;i ss;\n for(int i=0;in-m)\n { \n ss.pop();\n continue;\n }\n res+=ss.top()+'0';\n ss.pop();\n }\n for(int i=res.length()-1;i>=0;i--)\n {\n cout<=0&&(ans[modi]-'0')>x&&m>0){\n modi--;\n m--;\n }\n ans[++modi] = (char)(x+'0');\n }\n while (m>0){modi--;m--;}\n for(int k=0;k<=modi;k++)System.out.print(ans[k]);\n System.out.println();\n }\n }\n},PARTIAL_ACCEPTED,4813,43636 1575045115423473664,5898017b54cdd95dfbacbd4577deb68173830d5a83eafc08ba4c98cc675f1485,2022-09-28 16:49:53,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n for(int i=0;i>len>>shan;\n cin>>num;\n int i1=0;\n while(num>0){\n a[num%10]++;\n num=num/10;\n i1++;\n }\n int len1=0;\n long long ans=0;\n int flag=1;\n for(int j=1;j<10;j++){\n if(a[j]==0)continue;\n for(int k=0;k\n#include \n\nint main(){\n long long int T = 0;\n long long int n = 0,m = 0;\n scanf(\""%lld\"",&T);\n for(long long int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%d\"",c[j]);\n }\n printf(\""\\n\"");\n free(a);\n free(c);\n }\n \n return 0;\n}",RUNTIME_ERROR,190,4508 1575045238727622656,27d26e76d37de037dc307795981186768ad9ee1cd4523ae31c7b2a119332ccef,2022-09-28 16:50:22,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n\nint main(){\n long long int T = 0;\n long long int n = 0,m = 0;\n scanf(\""%lld\"",&T);\n for(long long int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%lld\"",c[j]);\n }\n printf(\""\\n\"");\n free(a);\n free(c);\n }\n \n return 0;\n}",RUNTIME_ERROR,207,4516 1575045377277648896,27d26e76d37de037dc307795981186768ad9ee1cd4523ae31c7b2a119332ccef,2022-09-28 16:50:55,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n\nint main(){\n long long int T = 0;\n long long int n = 0,m = 0;\n scanf(\""%lld\"",&T);\n for(long long int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%lld\"",c[j]);\n }\n printf(\""\\n\"");\n free(a);\n free(c);\n }\n \n return 0;\n}",WRONG_ANSWER,530,4392 1575045659965349888,72c931a1e7902607f487002f240eeafc7b62cb4cc5e3331fef34b50750044fe9,2022-09-28 16:52:02,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int t= sc.nextInt();\n for (int i = 0; i Integer.parseInt(s.substring(k+1,k+2))){\n s=s.substring(1);\n n--;\n flag=1;\n k=0;\n continue;\n }\n\n\n int max=0;\n for (int l = 0; l < n; l++) {\n max=Math.max(Integer.parseInt(s.substring(l,l+1)),max);\n }\n for (int l = 0; l \nusing namespace std;\nint main()\n{\n int t,a[200010]={0},n,m;\n cin>>t;\n for(int i=1;i<=t;i++)\n {\n string c,s;\n cin>>n>>m>>c;\n for(int j=0;j0)\n {\n for(int j=0;j\n\n\n\nint main()\n{\n\tint n,i,t,z,min,p,m,cnt=1,count=0,ret=0,s;\n\tscanf(\""%d\"",&p);\n\tchar money[200000];\n\tchar mi[200000];\n\tfor(z=0;zmoney[s])\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tmi[i]=money[s];\n\t\t\t\t\t\t\t\tcnt=s+1;\n\t\t\t\t\t\t\t\tret=1;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(ret==1)\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(t-count>n-m)\n\t\t\t\t{\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tret=0;\n\t\t}\n\t\tif(mi[n-m-1]==0)\n\t\t{\n\t\t\tmi[n-m-1]=money[n];\n\t\t}\n\t\tfor(i=0;i\nusing namespace std;\ntypedef long long ll;\nconst int maxn=5e5+10; \n#define rep(i,a,b) for(int i=a;i<=b;i++)\n#define repd(i,a,b) for(int i=a;i>=b;i--)\n#define pb push_back\n\nint main(){\n\tint T;\n\tcin>>T;\n\twhile(T--){\n\t\tstring s;\n\t\tint n,m;\n\t\tcin>>n>>m>>s;\n\t\tint mm=m;\n\t\tvector v[10];\n\t\tmap mp;\n\t\trep(i,0,n-1) v[s[i]-'0'].pb(i);\n\t\tint last=-1;\n\t\tstring ans=\""\"";\n\t\twhile(ans.size()=n-mm) break;\n\t\t\t\t\tif(v[i][j]=n-mm) break;\n\t\t\t}\t\n\t\t}\n\t\tcout<\n#include \n\nint main(){\n long long int T = 0;\n long long int n = 0,m = 0;\n scanf(\""%lld\"",&T);\n for(long long int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%lld\"",c[j]);\n }\n printf(\""\\n\"");\n free(a);\n free(c);\n }\n \n return 0;\n}",WRONG_ANSWER,502,4544 1575045980074631168,4523cc430c4795f808a1cbc9a621be9340e9d1aa07c6b2181b5c0d1a9ab6feb3,2022-09-28 16:53:19,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nconst int N = 2e5 +10;\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n string s,res;\n cin>>s;\n int a[N];\n for(int i=0;i ss;\n for(int i=0;i=ss.top()&&ss.size()=0;i--)\n {\n cout<\nusing namespace std;\ntypedef long long ll;\nconst int maxn=5e5+10; \n#define rep(i,a,b) for(int i=a;i<=b;i++)\n#define repd(i,a,b) for(int i=a;i>=b;i--)\n#define pb push_back\n\nint main(){\n\tint T;\n\tcin>>T;\n\twhile(T--){\n\t\tstring s;\n\t\tint n,m;\n\t\tcin>>n>>m>>s;\n\t\tint mm=m;\n\t\tvector v[10];\n\t\tmap mp;\n\t\trep(i,0,n-1) v[s[i]-'0'].pb(i);\n\t\tint last=-1;\n\t\tstring ans=\""\"";\n\t\twhile(ans.size()=n-mm) break;\n\t\t\t\t\tif(v[i][j]=n-mm) break;\n\t\t\t}\t\n\t\t}\n\t\tcout<\n\n\n\nint main()\n{\n\tint n,i,t,z,min,p,m,cnt=1,count=0,ret=0,s;\n\tscanf(\""%d\"",&p);\n\tchar money[200000];\n\tchar mi[200000];\n\tfor(z=0;zmoney[s])\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tmi[i]=money[s];\n\t\t\t\t\t\t\t\tcnt=s+1;\n\t\t\t\t\t\t\t\tret=1;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(ret==1)\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(t-count>n-m)\n\t\t\t\t{\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tret=0;\n\t\t}\n\t\tif(mi[n-m-1]==0)\n\t\t{\n\t\t\tmi[n-m-1]=money[n];\n\t\t}\n\t\tfor(i=0;i<=n-m;i++)\n\t\t{\n\t\t\tprintf(\""%c\"",mi[i]);\n\t\t\tif(i==n-m)\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t\tcnt=1;\n\t\tcount=0;\n\t}\n\treturn 0;\n}\t",MULTIPLE_ERROR,1962,1204 1575046239387893760,61bf8a3882552630582b70c6da81c99c715096b8fec33ce4e4805b94b240642f,2022-09-28 16:54:21,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n\n\n\nint main()\n{\n\tint n,i,t,z,min,p,m,cnt=1,count=0,ret=0,s;\n\tscanf(\""%d\"",&p);\n\tchar money[200000];\n\tchar mi[200000];\n\tfor(z=0;zmoney[s])\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tmi[i]=money[s];\n\t\t\t\t\t\t\t\tcnt=s+1;\n\t\t\t\t\t\t\t\tret=1;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(ret==1)\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(t-count>n-m)\n\t\t\t\t{\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tret=0;\n\t\t}\n\t\tif(mi[n-m-1]==0)\n\t\t{\n\t\t\tmi[n-m-1]=money[n];\n\t\t}\n\t\tfor(i=0;i<=n-m;i++)\n\t\t{\n\t\t\tprintf(\""%c\"",mi[i]);\n\t\t\tif(i==n-m)\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t\tcnt=1;\n\t\tcount=0;\n\t}\n\treturn 0;\n}\t",MULTIPLE_ERROR,1979,1208 1575046338134392832,569a6db1313d25f282bd0ed487c37a89c1bd48433e81dbc2951ddaf1a4ee6ccb,2022-09-28 16:54:44,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[20000]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t cin>>str;\n \t for(int l=0;lmax){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j\nusing namespace std;\n\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\t int o;\n\tcin>>o;\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\tfor(int i=0;inumber[j+1])\n\t\t{\n\t\t\tint temp2=number[j];\n\t\t\tnumber[j]=number[j+1];\n\t\t\tnumber[j+1]=temp2;\n\t\t}\n\t}\n\t\n}\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tfor(int i=0;i\nusing namespace std;\n\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\t int o;\n\tcin>>o;\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\tfor(int i=0;inumber[j+1])\n\t\t{\n\t\t\tint temp2=number[j];\n\t\t\tnumber[j]=number[j+1];\n\t\t\tnumber[j+1]=temp2;\n\t\t}\n\t}\n\t\n}\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tfor(int i=0;iInteger.parseInt(s.substring(k+1,k+2))){\n s=s.substring(1);\n n--;\n flag=1;\n k=0;\n continue;\n }\n int max=0;\n for (int l = 0; l < n; l++) {\n max=Math.max(Integer.parseInt(s.substring(l,l+1)),max);\n }\n for (int l = 0; l \n#include\nusing namespace std;\n\nint main(){\n\tint T;\n\tcin>>T;\n\tint n,m;\n\tfor(int i=0; i>n>>m;\n\t\tfor(int j=0;j<=n;j++){\n\t\t\ta[j] = getchar();\n\t\t}\n\t\tfor(int num = 0;num<= m;num++){\n\t\t\tchar max = a[0];\n\t\t int index = 0;\n\t\t for(int k=0 ; k<=n ; k++){\n\t\t\t if(a[k] > max){\n\t\t\t\t max = a[k];\n\t\t\t\t index = k;\n\t\t\t }\n\t\t }\n\t\t int l = 0;\n\t\t for(int c=0;c<=n;c++){\n\t\t\t if(index!=c&&a[c]!='0'){\n\t\t\t\t b[l] = a[c];\n\t\t\t\t l++;\n\t\t\t }\n\t\t\t else{\n\t\t\t \ta[c] = '0';\n\t\t\t\t}\n\t\t }\n\t\t \n\t\t}\n\t\tfor(int p=0;p<=n-m;p++){\n\t\t\tcout<\nusing namespace std;\nconst int maxn =1e6+10;\ntypedef pair pii;\ntypedef long long ll ;\ntypedef pair pll;\n#define all(x) (x).begin(),(x).end();\n#define endl '\\n';\n\nvoid solve()\n{\n int n, k;\n char c;\n cin >> n >> k;\n stack stk;\n for (int i = 1; i <= n-2;i++)\n {\n // cout << \""i=\"" << i<<\"" \""<> c;\n int x = c - '0';\n\n if(!stk.size()||k==0||x==stk.top())\n stk.push(x);\n else \n {\n if(x>stk.top())\n k--;\n else if(x ans;\n\n // cout << stk.size()<<\"" \""<> a >> b;\n // cout << a << \"" \"" << b << endl;\n if (k == 1)\n {\n stk.push(min(a, b)-'0');\n // cout << char(stk.top()) << endl;\n }\n else \n {\n stk.push(a-'0');\n stk.push(b-'0');\n }\n while (stk.size())\n {\n ans.push_back(stk.top());\n stk.pop();\n }\n for (int i = ans.size() - 1; i >= 0;i--)\n cout << ans[i];\n cout << endl;\n}\n\nint main()\n{\n cin.tie(0);\n int _;\n cin>>_;\n while(_--)\n solve();\n return 0;\n}",WRONG_ANSWER,278,2860 1575046672352890880,88b80152288602f35363fbcf695ca1d7eed093d6c31cb9b2a39595f09c2481ce,2022-09-28 16:56:04,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\n\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\t int o;\n\tcin>>o;\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\tfor(int i=0;inumber[j+1])\n\t\t{\n\t\t\tint temp2=number[j];\n\t\t\tnumber[j]=number[j+1];\n\t\t\tnumber[j+1]=temp2;\n\t\t}\n\t}\n\t\n}\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tfor(int i=0;i\n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n \n \n\t\t for(int k=0;k\n\n\n\nint main()\n{\n\tint n,i,t,z,p,m,cnt=1,count=0,ret=0,s;\n\tscanf(\""%d\"",&p);\n\tchar money[200000];\n\tchar mi[200000];\n\tfor(z=0;zmoney[s])\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tmi[i]=money[s];\n\t\t\t\t\t\t\t\tcnt=s+1;\n\t\t\t\t\t\t\t\tret=1;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(ret==1)\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(t-count>n-m)\n\t\t\t\t{\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tret=0;\n\t\t}\n\t\tif(mi[n-m-1]==0)\n\t\t{\n\t\t\tmi[n-m-1]=money[n];\n\t\t}\n\t\tfor(i=0;i<=n-m;i++)\n\t\t{\n\t\t\tprintf(\""%c\"",mi[i]);\n\t\t\tif(i==n-m)\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t\tcnt=1;\n\t\tcount=0;\n\t}\n\treturn 0;\n}\t",MULTIPLE_ERROR,1962,1104 1575046823230398464,72c931a1e7902607f487002f240eeafc7b62cb4cc5e3331fef34b50750044fe9,2022-09-28 16:56:40,Java,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int t= sc.nextInt();\n for (int i = 0; i Integer.parseInt(s.substring(k+1,k+2))){\n s=s.substring(1);\n n--;\n flag=1;\n k=0;\n continue;\n }\n int max=0;\n for (int l = 0; l < n; l++) {\n max=Math.max(Integer.parseInt(s.substring(l,l+1)),max);\n }\n for (int l = 0; l \nint main()\n{\n int t,n,m,i,j,k,s,count=0;\n scanf(\""%d\"",&t);\n for(i=0;i\n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n \n \n\t\t for(int k=0;k\n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n \n \n\t\t for(int k=0;k\nusing namespace std;\nconst int N = 2e5 +10;\nint a[N];\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n string s,res;\n cin>>s;\n for(int i=0;i ss;\n for(int i=0;i=ss.top()&&ss.size()=0;i--)\n {\n cout<Integer.parseInt(s.substring(k+1,k+2))){\n s=s.substring(1);\n n--;\n flag=1;\n k=0;\n continue;\n }\n int max=0;\n for (int l = 0; l < n; l++) {\n max=Math.max(Integer.parseInt(s.substring(l,l+1)),max);\n }\n for (int l = 0; l \nusing namespace std;\ntypedef long long ll;\nconst int maxn=5e5+10; \n#define rep(i,a,b) for(int i=a;i<=b;i++)\n#define repd(i,a,b) for(int i=a;i>=b;i--)\n#define pb push_back\n\nint main(){\n\tint T;\n\tcin>>T;\n\twhile(T--){\n\t\tstring s;\n\t\tint n,m;\n\t\tcin>>n>>m>>s;\n\t\tint mm=m;\n\t\tvector v[10];\n\t\trep(i,0,n-1) v[s[i]-'0'].pb(i);\n\t\tint last=-1;\n\t\tstring ans=\""\"";\n\t\trep(i,1,9){\n\t\t\tfor(int j=0;j=n-mm) break;\n\t\t\t\tif(v[i][j]=n-mm) break;\n\t\t}\t\n\t\tint c=n-mm-ans.size();\n\t\trep(i,last+1,n-1){\n\t\t\tif(c<=0) break;\n\t\t\tans+=s[i];\n\t\t\tc--;\n\t\t}\n\t\tcout<\nusing namespace std;\nconst int N = 2e5 +10;\nint a[N];\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n string s,res=\""\"";\n cin>>s;\n for(int i=0;i ss;\n for(int i=0;i=ss.top()&&ss.size()=0;i--)\n {\n cout<\nint main(){\n int m;0=\nint main(){\n int m;0=\nusing namespace std;\nconst int N = 2e5 +10;\nint a[N];\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n string s,res=\""\"";\n cin>>s;\n for(int i=0;i ss;\n for(int i=0;i=ss.top()&&ss.size()=0;i--)\n {\n cout<\nusing namespace std;\nint main()\n{\n int t,a[200010]={0},n,m;\n cin>>t;\n for(int i=1;i<=t;i++)\n {\n string c,s;\n cin>>n>>m>>c;\n /*for(int j=0;j0)\n {\n for(int j=0;j\nusing namespace std;\nint main()\n{\n\tint T;\n\tint n,m,sum=0,abs;\n\tchar a[200000];\n\tint dig[12]={0};\n\tint k;\n\tcin>>T;\n\tfor(int i=0;i>n>>m;\n\t\tfor(int j=0;j>a[j];\n\t\t\tdig[a[j]-'0']++;\n\t\t}\n\t\tfor(k=9;k>=0;k--)\n\t\t{\n\t\t\t\n\t\t\tif(sum+dig[k]>=m)\n\t\t\t{\n\t\t\t\tabs=m-sum;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tsum+=dig[k];\n\t\t} \n\t\t//cout<k+'0')\n\t\t\tcontinue;\n\t\t\telse if(a[l]==k+'0'&&abs>0)\n\t\t\t{\n\t\t\t\tabs--;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse\n\t\t\tcout<\n\n\n\nint main()\n{\n\tint n,i,t,z,p,m,cnt=1,count=0,ret=0,s;\n\tscanf(\""%d\"",&p);\n\tchar money[200000];\n\tchar mi[200000];\n\tfor(z=0;zmoney[s])\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tmi[i]=money[s];\n\t\t\t\t\t\t\t\tcnt=s+1;\n\t\t\t\t\t\t\t\tret=1;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(ret==1)\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(t-count>n-m)\n\t\t\t\t{\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tret=0;\n\t\t}\n\t\tif(mi[n-m-1]==0)\n\t\t{\n\t\t\tmi[n-m-1]=money[n];\n\t\t}\n\t\tfor(i=0;i<=n-m;i++)\n\t\t{\n\t\t\tprintf(\""%c\"",mi[i]);\n\t\t\tif(i==n-m)\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t\tcnt=1;\n\t\tcount=0;\n\t}\n\treturn 0;\n}\t",MULTIPLE_ERROR,1953,1204 1575048100341436416,8ae7ffb144ed063ef3eec40c8d947586bf02afb7bd1379c59a5239f483624d9f,2022-09-28 17:01:44,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main()\n{\n int t,n,m,i,j,k,s,count=0;\n scanf(\""%d\"",&t);\n for(i=0;i\n#include \nusing namespace std;\nint main()\n{\n\tint n;\n\tcin>>n;\n\twhile (n--)\n\t{\n int len,num;\n\t\tcin>>len>>num;\n\t\tstring s;\n\t\tcin>>s;\n sort(s.begin(),s.end());\n string res;\n for (int i=0;iInteger.parseInt(s.substring(k+1,k+2))){\n s=s.substring(1);\n n--;\n m--;\n continue;\n }\n int max=0;\n for (int l = 0; l < n; l++) {\n max=Math.max(Integer.parseInt(s.substring(l,l+1)),max);\n }\n for (int l = 0; l Integer.parseInt(s.substring(k+1,k+2))){\n s=s.substring(1);\n n--;\n\n continue;\n }\n int max=0;\n for (int l = 0; l < n; l++) {\n max=Math.max(Integer.parseInt(s.substring(l,l+1)),max);\n }\n for (int l = 0; l Integer.parseInt(s.substring(k+1,k+2))){\n s=s.substring(1);\n n--;\n\n continue;\n }\n int max=0;\n for (int l = 0; l < n; l++) {\n max=Math.max(Integer.parseInt(s.substring(l,l+1)),max);\n }\n for (int l = 0; l \n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n \n \n\t\t for(int k=0;k\n#include\nusing namespace std;\n\nint main(){\n\tint T;\n\tcin>>T;\n\tint n,m;\n\tfor(int i=0; i max){\n\t\t\t\t max = a[k];\n\t\t\t\t index = k;\n\t\t\t }\n\t\t }\n\t\t int l = 0;\n\t\t for(int c=0;c<=n;c++){\n\t\t\t if(index!=c&&a[c]!='0'){\n\t\t\t\t b[l] = a[c];\n\t\t\t\t l++;\n\t\t\t }\n\t\t\t else{\n\t\t\t \ta[c] = '0';\n\t\t\t\t}\n\t\t }\n\t\t \n\t\t}\n\t\tfor(int p=0;p<=n-m;p++){\n\t\t\tcout<\n#include\nint main(){\n int T;\n long long m,n,o,count=0,s;\n scanf(\""%d\"",&T);\n for(int i=0;i\nusing namespace std;\nconst int maxn = 1e6 + 10;\ntypedef pair pii;\ntypedef long long ll;\ntypedef pair pll;\n#define all(x) (x).begin(), (x).end();\n#define endl '\\n';\n\nvoid solve()\n{\n int n, k;\n cin >> n >> k;\n vector a(n);\n for(auto &x:a)\n cin >> x;\n stack stk;\n for (int i = 0; i < n-1;i++)\n {\n if(a[i]>a[i+1]&&k>0)\n {\n // cout << i << endl;\n k--;\n }\n else \n {\n while(stk.size()&&stk.top()>a[i]&&k>0)\n stk.pop(), k--;\n stk.push(a[i]);\n // cout << \""po\"" << a[i] << endl;\n }\n }\n\n if(!k)\n stk.push(a.back());\n\n vector ans;\n while(stk.size())\n {\n ans.push_back(stk.top());\n stk.pop();\n }\n reverse(ans.begin(),ans.end());\n for(auto x:ans)\n cout << x-'0';\n cout << endl;\n}\n\nint main()\n{\n cin.tie(0);\n int _;\n cin >> _;\n while (_--)\n solve();\n return 0;\n}",PARTIAL_ACCEPTED,349,3088 1575048987088609280,61bf8a3882552630582b70c6da81c99c715096b8fec33ce4e4805b94b240642f,2022-09-28 17:05:16,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\n\n\n\nint main()\n{\n\tint n,i,t,z,p,m,cnt=1,count=0,ret=0,s;\n\tscanf(\""%d\"",&p);\n\tchar money[200000];\n\tchar mi[200000];\n\tfor(z=0;zmoney[s])\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tmi[i]=money[s];\n\t\t\t\t\t\t\t\tcnt=s+1;\n\t\t\t\t\t\t\t\tret=1;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(ret==1)\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(t-count>n-m)\n\t\t\t\t{\n\t\t\t\t\tmi[i]=money[t];\n\t\t\t\t\tcnt=t+1;\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tret=0;\n\t\t}\n\t\tif(mi[n-m-1]==0)\n\t\t{\n\t\t\tmi[n-m-1]=money[n];\n\t\t}\n\t\tfor(i=0;i<=n-m;i++)\n\t\t{\n\t\t\tprintf(\""%c\"",mi[i]);\n\t\t\tif(i==n-m)\n\t\t\tprintf(\""%c\"",10);\n\t\t}\n\t\tcnt=1;\n\t\tcount=0;\n\t}\n\treturn 0;\n}\t",MULTIPLE_ERROR,1892,1196 1575049181050421248,147710752d8e8081300c289a748f858e03386bd89e19cc4b252f6fc5b9bd7b4f,2022-09-28 17:06:02,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nlong long num;\nint main()\n{\n\tint index,min,count;\n\tint t,m,n,i,j,k;\n\tcin>>t;\n\tint a[2000];\n\tint b[2000];\n\tfor(i = 0; i < t; i++)\n\t{\n\t\tmemset(a,0,sizeof(a));\n\t\tmemset(b,0,sizeof(b));\n\t\tcin>>n>>m;\n\t\tcin>>num;\n\t\tfor(j = n-1; j >= 0; j--)\n\t\t{\n\t\t\ta[j] = num % 10;\n\t\t\tnum /= 10;\n\t\t}\n\t\tindex = -1;\n\t\tmin = 1000;\n\t\tcount = 0;\n\t\twhile(count<(n-m)){\n\t\t\tfor(k = 0; k < n; k++)\n\t\t\t{\n\t\t\t\tif(a[k]<=min){\n\t\t\t\t\tmin = a[k];\n\t\t\t\t\tindex = k;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcount++;\n\t\t\tb[index] = min;\n\t\t\ta[index] = 10;\n\t\t\tmin = 10;\n\t\t}\n\t\tfor(j = 0; j < n; j++)\n\t\t{\n\t\t\tif(b[j]!=0){\n\t\t\t\tcout<\n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n \n \n\t\t for(int k=0;k\nusing namespace std;\nconst int N = 2e5 +10;\nint a[N];\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n string s,res;\n cin>>s;\n int cnt=0;\n for(int i=0;i ss;\n for(int i=0;i=ss.top()&&ss.size()=0;i--)\n {\n cout<\nusing namespace std;\nint main()\n{\n int t;\n scanf(\""%d\"",&t);\n int m,n;\n int a[6];\n int i,j,w,p;\n int max=0;\n int q=0;\n for(int i=1;i<=t;i++)\n {\n scanf(\""%d %d\"",&m,&n);\n for(int j=0;j\nusing namespace std;\nlong long num;\nint main()\n{\n\tint index,min,count;\n\tint t,m,n,i,j,k;\n\tcin>>t;\n\tint a[2000];\n\tint b[2000];\n\tfor(i = 0; i < t; i++)\n\t{\n\t\tmemset(a,0,sizeof(a));\n\t\tmemset(b,0,sizeof(b));\n\t\tcin>>n>>m;\n\t\tcin>>num;\n\t\tfor(j = n-1; j >= 0; j--)\n\t\t{\n\t\t\ta[j] = num % 10;\n\t\t\tnum /= 10;\n\t\t}\n\t\tindex = -1;\n\t\tmin = 1000;\n\t\tcount = 0;\n\t\twhile(count<(n-m)){\n\t\t\tfor(k = 0; k < n; k++)\n\t\t\t{\n\t\t\t\tif(a[k]<=min){\n\t\t\t\t\tmin = a[k];\n\t\t\t\t\tindex = k;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcount++;\n\t\t\tb[index] = min;\n\t\t\ta[index] = 10;\n\t\t\tmin = 10;\n\t\t}\n\t\tfor(j = 0; j < n; j++)\n\t\t{\n\t\t\tif(b[j]!=0){\n\t\t\t\tcout<\n#define ll long long\nusing namespace std;\n\nint main() {\nprintf(\""35\\n112\\n1114\"");\n}",WRONG_ANSWER,56,596 1575049677210996736,43c1996d6543440ca26cbb8948afe5c5dc698016c58f3ebbe738834403f782a9,2022-09-28 17:08:00,C++,2.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nusing namespace std;\nconst int maxn = 1e6 + 10;\ntypedef pair pii;\ntypedef long long ll;\ntypedef pair pll;\n#define all(x) (x).begin(), (x).end();\n#define endl '\\n';\n\nvoid solve()\n{\n int n, k;\n cin >> n >> k;\n vector a(n);\n for(auto &x:a)\n cin >> x;\n stack stk;\n for (int i = 0; i < n-1;i++)\n {\n if(a[i]>a[i+1]&&k>0)\n {\n // cout << i << endl;\n k--;\n }\n else \n {\n while(stk.size()&&stk.top()>a[i]&&k>0)\n stk.pop(), k--;\n stk.push(a[i]);\n // cout << \""po\"" << a[i] << endl;\n }\n }\n\n if(!k)\n stk.push(a.back());\n\n vector ans;\n while(stk.size())\n {\n ans.push_back(stk.top());\n stk.pop();\n }\n reverse(ans.begin(),ans.end());\n for(auto x:ans)\n cout << x-'0';\n cout << endl;\n}\n\nint main()\n{\n cin.tie(0);\n int _;\n cin >> _;\n while (_--)\n solve();\n return 0;\n}",PARTIAL_ACCEPTED,321,3024 1575049725403971584,8ae7ffb144ed063ef3eec40c8d947586bf02afb7bd1379c59a5239f483624d9f,2022-09-28 17:08:12,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main()\n{\n int t,n,m,i,j,k,s,x;\n char temp;\n scanf(\""%d\"",&t);\n for(i=0;i\n#include\nusing namespace std;\n\nint main(){\n\tint T;\n\tcin>>T;\n\tint n,m;\n int k=1;\n\tfor(int i=0; i>n>>m;\n\t\tfor(int j=0;j<=n;j++){\n\t\t\ta[j] = getchar();\n\t\t}\n\t\tfor(int num = 0;num<= m;num++){\n\t\t\tchar max = a[0];\n\t\t int index = 0;\n\t\t for(int k=0 ; k<=n ; k++){\n\t\t\t if(a[k] > max){\n\t\t\t\t max = a[k];\n\t\t\t\t index = k;\n\t\t\t }\n\t\t }\n\t\t int l = 0;\n\t\t for(int c=0;c<=n;c++){\n\t\t\t if(index!=c&&a[c]!='0'){\n\t\t\t\t b[l] = a[c];\n\t\t\t\t l++;\n\t\t\t }\n\t\t\t else{\n\t\t\t \ta[c] = '0';\n\t\t\t\t}\n\t\t }\n\t\t \n\t\t}\n\t\tfor(int p=1;p<=n-m;p++){\n\t\t\tcout<\n#include \n\nint main(){\n long long int T = 0;\n long long int n = 0,m = 0;\n scanf(\""%lld\"",&T);\n for(long long int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%lld\"",c[j]);\n }\n printf(\""\\n\"");\n free(a);\n free(c);\n }\n \n return 0;\n}",WRONG_ANSWER,499,4384 1575050154392768512,8155e119b8800f713f143ddd24fc9246c3c587b7d746741f1266c43d542bf023,2022-09-28 17:09:54,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \n#include \n#include \n#include \n\nusing namespace std;\n\nconst int MAXS = 200005;\n\nvoid solve()\n{\n\t// 蛮力法\n\tint T;\n\tcin >> T;\n\twhile(T--)\n\t{\n\t\tint len, m;\n\t\tcin >> len >> m;\n\t\tstring str;\n\t\tcin >> str;\n\t\tint* price = new int[MAXS];\n\t\tfor(int i = 0; i < len; i++)\n\t\t{\n\t\t\tint num = str[i]-'0';\n\t\t\tprice[i] = num;\n\t\t}\n\t\tint priceLen = len;\n//\t\t114514\n//\t\t3\n//\t\t贪心算法\n//\t\t先删最大数，相同数删第一个 \n\t\t\n\t\tint cnt = 0;\n\t\twhile(cnt < m)\n\t\t{\n\t\t\tint maxIndex = 0;\n\t\t\tfor(int i = 0; i < priceLen; i++)\n\t\t\t{\n\t\t\t\tif(price[i] > price[maxIndex])\n\t\t\t\t{\n\t\t\t\t\tmaxIndex = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//删掉 maxIndex处的元素\n//\t\t\t2 3 4\n//\t\t\tmaxIndex\n\t\t\tfor(int i = maxIndex, j = maxIndex + 1; i < priceLen - 1; i++, j++)\n\t\t\t{\n\t\t\t\tprice[i] = price[j];\n\t\t\t}\n\t\t\tpriceLen--;\n\t\t\tcnt++; //红包数 \n\t\t}\n\t\t// 输出 price 的内容\n\t\tfor(int i = 0; i < priceLen; i++)\n\t\t{\n\t\t\tcout << price[i];\n\t\t } \n\t\tcout << endl;\n\t\tdelete[] price;\n\t}\n}\n\nint main()\n{\n\tsolve();\n//\tvector test;\n//\ttest.push_back(2);\n//\ttest.push_back(2);\n//\ttest.pop_back();\n//\tfor(int i = 0; i < test.size(); i++)\n//\t{\n//\t\tcout << test[i] << \"" \"" << test.size();\n//\t}\n\treturn 0;\n}",MULTIPLE_ERROR,2024,1352 1575050337080295424,43c1996d6543440ca26cbb8948afe5c5dc698016c58f3ebbe738834403f782a9,2022-09-28 17:10:38,C++,12.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nusing namespace std;\nconst int maxn = 1e6 + 10;\ntypedef pair pii;\ntypedef long long ll;\ntypedef pair pll;\n#define all(x) (x).begin(), (x).end();\n#define endl '\\n';\n\nvoid solve()\n{\n int n, k;\n cin >> n >> k;\n vector a(n);\n for(auto &x:a)\n cin >> x;\n stack stk;\n for (int i = 0; i < n-1;i++)\n {\n if(a[i]>a[i+1]&&k>0)\n {\n // cout << i << endl;\n k--;\n }\n else \n {\n while(stk.size()&&stk.top()>a[i]&&k>0)\n stk.pop(), k--;\n stk.push(a[i]);\n // cout << \""po\"" << a[i] << endl;\n }\n }\n // cout << stk.size() << endl;\n if(!k)\n stk.push(a.back());\n else \n {\n k--;\n while(k--)\n stk.pop();\n }\n vector ans;\n while(stk.size())\n {\n ans.push_back(stk.top());\n stk.pop();\n }\n reverse(ans.begin(),ans.end());\n for(auto x:ans)\n cout << x-'0';\n cout << endl;\n}\n\nint main()\n{\n cin.tie(0);\n int _;\n cin >> _;\n while (_--)\n solve();\n return 0;\n}",PARTIAL_ACCEPTED,362,3164 1575050535655002112,8ae7ffb144ed063ef3eec40c8d947586bf02afb7bd1379c59a5239f483624d9f,2022-09-28 17:11:25,C,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include \nint main()\n{\n int t,n,m,i,j,k,s,x;\n char temp;\n scanf(\""%d\"",&t);\n for(i=0;ich[k])\n {\n max=ch[x];\n ch[x]=ch[k];\n ch[k]=max;\n }\n }\n }\n for(s=0;s\nusing namespace std;\nlong long num;\nint main()\n{\n\tint index,min,count;\n\tint t,m,n,i,j,k;\n\tcin>>t;\n\tint a[2000];\n\tint b[2000];\n\tfor(i = 0; i < t; i++)\n\t{\n\t\tmemset(a,0,sizeof(a));\n\t\tmemset(b,0,sizeof(b));\n\t\tcin>>n>>m;\n\t\tcin>>num;\n\t\tfor(j = n-1; j >= 0; j--)\n\t\t{\n\t\t\ta[j] = num % 10;\n\t\t\tnum /= 10;\n\t\t}\n\t\tindex = -1;\n\t\tmin = 1000;\n\t\tif(m == 1){\n\t\t\tb[n-1] = a[n-1];\n\t\t\tcount ++;\n\t\t}\n\t\twhile(count<(n-m)){\n\t\t\tfor(k = 0; k < n; k++)\n\t\t\t{\n\t\t\t\tif(a[k]<=min){\n\t\t\t\t\tmin = a[k];\n\t\t\t\t\tindex = k;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcount++;\n\t\t\tb[index] = min;\n\t\t\ta[index] = 10;\n\t\t\tmin = 10;\n\t\t}\n\t\tfor(j = 0; j < n; j++)\n\t\t{\n\t\t\tif(b[j]!=0){\n\t\t\t\tcout<\nusing namespace std;\ntypedef long long ll;\nconst int maxn=5e5+10; \n#define rep(i,a,b) for(int i=a;i<=b;i++)\n#define repd(i,a,b) for(int i=a;i>=b;i--)\n#define pb push_back\n\nint main(){\n\tint T;\n\tcin>>T;\n\twhile(T--){\n\t\tstring s;\n\t\tint n,m;\n\t\tcin>>n>>m>>s;\n\t\tint mm=m;\n\t\tvector v[10];\n\t\trep(i,0,n-1) v[s[i]-'0'].pb(i);\n\t\tint last=-1;\n\t\tstring ans=\""\"";\n\t\tmap mp;\n\t\twhile(ans.size()=v[i].size()) continue;\n\t\t\t\tif(last==-1){\n\t\t\t\t\tif(v[i][j]<=m){\n\t\t\t\t\t\tm-=v[i][j];\n\t\t\t\t\t\tans+=(i+'0');\n\t\t\t\t\t\tlast=v[i][j];\n\t\t\t\t\t\tmp[i]=j+1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(v[i][j]-last-1<=m){\n\t\t\t\t\tm-=(v[i][j]-last-1);\n\t\t\t\t\tans+=(i+'0');\n\t\t\t\t\tlast=v[i][j];\n\t\t\t\t\tmp[i]=j+1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\t\n\t\t}\n\t\tcout<\n#include\nusing namespace std;\n\nint main(){\n\tint T;\n\tcin>>T;\n\tint n,m;\n int k=1;\n\tfor(int i=0; i>n>>m;\n\t\tfor(int j=0;j<=n;j++){\n\t\t\ta[j] = getchar();\n\t\t}\n\t\tfor(int num = 0;num<= m;num++){\n\t\t\tchar max = a[0];\n\t\t int index = 0;\n\t\t for(int k=0 ; k<=n ; k++){\n\t\t\t if(a[k] > max){\n\t\t\t\t max = a[k];\n\t\t\t\t index = k;\n\t\t\t }\n\t\t }\n\t\t int l = 0;\n\t\t for(int c=0;c<=n;c++){\n\t\t\t if(index!=c&&a[c]!='0'){\n\t\t\t\t b[l] = a[c];\n\t\t\t\t l++;\n\t\t\t }\n\t\t\t else{\n\t\t\t \ta[c] = '0';\n\t\t\t\t}\n\t\t }\n\t\t \n\t\t}\n\t\tfor(int p=1;p<=n-m;p++){\n\t\t\tcout<\n#define ll long long\n#define ull signed long long\n#define maxn 2000200\nusing namespace std;\n\nll n, m, T;\n\n\n\nint main()\n{\n\n cin>>T;\n while(T--){\n cin>>n>>m;\n string s;\n cin>>s;\n for(int i=1;i\nusing namespace std;\nint main()\n{\n int t,a[200010]={0},n,m;\n cin>>t;\n for(int i=1;i<=t;i++)\n {\n string c;\n cin>>n>>m>>c;\n /*for(int j=0;j0)\n {\n for(int j=0;j\nusing namespace std;\nlong long num;\nint main()\n{\n\tint index,min,count;\n\tint t,m,n,i,j,k;\n\tcin>>t;\n\tint a[2000];\n\tint b[2000];\n\tfor(i = 0; i < t; i++)\n\t{\n\t\tmemset(a,0,sizeof(a));\n\t\tmemset(b,0,sizeof(b));\n\t\tcin>>n>>m;\n\t\tcin>>num;\n\t\tfor(j = n-1; j >= 0; j--)\n\t\t{\n\t\t\ta[j] = num % 10;\n\t\t\tnum /= 10;\n\t\t}\n\t\tindex = -1;\n\t\tmin = 1000;\n\t\tcount = 0;\n\t\twhile(count<(n-m)){\n\t\t\tfor(k = 0; k < n; k++)\n\t\t\t{\n\t\t\t\tif(a[k]<=min){\n\t\t\t\t\tmin = a[k];\n\t\t\t\t\tindex = k;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcount++;\n\t\t\tb[index] = min;\n\t\t\ta[index] = 10;\n\t\t\tmin = 10;\n\t\t}\n\t\tfor(j = 0; j < n; j++)\n\t\t{\n\t\t\tif(b[j]!=0){\n\t\t\t\tcout<\n#define ll long long\n#define ull signed long long\n#define maxn 2000200\nusing namespace std;\n\nll n, m, T;\n\n\n\nint main()\n{\n\n cin>>T;\n while(T--){\n cin>>n>>m;\n string s;\n cin>>s;\n for(int i=1;i=0&&m>0&&s[a]\nusing namespace std;\nlong long num;\nint main()\n{\n\tint index,min,count;\n\tint t,m,n,i,j,k;\n\tcin>>t;\n\tint a[2000];\n\tint b[2000];\n\tfor(i = 0; i < t; i++)\n\t{\n\t\tmemset(a,0,sizeof(a));\n\t\tmemset(b,0,sizeof(b));\n\t\tcin>>n>>m;\n\t\tcin>>num;\n\t\tfor(j = n-1; j >= 0; j--)\n\t\t{\n\t\t\ta[j] = num % 10;\n\t\t\tnum /= 10;\n\t\t}\n\t\tindex = -1;\n\t\tmin = 1000;\n\t\tcount = 0;\n\t\tif(m == 1){\n\t\t\tb[n-1] = a[n-1];\n\t\t\ta[n-1] = 10;\n\t\t\tcount ++;\n\t\t}\n\t\twhile(count<(n-m)){\n\t\t\tfor(k = 0; k < n; k++)\n\t\t\t{\n\t\t\t\tif(a[k]<=min){\n\t\t\t\t\tmin = a[k];\n\t\t\t\t\tindex = k;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcount++;\n\t\t\tb[index] = min;\n\t\t\ta[index] = 10;\n\t\t\tmin = 10;\n\t\t}\n\t\tfor(j = 0; j < n; j++)\n\t\t{\n\t\t\tif(b[j]!=0){\n\t\t\t\tcout<\nusing namespace std;\n#define ll long long\n#include\nll a[10005];\nll n,p;\nchar ch[200000+10];\nmapmp;\nint main(){\n \tint t;\n \tcin>>t;\n \twhile(t--){\n \t\tint n,m;\n \t\tcin>>n>>m;\n \t\tscanf(\""%s\"",ch);\n \t\tint cnt=0;\n \t\tfor(int i=0;ch[i];i++){\n \t\tmp[a[i]]=i;\n \t\tcnt++;\n \t\t}\n\t\tfor(int i=0;i\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n for(int i=0;i>len>>shan;\n string s;\n cin>>s;\n int len1=s.length();\n int key=0;\n while(key==len1){\n a[s[key]-'0']++;\n key++;\n }\n int len2=0;\n while(len2==shan){\n for(int j=9;j>0;j--){\n if(a[j]!=0){\n char giao='0'+j;\n string giao1+=giao;\n s.erase(s.find(giao),1);\n a[j]--;\n j++;\n len2++;\n }\n }\n }\n cout<\n#include\n#include\n#include\n#include\n#include\nusing namespace std;\n\nint main() {\n\n\tint T = 0;\n\tint price;\n\tint n, m;\n\tn = 0;\n\tm = 0;\n\tint tmp;\n\tint size;\n\tcin >> T;\n\tvectorarr;\n\tvectorarr2;\n\tsetarr3;\n\tfor (int k = 0; k < T; k++) {\n\t\tcin >> n >> m;\n\t\tcin >> price;\n\t\tsize = n - m;\n\t\t//将数字拆分成字符串\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ttmp = price % 10;\n\t\t\tprice /= 10;\n\t\t\tarr.push_back(tmp);\n\t\t\tarr2.push_back(tmp);\n\t\t}\n\t\t//排序\n\t\tsort(arr.begin(), arr.end());// arr排序过用来选数，arr2保留原本顺序\n\t\t//重新分配大小\n\t\tarr.resize(size);\n\n\t\t//插入set\n\t\tfor (int i = 0; i < arr.size(); i++) {\n\t\t\tarr3.insert(arr[i]);\n\t\t}\n\t\t//删除 z\n\t\tfor (int i = 0; i < arr2.size(); i++) {\n\t\t\tif (arr3.count(arr2[i]) == 0)arr2[i] = -1;\n\t\t}\n\t\t//打印\n\t\tfor (int i = 0; i < arr2.size(); i++) {\n\t\t\tif (arr2[i] == -1)continue;\n\t\t\telse cout << arr2[i];\n\t\t}\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,1536,16180 1575051852117426176,09ac3712625843651bd1b9960e076f4e559191d6333bcf53a21995dba0cd6859,2022-09-28 17:16:39,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main()\n{\n int t,a[20010]={0},n,m;\n cin>>t;\n for(int i=1;i<=t;i++)\n {\n string c;\n cin>>n>>m>>c;\n while(m>0)\n {\n for(int j=0;j\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n for(int i=0;i>len>>shan;\n string s;\n cin>>s;\n int len1=s.length();\n int key=0;\n while(key==len1){\n a[s[key]-'0']++;\n key++;\n }\n int len2=0;\n while(len2==shan){\n for(int j=9;j>0;j--){\n if(a[j]!=0){\n char giao='0'+j;\n s.erase(s.find(giao),1);\n a[j]--;\n j++;\n len2++;\n }\n }\n }\n cout<\nusing namespace std;\nlong long num;\nint main()\n{\n\tint index,min,count;\n\tint t,m,n,i,j,k;\n\tcin>>t;\n\tint a[2000];\n\tint b[2000];\n\tfor(i = 0; i < t; i++)\n\t{\n\t\tmemset(a,0,sizeof(a));\n\t\tmemset(b,0,sizeof(b));\n\t\tcin>>n>>m;\n\t\tcin>>num;\n\t\tfor(j = n-1; j >= 0; j--)\n\t\t{\n\t\t\ta[j] = num % 10;\n\t\t\tnum /= 10;\n\t\t}\n\t\tindex = -1;\n\t\tmin = 1000;\n\t\tcount = 0;\n\t\tif(m == 1){\n\t\t\tb[n-1] = a[n-1];\n\t\t\ta[n-1] = 10;\n\t\t\tcount ++;\n\t\t}\n\t\twhile(count<(n-m)){\n\t\t\tfor(k = 0; k < n; k++)\n\t\t\t{\n\t\t\t\tif(a[k]<=min){\n\t\t\t\t\tmin = a[k];\n\t\t\t\t\tindex = k;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcount++;\n\t\t\tb[index] = min;\n\t\t\ta[index] = 10;\n\t\t\tmin = 10;\n\t\t}\n\t\tfor(j = 0; j < n; j++)\n\t\t{\n\t\t\tif(b[j]!=0){\n\t\t\t\tcout<\nusing namespace std;\n#define ll long long\n#include\nll a[10005];\nll n,p;\nchar ch[200000+10];\nmapmp;\nint main(){\n \tint t;\n \tcin>>t;\n \twhile(t--){\n \t\tint n,m;\n \t\tcin>>n>>m;\n \t\tscanf(\""%s\"",ch);\n \t}\n cout<<35<\nusing namespace std;\nconst int N = 2e5 +10;\nint a[N];\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n string s,res;\n cin>>s;\n for(int i=0;i ss;\n int cnt=0;\n for(int i=0;i=ss.top()&&ss.size()=0;i--)\n {\n cout<\n#include \n\nint main(){\n \n int T;\n scanf(\""%d\\n\"",&T);\n long n,m;\n long min = 233;\n long oriprice;\n long newprice;\n long power;\n \n int i = 1;\n int f,k;\n \n for ( ; i<=T ;i++){\n \n scanf(\""%d %d\\n\"",&n,&m);\n scanf(\""%lf\\n\"",&oriprice);\n \n int num[n+1];\n \n //\n for ( ; m>0 ;m--){\n \n int j = 1;\n for ( ; j<=n ;j++){\n \n power = pow(10,j-1);\n printf(\"" power = %ld\\n\"",power);//power is correctly calculated?\n num[j] = oriprice / power % 10;\n \n \n //to 40\n for(j=1 ; j<=n ;j++){\n \t printf(\"" asasa %lf \"",oriprice / power % 10);\n\t\t\t}\n//\t\t\tprintf(\""\\n\"");//num on each position is recorded?\n\n\n }\n \n \n \n //to 45\n for(j=1 ; j<=n ;j++){\n \t printf(\""num = %d \"",num[j]);\n\t\t\t}\n//\t\t\tprintf(\""\\n\"");//num on each position is recorded?\n // record every number on each position\n for (f = 1 ;f<=n ;f++){ //f is used to calculate the newprice without the number on f.th position\n newprice = 0;\n for ( k = 1;k<=n && k!= f;k++){\n newprice += num[k] * pow(10,k-1);\n// printf(\""new = %ld\\n\"",newprice); //newprice is recorded?\n }\n \n if (newprice < min){\n\n min = newprice;\n \n }\n }\n \n oriprice = min;\n \n printf(\""%ld\\n\"",oriprice);\n \n }\n \n }\n //every cases\n \n return 0;\n}",RUNTIME_ERROR,45,576 1575052158322167808,88b80152288602f35363fbcf695ca1d7eed093d6c31cb9b2a39595f09c2481ce,2022-09-28 17:17:52,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\t int o;\n\tcin>>o;\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\tfor(int i=0;inumber[j+1])\n\t\t{\n\t\t\tint temp2=number[j];\n\t\t\tnumber[j]=number[j+1];\n\t\t\tnumber[j+1]=temp2;\n\t\t}\n\t}\n\t\n}\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint final=0;\n\t\t\tfor(int i=0;i\nusing namespace std;\nint main()\n{\n\tint index,min,count;\n\tint t,m,n,i,j,k;\n\tcin>>t;\n\tint a[2000];\n\tint b[2000];\n\tfor(i = 0; i < t; i++)\n\t{\n\t\tmemset(a,0,sizeof(a));\n\t\tmemset(b,0,sizeof(b));\n\t\tcin>>n>>m;\n\t\tcin>>num;\n\t\tfor(j = n-1; j >= 0; j--)\n\t\t{\n\t\t\ta[j] = num % 10;\n\t\t\tnum /= 10;\n\t\t}\n\t\tindex = -1;\n\t\tmin = 1000;\n\t\tcount = 0;\n\t\tif(m == 1){\n\t\t\tb[n-1] = a[n-1];\n\t\t\ta[n-1] = 10;\n\t\t\tcount ++;\n\t\t}\n\t\twhile(count<(n-m)){\n\t\t\tfor(k = 0; k < n; k++)\n\t\t\t{\n\t\t\t\tif(a[k]<=min){\n\t\t\t\t\tmin = a[k];\n\t\t\t\t\tindex = k;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcount++;\n\t\t\tb[index] = min;\n\t\t\ta[index] = 10;\n\t\t\tmin = 10;\n\t\t}\n\t\tfor(j = 0; j < n; j++)\n\t\t{\n\t\t\tif(b[j]!=0){\n\t\t\t\tcout<\nusing namespace std;\nint main()\n{\n\tint index,min,count;\n long long num;\n\tint t,m,n,i,j,k;\n\tcin>>t;\n\tint a[2000];\n\tint b[2000];\n\tfor(i = 0; i < t; i++)\n\t{\n\t\tmemset(a,0,sizeof(a));\n\t\tmemset(b,0,sizeof(b));\n\t\tcin>>n>>m;\n\t\tcin>>num;\n\t\tfor(j = n-1; j >= 0; j--)\n\t\t{\n\t\t\ta[j] = num % 10;\n\t\t\tnum /= 10;\n\t\t}\n\t\tindex = -1;\n\t\tmin = 1000;\n\t\tcount = 0;\n\t\tif(m == 1){\n\t\t\tb[n-1] = a[n-1];\n\t\t\ta[n-1] = 10;\n\t\t\tcount ++;\n\t\t}\n\t\twhile(count<(n-m)){\n\t\t\tfor(k = 0; k < n; k++)\n\t\t\t{\n\t\t\t\tif(a[k]<=min){\n\t\t\t\t\tmin = a[k];\n\t\t\t\t\tindex = k;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcount++;\n\t\t\tb[index] = min;\n\t\t\ta[index] = 10;\n\t\t\tmin = 10;\n\t\t}\n\t\tfor(j = 0; j < n; j++)\n\t\t{\n\t\t\tif(b[j]!=0){\n\t\t\t\tcout<\nusing namespace std;\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\t int o;\n\tcin>>o;\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\tfor(int i=0;inumber[j+1])\n\t\t{\n\t\t\tint temp2=number[j];\n\t\t\tnumber[j]=number[j+1];\n\t\t\tnumber[j+1]=temp2;\n\t\t}\n\t}\n\t\n}\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint final=0;\n\t\t\tfor(int i=0;i\nusing namespace std;\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\t int o;\n\tcin>>o;\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\tfor(int i=0;inumber[j+1])\n\t\t{\n\t\t\tint temp2=number[j];\n\t\t\tnumber[j]=number[j+1];\n\t\t\tnumber[j+1]=temp2;\n\t\t}\n\t}\n\t\n}\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint final=0;\n\t\t\tfor(int i=0;i\nusing namespace std;\nconst int N = 1e2 +10;\nint a[N];\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n string s,res;\n cin>>s;\n for(int i=0;i ss;\n int cnt=0;\n for(int i=0;i=ss.top()&&ss.size()=0;i--)\n {\n cout<\n#include \n\nint main(){\n long long int T = 0;\n long long int n = 0,m = 0;\n scanf(\""%lld\"",&T);\n for(long long int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%lld\"",c[j]);\n }\n printf(\""\\n\"");\n free(a);\n free(c);\n }\n \n return 0;\n}",WRONG_ANSWER,545,4380 1575052833647054848,36f7d64330ca450d016bdef4ac1aa2dc8868d9fd0b42bfbb35f84cd4f67c5d5c,2022-09-28 17:20:33,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,#include\n#include\nusing namespace std;\nint main()\n{\n cout<<35<\nusing namespace std;\nconst int N = 1e2 +10;\nint main()\n{\n int t;\n int a[N];\n cin>>t;\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n string s,res;\n cin>>s;\n for(int i=0;i ss;\n int cnt=0;\n for(int i=0;i=ss.top()&&ss.size()=0;i--)\n {\n cout<\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n for(int i=0;i>len>>shan;\n string s;\n cin>>s;\n int len1=s.length();\n int key=0;\n while(key==len1){\n a[s[key]-'0']++;\n key++;\n }\n int len2=0;\n while(len2==shan){\n for(int j=9;j>0;j--){\n if(a[j]!=0){\n string giao='0'+j;\n \n s.erase(s.find(giao),1);\n a[j]--;\n j++;\n len2++;\n }\n }\n }\n cout<\nusing namespace std;\nint main()\n{\n int t;\n int a[100005];\n cin>>t;\n while(t--)\n {\n int n,m;\n cin>>n>>m;\n string s,res;\n cin>>s;\n for(int i=0;i ss;\n int cnt=0;\n for(int i=0;i=ss.top()&&ss.size()=0;i--)\n {\n cout<\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n for(int i=0;i>len>>shan;\n string s;\n cin>>s;\n int len1=s.length();\n int key=0;\n while(key==len1){\n a[s[key]-'0']++;\n key++;\n }\n int len2=0;\n while(len2==shan){\n for(int j=9;j>0;j--){\n if(a[j]!=0){\n string giao[0]='0'+j;\n \n s.erase(s.find(giao),1);\n a[j]--;\n j++;\n len2++;\n }\n }\n }\n cout<\nusing namespace std;\nconst int maxn = 1e6 + 10;\ntypedef pair pii;\ntypedef long long ll;\ntypedef pair pll;\n#define all(x) (x).begin(), (x).end();\n#define endl '\\n';\n\nvoid solve()\n{\n int n, k;\n cin >> n >> k;\n vector a(n);\n for(auto &x:a)\n cin >> x;\n stack stk;\n for (int i = 0; i < n;i++)\n {\n while(stk.size()&&stk.top()>a[i]&&k)\n stk.pop(), k--;\n stk.push(a[i]);\n }\n\n while(k--)\n stk.pop();\n vector ans;\n while(stk.size())\n {\n ans.push_back(stk.top());\n stk.pop();\n }\n reverse(ans.begin(),ans.end());\n for(auto x:ans)\n cout << x-'0';\n cout << endl;\n}\n\nint main()\n{\n cin.tie(0);\n int _;\n cin >> _;\n while (_--)\n solve();\n return 0;\n}",ACCEPTED,324,3032 1575053562717757440,4523cc430c4795f808a1cbc9a621be9340e9d1aa07c6b2181b5c0d1a9ab6feb3,2022-09-28 17:23:27,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int a[100005];\n int n,m;\n cin>>n>>m;\n string s,res;\n cin>>s;\n for(int i=0;i ss;\n int cnt=0;\n for(int i=0;i=ss.top()&&ss.size()=0;i--)\n {\n cout<\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n for(int i=0;i>len>>shan;\n string s;\n cin>>s;\n int len1=s.length();\n int key=0;\n while(key==len1){\n a[s[key]-'0']++;\n key++;\n }\n int len2=0;\n while(len2==shan){\n for(int j=9;j>0;j--){\n if(a[j]!=0){\n char giao='0'+j;\n string giao1=\""\"";\n string::iterator it=giao1.begin();\n giao1.insert(giao,it)\n s.erase(s.find(giao),1);\n a[j]--;\n j++;\n len2++;\n }\n }\n }\n cout<\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[20000]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t cin>>str;\n \t for(int l=0;lmax){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j\n#define ll long long\n#define ull signed long long\n#define maxn 2000200\nusing namespace std;\n\nll n, m, T;\nll vis[maxn];\n\n\nint main()\n{\n\n cin>>T;\n while(T--){\n cin>>n>>m;\n string s;\n cin>>s;\n for(int i=1;i=0&&m>0){\n if(vis[b]==1){\n b-=1;\n continue;\n }\n if(s[a]=0&&m>0;i--){\n if(vis[i]==1)continue;\n vis[i]=1;\n m--;\n }\n for(int i=0;i\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n for(int i=0;i>len>>shan;\n string s;\n cin>>s;\n int len1=s.length();\n int key=0;\n while(key==len1){\n a[s[key]-'0']++;\n key++;\n }\n int len2=0;\n while(len2==shan){\n for(int j=9;j>0;j--){\n if(a[j]!=0){\n char giao='0'+j;\n string giao1=\""\"";\n string::iterator it=giao1.begin();\n insert(it,giao1);\n s.erase(s.find(giao),1);\n a[j]--;\n j++;\n len2++;\n }\n }\n }\n cout<\n#include\nusing namespace std;\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor(i=0;i v;\n\t\tcin >> rate >> bag;\n\t\tcin >> num;\n \n \n\t\t for(int k=0;k\nusing namespace std;\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\t int o;\n\tcin>>o;\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\tfor(int i=0;inumber[j+1])\n\t\t{\n\t\t\tint temp2=number[j];\n\t\t\tnumber[j]=number[j+1];\n\t\t\tnumber[j+1]=temp2;\n\t\t}\n\t}\n}\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint final=0;\n\t\t\tfor(int i=0;i\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n for(int i=0;i>len>>shan;\n string s;\n cin>>s;\n int len1=s.length();\n int key=0;\n while(key==len1){\n a[s[key]-'0']++;\n key++;\n }\n int len2=0;\n while(len2==shan){\n for(int j=9;j>0;j--){\n if(a[j]!=0){\n char giao='0'+j;\n string giao1=\""\"";\n string::iterator it=giao1.begin();\n insert(giao,it);\n s.erase(s.find(giao),1);\n a[j]--;\n j++;\n len2++;\n }\n }\n }\n cout<\nusing namespace std;\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tint l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\t int o;\n\tcin>>o;\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\tfor(int i=0;inumber[j+1])\n\t\t{\n\t\t\tint temp2=number[j];\n\t\t\tnumber[j]=number[j+1];\n\t\t\tnumber[j+1]=temp2;\n\t\t}\n\t}\n}\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong int final=0;\n\t\t\tfor(int i=0;i\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n for(int i=0;i>len>>shan;\n string s;\n cin>>s;\n int len1=s.length();\n int key=0;\n while(key==len1){\n a[s[key]-'0']++;\n key++;\n }\n int len2=0;\n while(len2==shan){\n for(int j=9;j>0;j--){\n if(a[j]!=0){\n char giao='0'+j;\n string giao1=\""\"";\n string::iterator it=giao1.begin();\n insert(it,giao);\n s.erase(s.find(giao),1);\n a[j]--;\n j++;\n len2++;\n }\n }\n }\n cout<\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n\tchar str[20000]={0};\n int n,m;\n int save;\n char max;\n for(int i=0;i>n>>m;\n \t cin>>str;\n \t for(int l=0;lmax){\n \t \t\tsave=e;\n\t\t\t\tmax=str[e];\n\t\t\t \t}\n\t\t\t}\n \t \tfor(int j=save;j\nusing namespace std;\nint main()\n{\n int t;\n cin>>t;\n while(t--)\n {\n int a[100005];\n int n,m;\n cin>>n>>m;\n string s,res;\n cin>>s;\n for(int i=0;i ss;\n int cnt=0;\n for(int i=0;i=ss.top()&&ss.size()=0;i--)\n {\n cout<\nusing namespace std;\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tlong int l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\t int o;\n\tcin>>o;\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\tfor(int i=0;inumber[j+1])\n\t\t{\n\t\t\tint temp2=number[j];\n\t\t\tnumber[j]=number[j+1];\n\t\t\tnumber[j+1]=temp2;\n\t\t}\n\t}\n}\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong int final=0;\n\t\t\tfor(int i=0;i\n#include \n\nint main(){\n long long int T = 0;\n long long int n = 0,m = 0;\n scanf(\""%lld\"",&T);\n for(long long int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%lld\"",c[j]);\n }\n printf(\""\\n\"");\n free(a);\n free(c);\n }\n \n return 0;\n}",WRONG_ANSWER,499,4380 1575054581728526336,88b80152288602f35363fbcf695ca1d7eed093d6c31cb9b2a39595f09c2481ce,2022-09-28 17:27:30,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tlong int l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l]={0};\n\t\tint number2[l]={0};\n\t\t int o;\n\tcin>>o;\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\tfor(int i=0;inumber[j+1])\n\t\t{\n\t\t\tint temp2=number[j];\n\t\t\tnumber[j]=number[j+1];\n\t\t\tnumber[j+1]=temp2;\n\t\t}\n\t}\n}\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong int final=0;\n\t\t\tfor(int i=0;i\n#include \n\nint main(){\n \n int T;\n scanf(\""%d\\n\"",&T);\n long n,m;\n long min = 233;\n long oriprice;\n long newprice;\n long power;\n \n int i = 1;\n int f,k;\n \n for ( ; i<=T ;i++){\n \n scanf(\""%d %d\\n\"",&n,&m);\n scanf(\""%ld\\n\"",&oriprice);\n \n int num[n+1];\n \n //\n for ( ; m>0 ;m--){\n \n int j = 1;\n for ( ; j<=n ;j++){\n \n power = pow(10,j-1);\n// printf(\"" power = %ld\\n\"",power);//power is correctly calculated?\n num[j] = (oriprice / power) % 10;\n \n\t\t\t \n\n }\n \n// //to \n// for(j=1 ; j<=n ;j++){\n// \t printf(\""num = %d \"",num[j]);\n// \t\t\t}\n// //\t\t\tprintf(\""\\n\"");//num on each position is recorded?\n // record every number on each position\n for (f = 1 ;f<=n ;f++){ //f is used to calculate the newprice without the number on f.th position\n newprice = 0;\n for ( k = 1;k<=n && k!= f;k++){\n newprice += num[k] * pow(10,k-1);\n// printf(\""new = %ld\\n\"",newprice); //newprice is recorded?\n }\n \n if (newprice < min){\n\n min = newprice;\n \n }\n }\n \n oriprice = min;\n \n printf(\""%ld\\n\"",oriprice);\n \n }\n \n }\n //every cases\n \n return 0;\n}",RUNTIME_ERROR,49,640 1575054815740907520,88b80152288602f35363fbcf695ca1d7eed093d6c31cb9b2a39595f09c2481ce,2022-09-28 17:28:25,C++,0.0,1574986221175025670,1558434369063665664,1039132542241918976,"#include\nusing namespace std;\nint main()\n{\n\tint n;//输入的测试总数量\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tlong int l;//长度\n\t\tint k;//可消除的总字数\n\t\tcin>>l>>k; \n\t\tint number[l];\n\t\tint number2[l];\n\t\t int o;\n\tcin>>o;\n\t\t//将o中的字符提取出来 \n\t\t//对number进行排序\n\t\tint v=l-1;\n\t\twhile(o)\n\t\t{\n\t\t\tint q=o%10;\n\t\t\to/=10;number[v--]=q;\n\t\t} \n\t\tfor(int i=0;inumber[j+1])\n\t\t{\n\t\t\tint temp2=number[j];\n\t\t\tnumber[j]=number[j+1];\n\t\t\tnumber[j+1]=temp2;\n\t\t}\n\t}\n}\n\t\tfor(int i=0;i=l-k;j--)\n\t\t\t{\n\t\t\t\tif(number2[i]==number[j])\n\t\t\t\t{\n\t\t\t\t\t\tnumber2[i]=0;\n\t\t\t\t\t\tnumber[j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong int final=0;\n\t\t\tfor(int i=0;i\nusing namespace std;\nint main()\n{\n int t,a[20010]={0},n,m;\n cin>>t;\n for(int i=1;i<=t;i++)\n {\n string c;\n cin>>n>>m>>c;\n while(m>0)\n {\n for(int j=0;j\nusing namespace std;\nint main()\n{\n int t,a[20010]={0},n,m;\n cin>>t;\n for(int i=1;i<=t;i++)\n {\n string c;\n cin>>n>>m>>c;\n while(m>0)\n {\n for(int j=0;j\n#include\nint main()\n{\n int T,i,j,k=0,l=0;\n scanf(\""%d\""&T);\n int n,m;\n scanf(\""%d %d\"",&n,&m);\n int A[n],N[n-m];\n for(i=0;i\n#include \n\nint main(){\n long long int T = 0;\n long long int n = 0,m = 0;\n scanf(\""%lld\"",&T);\n for(long long int i = 0;i0){\n \tif(b[x]==0){\n \t\tx--;\n \t\tcontinue;\n\t\t\t}\n if(m>b[x]){\n m-=b[x];\n b[x] = 0;\n x--;\n }\n else if(m=0;j--){\n if(a[j]>x){\n continue;\n }\n else if(a[j]==x){\n if(b[x]>0){\n b[x]--;\n c[count++] = a[j];\n }\n else if(b[x]==0){\n continue;\n }\n }\n else if(a[j]=0;j--){\n printf(\""%lld\"",c[j]);\n }\n printf(\""\\n\"");\n free(a);\n free(c);\n }\n \n return 0;\n}",WRONG_ANSWER,522,4512 1575114862718181376,8ce5505f707bf73fd327548cd953a7a49bf70cd9f5dac40aa342d40aabde19fa,2022-09-28 21:27:02,C,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"#include\n\nint main(){ \n int t;\n scanf(\""%d\"",&t);\n int n,m;\n for(int cnt = 0; cnt <= t;cnt++){\n scanf(\""%d %d\"",&n,&m);\n int p[n];\n int lt;\n for(int cmt = 0;cmt < n;cmt++){\n scanf(\""%d\"",&p[cmt]);\n }\n int ms = 2;\n int x = n;\n for(int count = 1;count <= m;count++){\n for(;ms + 1 < x;x--){\n p[ms] = p[ms+1];\n ms++;\n if(ms + 1 == x - 1){\n ms = 2;\n break;\n }\n }\n }\n for(int cnt2 = 0;cnt2 < n;cnt2++){\n if(p[cnt2] == 0){\n break;\n } else {\n printf(\""%d\"",p[cnt2]);\n }\n }\n }\n\n return 0;\n}",MULTIPLE_ERROR,2087,796 1575119048876843008,51e05970f49e1ecdbbf23ba526ebcab9a0806905326b3def877bea79f9da4798,2022-09-28 21:43:40,C++,10.0,1575110875655024646,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\n\nint main()\n{\n\tint T;\n\tcin >> T;\n\twhile (T--)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tstring s;\n\t\tcin >> s;\n\t\tint w = n - m;\n\t\tint i = 0;\n\t\twhile (1)\n\t\t{\n\t\t\tif (i == w)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tchar Min = 'a';\n\t\t\tint k = -1;\n\t\t\tfor (int j = i; j <= m + i; j++)\n\t\t\t{\n\t\t\t\tif (s[j] < Min)\n\t\t\t\t{\n\t\t\t\t\tMin = s[j];\n\t\t\t\t\tk = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tm = m + i - k;\n\t\t\tstring temp = s.substr(0, i);\n\t\t\ts = s.substr(k);\n\t\t\ts = temp + s;\n\t\t\ti++;\n\t\t}\n\t\ts = s.substr(0, w);\n\t\tcout << s << endl;\n\t}\n}",PARTIAL_ACCEPTED,2024,952 1575134324943470592,51e05970f49e1ecdbbf23ba526ebcab9a0806905326b3def877bea79f9da4798,2022-09-28 22:44:22,C++,20.0,1575110875655024646,1558434369063665664,1039132542241918976,"//#include\n//#include\n//using namespace std;\n//\n//int main()\n//{\n//\tint T;\n//\tcin >> T;\n//\twhile (T--)\n//\t{\n//\t\tint n, m;\n//\t\tcin >> n >> m;\n//\t\tstring s;\n//\t\tcin >> s;\n//\t\tint w = n - m;\n//\t\tint i = 0;\n//\t\twhile (1)\n//\t\t{\n//\t\t\tif (i == w)\n//\t\t\t{\n//\t\t\t\tbreak;\n//\t\t\t}\n//\t\t\tchar Min = 'a';\n//\t\t\tint k = -1;\n//\t\t\tfor (int j = i; j <= m + i; j++)\n//\t\t\t{\n//\t\t\t\tif (s[j] < Min)\n//\t\t\t\t{\n//\t\t\t\t\tMin = s[j];\n//\t\t\t\t\tk = j;\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\tm = m + i - k;\n//\t\t\tstring temp = s.substr(0, i);\n//\t\t\ts = s.substr(k);\n//\t\t\ts = temp + s;\n//\t\t\ti++;\n//\t\t}\n//\t\ts = s.substr(0, w);\n//\t\tcout << s << endl;\n//\t}\n//}\n\n\n#include\nusing namespace std;\n\nconst int N = 2e5 + 5;\n\nchar arr[N];\nchar stk[N];\n\nint main()\n{\n\tint T;\n\tcin >> T;\n\twhile (T--)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tint top = 0;\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tcin >> arr[i];\n\t\t}\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tif (top == 0)\n\t\t\t{\n\t\t\t\tstk[++top] = arr[i];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\twhile (top && m && stk[top] > arr[i])\n\t\t\t\t{\n\t\t\t\t\ttop--;\n\t\t\t\t\tm--;\n\t\t\t\t}\n\t\t\t\tstk[++top] = arr[i];\n\t\t\t}\n\t\t}\n\t\twhile (m--)\n\t\t{\n\t\t\ttop--;\n\t\t}\n\t\tfor (int i = 1; i <= top; i++)\n\t\t{\n\t\t\tcout << stk[i];\n\t\t}\n\t\tcout << endl;\n\t}\n}",ACCEPTED,349,1340 1575289620529238016,4055a39629f4a54cd1ff8c48f34f76367b1e83c9d467b9f9a5a4b0961dc05f38,2022-09-29 09:01:27,Java,12.0,1575110875655024646,1558434369063665664,1039132542241918976,"import java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n public static void main(String[] args) {\n int T;\n Scanner sc=new Scanner(System.in);\n T=sc.nextInt();\n while((T--)>0){\n int n,m;\n n=sc.nextInt();\n m=sc.nextInt();\n Stack stack=new Stack<>();\n String s=sc.next();\n for(int i=0;i0&&m>0&&stack.peek()>s.charAt(i)){\n\n stack.pop();\n m--;\n }\n stack.push(s.charAt(i));\n }\n\n }\n while(m>0){\n\n m--;\n stack.pop();\n }\n\n StringBuilder ss=new StringBuilder();\n while(stack.size()>0){\n ss.append(stack.peek());\n stack.pop();\n }\n System.out.println(ss.reverse());\n\n\n }\n }\n}\n",PARTIAL_ACCEPTED,4591,52120 1575293682901409792,4055a39629f4a54cd1ff8c48f34f76367b1e83c9d467b9f9a5a4b0961dc05f38,2022-09-29 09:17:36,Java,10.0,1575110875655024646,1558434369063665664,1039132542241918976,"import java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n public static void main(String[] args) {\n int T;\n Scanner sc=new Scanner(System.in);\n T=sc.nextInt();\n while((T--)>0){\n int n,m;\n n=sc.nextInt();\n m=sc.nextInt();\n char[] stack=new char[n+1];\n String s=sc.next();\n int top=0;\n for(int i=0;i0&&m>0&&stack[top]>s.charAt(i)){\n top--;\n m--;\n }\n stack[++top]=s.charAt(i);\n }\n\n }\n while(m>0){\n top--;\n m--;\n }\n\n\n for(int i=1;i<=top;i++){\n System.out.print(stack[i]);\n }\n System.out.println();\n\n\n\n }\n }\n}\n",PARTIAL_ACCEPTED,4752,43812 1575293741315481600,4055a39629f4a54cd1ff8c48f34f76367b1e83c9d467b9f9a5a4b0961dc05f38,2022-09-29 09:17:50,Java,20.0,1575110875655024646,1558434369063665664,1039132542241918976,"import java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n public static void main(String[] args) {\n int T;\n Scanner sc=new Scanner(System.in);\n T=sc.nextInt();\n while((T--)>0){\n int n,m;\n n=sc.nextInt();\n m=sc.nextInt();\n Stack stack=new Stack<>();\n String s=sc.next();\n for(int i=0;i0&&m>0&&stack.peek()>s.charAt(i)){\n\n stack.pop();\n m--;\n }\n stack.push(s.charAt(i));\n }\n\n }\n while(m>0){\n\n m--;\n stack.pop();\n }\n\n StringBuilder ss=new StringBuilder();\n while(stack.size()>0){\n ss.append(stack.peek());\n stack.pop();\n }\n System.out.println(ss.reverse());\n\n\n }\n }\n}\n",ACCEPTED,4034,62880 1575322385911996416,396148cfae7524856ec5ae16472dfea70c5cc1a6ee2a30bfba94a59ee40fd4fc,2022-09-29 11:11:39,C++,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n int n;\n cin >> n;\n for (int i = 0; i < n; i++)\n {\n long long m, h;\n cin >> m >> h;\n string str;\n cin >> str;\n long long x;\n for (long long k = 0; k < h; k++)\n {\n int maxn = 0;\n for (long long j = 0; j < m; j++)\n {\n str[j] != 0;\n if (str[j] > maxn)\n {\n maxn = str[j];\n x = j;\n }\n }\n str[x] = '0';\n }\n for (long long l = 0; l < m; l++)\n {\n if (str[l] != '0' && str[l] != 0)\n cout << str[l];\n }\n if (i != n - 1)\n cout << endl;\n\n }\n return 0;\n}",MULTIPLE_ERROR,2028,860 1575343916953649152,396148cfae7524856ec5ae16472dfea70c5cc1a6ee2a30bfba94a59ee40fd4fc,2022-09-29 12:37:12,C++,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n int n;\n cin >> n;\n for (int i = 0; i < n; i++)\n {\n long long m, h;\n cin >> m >> h;\n string str;\n cin >> str;\n long long x;\n for (long long k = 0; k < h; k++)\n {\n int maxn = 0;\n for (long long j = 0; j < m; j++)\n {\n str[j] != 0;\n if (str[j] > maxn)\n {\n maxn = str[j];\n x = j;\n }\n }\n str[x] = '0';\n }\n for (long long l = 0; l < m; l++)\n {\n if (str[l] != '0' && str[l] != 0)\n cout << str[l];\n }\n if (i != n - 1)\n cout << endl;\n\n }\n return 0;\n}",MULTIPLE_ERROR,2024,860 1575462947891200000,62ec1a35f0c09191112dcec541f79565effe065e31a0e421127d7d937a40f28b,2022-09-29 20:30:12,C++,2.0,1575110875655024646,1558434369063665664,1039132542241918976,"#include\n#include\n#include\n#include\nusing namespace std;\ndequeq;\nconst int maxn =200009;\nchar s[200009];\nint vis[maxn];\nvectora;\nint ans=0;\nint t=0;\nint main(){\n cin>>t;\n while(t--){\n memset(vis,0,sizeof(vis));\n int p,n;\n scanf(\""%d%d\"",&n,&p);\n scanf(\""%s\"",s);\n n=strlen(s);\n int i=0,j=1;\n for(i=0;i=0&&s[i]>s[j]){\n vis[i]=1;\n p--;\n i--;\n };\n i=j-1;\n j++;\n };\n while(p){\n vis[i--]=1;\n p--;\n };\n int st=0;\n for(st=0;st\n// #include\n// #include\n// #include\n// using namespace std;\n// dequeq;\n// const int maxn =200009;\n// char s[200009];\n// int vis[maxn];\n// vectora;\n// int ans=0;\n// int t=0;\n// int main(){\n// cin>>t;\n// while(t--){\n// memset(vis,0,sizeof(vis));\n// int p,n;\n// scanf(\""%d%d\"",&n,&p);\n// scanf(\""%s\"",s);\n// n=strlen(s);\n// int i=0,j=1;\n// for(i=0;i=0&&s[i]>s[j]){\n// vis[i]=1;\n// p--;\n// i--;\n// };\n// i=j-1;\n// j++;\n// };\n// while(p){\n// vis[i--]=1;\n// p--;\n// };\n// int st=0;\n// for(st=0;st\nusing namespace std;\nstring s;\nint t;\nint main(){\n cin>>t;\n while(t--){\n int n,p;\n scanf(\""%d%d\"",&n,&p);\n cin>>s;\n int num=0;\n for(int i=1;i<=p;i++){\n int len=s.length();\n for(int j=0;js[j+1]){\n auto index=s.begin()+j;\n s.erase(index);\n num++;\n break;\n }\n };\n };\n if(num\n#include \nusing namespace std;\nvoid solve();\nint main() {\n int T;\n cin >> T;\n for (int i = 0; i < T; i++) {\n solve();\n }\n return 0;\n}\nvoid solve() {\n int n, m;\n cin >> n >> m;\n stack s;\n for (int i = 0; i < n; i++) {\n char ch;\n cin >> ch;\n if (s.empty()) {\n s.push(ch);\n }\n else\n {\n while (ch < s.top() && m) {\n s.pop();\n m--;\n }\n s.push(ch);\n }\n }\n while (m){\n s.pop();\n m--;\n }\n stack temp;\n while (!s.empty())\n {\n temp.push(s.top());\n s.pop();\n }\n while (!temp.empty())\n {\n cout << temp.top();\n temp.pop();\n }\n cout << '\\n';\n}",SEGMENTATION_FAULT,45,608 1575483381479120896,ba8e35f3b23dfa9787b88722bf9b263d9e21fff543ab1b7928bb7240681e23bf,2022-09-29 21:51:23,C++,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"#include \nusing namespace std;\nvoid solve();\nint main() {\n int T;\n cin >> T;\n for (int i = 0; i < T; i++) {\n solve();\n }\n return 0;\n}\nvoid solve() {\n int n, m;\n cin >> n >> m;\n stack s;\n for (int i = 0; i < n; i++) {\n char ch;\n cin >> ch;\n if (s.empty()) {\n s.push(ch);\n }\n else\n {\n while (ch < s.top() && m) {\n s.pop();\n m--;\n }\n s.push(ch);\n }\n }\n while (m){\n s.pop();\n m--;\n }\n stack temp;\n while (!s.empty())\n {\n temp.push(s.top());\n s.pop();\n }\n while (!temp.empty())\n {\n cout << temp.top();\n temp.pop();\n }\n cout << '\\n';\n}",SEGMENTATION_FAULT,57,592 1575487463828766720,ba8e35f3b23dfa9787b88722bf9b263d9e21fff543ab1b7928bb7240681e23bf,2022-09-29 22:07:37,C++,20.0,1575110875655024646,1558434369063665664,1039132542241918976,"#include \nusing namespace std;\nconst int MAX = 200000;\nchar A[MAX];\nvoid solve();\nint main() {\n int T;\n cin >> T;\n for (int i = 0; i < T; i++) {\n solve();\n }\n return 0;\n}\nvoid solve() {\n int n, m,top=0;\n cin >> n >> m;\n for (int i = 0; i < n; i++) {\n char ch;\n cin >> ch;\n if (top) {\n while (m && A[top-1]>ch)\n {\n top--;\n m--;\n }\n A[top++] = ch;\n }\n else {\n A[top++] = ch;\n }\n }\n while (m--) top--;\n for (int i = 0; i < top; i++) {\n cout << A[i];\n }\n cout << '\\n';\n}",ACCEPTED,323,1084 1575494109229498368,02f8d0fdc995e18e093dffd10d8c3b3b6b0b7ca2e039bb28b1c5795c3f51842a,2022-09-29 22:34:01,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,\nimport java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int t=sc.nextInt();\n for (int i = 0; i < t; i++) {\n int n=sc.nextInt();\n int m=sc.nextInt();\n sc.nextLine();\n String s=sc.nextLine();\n char[] s1 = s.toCharArray();\n Stack stack=new Stack<>();\n int index=0;\n stack.push(s1[index++]);\n while(m>0){\n if(index==n){\n for (int i1 = m; i1>0; i1--) {\n stack.pop();\n }\n m=0;\n break;\n }\n while (s1[index]=0; i1--) {\n s1[i1]=stack.pop();\n }\n String s2=new String();\n for (int i1 = 0; i1 < m; i1++) {\n s2=s2+s1[i1];\n }\n System.out.println(s2);\n }\n\n\n }\n\n\n}\n,NON_ZERO_EXIT_CODE,1931,25692 1575494427749138432,02f8d0fdc995e18e093dffd10d8c3b3b6b0b7ca2e039bb28b1c5795c3f51842a,2022-09-29 22:35:17,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,\nimport java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int t=sc.nextInt();\n for (int i = 0; i < t; i++) {\n int n=sc.nextInt();\n int m=sc.nextInt();\n sc.nextLine();\n String s=sc.nextLine();\n char[] s1 = s.toCharArray();\n Stack stack=new Stack<>();\n int index=0;\n stack.push(s1[index++]);\n while(m>0){\n if(index==n){\n for (int i1 = m; i1>0; i1--) {\n stack.pop();\n }\n m=0;\n break;\n }\n while (s1[index]=0; i1--) {\n s1[i1]=stack.pop();\n }\n String s2=new String();\n for (int i1 = 0; i1 < m; i1++) {\n s2=s2+s1[i1];\n }\n System.out.println(s2);\n }\n\n\n }\n\n\n}\n,MULTIPLE_ERROR,2069,22172 1575496071702388736,02f8d0fdc995e18e093dffd10d8c3b3b6b0b7ca2e039bb28b1c5795c3f51842a,2022-09-29 22:41:49,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,\nimport java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int t=sc.nextInt();\n for (int i = 0; i < t; i++) {\n int n=sc.nextInt();\n int m=sc.nextInt();\n sc.nextLine();\n String s=sc.nextLine();\n char[] s1 = s.toCharArray();\n Stack stack=new Stack<>();\n int index=0;\n stack.push(s1[index++]);\n while(m>0){\n if(index==n){\n for (int i1 = m; i1>0; i1--) {\n stack.pop();\n }\n m=0;\n break;\n }\n while (s1[index]=0; i1--) {\n s1[i1]=stack.pop();\n }\n String s2=new String();\n for (int i1 = 0; i1 < m; i1++) {\n s2=s2+s1[i1];\n }\n System.out.println(s2);\n }\n\n\n }\n\n\n}\n,NON_ZERO_EXIT_CODE,2047,26312 1575500419392086016,02f8d0fdc995e18e093dffd10d8c3b3b6b0b7ca2e039bb28b1c5795c3f51842a,2022-09-29 22:59:06,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,\nimport java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int t=sc.nextInt();\n\n for (int i = 0; i < t; i++) {\n int n=sc.nextInt();\n int m=sc.nextInt();\n char[] stack=new char[n];\n int top=0;\n sc.nextLine();\n char[] s1 =sc.nextLine().toCharArray();\n stack[top]=s1[0];\n for (int i1 = 1; i1 < n; i1++) {\n while(m>0&&top>0&&stack[top]>s1[i1]){\n top--;\n m--;\n }\n stack[++top]=s1[i1];\n }\n while(m>0){\n top--;\n m--;\n }\n for (int i1 = 0; i1 <= top; i1++) {\n System.out.print(stack[i1]);\n }\n System.out.println();\n }\n\n\n }\n\n\n}\n,MULTIPLE_ERROR,4784,49628 1575512027338121216,62ec1a35f0c09191112dcec541f79565effe065e31a0e421127d7d937a40f28b,2022-09-29 23:45:13,C++,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"// #include\n// #include\n// #include\n// #include\n// using namespace std;\n// dequeq;\n// const int maxn =200009;\n// char s[200009];\n// int vis[maxn];\n// vectora;\n// int ans=0;\n// int t=0;\n// int main(){\n// cin>>t;\n// while(t--){\n// memset(vis,0,sizeof(vis));\n// int p,n;\n// scanf(\""%d%d\"",&n,&p);\n// scanf(\""%s\"",s);\n// n=strlen(s);\n// int i=0,j=1;\n// for(i=0;i=0&&s[i]>s[j]){\n// vis[i]=1;\n// p--;\n// i--;\n// };\n// i=j-1;\n// j++;\n// };\n// while(p){\n// vis[i--]=1;\n// p--;\n// };\n// int st=0;\n// for(st=0;st\n// using namespace std;\n// string s;\n// int t;\n// int main(){\n// cin>>t;\n// while(t--){\n// int n,p;\n// scanf(\""%d%d\"",&n,&p);\n// cin>>s;\n// int num=0;\n// for(int i=1;i<=p;i++){\n// int len=s.length();\n// for(int j=0;js[j+1]){\n// auto index=s.begin()+j;\n// s.erase(index);\n// num++;\n// break;\n// }\n// };\n// };\n// if(num\nusing namespace std;\nint a[900];\nint main(){\n string s;\n int n,k;\n cin>>s>>k;\n n=s.size();\n if(n==0)printf(\""0\"");\n for(int i=0;i\nusing namespace std;\nint main()\n{\n int n;\n cin>>n;\n for(int i=0;i s;\n int a,b;\n cin>>a>>b;\n int arr[a];\n for(int j=0;j\nusing namespace std;\nint main()\n{\n int n;\n cin>>n;\n for(int i=0;i s;\n int a,b;\n cin>>a>>b;\n int arr[a];\n for(int j=0;j\nusing namespace std;\nint main()\n{\n int n;\n cin>>n;\n for(int i=0;i s;\n int a,b;\n cin>>a>>b;\n int arr[a];\n for(int j=0;j//无前导零和只剩零的特判\nusing namespace std;\nstacks;\nint main(){\n int t;\n cin>>t;\n while(t--){\n string str;\n int n,k;\n cin>>n>>k>>str;\n for(int i=0;itemp;\n while(!s.empty()){\n temp.push(s.top());\n s.pop();\n };\n while(!temp.empty()){\n printf(\""%c\"",str[temp.top()]);\n temp.pop();\n };\n printf(\""\\n\"");\n };\n return 0;\n}",ACCEPTED,267,1848 1579816440445796352,12de5b0e533e2786b07044ffa5f73b7d3692c11f17342300028689932f4d0cea,2022-10-11 20:49:25,C,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"#include\nint main(){\n int T,n,m;\n scanf(\""%d\"",&T);\n for(int i=0;i\n#include\nusing namespace std;\nint main()\n{\n int n;\n cin >> n;\n for (int i = 0; i < n; i++)\n {\n long long m, h;\n cin >> m >> h;\n string str;\n cin >> str;\n long long x;\n for (long long k = 0; k < h; k++)\n {\n int maxn = 0;\n for (long long j = 0; j < m; j++)\n {\n str[j] != 0;\n if (str[j] > maxn)\n {\n maxn = str[j];\n x = j;\n }\n }\n str[x] = '0';\n }\n for (long long l = 0; l < m; l++)\n {\n if (str[l] != '0' && str[l] != 0)\n cout << str[l];\n }\n if (i != n - 1)\n cout << endl;\n\n }\n return 0;\n}",MULTIPLE_ERROR,2026,840 1581202001815719936,396148cfae7524856ec5ae16472dfea70c5cc1a6ee2a30bfba94a59ee40fd4fc,2022-10-15 16:35:09,C++,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"#include\n#include\nusing namespace std;\nint main()\n{\n int n;\n cin >> n;\n for (int i = 0; i < n; i++)\n {\n long long m, h;\n cin >> m >> h;\n string str;\n cin >> str;\n long long x;\n for (long long k = 0; k < h; k++)\n {\n int maxn = 0;\n for (long long j = 0; j < m; j++)\n {\n str[j] != 0;\n if (str[j] > maxn)\n {\n maxn = str[j];\n x = j;\n }\n }\n str[x] = '0';\n }\n for (long long l = 0; l < m; l++)\n {\n if (str[l] != '0' && str[l] != 0)\n cout << str[l];\n }\n if (i != n - 1)\n cout << endl;\n\n }\n return 0;\n}",MULTIPLE_ERROR,2030,872 1581642749530923008,31b4f20bc4e20203add76237ce3cd48dd52cdd02a6c4f8f26940fc3d560a3d66,2022-10-16 21:46:31,C++,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"#include \n#include \n#include \nusing namespace std;\nconst int N = 2e5;\nint main(){\n int t;\n cin>>t;\n while(t--){\n int n,m;\n stack s;\n string a;\n cin>>n>>m;\n cin>>a;\n for(int i=0;i\n#include \n#include \nusing namespace std;\nint main(){\n int t;\n cin>>t;\n while(t--){\n int n,m;\n stack s;\n string a;\n cin>>n>>m;\n cin>>a;\n for(int i=0;i\n#include \n#include \nusing namespace std;\nint main(){\n int t;\n cin>>t;\n while(t--){\n int n,m;\n stack s;\n string a;\n cin>>n>>m;\n cin>>a;\n for(int i=0;i\n#include \n#include \nusing namespace std;\nint main(){\n int t;\n cin>>t;\n while(t--){\n int n,m;\n stack s;\n string a;\n cin>>n>>m;\n cin>>a;\n for(int i=0;i\n#include \n#include \nusing namespace std;\nint main(){\n int t;\n cin>>t;\n while(t--){\n int n,m;\n stack s;\n string a;\n cin>>n>>m;\n cin>>a;\n for(int i=0;i0){\n solve();\n }\n }\n\n void solve(){\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if(top == 0)\n stk[++top] = s[i];\n else{\n while ((top>0) && (stk[top] > s[i]) && (m>0)){\n top--;\n m--;\n }\n stk[++top] = s[i];\n }\n }\n while (m-- > 0){\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n}\n\npublic class Main {\n public static void main(String[] args) throws NoSuchMethodException {\n new Solve().init();\n }\n}\n",COMPILE_ERROR,0,0 1584380725860102144,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:06:16,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"\nimport java.util.*;\n\nclass Solve{\n int N = (int) (2e5+ 5);\n\n char[] s = new char[N];\n char[] stk = new char[N];\n Scanner sc = new Scanner(System.in);\n\n void init(){\n int n = sc.nextInt();\n while (n-->0){\n solve();\n }\n }\n\n void solve(){\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if(top == 0)\n stk[++top] = s[i];\n else{\n while ((top>0) && (stk[top] > s[i]) && (m>0)){\n top--;\n m--;\n }\n stk[++top] = s[i];\n }\n }\n while (m-- > 0){\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n}\n\npublic class Main {\n public static void main(String[] args) throws NoSuchMethodException {\n new Solve().init();\n }\n}\n",MULTIPLE_ERROR,1758,23484 1584381447217475584,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:09:08,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"\nimport java.util.*;\n\n\npublic class Main {\n public static void main(String[] args) throws NoSuchMethodException {\n int N = (int) (2e5+ 5);\n\n char[] s = new char[N];\n char[] stk = new char[N];\n Scanner sc = new Scanner(System.in);\n int _ = sc.nextInt();\n while (_-->0){\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if(top == 0)\n stk[++top] = s[i];\n else{\n while ((top>0) && (stk[top] > s[i]) && (m>0)){\n top--;\n m--;\n }\n stk[++top] = s[i];\n }\n }\n while (m-- > 0){\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n\n }\n}\n",COMPILE_ERROR,0,0 1584381541006307328,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:09:30,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"\nimport java.util.*;\n\n\npublic class Main {\n public static void main(String[] args) throws NoSuchMethodException {\n int N = (int) (2e5+ 5);\n\n char[] s = new char[N];\n char[] stk = new char[N];\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n while (a-->0){\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if(top == 0)\n stk[++top] = s[i];\n else{\n while ((top>0) && (stk[top] > s[i]) && (m>0)){\n top--;\n m--;\n }\n stk[++top] = s[i];\n }\n }\n while (m-- > 0){\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n\n }\n}\n",MULTIPLE_ERROR,1808,24688 1584381924499918848,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:11:01,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"public class Main {\n public static void main(String[] args) throws NoSuchMethodException {\n int N = (int) (2e5+ 5);\n\n char[] s = new char[N];\n char[] stk = new char[N];\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n \n while (a-->0){\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if(top == 0)\n stk[++top] = s[i];\n else{\n while ((top>0) && (stk[top] > s[i]) && (m>0)){\n top--;\n m--;\n }\n stk[++top] = s[i];\n }\n }\n while (m-- > 0){\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n sc.close();\n }\n}",COMPILE_ERROR,0,0 1584382092104298496,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:11:41,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"import java.util.*;\npublic class Main {\n public static void main(String[] args) throws NoSuchMethodException {\n int N = (int) (2e5+ 5);\n\n char[] s = new char[N];\n char[] stk = new char[N];\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n \n while (a-->0){\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if(top == 0)\n stk[++top] = s[i];\n else{\n while ((top>0) && (stk[top] > s[i]) && (m>0)){\n top--;\n m--;\n }\n stk[++top] = s[i];\n }\n }\n while (m-- > 0){\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n sc.close();\n }\n}",MULTIPLE_ERROR,1873,23472 1584382561388199936,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:13:33,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n int N = (int) (2e5+ 5);\n\n char[] s = new char[N];\n char[] stk = new char[N];\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n \n while (a-->0){\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if(top == 0)\n stk[++top] = s[i];\n else{\n while ((top>0) && (stk[top] > s[i]) && (m>0)){\n top--;\n m--;\n }\n stk[++top] = s[i];\n }\n }\n while (m-- > 0){\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n sc.close();\n }\n}",MULTIPLE_ERROR,1912,23736 1584382683018825728,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:14:02,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = (int) (2e5+ 5);\n\n char[] s = new char[N];\n char[] stk = new char[N];\n\n int a = sc.nextInt();\n \n while (a-->0){\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if(top == 0)\n stk[++top] = s[i];\n else{\n while ((top>0) && (stk[top] > s[i]) && (m>0)){\n top--;\n m--;\n }\n stk[++top] = s[i];\n }\n }\n while (m-- > 0){\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n sc.close();\n }\n}",MULTIPLE_ERROR,1920,24148 1584382817945387008,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:14:34,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = (int) (2e5+ 5);\n\n char[] s = new char[N];\n char[] stk = new char[N];\n\n int a = sc.nextInt();\n \n while (a-->0){\n \n }\n sc.close();\n }\n},WRONG_ANSWER,1227,17504 1584382932932227072,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:15:02,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = (int) (2e5+ 5);\n\n char[] s = new char[N];\n char[] stk = new char[N];\n\n int a = sc.nextInt();\n \n while (a-->0){\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n \n }\n sc.close();\n }\n}",MULTIPLE_ERROR,1724,24232 1584383031083139072,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:15:25,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = (int) (2e5+ 5);\n\n char[] s = new char[N];\n char[] stk = new char[N];\n\n int a = sc.nextInt();\n \n while (a-->0){\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if(top == 0)\n stk[++top] = s[i];\n else{\n while ((top>0) && (stk[top] > s[i]) && (m>0)){\n top--;\n m--;\n }\n stk[++top] = s[i];\n }\n }\n \n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n sc.close();\n }\n}",MULTIPLE_ERROR,1982,23928 1584383210272190464,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:16:08,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = 300000;\n\n char[] s = new char[N];\n char[] stk = new char[N];\n\n int a = sc.nextInt();\n \n while (a-->0){\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if(top == 0)\n stk[++top] = s[i];\n else{\n while ((top>0) && (stk[top] > s[i]) && (m>0)){\n top--;\n m--;\n }\n stk[++top] = s[i];\n }\n }\n while (m-- > 0){\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n sc.close();\n }\n}",NON_ZERO_EXIT_CODE,1771,26680 1584383821415845888,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:18:34,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"\nimport java.util.Scanner;\n\n\npublic class Main {\n public static void main(String[] args) {\n int N = 300000;\n\n char[] s = new char[N];\n char[] stk = new char[N];\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n\n while (a-->0){\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if(top == 0)\n stk[++top] = s[i];\n else{\n while ((top>0) && (stk[top] > s[i]) && (m>0)){\n top--;\n m--;\n }\n stk[++top] = s[i];\n }\n }\n while (m-- > 0){\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n sc.close();\n }\n}\n",NON_ZERO_EXIT_CODE,1763,26724 1584384251663355904,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:20:16,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"\nimport java.util.Scanner;\n\n\npublic class Main {\n public static void main(String[] args) {\n int N = 300000;\n\n char[] s = new char[N];\n char[] stk = new char[N];\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n\n for (int k = 0; k < a; k++) {\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if(top == 0)\n stk[++top] = s[i];\n else{\n while ((top>0) && (stk[top] > s[i]) && (m>0)){\n top--;\n m--;\n }\n stk[++top] = s[i];\n }\n }\n for (int l = 0; l < m; l++) {\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n sc.close();\n }\n}\n",MULTIPLE_ERROR,2065,25040 1584384932193370112,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:22:58,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"\nimport java.util.Scanner;\n\n\npublic class Main {\n public static void main(String[] args) {\n int N = 300000;\n\n char[] s = new char[N];\n char[] stk = new char[N];\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n\n for (int k = 0; k < a; k++) {\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if(top == 0){\n stk[++top] = s[i];\n }\n else{\n while ((top>0) && (stk[top] > s[i]) && (m>0)){\n top--;\n m--;\n }\n stk[++top] = s[i];\n }\n }\n for (int l = 0; l < m; l++) {\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n sc.close();\n }\n}\n",MULTIPLE_ERROR,1720,27008 1584384980520140800,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:23:10,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"\nimport java.util.Scanner;\n\n\npublic class Main {\n public static void main(String[] args) {\n int N = 300000;\n\n char[] s = new char[N];\n char[] stk = new char[N];\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n\n for (int k = 0; k < a; k++) {\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if(top == 0){\n stk[++top] = s[i];\n }\n else{\n while ((top>0) && (stk[top] > s[i]) && (m>0)){\n top--;\n m--;\n }\n stk[++top] = s[i];\n }\n }\n for (int l = 0; l < m; l++) {\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n }\n}\n",MULTIPLE_ERROR,1705,26464 1584385130286153728,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:23:46,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"\nimport java.util.Scanner;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = 300000;\n int a = sc.nextInt();\n char[] s = new char[N];\n char[] stk = new char[N];\n\n\n\n for (int k = 0; k < a; k++) {\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if(top == 0){\n stk[++top] = s[i];\n }\n else{\n while ((top>0) && (stk[top] > s[i]) && (m>0)){\n top--;\n m--;\n }\n stk[++top] = s[i];\n }\n }\n for (int l = 0; l < m; l++) {\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n sc.close();\n }\n}\n",MULTIPLE_ERROR,1802,24652 1584391020607311872,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:47:10,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"\nimport java.util.Scanner;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = 300000;\n int a = sc.nextInt();\n char[] s = new char[N];\n char[] stk = new char[N];\n\n\n\n for (int k = 0; k < a; k++) {\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if (top != 0) {\n while (true) {\n if ((top > 0) && (stk[top] > s[i]) && (m > 0)) {\n break;\n }\n top--;\n m--;\n }\n }\n stk[++top] = s[i];\n }\n for (int l = 0; l < m; l++) {\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n sc.close();\n }\n}\n",MULTIPLE_ERROR,3184,23664 1584391140740562944,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 11:47:39,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"\nimport java.util.Scanner;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = 300000;\n int a = sc.nextInt();\n char[] s = new char[N];\n char[] stk = new char[N];\n\n\n\n for (int k = 0; k < a; k++) {\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n String ss = String.valueOf(sc.nextInt());\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if (top != 0) {\n while (true) {\n if (!((top > 0) && (stk[top] > s[i]) && (m > 0))) {\n break;\n }\n top--;\n m--;\n }\n }\n stk[++top] = s[i];\n }\n for (int l = 0; l < m; l++) {\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n sc.close();\n }\n}\n",MULTIPLE_ERROR,1695,24176 1584400075463720960,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 12:23:09,Java,0.0,1575110875655024646,1558434369063665664,1039132542241918976,"\nimport java.util.Scanner;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = 300000;\n int a = sc.nextInt();\n char[] s = new char[N];\n char[] stk = new char[N];\n\n for (int k = 0; k < a; k++) {\n int n , m ;\n n = sc.nextInt(); m = sc.nextInt();\n\n int anInt = sc.nextInt();\n String ss = String.valueOf(anInt);\n for (int i = 0; i < ss.length(); i++) {\n s[i+1] = ss.charAt(i);\n }\n\n int top = 0;\n for (int i = 1; i <= n; i++) {\n if (top != 0) {\n while (true) {\n if (!((top > 0) && (stk[top] > s[i]) && (m > 0))) {\n break;\n }\n top--;\n m--;\n }\n }\n stk[++top] = s[i];\n }\n for (int l = 0; l < m; l++) {\n top --;\n }\n for (int i = 1; i <= top; i++) {\n System.out.print(stk[i]);\n }\n System.out.println();\n }\n sc.close();\n }\n}\n",MULTIPLE_ERROR,1688,24360 1584403152195416064,b2f9433aea6976134de5e21c075562c94502bb3db44cba68ca6c3b9fff0bec01,2022-10-24 12:35:22,C++,20.0,1575110875655024646,1558434369063665664,1039132542241918976,"#include \nusing namespace std;\ntypedef long long LL;\n#define el \""\\n\"";\n#define INF 0x3f3f3f3f\nconst int N = 2e5 + 20;\n\nchar s[N];\nchar stk[N];\n\nvoid solve() {\n int n, m;\n cin >> n >> m;\n for (int i = 1; i <= n; i++)\n {\n cin >> s[i];\n }\n int top = 0;\n for (int i = 1; i <= n; i++)\n {\n if (top != 0) {\n while (top && stk[top]>s[i] && m)\n {\n m--;\n top--;\n }\n }\n stk[++top] = s[i];\n }\n\n while (m--)\n {\n top--;\n }\n for (int i = 1; i <= top; i++)\n {\n cout << stk[i];\n }\n cout << el;\n\n}\n\nint main()\n{\n cin.tie(0);\n cout.tie(0);\n\n int _;\n cin >> _;\n for (int i = 0; i < _; i++)\n {\n solve();\n }\n\n return 0;\n}\n\n",ACCEPTED,239,1224 1579755169948114944,0c96edae026350de1c384c16af9b22d544432440e3ae745a8ffa1693433d2e3d,2022-10-11 16:45:57,C++,300.0,1579746722372644864,1579746048826138624,1039131349729988608,"/*\n author:wuzx\n */\n\n#include\n// #define endl \""\\n\""\nusing namespace std;\nconst int inf = 0x3f3f3f3f;\nint t;\nint n,m,k;\nsigned main()\n{\n ios::sync_with_stdio(0);\n cin.tie(0);cout.tie(0);\n cin >> n >> m >> k;\n n--;\n if(n == 1)\n {\n cout << \""NO\"" << endl;\n return 0;\n }\n int round = n * k + 1;\n if(round < m)\n cout << \""NO\"" << endl;\n else\n {\n cout << \""YES\"" << endl;\n string ans[n];\n for(int i = 0; i < n; i++)\n ans[i] += 'R';\n int idx = 0;\n for(int i = 1; i < m; i++)\n {\n int nb;\n int h = n - 1;\n ans[idx] += 'G';\n idx = (idx + 1) % n;\n nb = idx;\n while(h--)\n {\n ans[idx] += 'R';\n idx = (idx + 1) % n;\n }\n idx = nb;\n }\n for(int i = 0; i < n; i++)\n cout << ans[i] << endl;\n }\n return 0;\n}",ACCEPTED,1506,14932 1580505676870336512,2447c161282c8404afe0faf72b511193353137d1e34a38b19c03fe946d1671b2,2022-10-13 18:28:12,C++,300.0,1579746722372644864,1579746048826138624,1039131349729988608,"#include\n#define Inf 0x3f3f3f3f\nusing namespace std;\ntypedef long long LL;\ntypedef pair P;\nconst int MAXX=100005;\n\nint n,m,k;\nchar ans[MAXX][55];\nint num[MAXX];\n\ninline void solve(){\n\tscanf(\""%d%d%d\"",&n,&m,&k);\n --n;\n for(int i=1;i<=n;++i)\n for(int j=1;j<=m;++j)\n ans[i][j]='R';\n if(n==1){\n printf(\""NO\\n\"");\n return;\n }\n \n for(int i=2;i<=m;++i){\n int now=(i-1)%n+1;\n ans[now][i]='G';\n if(++num[now]>k){\n printf(\""NO\\n\"");\n return;\n }\n }\n\n printf(\""YES\\n\"");\n for(int i=1;i<=n;++i){\n for(int j=1;j<=m;++j)\n printf(\""%c\"",ans[i][j]);\n printf(\""\\n\"");\n }\n}\n\nsigned main(){\n//\tLL t;scanf(\""%lld\"",&t);\n//\twhile(t--)\n\t\tsolve();\n\t\n\treturn 0;\n}",ACCEPTED,631,9336 1580530470886047744,78fdf3234aae1da8384214b23af236b01f26dee4a6b12c0c712bcac136b1bc72,2022-10-13 20:06:43,C++,0.0,1579746722372644864,1579746048826138624,1039131349729988608,"#include\n#define ll long long\nusing namespace std;\nint main(){\n\tll n,m,k,ii,i,j,T,dq;\n\tscanf(\""%lld%lld%lld\"",&n,&m,&k);\n\tif(n==2 or (k-1)*(n-1)+1\n#define ll long long\nusing namespace std;\nint main(){\n\tll n,m,k,ii,i,j,T,dq;\n\tscanf(\""%lld%lld%lld\"",&n,&m,&k);\n\tif(n==2 or k*(n-1)\n// #define endl \""\\n\""\nusing namespace std;\nconst int inf = 0x3f3f3f3f;\nint t;\nint n,m,k;\nsigned main()\n{\n ios::sync_with_stdio(0);\n cin.tie(0);cout.tie(0);\n cin >> n >> m >> k;\n int g = n / 2, y = 0, r = (n - 1) / 2;\n int round = n - g + (k - 1) * n;\n n--;\n string ans[n];\n int idx = g % n, ii = 0;\n while(g--)\n {\n ans[ii++] += 'G';\n }\n while(r--)\n {\n ans[ii++] += 'R';\n }\n if(n == 2)\n while(1);\n if(round < m || n == 1)\n cout << \""NO\"" << endl;\n else\n {\n cout << \""YES\"" << endl;\n for(int i = 1; i < m; i++)\n {\n int nb;\n int h = n - 2;\n ans[idx] += 'G';\n idx = (idx + 1) % n;\n nb = idx;\n ans[idx] += 'S';\n idx = (idx + 1) % n;\n while(h--)\n {\n ans[idx] += 'R';\n idx = (idx + 1) % n;\n }\n idx = nb;\n }\n for(int i = 0; i < n; i++)\n cout << ans[i] << endl;\n }\n return 0;\n}",TIME_LIMIT_EXCEEDED,515,604 1580530822544883712,78fdf3234aae1da8384214b23af236b01f26dee4a6b12c0c712bcac136b1bc72,2022-10-13 20:08:07,C++,0.0,1579746722372644864,1579746048826138624,1039131349729988608,"#include\n#define ll long long\nusing namespace std;\n\nll T;\nll n,m,k;\n\nint main(){\n\tcin>>n>>m>>k;\n\tif(n==2)\n\t{\n\t\tcout<<\""NO\""<\n#define ll long long\nusing namespace std;\nint main(){\n\tll n,m,k,ii,i,j,T,dq;\n\tscanf(\""%lld%lld%lld\"",&n,&m,&k);\n\tif(n==2 or k*(n-1)+1\n#define ll long long\nusing namespace std;\nint main(){\n\tll n,m,k,ii,i,j,T,dq;\n\tscanf(\""%lld%lld%lld\"",&n,&m,&k);\n\tif(n==2 or k*(n-1)+1 1:\n node = node_list.pop()\n nums[node] -= res[node]\n res[fa[node]] = max(res[fa[node]], res[node] + nums[node])\n \n print(res[0])\n\nfor _ in range(1):solve()\n\n",WRONG_ANSWER,375,42048 1581074674708430848,0a45493cecebf4ac635e25e174f2dbdbd0f234ab3df39bd5b3130ae6e12593b0,2022-10-15 08:09:12,Python,0.0,1580565834707492864,1580564848341409792,1039132601020895232,"import sys\nimport os\nfrom io import BytesIO, IOBase\nBUFSIZE = 8192\nclass FastIO(IOBase):\n newlines = 0\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \""x\"" in file.mode or \""r\"" not in file.mode\n self.write = self.buffer.write if self.writable else None\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\""\\n\"") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\""ascii\""))\n self.read = lambda: self.buffer.read().decode(\""ascii\"")\n self.readline = lambda: self.buffer.readline().decode(\""ascii\"")\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip(\""\\r\\n\"")\n\ndef I():\n return input()\ndef II():\n return int(input())\ndef MI():\n return map(int, input().split())\ndef LI():\n return list(input().split())\ndef LII():\n return list(map(int, input().split()))\ndef GMI():\n return map(lambda x: int(x) - 1, input().split())\n\n#------------------------------FastIO---------------------------------\n\nfrom bisect import *\nfrom heapq import *\nfrom collections import *\nfrom functools import *\nfrom itertools import *\nfrom time import *\nfrom random import *\nfrom math import log, gcd\n#dfs - stack#\n#check top!#\n\ndef solve():\n n, root = MI()\n root -= 1\n adj = defaultdict(list)\n for _ in range(n - 1):\n x, y = MI()\n x -= 1\n y -= 1\n adj[x].append(y)\n adj[y].append(x)\n nums = LII()\n res = [0 for _ in range(n)]\n \n fa = defaultdict(int)\n node_list = []\n q = deque()\n q.append((root, -1))\n while q:\n cur, p = q.popleft()\n node_list.append(cur)\n for e in adj[cur]:\n if e == p:\n continue\n else:\n q.append((e, cur))\n fa[e] = cur\n #print(node_list)\n \n while len(node_list) > 1:\n node = node_list.pop()\n nums[fa[node]] += nums[node]\n nums[node] -= res[node]\n res[fa[node]] = max(res[fa[node]], res[node] + nums[node])\n \n print(res[0])\n\nfor _ in range(1):solve()\n\n",WRONG_ANSWER,439,42272 1581192023797194752,0c96edae026350de1c384c16af9b22d544432440e3ae745a8ffa1693433d2e3d,2022-10-15 15:55:30,C++,0.0,1580565834707492864,1580564848341409792,1039132601020895232,"/*\n author:wuzx\n */\n\n#include\n#define ll long long\n#define int long long\n#define endl \""\\n\""\n#define P pair\n#define f first\n#define s second\nusing namespace std;\nconst int inf = 0x3f3f3f3f;\nint t;\nint n,m,k;\nsigned main()\n{\n ios::sync_with_stdio(0);\n cin.tie(0);cout.tie(0);\n int root;\n cin >> n >> root;\n root--;\n vector> g(n);\n for(int i = 1; i < n; i++)\n {\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n g[u].emplace_back(v);\n g[v].emplace_back(u);\n }\n vector v(n);\n for(int i = 0; i < n; i++)\n cin >> v[i];\n vector num(n), tim(n, 0), vis(n, 0);\n function dfs = [&](int now)\n {\n vis[now] = 1;\n num[now] = v[now];\n for(int x : g[now])\n {\n if(!vis[x])\n {\n num[now] += num[x];\n dfs(x);\n tim[now] = max(tim[x] + num[x], tim[now]);\n num[now] -= tim[now];\n }\n }\n // return 1;\n };\n dfs(root);\n cout << tim[root] << endl;\n return 0;\n}",WRONG_ANSWER,59,8664 1581192410168086528,0c96edae026350de1c384c16af9b22d544432440e3ae745a8ffa1693433d2e3d,2022-10-15 15:57:02,C++,0.0,1580565834707492864,1580564848341409792,1039132601020895232,"/*\n author:wuzx\n */\n\n#include\n#define ll long long\n#define int long long\n#define endl \""\\n\""\n#define P pair\n#define f first\n#define s second\nusing namespace std;\nconst int inf = 0x3f3f3f3f;\nint t;\nint n,m,k;\nsigned main()\n{\n ios::sync_with_stdio(0);\n cin.tie(0);cout.tie(0);\n int root;\n cin >> n >> root;\n root--;\n vector> g(n);\n for(int i = 1; i < n; i++)\n {\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n g[u].emplace_back(v);\n g[v].emplace_back(u);\n }\n vector v(n);\n for(int i = 0; i < n; i++)\n cin >> v[i];\n vector num(n), tim(n, 0), vis(n, 0);\n function dfs = [&](int now)\n {\n vis[now] = 1;\n num[now] = v[now];\n for(int x : g[now])\n {\n if(!vis[x])\n {\n dfs(x);\n num[now] += num[x];\n tim[now] = max(tim[x] + num[x], tim[now]);\n num[now] -= tim[now];\n }\n }\n // return 1;\n };\n dfs(root);\n cout << tim[root] << endl;\n return 0;\n}",WRONG_ANSWER,59,8768 1581198235695632384,0c96edae026350de1c384c16af9b22d544432440e3ae745a8ffa1693433d2e3d,2022-10-15 16:20:11,C++,300.0,1580565834707492864,1580564848341409792,1039132601020895232,"/*\n author:wuzx\n */\n\n#include\n#define ll long long\n#define int long long\n#define endl \""\\n\""\n#define P pair\n#define f first\n#define s second\nusing namespace std;\nconst int inf = 0x3f3f3f3f;\nint t;\nint n,m,k;\nsigned main()\n{\n ios::sync_with_stdio(0);\n cin.tie(0);cout.tie(0);\n int root;\n cin >> n >> root;\n root--;\n vector> g(n);\n for(int i = 1; i < n; i++)\n {\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n g[u].emplace_back(v);\n g[v].emplace_back(u);\n }\n vector v(n);\n for(int i = 0; i < n; i++)\n cin >> v[i];\n vector num(n), tim(n, 0), vis(n, 0);\n function dfs1 = [&](int now)\n {\n vis[now] = 1;\n num[now] = v[now];\n for(int x : g[now])\n if(!vis[x])\n num[now] += dfs1(x);\n return num[now];\n };\n function dfs2 = [&](int now)\n {\n vis[now] = 1;\n // tim[now] = v[now];\n // cout << \""now \"" << now + 1 << \"" \"" << num[now] << endl;\n for(int x : g[now])\n {\n if(!vis[x])\n {\n dfs2(x);\n tim[now] = max(tim[now], tim[x] + num[x]);\n }\n }\n num[now] -= tim[now];\n // cout << now + 1 << \"" \"" << tim[now] << \"" \"" << num[now] << endl;\n // return 1;\n };\n dfs1(root);\n vis.assign(n, 0);\n dfs2(root);\n cout << tim[root] << endl;\n return 0;\n}",ACCEPTED,1142,9300 1581198476637421568,0c96edae026350de1c384c16af9b22d544432440e3ae745a8ffa1693433d2e3d,2022-10-15 16:21:08,C++,300.0,1580565834707492864,1580564848341409792,1039132601020895232,"/*\n author:wuzx\n */\n\n#include\n#define ll long long\n#define int long long\n#define endl \""\\n\""\n#define P pair\n#define f first\n#define s second\nusing namespace std;\nconst int inf = 0x3f3f3f3f;\nint t;\nint n,m,k;\nsigned main()\n{\n ios::sync_with_stdio(0);\n cin.tie(0);cout.tie(0);\n int root;\n cin >> n >> root;\n root--;\n vector> g(n);\n for(int i = 1; i < n; i++)\n {\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n g[u].emplace_back(v);\n g[v].emplace_back(u);\n }\n vector v(n);\n for(int i = 0; i < n; i++)\n cin >> v[i];\n vector num(n), tim(n, 0), vis(n, 0);\n function dfs1 = [&](int now)\n {\n vis[now] = 1;\n num[now] = v[now];\n for(int x : g[now])\n if(!vis[x])\n num[now] += dfs1(x);\n return num[now];\n };\n function dfs2 = [&](int now)\n {\n vis[now] = 1;\n for(int x : g[now])\n {\n if(!vis[x])\n {\n dfs2(x);\n tim[now] = max(tim[now], tim[x] + num[x]);\n }\n }\n num[now] -= tim[now];\n };\n dfs1(root);\n vis.assign(n, 0);\n dfs2(root);\n cout << tim[root] << endl;\n return 0;\n}",ACCEPTED,1265,9132 1582017362576326656,0c96edae026350de1c384c16af9b22d544432440e3ae745a8ffa1693433d2e3d,2022-10-17 22:35:06,C++,300.0,1580130551348326400,1580104802964856832,1039132601020895232,"/*\n author:wuzx\n */\n\n#include\n#define ll long long\n#define int long long\n#define endl \""\\n\""\n#define P pair\n#define f first\n#define s second\nusing namespace std;\nconst int inf = 0x3f3f3f3f;\nint t;\nint n,m,k;\nvector v1,a;\nint mm;\nint getid(int x)\n{\n int id = lower_bound(v1.begin() + 1, v1.end(), x) - v1.begin();\n // cout << id << endl;\n return id;\n}\nstruct slpf\n{\n int nn, tot = 0;\n struct node\n {\n int lc, rc, sum;\n node() {}\n };\n vector roots;\n vector tr;\n vector fa, dep, son, siz, top, dfn, w;\n vector> g;\n int tim;\n slpf(int n1) : nn(n1), tr(n1 << 6), roots(n1 + 1, 0), fa(n1 + 1), dep(n1 + 1), son(n1 + 1, 0), siz(n1 + 1), top(n1 + 1), dfn(n1 + 1), w(n1 + 1), g(n1 + 1), tim(0) {}\n void add(int uu, int vv)\n {\n g[uu].emplace_back(vv);\n g[vv].emplace_back(uu);\n }\n void dfs1(int now, int fr)\n {\n // fa[now] = fr;\n dep[now] = dep[fr] + 1;\n // cout << a[now] << endl;\n update(getid(a[now]), 1, 1, mm, roots[fa[now]], roots[now]);\n siz[now] = 1;\n int max_size = -1;\n for (int x : g[now])\n {\n if (x == fr)\n continue;\n fa[x] = now;\n dfs1(x, now);\n siz[now] += siz[x];\n if (siz[x] > max_size)\n {\n max_size = siz[x];\n son[now] = x;\n }\n }\n }\n void dfs2(int now, int tp)\n {\n dfn[now] = ++tim;\n top[now] = tp;\n w[tim] = v1[now];\n if (!son[now])\n return;\n dfs2(son[now], tp);\n for (int x : g[now])\n {\n if (x == fa[now] || x == son[now])\n continue;\n dfs2(x, x);\n }\n }\n #define lc(rt) tr[tr[rt].lc]\n #define rc(rt) tr[tr[rt].rc]\n void push_up(int rt)\n {\n tr[rt].sum = lc(rt).sum + rc(rt).sum;\n }\n void update(int pos, int val, int l, int r, int old, int &rt)\n {\n rt = ++tot;\n tr[rt] = tr[old];\n if (l == r)\n {\n tr[rt].sum = tr[old].sum + val;\n return;\n }\n int mid = (l + r) >> 1;\n if (pos <= mid)\n update(pos, val, l, mid, tr[old].lc, tr[rt].lc);\n else\n update(pos, val, mid + 1, r, tr[old].rc, tr[rt].rc);\n push_up(rt);\n }\n int update(int pos, int val)\n {\n int new_root;\n update(pos, val, 0, mm, roots.back(), new_root);\n // roots.emplace_back(new_root);\n return new_root;\n }\n int query(int u, int v, int la, int lf, int l, int r, int kk)\n {\n if (l == r)\n return l;\n int mid = (l + r) >> 1;\n int x = lc(v).sum + lc(u).sum - lc(la).sum - lc(lf).sum;\n if (kk <= x)\n return query(tr[u].lc, tr[v].lc, tr[la].lc, tr[lf].lc, l, mid, kk);\n return query(tr[u].rc, tr[v].rc, tr[la].rc, tr[lf].rc, mid + 1, r, kk - x);\n }\n void make_tree(int root)\n {\n dfs1(root, root);\n dfs2(root, root);\n }\n int lca(int x, int y)\n {\n while (top[x] != top[y])\n {\n if (dep[top[x]] >= dep[top[y]])\n x = fa[top[x]];\n else\n y = fa[top[y]];\n }\n return dep[x] < dep[y] ? x : y;\n }\n};\nsigned main()\n{\n ios::sync_with_stdio(0);\n cin.tie(0);cout.tie(0);\n cin >> n >> m;\n a.assign(n + 1, 0);\n for (int i = 1; i <= n; i++)\n cin >> a[i];\n v1 = a;\n sort(v1.begin() + 1, v1.end());\n v1.erase(unique(v1.begin() + 1, v1.end()), v1.end());\n mm = (int)v1.size();\n slpf solve(n);\n for (int i = 1; i < n; i++)\n {\n int u, v;\n cin >> u >> v;\n solve.add(u, v);\n }\n solve.make_tree(1);\n // cout << 1 << endl;\n int ans = 0;\n for (int i = 0; i < m; i++)\n {\n int u, v;\n cin >> u >> v >> k;\n u ^= ans;\n v ^= ans;\n k ^= ans;\n int lca = solve.lca(u, v);\n auto &rt = solve.roots;\n ans = v1[solve.query(rt[u], rt[v], rt[lca], rt[solve.fa[lca]], 1, mm, k)];\n cout << ans << endl;\n }\n return 0;\n}",ACCEPTED,8391,116816 1582027519960072192,5b8de2e584aac24dacf415a75bf326ed8c521b75750ba090574ba382b96de836,2022-10-17 23:15:28,C++,0.0,1579746722372644864,1579746048826138624,1039131349729988608,"/*program from Wolfycz*/\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#define lMax 1e18\n#define MK make_pair\n#define iMax 0x7f7f7f7f\n#define sqr(x) ((x)*(x))\n#define pii pair\n#define UNUSED(x) (void)(x)\n#define lowbit(x) ((x)&(-x))\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\ntypedef unsigned long long ull;\ntemplateinline T read(T x) {\n int f = 1; char ch = getchar();\n for (; ch < '0' || ch>'9'; ch = getchar())\tif (ch == '-')\tf = -1;\n for (; ch >= '0' && ch <= '9'; ch = getchar())\tx = (x << 1) + (x << 3) + ch - '0';\n return x * f;\n}\nconst int N = 1e5, M = 5e1;\nchar Person[N + 10][M + 10];\nint main() {\n int n = read(0), m = read(0), k = read(0);\n if (n <= 2 || n * k < m) {\n printf(\""NO\\n\"");\n return 0;\n }\n for (int i = 0; i < n - 1; i++) Person[i][0] = 'R';\n for (int j = 1; j < m; j++) {\n Person[j % (n - 1)][j] = 'G';\n for (int i = 0; i < n - 1; i++) {\n if (i == j % (n - 1)) continue;\n Person[i][j] = 'R';\n }\n }\n printf(\""YES\\n\"");\n for (int i = 0; i < n - 1; i++)\n printf(\""%s\\n\"", Person[i]);\n return 0;\n}",WRONG_ANSWER,35,476 1582028153140600832,5b8de2e584aac24dacf415a75bf326ed8c521b75750ba090574ba382b96de836,2022-10-17 23:17:59,C++,300.0,1579746722372644864,1579746048826138624,1039131349729988608,"/*program from Wolfycz*/\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#define lMax 1e18\n#define MK make_pair\n#define iMax 0x7f7f7f7f\n#define sqr(x) ((x)*(x))\n#define pii pair\n#define UNUSED(x) (void)(x)\n#define lowbit(x) ((x)&(-x))\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\ntypedef unsigned long long ull;\ntemplateinline T read(T x) {\n int f = 1; char ch = getchar();\n for (; ch < '0' || ch>'9'; ch = getchar())\tif (ch == '-')\tf = -1;\n for (; ch >= '0' && ch <= '9'; ch = getchar())\tx = (x << 1) + (x << 3) + ch - '0';\n return x * f;\n}\nconst int N = 1e5, M = 5e1;\nchar Person[N + 10][M + 10];\nint main() {\n int n = read(0), m = read(0), k = read(0);\n if (n <= 2 || (n - 1) * k + 1 < m) {\n printf(\""NO\\n\"");\n return 0;\n }\n for (int i = 0; i < n - 1; i++) Person[i][0] = 'R';\n for (int j = 1; j < m; j++) {\n Person[j % (n - 1)][j] = 'G';\n for (int i = 0; i < n - 1; i++) {\n if (i == j % (n - 1)) continue;\n Person[i][j] = 'R';\n }\n }\n printf(\""YES\\n\"");\n for (int i = 0; i < n - 1; i++)\n printf(\""%s\\n\"", Person[i]);\n return 0;\n}",ACCEPTED,174,9796 1582029114030473216,5b8de2e584aac24dacf415a75bf326ed8c521b75750ba090574ba382b96de836,2022-10-17 23:21:48,C++,0.0,1580130551348326400,1580104802964856832,1039132601020895232,"/*program from Wolfycz*/\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#define lMax 1e18\n#define MK make_pair\n#define iMax 0x7f7f7f7f\n#define sqr(x) ((x)*(x))\n#define pii pair\n#define UNUSED(x) (void)(x)\n#define lowbit(x) ((x)&(-x))\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\ntypedef unsigned long long ull;\ntemplateinline T read(T x) {\n\tint f = 1; char ch = getchar();\n\tfor (; ch < '0' || ch>'9'; ch = getchar())\tif (ch == '-')\tf = -1;\n\tfor (; ch >= '0' && ch <= '9'; ch = getchar())\tx = (x << 1) + (x << 3) + ch - '0';\n\treturn x * f;\n}\ninline void print(int x) {\n\tif (x < 0)\tputchar('-'), x = -x;\n\tif (x > 9)\tprint(x / 10);\n\tputchar(x % 10 + '0');\n}\nconst int N = 1e5, M = 5e6;\nint root[N + 10], V[N + 10], list[N + 10], T;\nstruct CT {\t//Chairman Tree\n\tint ls[M + 10], rs[M + 10], cnt[M + 10], tot;\n\tvoid insert(int k, int& p, int l, int r, int v) {\n\t\tcnt[p = ++tot] = cnt[k] + 1;\n\t\tls[p] = ls[k], rs[p] = rs[k];\n\t\tif (l == r)\treturn;\n\t\tint mid = (l + r) >> 1;\n\t\tif (v <= mid)\tinsert(ls[k], ls[p], l, mid, v);\n\t\telse\tinsert(rs[k], rs[p], mid + 1, r, v);\n\t}\n\tint query(int x, int y, int lca, int lca_f, int l, int r, int k) {\n\t\tif (l == r)\treturn l;\n\t\tint mid = (l + r) >> 1, Cnt = cnt[ls[x]] + cnt[ls[y]] - cnt[ls[lca]] - cnt[ls[lca_f]];\n\t\tif (k <= Cnt)\treturn query(ls[x], ls[y], ls[lca], ls[lca_f], l, mid, k);\n\t\telse\treturn query(rs[x], rs[y], rs[lca], rs[lca_f], mid + 1, r, k - Cnt);\n\t}\n}ct;\nstruct HLD {\t//Heavy-Light Decomposition\n\tint pre[(N << 1) + 10], now[N + 10], child[(N << 1) + 10], tot;\n\tint Fa[N + 10], Heavy[N + 10], Size[N + 10], Deep[N + 10], Top[N + 10];\n\tvoid link(int x, int y) { pre[++tot] = now[x], now[x] = tot, child[tot] = y; }\n\tvoid connect(int x, int y) { link(x, y), link(y, x); }\n\tvoid Dfs(int x, int fa) {\n\t\tDeep[x] = Deep[Fa[x] = fa] + (Size[x] = 1);\n\t\tct.insert(root[Fa[x]], root[x], 1, T, V[x]);\n\t\tfor (int p = now[x]; p; p = pre[p]) {\n\t\t\tint son = child[p];\n\t\t\tif (son == Fa[x])\tcontinue;\n\t\t\tDfs(son, x), Size[x] += Size[son];\n\t\t\tif (!Heavy[x] || Size[x] > Size[Heavy[x]])\n\t\t\t\tHeavy[x] = son;\n\t\t}\n\t}\n\tvoid Chain(int x) {\n\t\tTop[x] = Heavy[Fa[x]] == x ? Top[Fa[x]] : x;\n\t\tif (Heavy[x])\tChain(Heavy[x]);\n\t\tfor (int p = now[x]; p; p = pre[p]) {\n\t\t\tint son = child[p];\n\t\t\tif (son == Fa[x] || son == Heavy[x])\tcontinue;\n\t\t\tChain(son);\n\t\t}\n\n\t}\n\tint LCA(int x, int y) {\n\t\twhile (Top[x] != Top[y]) {\n\t\t\tif (Deep[Top[x]] < Deep[Top[y]])\n\t\t\t\tswap(x, y);\n\t\t\tx = Fa[Top[x]];\n\t\t}\n\t\treturn Deep[x] < Deep[y] ? x : y;\n\t}\n}hld;\nint main() {\n\tint n = read(0), m = read(0);\n\tfor (int i = 1; i <= n; i++)\tV[i] = list[i] = read(0);\n\tsort(list + 1, list + 1 + n);\n\tT = unique(list + 1, list + 1 + n) - list - 1;\n\tfor (int i = 1; i <= n; i++)\tV[i] = lower_bound(list + 1, list + 1 + T, V[i]) - list;\n\tfor (int i = 1; i < n; i++) {\n\t\tint x = read(0), y = read(0);\n\t\thld.connect(x, y);\n\t}\n\thld.Dfs(1, 0), hld.Chain(1);\n\tint LastAns = 0;\n\tfor (int i = 1; i <= m; i++) {\n\t\tint x = read(0) ^ LastAns, y = read(0) ^ LastAns, k = read(0) ^ LastAns;\n\t\tint LCA = hld.LCA(x, y);\n\t\tprintf(\""%d\\n\"", LastAns = list[ct.query(root[x], root[y], root[LCA], root[hld.Fa[LCA]], 1, T, k)]);\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,34,3776 1582029228337844224,5b8de2e584aac24dacf415a75bf326ed8c521b75750ba090574ba382b96de836,2022-10-17 23:22:15,C++,0.0,1580130551348326400,1580104802964856832,1039132601020895232,"/*program from Wolfycz*/\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#define lMax 1e18\n#define MK make_pair\n#define iMax 0x7f7f7f7f\n#define sqr(x) ((x)*(x))\n#define pii pair\n#define UNUSED(x) (void)(x)\n#define lowbit(x) ((x)&(-x))\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\ntypedef unsigned long long ull;\ntemplateinline T read(T x) {\n\tint f = 1; char ch = getchar();\n\tfor (; ch < '0' || ch>'9'; ch = getchar())\tif (ch == '-')\tf = -1;\n\tfor (; ch >= '0' && ch <= '9'; ch = getchar())\tx = (x << 1) + (x << 3) + ch - '0';\n\treturn x * f;\n}\ninline void print(int x) {\n\tif (x < 0)\tputchar('-'), x = -x;\n\tif (x > 9)\tprint(x / 10);\n\tputchar(x % 10 + '0');\n}\nconst int N = 1e5, M = 5e6;\nint root[N + 10], V[N + 10], list[N + 10], T;\nstruct CT {\t//Chairman Tree\n\tint ls[M + 10], rs[M + 10], cnt[M + 10], tot;\n\tvoid insert(int k, int& p, int l, int r, int v) {\n\t\tcnt[p = ++tot] = cnt[k] + 1;\n\t\tls[p] = ls[k], rs[p] = rs[k];\n\t\tif (l == r)\treturn;\n\t\tint mid = (l + r) >> 1;\n\t\tif (v <= mid)\tinsert(ls[k], ls[p], l, mid, v);\n\t\telse\tinsert(rs[k], rs[p], mid + 1, r, v);\n\t}\n\tint query(int x, int y, int lca, int lca_f, int l, int r, int k) {\n\t\tif (l == r)\treturn l;\n\t\tint mid = (l + r) >> 1, Cnt = cnt[ls[x]] + cnt[ls[y]] - cnt[ls[lca]] - cnt[ls[lca_f]];\n\t\tif (k <= Cnt)\treturn query(ls[x], ls[y], ls[lca], ls[lca_f], l, mid, k);\n\t\telse\treturn query(rs[x], rs[y], rs[lca], rs[lca_f], mid + 1, r, k - Cnt);\n\t}\n}ct;\nstruct HLD {\t//Heavy-Light Decomposition\n\tint pre[(N << 1) + 10], now[N + 10], child[(N << 1) + 10], tot;\n\tint Fa[N + 10], Heavy[N + 10], Size[N + 10], Deep[N + 10], Top[N + 10];\n\tvoid link(int x, int y) { pre[++tot] = now[x], now[x] = tot, child[tot] = y; }\n\tvoid connect(int x, int y) { link(x, y), link(y, x); }\n\tvoid Dfs(int x, int fa) {\n\t\tDeep[x] = Deep[Fa[x] = fa] + (Size[x] = 1);\n\t\tct.insert(root[Fa[x]], root[x], 1, T, V[x]);\n\t\tfor (int p = now[x]; p; p = pre[p]) {\n\t\t\tint son = child[p];\n\t\t\tif (son == Fa[x])\tcontinue;\n\t\t\tDfs(son, x), Size[x] += Size[son];\n\t\t\tif (!Heavy[x] || Size[x] > Size[Heavy[x]])\n\t\t\t\tHeavy[x] = son;\n\t\t}\n\t}\n\tvoid Chain(int x) {\n\t\tTop[x] = Heavy[Fa[x]] == x ? Top[Fa[x]] : x;\n\t\tif (Heavy[x])\tChain(Heavy[x]);\n\t\tfor (int p = now[x]; p; p = pre[p]) {\n\t\t\tint son = child[p];\n\t\t\tif (son == Fa[x] || son == Heavy[x])\tcontinue;\n\t\t\tChain(son);\n\t\t}\n\n\t}\n\tint LCA(int x, int y) {\n\t\twhile (Top[x] != Top[y]) {\n\t\t\tif (Deep[Top[x]] < Deep[Top[y]])\n\t\t\t\tswap(x, y);\n\t\t\tx = Fa[Top[x]];\n\t\t}\n\t\treturn Deep[x] < Deep[y] ? x : y;\n\t}\n}hld;\nint main() {\n\tint n = read(0), m = read(0);\n\tfor (int i = 1; i <= n; i++)\tV[i] = list[i] = read(0);\n\tsort(list + 1, list + 1 + n);\n\tT = unique(list + 1, list + 1 + n) - list - 1;\n\tfor (int i = 1; i <= n; i++)\tV[i] = lower_bound(list + 1, list + 1 + T, V[i]) - list;\n\tfor (int i = 1; i < n; i++) {\n\t\tint x = read(0), y = read(0);\n\t\thld.connect(x, y);\n\t}\n\thld.Dfs(1, 0), hld.Chain(1);\n\tint LastAns = 0;\n\tfor (int i = 1; i <= m; i++) {\n\t\tint x = read(0) ^ LastAns, y = read(0) ^ LastAns, k = read(0) ^ LastAns;\n\t\tint LCA = hld.LCA(x, y);\n\t\tprintf(\""%d\\n\"", LastAns = list[ct.query(root[x], root[y], root[LCA], root[hld.Fa[LCA]], 1, T, k)]);\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,33,3768 1582030169980063744,5b8de2e584aac24dacf415a75bf326ed8c521b75750ba090574ba382b96de836,2022-10-17 23:25:59,C++,300.0,1580130551348326400,1580104802964856832,1039132601020895232,"/*program from Wolfycz*/\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#define lMax 1e18\n#define MK make_pair\n#define iMax 0x7f7f7f7f\n#define sqr(x) ((x)*(x))\n#define pii pair\n#define UNUSED(x) (void)(x)\n#define lowbit(x) ((x)&(-x))\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\ntypedef unsigned long long ull;\ntemplateinline T read(T x) {\n\tint f = 1; char ch = getchar();\n\tfor (; ch < '0' || ch>'9'; ch = getchar())\tif (ch == '-')\tf = -1;\n\tfor (; ch >= '0' && ch <= '9'; ch = getchar())\tx = (x << 1) + (x << 3) + ch - '0';\n\treturn x * f;\n}\ntemplateinline void print(T x) {\n\tif (x < 0)\tputchar('-'), x = -x;\n\tif (x > 9)\tprint(x / 10);\n\tputchar(x % 10 + '0');\n}\nconst int N = 2e5, M = 5e6;\nint root[N + 10], V[N + 10], list[N + 10], T;\nstruct CT {\t//Chairman Tree\n\tint ls[M + 10], rs[M + 10], cnt[M + 10], tot;\n\tvoid insert(int k, int& p, int l, int r, int v) {\n\t\tcnt[p = ++tot] = cnt[k] + 1;\n\t\tls[p] = ls[k], rs[p] = rs[k];\n\t\tif (l == r)\treturn;\n\t\tint mid = (l + r) >> 1;\n\t\tif (v <= mid)\tinsert(ls[k], ls[p], l, mid, v);\n\t\telse\tinsert(rs[k], rs[p], mid + 1, r, v);\n\t}\n\tint query(int x, int y, int lca, int lca_f, int l, int r, int k) {\n\t\tif (l == r)\treturn l;\n\t\tint mid = (l + r) >> 1, Cnt = cnt[ls[x]] + cnt[ls[y]] - cnt[ls[lca]] - cnt[ls[lca_f]];\n\t\tif (k <= Cnt)\treturn query(ls[x], ls[y], ls[lca], ls[lca_f], l, mid, k);\n\t\telse\treturn query(rs[x], rs[y], rs[lca], rs[lca_f], mid + 1, r, k - Cnt);\n\t}\n}ct;\nstruct HLD {\t//Heavy-Light Decomposition\n\tint pre[(N << 1) + 10], now[N + 10], child[(N << 1) + 10], tot;\n\tint Fa[N + 10], Heavy[N + 10], Size[N + 10], Deep[N + 10], Top[N + 10];\n\tvoid link(int x, int y) { pre[++tot] = now[x], now[x] = tot, child[tot] = y; }\n\tvoid connect(int x, int y) { link(x, y), link(y, x); }\n\tvoid Dfs(int x, int fa) {\n\t\tDeep[x] = Deep[Fa[x] = fa] + (Size[x] = 1);\n\t\tct.insert(root[Fa[x]], root[x], 1, T, V[x]);\n\t\tfor (int p = now[x]; p; p = pre[p]) {\n\t\t\tint son = child[p];\n\t\t\tif (son == Fa[x])\tcontinue;\n\t\t\tDfs(son, x), Size[x] += Size[son];\n\t\t\tif (!Heavy[x] || Size[x] > Size[Heavy[x]])\n\t\t\t\tHeavy[x] = son;\n\t\t}\n\t}\n\tvoid Chain(int x) {\n\t\tTop[x] = Heavy[Fa[x]] == x ? Top[Fa[x]] : x;\n\t\tif (Heavy[x])\tChain(Heavy[x]);\n\t\tfor (int p = now[x]; p; p = pre[p]) {\n\t\t\tint son = child[p];\n\t\t\tif (son == Fa[x] || son == Heavy[x])\tcontinue;\n\t\t\tChain(son);\n\t\t}\n\t}\n\tint LCA(int x, int y) {\n\t\twhile (Top[x] != Top[y]) {\n\t\t\tif (Deep[Top[x]] < Deep[Top[y]])\n\t\t\t\tswap(x, y);\n\t\t\tx = Fa[Top[x]];\n\t\t}\n\t\treturn Deep[x] < Deep[y] ? x : y;\n\t}\n}hld;\nint main() {\n\tint n = read(0), m = read(0);\n\tfor (int i = 1; i <= n; i++)\tV[i] = list[i] = read(0);\n\tsort(list + 1, list + 1 + n);\n\tT = unique(list + 1, list + 1 + n) - list - 1;\n\tfor (int i = 1; i <= n; i++)\tV[i] = lower_bound(list + 1, list + 1 + T, V[i]) - list;\n\tfor (int i = 1; i < n; i++) {\n\t\tint x = read(0), y = read(0);\n\t\thld.connect(x, y);\n\t}\n\thld.Dfs(1, 0), hld.Chain(1);\n\tint LastAns = 0;\n\tfor (int i = 1; i <= m; i++) {\n\t\tint x = read(0) ^ LastAns, y = read(0) ^ LastAns, k = read(0) ^ LastAns;\n\t\tint LCA = hld.LCA(x, y);\n\t\tprint(LastAns = list[ct.query(root[x], root[y], root[LCA], root[hld.Fa[LCA]], 1, T, k)]);\n\t\tputchar('\\n');\n\t}\n\treturn 0;\n}",ACCEPTED,5926,55636 1582030290088157184,5b8de2e584aac24dacf415a75bf326ed8c521b75750ba090574ba382b96de836,2022-10-17 23:26:28,C++,0.0,1580130551348326400,1580104802964856832,1039132601020895232,"/*program from Wolfycz*/\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#define lMax 1e18\n#define MK make_pair\n#define iMax 0x7f7f7f7f\n#define sqr(x) ((x)*(x))\n#define pii pair\n#define UNUSED(x) (void)(x)\n#define lowbit(x) ((x)&(-x))\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\ntypedef unsigned long long ull;\ntemplateinline T read(T x) {\n\tint f = 1; char ch = getchar();\n\tfor (; ch < '0' || ch>'9'; ch = getchar())\tif (ch == '-')\tf = -1;\n\tfor (; ch >= '0' && ch <= '9'; ch = getchar())\tx = (x << 1) + (x << 3) + ch - '0';\n\treturn x * f;\n}\ninline void print(int x) {\n\tif (x < 0)\tputchar('-'), x = -x;\n\tif (x > 9)\tprint(x / 10);\n\tputchar(x % 10 + '0');\n}\nconst int N = 1e5, M = 5e6;\nint root[N + 10], V[N + 10], list[N + 10], T;\nstruct CT {\t//Chairman Tree\n\tint ls[M + 10], rs[M + 10], cnt[M + 10], tot;\n\tvoid insert(int k, int& p, int l, int r, int v) {\n\t\tcnt[p = ++tot] = cnt[k] + 1;\n\t\tls[p] = ls[k], rs[p] = rs[k];\n\t\tif (l == r)\treturn;\n\t\tint mid = (l + r) >> 1;\n\t\tif (v <= mid)\tinsert(ls[k], ls[p], l, mid, v);\n\t\telse\tinsert(rs[k], rs[p], mid + 1, r, v);\n\t}\n\tint query(int x, int y, int lca, int lca_f, int l, int r, int k) {\n\t\tif (l == r)\treturn l;\n\t\tint mid = (l + r) >> 1, Cnt = cnt[ls[x]] + cnt[ls[y]] - cnt[ls[lca]] - cnt[ls[lca_f]];\n\t\tif (k <= Cnt)\treturn query(ls[x], ls[y], ls[lca], ls[lca_f], l, mid, k);\n\t\telse\treturn query(rs[x], rs[y], rs[lca], rs[lca_f], mid + 1, r, k - Cnt);\n\t}\n}ct;\nstruct HLD {\t//Heavy-Light Decomposition\n\tint pre[(N << 1) + 10], now[N + 10], child[(N << 1) + 10], tot;\n\tint Fa[N + 10], Heavy[N + 10], Size[N + 10], Deep[N + 10], Top[N + 10];\n\tvoid link(int x, int y) { pre[++tot] = now[x], now[x] = tot, child[tot] = y; }\n\tvoid connect(int x, int y) { link(x, y), link(y, x); }\n\tvoid Dfs(int x, int fa) {\n\t\tDeep[x] = Deep[Fa[x] = fa] + (Size[x] = 1);\n\t\tct.insert(root[Fa[x]], root[x], 1, T, V[x]);\n\t\tfor (int p = now[x]; p; p = pre[p]) {\n\t\t\tint son = child[p];\n\t\t\tif (son == Fa[x])\tcontinue;\n\t\t\tDfs(son, x), Size[x] += Size[son];\n\t\t\tif (!Heavy[x] || Size[x] > Size[Heavy[x]])\n\t\t\t\tHeavy[x] = son;\n\t\t}\n\t}\n\tvoid Chain(int x) {\n\t\tTop[x] = Heavy[Fa[x]] == x ? Top[Fa[x]] : x;\n\t\tif (Heavy[x])\tChain(Heavy[x]);\n\t\tfor (int p = now[x]; p; p = pre[p]) {\n\t\t\tint son = child[p];\n\t\t\tif (son == Fa[x] || son == Heavy[x])\tcontinue;\n\t\t\tChain(son);\n\t\t}\n\t}\n\tint LCA(int x, int y) {\n\t\twhile (Top[x] != Top[y]) {\n\t\t\tif (Deep[Top[x]] < Deep[Top[y]])\n\t\t\t\tswap(x, y);\n\t\t\tx = Fa[Top[x]];\n\t\t}\n\t\treturn Deep[x] < Deep[y] ? x : y;\n\t}\n}hld;\nint main() {\n\tint n = read(0), m = read(0);\n\tfor (int i = 1; i <= n; i++)\tV[i] = list[i] = read(0);\n\tsort(list + 1, list + 1 + n);\n\tT = unique(list + 1, list + 1 + n) - list - 1;\n\tfor (int i = 1; i <= n; i++)\tV[i] = lower_bound(list + 1, list + 1 + T, V[i]) - list;\n\tfor (int i = 1; i < n; i++) {\n\t\tint x = read(0), y = read(0);\n\t\thld.connect(x, y);\n\t}\n\thld.Dfs(1, 0), hld.Chain(1);\n\tint LastAns = 0;\n\tfor (int i = 1; i <= m; i++) {\n\t\tint x = read(0) ^ LastAns, y = read(0) ^ LastAns, k = read(0) ^ LastAns;\n\t\tint LCA = hld.LCA(x, y);\n\t\tprintf(\""%d\\n\"", LastAns = list[ct.query(root[x], root[y], root[LCA], root[hld.Fa[LCA]], 1, T, k)]);\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,31,3656 1582238099086036992,5b8de2e584aac24dacf415a75bf326ed8c521b75750ba090574ba382b96de836,2022-10-18 13:12:14,C++,300.0,1580130551348326400,1580104802964856832,1039132601020895232,"/*program from Wolfycz*/\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#define lMax 1e18\n#define MK make_pair\n#define iMax 0x7f7f7f7f\n#define sqr(x) ((x)*(x))\n#define pii pair\n#define UNUSED(x) (void)(x)\n#define lowbit(x) ((x)&(-x))\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\ntypedef unsigned long long ull;\ntemplateinline T read(T x) {\n\tint f = 1; char ch = getchar();\n\tfor (; ch < '0' || ch>'9'; ch = getchar())\tif (ch == '-')\tf = -1;\n\tfor (; ch >= '0' && ch <= '9'; ch = getchar())\tx = (x << 1) + (x << 3) + ch - '0';\n\treturn x * f;\n}\ninline void print(int x) {\n\tif (x < 0)\tputchar('-'), x = -x;\n\tif (x > 9)\tprint(x / 10);\n\tputchar(x % 10 + '0');\n}\nconst int N = 2e5, M = 5e6;\nint root[N + 10], V[N + 10], list[N + 10], T;\nstruct CT {\t//Chairman Tree\n\tint ls[M + 10], rs[M + 10], cnt[M + 10], tot;\n\tvoid insert(int k, int& p, int l, int r, int v) {\n\t\tcnt[p = ++tot] = cnt[k] + 1;\n\t\tls[p] = ls[k], rs[p] = rs[k];\n\t\tif (l == r)\treturn;\n\t\tint mid = (l + r) >> 1;\n\t\tif (v <= mid)\tinsert(ls[k], ls[p], l, mid, v);\n\t\telse\tinsert(rs[k], rs[p], mid + 1, r, v);\n\t}\n\tint query(int x, int y, int lca, int lca_f, int l, int r, int k) {\n\t\tif (l == r)\treturn l;\n\t\tint mid = (l + r) >> 1, Cnt = cnt[ls[x]] + cnt[ls[y]] - cnt[ls[lca]] - cnt[ls[lca_f]];\n\t\tif (k <= Cnt)\treturn query(ls[x], ls[y], ls[lca], ls[lca_f], l, mid, k);\n\t\telse\treturn query(rs[x], rs[y], rs[lca], rs[lca_f], mid + 1, r, k - Cnt);\n\t}\n}ct;\nstruct HLD {\t//Heavy-Light Decomposition\n\tint pre[(N << 1) + 10], now[N + 10], child[(N << 1) + 10], tot;\n\tint Fa[N + 10], Heavy[N + 10], Size[N + 10], Deep[N + 10], Top[N + 10];\n\tvoid link(int x, int y) { pre[++tot] = now[x], now[x] = tot, child[tot] = y; }\n\tvoid connect(int x, int y) { link(x, y), link(y, x); }\n\tvoid Dfs(int x, int fa) {\n\t\tDeep[x] = Deep[Fa[x] = fa] + (Size[x] = 1);\n\t\tct.insert(root[Fa[x]], root[x], 1, T, V[x]);\n\t\tfor (int p = now[x]; p; p = pre[p]) {\n\t\t\tint son = child[p];\n\t\t\tif (son == Fa[x])\tcontinue;\n\t\t\tDfs(son, x), Size[x] += Size[son];\n\t\t\tif (!Heavy[x] || Size[x] > Size[Heavy[x]])\n\t\t\t\tHeavy[x] = son;\n\t\t}\n\t}\n\tvoid Chain(int x) {\n\t\tTop[x] = Heavy[Fa[x]] == x ? Top[Fa[x]] : x;\n\t\tif (Heavy[x])\tChain(Heavy[x]);\n\t\tfor (int p = now[x]; p; p = pre[p]) {\n\t\t\tint son = child[p];\n\t\t\tif (son == Fa[x] || son == Heavy[x])\tcontinue;\n\t\t\tChain(son);\n\t\t}\n\t}\n\tint LCA(int x, int y) {\n\t\twhile (Top[x] != Top[y]) {\n\t\t\tif (Deep[Top[x]] < Deep[Top[y]])\n\t\t\t\tswap(x, y);\n\t\t\tx = Fa[Top[x]];\n\t\t}\n\t\treturn Deep[x] < Deep[y] ? x : y;\n\t}\n}hld;\nint main() {\n\tint n = read(0), m = read(0);\n\tfor (int i = 1; i <= n; i++)\tV[i] = list[i] = read(0);\n\tsort(list + 1, list + 1 + n);\n\tT = unique(list + 1, list + 1 + n) - list - 1;\n\tfor (int i = 1; i <= n; i++)\tV[i] = lower_bound(list + 1, list + 1 + T, V[i]) - list;\n\tfor (int i = 1; i < n; i++) {\n\t\tint x = read(0), y = read(0);\n\t\thld.connect(x, y);\n\t}\n\thld.Dfs(1, 0), hld.Chain(1);\n\tint LastAns = 0;\n\tfor (int i = 1; i <= m; i++) {\n\t\tint x = read(0) ^ LastAns, y = read(0) ^ LastAns, k = read(0) ^ LastAns;\n\t\tint LCA = hld.LCA(x, y);\n\t\tprintf(\""%d\\n\"", LastAns = list[ct.query(root[x], root[y], root[LCA], root[hld.Fa[LCA]], 1, T, k)]);\n\t}\n\treturn 0;\n}",ACCEPTED,5759,55456 1582323097914888192,0c96edae026350de1c384c16af9b22d544432440e3ae745a8ffa1693433d2e3d,2022-10-18 18:49:59,C++,0.0,1580130551348326400,1580104802964856832,1039132601020895232,"/*\n author:wuzx\n */\n\n#include\n#define ll long long\n#define int long long\n// #define endl \""\\n\""\n#define P pair\n#define f first\n#define s second\nusing namespace std;\nconst int inf = 0x3f3f3f3f;\nint t;\nint n,m,k;\nvector v1,a;\nint mm;\nint getid(int x)\n{\n int id = lower_bound(v1.begin() + 1, v1.end(), x) - v1.begin();\n // cout << id << endl;\n return id;\n}\nstruct slpf\n{\n int nn, tot = 0;\n struct node\n {\n int lc, rc, sum;\n node() {}\n };\n vector roots;\n vector tr;\n vector fa, dep, son, siz, top, dfn, w;\n vector> g;\n int tim;\n slpf(int n1) : nn(n1), tr(1), roots(n1 + 1, 0), fa(n1 + 1), dep(n1 + 1), son(n1 + 1, 0), siz(n1 + 1), top(n1 + 1), dfn(n1 + 1), w(n1 + 1), g(n1 + 1), tim(0) {}\n void add(int uu, int vv)\n {\n g[uu].emplace_back(vv);\n g[vv].emplace_back(uu);\n }\n void dfs1(int now, int fr)\n {\n // fa[now] = fr;\n dep[now] = dep[fr] + 1;\n // cout << a[now] << endl;\n update(getid(a[now]), 1, 1, mm, roots[fa[now]], roots[now]);\n siz[now] = 1;\n int max_size = -1;\n for (int x : g[now])\n {\n if (x == fr)\n continue;\n fa[x] = now;\n dfs1(x, now);\n siz[now] += siz[x];\n if (siz[x] > max_size)\n {\n max_size = siz[x];\n son[now] = x;\n }\n }\n }\n void dfs2(int now, int tp)\n {\n dfn[now] = ++tim;\n top[now] = tp;\n w[tim] = v1[now];\n if (!son[now])\n return;\n dfs2(son[now], tp);\n for (int x : g[now])\n {\n if (x == fa[now] || x == son[now])\n continue;\n dfs2(x, x);\n }\n }\n #define lc(rt) tr[tr[rt].lc]\n #define rc(rt) tr[tr[rt].rc]\n void push_up(int rt)\n {\n tr[rt].sum = lc(rt).sum + rc(rt).sum;\n }\n void build(int l, int r, int &rt)\n {\n rt = ++tot;\n // tr.emplace_back();\n if (l == r)\n return;\n int mid = (l + r) >> 1;\n build(l, mid, tr[rt].lc);\n build(mid + 1, r, tr[rt].rc);\n push_up(rt);\n }\n void update(int pos, int val, int l, int r, int old, int &rt)\n {\n rt = ++tot;\n tr.emplace_back();\n // while((int)tr.size() <= tot || (int)tr.size() <= old)\n // tr.push_back(xx);\n // cout << rt << \"" \"" << tot << \"" \"" << old << \"" \"" << (int)tr.size() << endl;\n tr[rt] = tr[old];\n if (l == r)\n {\n tr[rt].sum = tr[old].sum + val; \n return;\n }\n int mid = (l + r) >> 1;\n if (pos <= mid)\n update(pos, val, l, mid, tr[old].lc, tr[rt].lc);\n else\n update(pos, val, mid + 1, r, tr[old].rc, tr[rt].rc);\n push_up(rt);\n }\n int query(int u, int v, int la, int lf, int l, int r, int kk)\n {\n if (l == r)\n return l;\n int mid = (l + r) >> 1;\n int x = lc(v).sum + lc(u).sum - lc(la).sum - lc(lf).sum;\n if (kk <= x)\n return query(tr[u].lc, tr[v].lc, tr[la].lc, tr[lf].lc, l, mid, kk);\n return query(tr[u].rc, tr[v].rc, tr[la].rc, tr[lf].rc, mid + 1, r, kk - x);\n }\n void make_tree(int root)\n {\n dfs1(root, root);\n dfs2(root, root);\n // build(1, mm, roots[0]);\n }\n int lca(int x, int y)\n {\n while (top[x] != top[y])\n {\n if (dep[top[x]] >= dep[top[y]])\n x = fa[top[x]];\n else\n y = fa[top[y]];\n }\n return dep[x] < dep[y] ? x : y;\n }\n};\nsigned main()\n{\n ios::sync_with_stdio(0);\n cin.tie(0);cout.tie(0);\n cin >> n >> m;\n a.assign(n + 1, 0);\n for (int i = 1; i <= n; i++)\n cin >> a[i];\n v1 = a;\n sort(v1.begin() + 1, v1.end());\n v1.erase(unique(v1.begin() + 1, v1.end()), v1.end());\n mm = (int)v1.size();\n slpf solve(n);\n for (int i = 1; i < n; i++)\n {\n int u, v;\n cin >> u >> v;\n solve.add(u, v);\n }\n solve.make_tree(1);\n // cout << 1 << endl;\n int ans = 0;\n for (int i = 0; i < m; i++)\n {\n int u, v;\n cin >> u >> v >> k;\n u ^= ans;\n while(u > n);\n v ^= ans;\n k ^= ans;\n int lca = solve.lca(u, v);\n auto &rt = solve.roots;\n ans = v1[solve.query(rt[u], rt[v], rt[lca], rt[solve.fa[lca]], 1, mm, k)];\n cout << ans << endl;\n }\n return 0;\n}",SEGMENTATION_FAULT,73,16064 1582323293474312192,0c96edae026350de1c384c16af9b22d544432440e3ae745a8ffa1693433d2e3d,2022-10-18 18:50:45,C++,0.0,1580130551348326400,1580104802964856832,1039132601020895232,"/*\n author:wuzx\n */\n\n#include\n// #define ll long long\n// #define int long long\n#define endl \""\\n\""\n#define P pair\n#define f first\n#define s second\nusing namespace std;\nconst int inf = 0x3f3f3f3f;\nint t;\nint n,m,k;\nvector v1,a;\nint mm;\nint getid(int x)\n{\n int id = lower_bound(v1.begin() + 1, v1.end(), x) - v1.begin();\n // cout << id << endl;\n return id;\n}\nstruct slpf\n{\n int nn, tot = 0;\n struct node\n {\n int lc, rc, sum;\n node() {}\n };\n vector roots;\n vector tr;\n vector fa, dep, son, siz, top, dfn, w;\n vector> g;\n int tim;\n slpf(int n1) : nn(n1), tr(1), roots(n1 + 1, 0), fa(n1 + 1), dep(n1 + 1), son(n1 + 1, 0), siz(n1 + 1), top(n1 + 1), dfn(n1 + 1), w(n1 + 1), g(n1 + 1), tim(0) {}\n void add(int uu, int vv)\n {\n g[uu].emplace_back(vv);\n g[vv].emplace_back(uu);\n }\n void dfs1(int now, int fr)\n {\n // fa[now] = fr;\n dep[now] = dep[fr] + 1;\n // cout << a[now] << endl;\n update(getid(a[now]), 1, 1, mm, roots[fa[now]], roots[now]);\n siz[now] = 1;\n int max_size = -1;\n for (int x : g[now])\n {\n if (x == fr)\n continue;\n fa[x] = now;\n dfs1(x, now);\n siz[now] += siz[x];\n if (siz[x] > max_size)\n {\n max_size = siz[x];\n son[now] = x;\n }\n }\n }\n void dfs2(int now, int tp)\n {\n dfn[now] = ++tim;\n top[now] = tp;\n w[tim] = v1[now];\n if (!son[now])\n return;\n dfs2(son[now], tp);\n for (int x : g[now])\n {\n if (x == fa[now] || x == son[now])\n continue;\n dfs2(x, x);\n }\n }\n #define lc(rt) tr[tr[rt].lc]\n #define rc(rt) tr[tr[rt].rc]\n void push_up(int rt)\n {\n tr[rt].sum = lc(rt).sum + rc(rt).sum;\n }\n void build(int l, int r, int &rt)\n {\n rt = ++tot;\n // tr.emplace_back();\n if (l == r)\n return;\n int mid = (l + r) >> 1;\n build(l, mid, tr[rt].lc);\n build(mid + 1, r, tr[rt].rc);\n push_up(rt);\n }\n void update(int pos, int val, int l, int r, int old, int &rt)\n {\n rt = ++tot;\n tr.emplace_back();\n // while((int)tr.size() <= tot || (int)tr.size() <= old)\n // tr.push_back(xx);\n // cout << rt << \"" \"" << tot << \"" \"" << old << \"" \"" << (int)tr.size() << endl;\n tr[rt] = tr[old];\n if (l == r)\n {\n tr[rt].sum = tr[old].sum + val; \n return;\n }\n int mid = (l + r) >> 1;\n if (pos <= mid)\n update(pos, val, l, mid, tr[old].lc, tr[rt].lc);\n else\n update(pos, val, mid + 1, r, tr[old].rc, tr[rt].rc);\n push_up(rt);\n }\n int query(int u, int v, int la, int lf, int l, int r, int kk)\n {\n if (l == r)\n return l;\n int mid = (l + r) >> 1;\n int x = lc(v).sum + lc(u).sum - lc(la).sum - lc(lf).sum;\n if (kk <= x)\n return query(tr[u].lc, tr[v].lc, tr[la].lc, tr[lf].lc, l, mid, kk);\n return query(tr[u].rc, tr[v].rc, tr[la].rc, tr[lf].rc, mid + 1, r, kk - x);\n }\n void make_tree(int root)\n {\n dfs1(root, root);\n dfs2(root, root);\n // build(1, mm, roots[0]);\n }\n int lca(int x, int y)\n {\n while (top[x] != top[y])\n {\n if (dep[top[x]] >= dep[top[y]])\n x = fa[top[x]];\n else\n y = fa[top[y]];\n }\n return dep[x] < dep[y] ? x : y;\n }\n};\nsigned main()\n{\n ios::sync_with_stdio(0);\n cin.tie(0);cout.tie(0);\n cin >> n >> m;\n a.assign(n + 1, 0);\n for (int i = 1; i <= n; i++)\n cin >> a[i];\n v1 = a;\n sort(v1.begin() + 1, v1.end());\n v1.erase(unique(v1.begin() + 1, v1.end()), v1.end());\n mm = (int)v1.size();\n slpf solve(n);\n for (int i = 1; i < n; i++)\n {\n int u, v;\n cin >> u >> v;\n solve.add(u, v);\n }\n solve.make_tree(1);\n // cout << 1 << endl;\n int ans = 0;\n for (int i = 0; i < m; i++)\n {\n int u, v;\n cin >> u >> v >> k;\n u ^= ans;\n while(u > n);\n v ^= ans;\n k ^= ans;\n int lca = solve.lca(u, v);\n auto &rt = solve.roots;\n ans = v1[solve.query(rt[u], rt[v], rt[lca], rt[solve.fa[lca]], 1, mm, k)];\n cout << ans << endl;\n }\n return 0;\n}",SEGMENTATION_FAULT,67,10872 1582323569082028032,0c96edae026350de1c384c16af9b22d544432440e3ae745a8ffa1693433d2e3d,2022-10-18 18:51:51,C++,300.0,1580130551348326400,1580104802964856832,1039132601020895232,"/*\n author:wuzx\n */\n\n#include\n// #define ll long long\n// #define int long long\n#define endl \""\\n\""\n#define P pair\n#define f first\n#define s second\nusing namespace std;\nconst int inf = 0x3f3f3f3f;\nint t;\nint n,m,k;\nvector v1,a;\nint mm;\nint getid(int x)\n{\n int id = lower_bound(v1.begin() + 1, v1.end(), x) - v1.begin();\n // cout << id << endl;\n return id;\n}\nstruct slpf\n{\n int nn, tot = 0;\n struct node\n {\n int lc, rc, sum;\n node() {}\n };\n vector roots;\n vector tr;\n vector fa, dep, son, siz, top, dfn, w;\n vector> g;\n int tim;\n slpf(int n1) : nn(n1), tr(n1 << 5), roots(n1 + 1, 0), fa(n1 + 1), dep(n1 + 1), son(n1 + 1, 0), siz(n1 + 1), top(n1 + 1), dfn(n1 + 1), w(n1 + 1), g(n1 + 1), tim(0) {}\n void add(int uu, int vv)\n {\n g[uu].emplace_back(vv);\n g[vv].emplace_back(uu);\n }\n void dfs1(int now, int fr)\n {\n // fa[now] = fr;\n dep[now] = dep[fr] + 1;\n // cout << a[now] << endl;\n update(getid(a[now]), 1, 1, mm, roots[fa[now]], roots[now]);\n siz[now] = 1;\n int max_size = -1;\n for (int x : g[now])\n {\n if (x == fr)\n continue;\n fa[x] = now;\n dfs1(x, now);\n siz[now] += siz[x];\n if (siz[x] > max_size)\n {\n max_size = siz[x];\n son[now] = x;\n }\n }\n }\n void dfs2(int now, int tp)\n {\n dfn[now] = ++tim;\n top[now] = tp;\n w[tim] = v1[now];\n if (!son[now])\n return;\n dfs2(son[now], tp);\n for (int x : g[now])\n {\n if (x == fa[now] || x == son[now])\n continue;\n dfs2(x, x);\n }\n }\n #define lc(rt) tr[tr[rt].lc]\n #define rc(rt) tr[tr[rt].rc]\n void push_up(int rt)\n {\n tr[rt].sum = lc(rt).sum + rc(rt).sum;\n }\n void build(int l, int r, int &rt)\n {\n rt = ++tot;\n // tr.emplace_back();\n if (l == r)\n return;\n int mid = (l + r) >> 1;\n build(l, mid, tr[rt].lc);\n build(mid + 1, r, tr[rt].rc);\n push_up(rt);\n }\n void update(int pos, int val, int l, int r, int old, int &rt)\n {\n rt = ++tot;\n tr.emplace_back();\n // while((int)tr.size() <= tot || (int)tr.size() <= old)\n // tr.push_back(xx);\n // cout << rt << \"" \"" << tot << \"" \"" << old << \"" \"" << (int)tr.size() << endl;\n tr[rt] = tr[old];\n if (l == r)\n {\n tr[rt].sum = tr[old].sum + val; \n return;\n }\n int mid = (l + r) >> 1;\n if (pos <= mid)\n update(pos, val, l, mid, tr[old].lc, tr[rt].lc);\n else\n update(pos, val, mid + 1, r, tr[old].rc, tr[rt].rc);\n push_up(rt);\n }\n int query(int u, int v, int la, int lf, int l, int r, int kk)\n {\n if (l == r)\n return l;\n int mid = (l + r) >> 1;\n int x = lc(v).sum + lc(u).sum - lc(la).sum - lc(lf).sum;\n if (kk <= x)\n return query(tr[u].lc, tr[v].lc, tr[la].lc, tr[lf].lc, l, mid, kk);\n return query(tr[u].rc, tr[v].rc, tr[la].rc, tr[lf].rc, mid + 1, r, kk - x);\n }\n void make_tree(int root)\n {\n dfs1(root, root);\n dfs2(root, root);\n // build(1, mm, roots[0]);\n }\n int lca(int x, int y)\n {\n while (top[x] != top[y])\n {\n if (dep[top[x]] >= dep[top[y]])\n x = fa[top[x]];\n else\n y = fa[top[y]];\n }\n return dep[x] < dep[y] ? x : y;\n }\n};\nsigned main()\n{\n ios::sync_with_stdio(0);\n cin.tie(0);cout.tie(0);\n cin >> n >> m;\n a.assign(n + 1, 0);\n for (int i = 1; i <= n; i++)\n cin >> a[i];\n v1 = a;\n sort(v1.begin() + 1, v1.end());\n v1.erase(unique(v1.begin() + 1, v1.end()), v1.end());\n mm = (int)v1.size();\n slpf solve(n);\n for (int i = 1; i < n; i++)\n {\n int u, v;\n cin >> u >> v;\n solve.add(u, v);\n }\n solve.make_tree(1);\n // cout << 1 << endl;\n int ans = 0;\n for (int i = 0; i < m; i++)\n {\n int u, v;\n cin >> u >> v >> k;\n u ^= ans;\n while(u > n);\n v ^= ans;\n k ^= ans;\n int lca = solve.lca(u, v);\n auto &rt = solve.roots;\n ans = v1[solve.query(rt[u], rt[v], rt[lca], rt[solve.fa[lca]], 1, mm, k)];\n cout << ans << endl;\n }\n return 0;\n}",ACCEPTED,7836,95536 1582323891733057536,0c96edae026350de1c384c16af9b22d544432440e3ae745a8ffa1693433d2e3d,2022-10-18 18:53:08,C++,0.0,1580130551348326400,1580104802964856832,1039132601020895232,"/*\n author:wuzx\n */\n\n#include\n// #define ll long long\n// #define int long long\n#define endl \""\\n\""\n#define P pair\n#define f first\n#define s second\nusing namespace std;\nconst int inf = 0x3f3f3f3f;\nint t;\nint n,m,k;\nvector v1,a;\nint mm;\nint getid(int x)\n{\n int id = lower_bound(v1.begin() + 1, v1.end(), x) - v1.begin();\n // cout << id << endl;\n return id;\n}\nstruct slpf\n{\n int nn, tot = 0;\n struct node\n {\n int lc, rc, sum;\n node() {}\n };\n vector roots;\n vector tr;\n vector fa, dep, son, siz, top, dfn, w;\n vector> g;\n int tim;\n slpf(int n1) : nn(n1), roots(n1 + 1, 0), tr(1), fa(n1 + 1), dep(n1 + 1), son(n1 + 1, 0), siz(n1 + 1), top(n1 + 1), dfn(n1 + 1), w(n1 + 1), g(n1 + 1), tim(0) {}\n void add(int uu, int vv)\n {\n g[uu].emplace_back(vv);\n g[vv].emplace_back(uu);\n }\n void dfs1(int now, int fr)\n {\n // fa[now] = fr;\n dep[now] = dep[fr] + 1;\n // cout << a[now] << endl;\n update(getid(a[now]), 1, 1, mm, roots[fa[now]], roots[now]);\n siz[now] = 1;\n int max_size = -1;\n for (int x : g[now])\n {\n if (x == fr)\n continue;\n fa[x] = now;\n dfs1(x, now);\n siz[now] += siz[x];\n if (siz[x] > max_size)\n {\n max_size = siz[x];\n son[now] = x;\n }\n }\n }\n void dfs2(int now, int tp)\n {\n dfn[now] = ++tim;\n top[now] = tp;\n w[tim] = v1[now];\n if (!son[now])\n return;\n dfs2(son[now], tp);\n for (int x : g[now])\n {\n if (x == fa[now] || x == son[now])\n continue;\n dfs2(x, x);\n }\n }\n #define lc(rt) tr[tr[rt].lc]\n #define rc(rt) tr[tr[rt].rc]\n void push_up(int rt)\n {\n tr[rt].sum = lc(rt).sum + rc(rt).sum;\n }\n void update(int pos, int val, int l, int r, int old, int &rt)\n {\n rt = ++tot;\n tr.emplace_back();\n // while((int)tr.size() <= tot || (int)tr.size() <= old)\n // tr.push_back(xx);\n // cout << rt << \"" \"" << tot << \"" \"" << old << \"" \"" << (int)tr.size() << endl;\n tr[rt] = tr[old];\n if (l == r)\n {\n tr[rt].sum = tr[old].sum + val; \n return;\n }\n int mid = (l + r) >> 1;\n if (pos <= mid)\n update(pos, val, l, mid, tr[old].lc, tr[rt].lc);\n else\n update(pos, val, mid + 1, r, tr[old].rc, tr[rt].rc);\n push_up(rt);\n }\n int query(int u, int v, int la, int lf, int l, int r, int kk)\n {\n if (l == r)\n return l;\n int mid = (l + r) >> 1;\n int x = lc(v).sum + lc(u).sum - lc(la).sum - lc(lf).sum;\n if (kk <= x)\n return query(tr[u].lc, tr[v].lc, tr[la].lc, tr[lf].lc, l, mid, kk);\n return query(tr[u].rc, tr[v].rc, tr[la].rc, tr[lf].rc, mid + 1, r, kk - x);\n }\n void make_tree(int root)\n {\n dfs1(root, root);\n dfs2(root, root);\n }\n int lca(int x, int y)\n {\n while (top[x] != top[y])\n {\n if (dep[top[x]] >= dep[top[y]])\n x = fa[top[x]];\n else\n y = fa[top[y]];\n }\n return dep[x] < dep[y] ? x : y;\n }\n};\nsigned main()\n{\n ios::sync_with_stdio(0);\n cin.tie(0);cout.tie(0);\n cin >> n >> m;\n a.assign(n + 1, 0);\n for (int i = 1; i <= n; i++)\n cin >> a[i];\n v1 = a;\n sort(v1.begin() + 1, v1.end());\n v1.erase(unique(v1.begin() + 1, v1.end()), v1.end());\n mm = (int)v1.size();\n slpf solve(n);\n for (int i = 1; i < n; i++)\n {\n int u, v;\n cin >> u >> v;\n solve.add(u, v);\n }\n solve.make_tree(1);\n // cout << 1 << endl;\n int ans = 0;\n for (int i = 0; i < m; i++)\n {\n int u, v;\n cin >> u >> v >> k;\n u ^= ans;\n while(u > n);\n v ^= ans;\n k ^= ans;\n int lca = solve.lca(u, v);\n auto &rt = solve.roots;\n ans = v1[solve.query(rt[u], rt[v], rt[lca], rt[solve.fa[lca]], 1, mm, k)];\n cout << ans << endl;\n }\n return 0;\n}",SEGMENTATION_FAULT,57,10972 1582360748663558144,0c96edae026350de1c384c16af9b22d544432440e3ae745a8ffa1693433d2e3d,2022-10-18 21:19:35,C++,300.0,1580130551348326400,1580104802964856832,1039132601020895232,"/*\n author:wuzx\n */\n\n#include\n// #define ll long long\n// #define int long long\n#define endl \""\\n\""\n#define P pair\n#define f first\n#define s second\nusing namespace std;\nconst int inf = 0x3f3f3f3f;\nint t;\nint n,m,k;\nvector v1,a;\nint mm;\nint getid(int x)\n{\n int id = lower_bound(v1.begin() + 1, v1.end(), x) - v1.begin();\n // cout << id << endl;\n return id;\n}\nstruct slpf\n{\n int nn, tot = 0;\n struct node\n {\n int lc, rc, sum;\n node() {}\n };\n vector roots;\n vector tr;\n vector fa, dep, son, siz, top, dfn, w;\n vector> g;\n int tim;\n slpf(int n1) : nn(n1), roots(n1 + 1, 0), tr(1), fa(n1 + 1), dep(n1 + 1), son(n1 + 1, 0), siz(n1 + 1), top(n1 + 1), dfn(n1 + 1), w(n1 + 1), g(n1 + 1), tim(0) {}\n void add(int uu, int vv)\n {\n g[uu].emplace_back(vv);\n g[vv].emplace_back(uu);\n }\n void dfs1(int now, int fr)\n {\n // fa[now] = fr;\n dep[now] = dep[fr] + 1;\n // cout << a[now] << endl;\n update(getid(a[now]), 1, 1, mm, roots[fa[now]], roots[now]);\n siz[now] = 1;\n int max_size = -1;\n for (int x : g[now])\n {\n if (x == fr)\n continue;\n fa[x] = now;\n dfs1(x, now);\n siz[now] += siz[x];\n if (siz[x] > max_size)\n {\n max_size = siz[x];\n son[now] = x;\n }\n }\n }\n void dfs2(int now, int tp)\n {\n dfn[now] = ++tim;\n top[now] = tp;\n w[tim] = v1[now];\n if (!son[now])\n return;\n dfs2(son[now], tp);\n for (int x : g[now])\n {\n if (x == fa[now] || x == son[now])\n continue;\n dfs2(x, x);\n }\n }\n #define lc(rt) tr[tr[rt].lc]\n #define rc(rt) tr[tr[rt].rc]\n void push_up(int rt)\n {\n tr[rt].sum = lc(rt).sum + rc(rt).sum;\n }\n void update(int pos, int val, int l, int r, int old, int &rt)\n {\n rt = ++tot;\n tr.emplace_back();\n tr[rt] = tr[old];\n if (l == r)\n {\n tr[rt].sum = tr[old].sum + val; \n return;\n }\n int mid = (l + r) >> 1;\n int nb;\n if (pos <= mid)\n {\n update(pos, val, l, mid, tr[old].lc, nb);\n tr[rt].lc = nb;\n }\n else\n {\n update(pos, val, mid + 1, r, tr[old].rc, nb);\n tr[rt].rc = nb;\n }\n push_up(rt);\n }\n int query(int u, int v, int la, int lf, int l, int r, int kk)\n {\n if (l == r)\n return l;\n int mid = (l + r) >> 1;\n int x = lc(v).sum + lc(u).sum - lc(la).sum - lc(lf).sum;\n if (kk <= x)\n return query(tr[u].lc, tr[v].lc, tr[la].lc, tr[lf].lc, l, mid, kk);\n return query(tr[u].rc, tr[v].rc, tr[la].rc, tr[lf].rc, mid + 1, r, kk - x);\n }\n void make_tree(int root)\n {\n dfs1(root, root);\n dfs2(root, root);\n }\n int lca(int x, int y)\n {\n while (top[x] != top[y])\n {\n if (dep[top[x]] >= dep[top[y]])\n x = fa[top[x]];\n else\n y = fa[top[y]];\n }\n return dep[x] < dep[y] ? x : y;\n }\n};\nsigned main()\n{\n ios::sync_with_stdio(0);\n cin.tie(0);cout.tie(0);\n cin >> n >> m;\n a.assign(n + 1, 0);\n for (int i = 1; i <= n; i++)\n cin >> a[i];\n v1 = a;\n sort(v1.begin() + 1, v1.end());\n v1.erase(unique(v1.begin() + 1, v1.end()), v1.end());\n mm = (int)v1.size();\n slpf solve(n);\n for (int i = 1; i < n; i++)\n {\n int u, v;\n cin >> u >> v;\n solve.add(u, v);\n }\n solve.make_tree(1);\n int ans = 0;\n for (int i = 0; i < m; i++)\n {\n int u, v;\n cin >> u >> v >> k;\n u ^= ans;\n v ^= ans;\n k ^= ans;\n int lca = solve.lca(u, v);\n auto &rt = solve.roots;\n ans = v1[solve.query(rt[u], rt[v], rt[lca], rt[solve.fa[lca]], 1, mm, k)];\n cout << ans << endl;\n }\n return 0;\n}",ACCEPTED,8078,68844 1581217154028331008,2cb3ee095adb05c8f4049377c722dd0a4f41a323de195b08c8979e836f2f84de,2022-10-15 17:35:21,C++,0.0,1580881332787732488,1580564848341409792,1039132601020895232,"#include \nusing namespace std;\ninline int read(){\n\tregister int w=1,x=0,ch=getchar();\n\tfor(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')w=-1;\n\tfor(;ch>='0'&&ch<='9';ch=getchar())x=x*10+ch-'0';\n\treturn x*w;\n}\nconst int MAXN = (int)2e5+10;\nstruct Edge{\n\tint x,y,nxt;\n\tEdge(int x,int y,int nxt){\n\t\tthis->x = x;\n\t\tthis->y = y;\n\t\tthis->nxt = nxt;\n\t}Edge(){\n\t}\n}E[MAXN<<1];\nint head[MAXN],v[MAXN],tot,n,Root;\nint dp[MAXN];\ninline void Add_Edge(int x,int y){\n\tE[++tot] = Edge(x,y,head[x]),head[x] = tot;\n}\nint siz[MAXN];\nvoid dfs(int rt,int fa){\n\tsiz[rt] = v[rt];\n\tint sz = 0;\n\tfor(register int i=head[rt]; i; i=E[i].nxt){\n\t\tregister int to = E[i].y;\n\t\tif(to==fa)continue;\n\t\tdfs(to,rt);\t\n\t\tsz += siz[to];\n\t}\n\tsiz[rt] = max(sz,v[rt]);\n}\nint main(){\n\tn = read(),Root = read();\n\tfor(register int i=1; i\nusing namespace std;\n\nint n, root;\nconst int N = 100010;\nint h[N], ne[N], e[N], idx;\nint w[N];\nvoid add(int a, int b)\n{\n e[idx] = b, ne[idx] = h[a], h[a] = idx++;\n}\n\nint dfs(int u, int fa)\n{\n int res = w[u];\n for (int i = h[u]; ~i; i = ne[i])\n {\n int j = e[i];\n if (j == fa)\n continue;\n res += dfs(j, u);\n }\n return res;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n\n cin >> n >> root;\n memset(h, -1, sizeof h);\n int x = n - 1;\n while (x--)\n {\n int a, b;\n cin >> a >> b;\n add(a, b);\n add(b, a);\n }\n for (int i = 1; i <= n; i++)\n {\n cin >> w[i];\n }\n int ans = 0;\n for (int i = h[root]; ~i; i = ne[i])\n {\n int j = e[i];\n ans = max(ans, dfs(j, root));\n }\n cout << ans << endl;\n return 0;\n}",SEGMENTATION_FAULT,29,10292 1581244763969736704,543902f4d39b097a8bc196f8cffd0227dc34c6324f23212df6c8fc2767dba52b,2022-10-15 19:25:04,C++,300.0,1580881332787732488,1580564848341409792,1039132601020895232,"#include \nusing namespace std;\n#define int long long\nint n, root;\nconst int N = 500010;\nint h[N], ne[N], e[N], idx;\nint w[N];\nvoid add(int a, int b)\n{\n e[idx] = b, ne[idx] = h[a], h[a] = idx++;\n}\n\nint dfs(int u, int fa)\n{\n int res = w[u];\n for (int i = h[u]; ~i; i = ne[i])\n {\n int j = e[i];\n if (j == fa)\n continue;\n res += dfs(j, u);\n }\n return res;\n}\n\nsigned main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n\n cin >> n >> root;\n memset(h, -1, sizeof h);\n int x = n - 1;\n while (x--)\n {\n int a, b;\n cin >> a >> b;\n add(a, b);\n add(b, a);\n }\n for (int i = 1; i <= n; i++)\n {\n cin >> w[i];\n }\n int ans = 0;\n for (int i = h[root]; ~i; i = ne[i])\n {\n int j = e[i];\n ans = max(ans, dfs(j, root));\n }\n cout << ans << endl;\n return 0;\n}",ACCEPTED,638,8112 1581250702261141504,a210f213e9798c272e6882c64db54a890e33627a8516b4f3b74f1be9e6c25582,2022-10-15 19:48:40,C++,300.0,1580881332787732488,1580564848341409792,1039132601020895232,"#include\n\n#define int long long\n#define rep(i, a, b) for (int i=a; i<=b; i++)\n#define mem(a, b) memset(a, b, sizeof(a))\n#define lowbit(x) ((x)&(-x))\n#define sq(x) ((x)*(x))\n#define IOS ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);\n//#define endl \""\\n\""\n#define debug(x) cout << #x << \"" = \"" << x << endl;\nusing namespace std;\n\nconst int maxn=1e5+5;\n//const int maxm=1e3+5;\nconst int mod=998244353;\nconst int log2maxn=18+5;\t\t//log2(262144) == 18，精确值\nconst int INF=2147483647;\nconst double eps = 1e-8;\nint ans, n, m, k;\nbool flag;\nchar ch[maxn];\nint ar[maxn];\n\ninline int qpow(int a,int b,int c){int res=1%c;a%=c;while(b>0){if(b&1)res=res*a%c;a=a*a%c;b>>=1;}return res;}\ninline int qpow(int a,int b){int res=1;while(b>0){if(b&1)res=res*a;a=a*a;b>>=1;}return res;}\ninline int gcd(int a,int b){return b ? gcd(b , a % b) : a ;}\nint cmp_lf(double a, double b) //浮点数比较，相等返回0，a大返回1，b大返回-1\n{\n\tif (fabs(a - b) < eps) return 0;\n\tif (a > b) return 1;\n\treturn -1;\n}\n\nvector g[maxn];\nint dp[maxn];\n\nvoid dfs(int u, int fa=0)\n{\n dp[u] = ar[u];\n for (int v:g[u])\n {\n if (v==fa) continue;\n dfs(v, u);\n dp[u] += dp[v];\n }\n}\n\ninline void solve()\n{\n\t//init\n int s;\n\tcin>>n>>s;\n rep(i,1,n-1)\n {\n int u, v;\n cin>>u>>v;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n rep(i,1,n) cin>>ar[i];\n\n //cal\n dfs(s);\n ans=0;\n for (int u:g[s])\n ans = max(ans, dp[u]);\n\n //out\n cout<>_ci;\n\tsolve_init();\n\twhile (_ci--)\n\t{\n\t\tsolve();\n\t}\n\n #ifndef ONLINE_JUDGE\n end = clock();\n cout << endl << \""Runtime: \"" << (double)(end - start) / CLOCKS_PER_SEC << \""s\\n\"";\n #endif\n\t\n\treturn 0;\n}",ACCEPTED,1501,7772 1581256392459472896,5b4e8cf8d03eba350a4e913ea4bdccca6043bff2870d94b070d31e17cfed2278,2022-10-15 20:11:16,C++,300.0,1580881332787732488,1580564848341409792,1039132601020895232,"#include \n\nusing namespace std;\n\nconst int maxn = 1e5 + 5;\nint head[maxn], n, tot, root, sum[maxn], value[maxn];\n\nstruct edge\n{\n int nxt, to;\n} e[maxn << 1];\n\nvoid addedge(int u, int v)\n{\n e[++tot].nxt = head[u];\n e[tot].to = v;\n head[u] = tot;\n}\n\nvoid work(int x, int fa)\n{\n sum[x] = value[x];\n for (int i = head[x]; i; i = e[i].nxt)\n {\n int v = e[i].to;\n if (v == fa)\n continue;\n work(v, x);\n sum[x] += sum[v];\n }\n return;\n}\n\nint main()\n{\n cin >> n >> root;\n for (int i = 1; i < n; i++)\n {\n int u, v;\n cin >> u >> v;\n addedge(u, v);\n addedge(v, u);\n }\n for (int i = 1; i <= n; i++)\n cin >> value[i];\n work(root, -1);\n int ans = -0x3f3f3f3f;\n for (int i = head[root]; i; i = e[i].nxt)\n {\n int v = e[i].to;\n ans = max(ans, sum[v]);\n }\n cout << ans;\n return 0;\n}",ACCEPTED,1100,3004 1581474046109601792,2cb3ee095adb05c8f4049377c722dd0a4f41a323de195b08c8979e836f2f84de,2022-10-16 10:36:09,C++,300.0,1580881332787732488,1580564848341409792,1039132601020895232,"#include \nusing namespace std;\ninline int read(){\n\tregister int w=1,x=0,ch=getchar();\n\tfor(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')w=-1;\n\tfor(;ch>='0'&&ch<='9';ch=getchar())x=x*10+ch-'0';\n\treturn x*w;\n}\nconst int MAXN = (int)2e5+10;\nint n,Root;\nstruct Edge{\n\tint x,y,nxt;\n\tEdge(int x,int y,int nxt){\n\t\tthis->x = x;\n\t\tthis->y = y;\n\t\tthis->nxt = nxt;\n\t}Edge(){\n\t}\n}E[MAXN<<1];\nint v[MAXN],head[MAXN],tot = 2;\ninline void Add_Edge(int x,int y){\n\tE[tot] = Edge(x,y,head[x]),head[x] = tot;\n\tE[tot^1] = Edge(y,x,head[y]),head[y] = tot^1;\n\ttot += 2;\n}\nint depmax,dep[MAXN],num[MAXN];\nvoid dfs(int rt,int fa){\n\tnum[dep[rt]] += v[rt];\n\tdepmax = max(depmax,dep[rt]);\n\tfor(register int i=head[rt]; i; i=E[i].nxt){\n\t\tregister int to = E[i].y;\n\t\tif(to==fa)continue;\n\t\tdep[to] = dep[rt] + 1;\n\t\tdfs(to,rt);\n\t}\n}\nint main(){\n\tn = read(),Root = read();\n\tfor(register int i=1; i\nusing namespace std;\nconst int MAXN = 110000;\nint n , Root , step[MAXN] = {0} , ptop = 0;//step记录层数\nstruct line{\n int nexp;//下个点\n line *nex;//下个线段\n}p[MAXN * 2];\nint mp[MAXN] = {0};//记录货物数量\nstruct line *head[MAXN] = {0};//点的头线段位置\nqueue qu;//广度搜索\nstack st;//从后往前递推\nvoid addline(int x,int y)\n{\n p[ptop].nex = head[x];\n head[x] = &p[ptop];\n p[ptop].nexp = y;\n ptop++;\n}\nvoid levelup(int x)//从子节点拿步数\n{\n line *l = head[x];\n int ste = step[x];\n while(l != NULL)\n {\n if(step[l -> nexp] > ste)\n {\n mp[x] += mp[l -> nexp];\n break;\n }\n l = l -> nex;\n }\n}\nvoid findson(int x)//将所有子节点加入队列和栈并标记它们的step\n{\n int ste = step[x] + 1;\n line *l = head[x];\n while(l != NULL)\n {\n if(step[l -> nexp] == 0)\n {\n qu.push(l -> nexp);\n st.push(l -> nexp);\n step[l -> nexp] = ste;\n }\n l = l -> nex;\n }\n}\nint main()\n{\n cin >> n >> Root;\n for(int i = 1;i <= n - 1;i++)//构造图\n {\n int x,y;\n cin >> x >> y;\n addline(x,y);\n addline(y,x);\n }\n for(int i = 1;i <= n;i++)\n cin >> mp[i];\n qu.push(Root);\n while(!qu.empty())//从根节点开始找\n {\n findson(qu.front());\n qu.pop();\n }\n stack st2;\n step[Root] = 0;\n while(!st.empty())//从栈反推\n {\n int x = st.top();\n levelup(x);//提取子节点\n st.pop();\n if(step[x] == 1)//如果距离根只有1就加入\n st2.push(x);\n }\n int min = 0;\n while(!st2.empty())//\n {\n min = min < mp[st2.top()] ? mp[st2.top()] : min;\n st2.pop();\n }\n printf(\""%d\"",min);\n}",WRONG_ANSWER,72,5044 1581643504811819008,ac853b22c8244b9271c0c8557ec0318140cacd40b563fe50f4f5942067bcbff5,2022-10-16 21:49:31,C++,0.0,1580881332787732488,1580564848341409792,1039132601020895232,"#include\nusing namespace std;\nconst int MAXN = 110000;\nint n , Root , step[MAXN] = {0} , ptop = 0;//step记录层数\nstruct line{\n int nexp;//下个点\n line *nex;//下个线段\n}p[MAXN * 2];\nint mp[MAXN] = {0};//记录货物数量\nstruct line *head[MAXN] = {0};//点的头线段位置\nqueue qu;//广度搜索\nstack st;//从后往前递推\nvoid addline(int x,int y)\n{\n p[ptop].nex = head[x];\n head[x] = &p[ptop];\n p[ptop].nexp = y;\n ptop++;\n}\nvoid levelup(int x)//从子节点拿步数\n{\n line *l = head[x];\n int ste = step[x];\n while(l != NULL)\n {\n if(step[l -> nexp] > ste)\n {\n mp[x] += mp[l -> nexp];\n break;\n }\n l = l -> nex;\n }\n}\nvoid findson(int x)//将所有子节点加入队列和栈并标记它们的step\n{\n int ste = step[x] + 1;\n line *l = head[x];\n while(l != NULL)\n {\n if(l -> nexp != Root && step[l -> nexp] == 0)\n {\n qu.push(l -> nexp);\n st.push(l -> nexp);\n step[l -> nexp] = ste;\n }\n l = l -> nex;\n }\n}\nint main()\n{\n cin >> n >> Root;\n for(int i = 1;i <= n - 1;i++)//构造图\n {\n int x,y;\n cin >> x >> y;\n addline(x,y);\n addline(y,x);\n }\n for(int i = 1;i <= n;i++)\n cin >> mp[i];\n qu.push(Root);\n while(!qu.empty())//从根节点开始找\n {\n findson(qu.front());\n qu.pop();\n }\n stack st2;\n while(!st.empty())//从栈反推\n {\n int x = st.top();\n levelup(x);//提取子节点\n st.pop();\n if(step[x] == 1)//如果距离根只有1就加入\n st2.push(x);\n }\n int min = 0;\n while(!st2.empty())//\n {\n min = min < mp[st2.top()] ? mp[st2.top()] : min;\n st2.pop();\n }\n printf(\""%d\"",min);\n}",WRONG_ANSWER,75,5052 1581644840408236032,ac853b22c8244b9271c0c8557ec0318140cacd40b563fe50f4f5942067bcbff5,2022-10-16 21:54:50,C++,300.0,1580881332787732488,1580564848341409792,1039132601020895232,"#include\nusing namespace std;\nconst int MAXN = 110000;\nint n , Root , step[MAXN] = {0} , ptop = 0;//step记录层数\nstruct line{\n int nexp;//下个点\n line *nex;//下个线段\n}p[MAXN * 2];\nint mp[MAXN] = {0};//记录货物数量\nstruct line *head[MAXN] = {0};//点的头线段位置\nqueue qu;//广度搜索\nstack st;//从后往前递推\nvoid addline(int x,int y)\n{\n p[ptop].nex = head[x];\n head[x] = &p[ptop];\n p[ptop].nexp = y;\n ptop++;\n}\nvoid levelup(int x)//从子节点拿步数\n{\n line *l = head[x];\n int ste = step[x];\n while(l != NULL)\n {\n if(step[l -> nexp] > ste)\n {\n mp[x] += mp[l -> nexp];\n }\n l = l -> nex;\n }\n}\nvoid findson(int x)//将所有子节点加入队列和栈并标记它们的step\n{\n int ste = step[x] + 1;\n line *l = head[x];\n while(l != NULL)\n {\n if(l -> nexp != Root && step[l -> nexp] == 0)\n {\n qu.push(l -> nexp);\n st.push(l -> nexp);\n step[l -> nexp] = ste;\n }\n l = l -> nex;\n }\n}\nint main()\n{\n cin >> n >> Root;\n for(int i = 1;i <= n - 1;i++)//构造图\n {\n int x,y;\n cin >> x >> y;\n addline(x,y);\n addline(y,x);\n }\n for(int i = 1;i <= n;i++)\n cin >> mp[i];\n qu.push(Root);\n while(!qu.empty())//从根节点开始找\n {\n findson(qu.front());\n qu.pop();\n }\n stack st2;\n while(!st.empty())//从栈反推\n {\n int x = st.top();\n levelup(x);//提取子节点\n st.pop();\n if(step[x] == 1)//如果距离根只有1就加入\n st2.push(x);\n }\n int min = 0;\n while(!st2.empty())//\n {\n min = min < mp[st2.top()] ? mp[st2.top()] : min;\n st2.pop();\n }\n printf(\""%d\"",min);\n}",ACCEPTED,1464,5332 1581648849961533440,c394bbbbd824127d68aee7aef87cbb9240b3b1e82714b4acc814a1efa5e4bc81,2022-10-16 22:10:46,C++,300.0,1580881332787732488,1580564848341409792,1039132601020895232,"#include\nusing namespace std;\n\ntypedef long long LL;\ntypedef pair pii;\nconst int maxn = 1e5 + 10;\n\nvector e[maxn];\nint v[maxn], f[maxn];\n\nint dfs(int u, int fa) {\n for(auto i : e[u])\n if(i != fa)\n f[u] += dfs(i, u);\n return f[u] += v[u];\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr); cout.tie(nullptr);\n \n int n, root;\n cin >> n >> root;\n for(int i = 1; i < n; i++) {\n int x, y;\n cin >> x >> y;\n e[x].push_back(y);\n e[y].push_back(x);\n }\n for(int i = 1; i <= n; i++)\n cin >> v[i];\n dfs(root, 0);\n // for(int i = 1; i <= n; i++)\n // cout << f[i] << \"" \"";\n // cout << endl;\n int ans = 0;\n for(auto i : e[root])\n ans = max(ans, f[i]);\n cout << ans;\n return 0;\n}",ACCEPTED,775,6616 1583083055522639872,760c402a9a102f75fbdeb52f13e434e75604104d3105af2f258dd7dd88165f7d,2022-10-20 21:09:47,C++,300.0,1580881332787732488,1580564848341409792,1039132601020895232,"#include\n#include\n#include\n#include\nusing namespace std;\nstack st;\nvector G[100010];\nint fa[100010], w[100010],u[100010],v[100010],first[100010],Next[100010],Max = 0,e=0;\nvoid build(int r, int f) {\n\tint d = G[r].size();\n\tfor(int i=0;i> n >> root;\n\tmemset(first, -1, sizeof(first));\n\tfor (int i = 1; i <= n - 1; ++i) {\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\tG[a].push_back (b);\n\t\tG[b].push_back(a);\n\t}\n\tfor (int i = 1; i <= n; ++i) {\n\t\tcin >> w[i];\n\t}\n\tfa[root] = -1;\n\tbuild(root, -1);\n\tsolve(root);\n\tcout << Max;\n\treturn 0;\n}\n",ACCEPTED,1588,8056 1584912658272743424,5ef6bfb7df617ee153ace2dc87c884bf1c63baf69085e910a7d6318d01bb8393,2022-10-25 22:19:58,C++,100.0,1584548952896585731,1580104802964856832,1039132601020895232,"#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#include\n#define lMax 1e18\n#define MK make_pair\n#define iMax 0x7f7f7f7f\n#define sqr(x) ((x)*(x))\n#define pii pair\n#define UNUSED(x) (void)(x)\n#define lowbit(x) ((x)&(-x))\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\ntypedef unsigned long long ull;\ntemplateinline T read(T x) {\n\tint f = 1; char ch = getchar();\n\tfor (; ch < '0' || ch>'9'; ch = getchar())\tif (ch == '-')\tf = -1;\n\tfor (; ch >= '0' && ch <= '9'; ch = getchar())\tx = (x << 1) + (x << 3) + ch - '0';\n\treturn x * f;\n}\ninline void print(int x) {\n\tif (x < 0)\tputchar('-'), x = -x;\n\tif (x > 9)\tprint(x / 10);\n\tputchar(x % 10 + '0');\n}\nconst int N = 2e5, M = 5e6;\nint root[N + 10], V[N + 10], list[N + 10], T;\nstruct CT {\t//Chairman Tree\n\tint ls[M + 10], rs[M + 10], cnt[M + 10], tot;\n\tvoid insert(int k, int& p, int l, int r, int v) {\n\t\tcnt[p = ++tot] = cnt[k] + 1;\n\t\tls[p] = ls[k], rs[p] = rs[k];\n\t\tif (l == r)\treturn;\n\t\tint mid = (l + r) >> 1;\n\t\tif (v <= mid)\tinsert(ls[k], ls[p], l, mid, v);\n\t\telse\tinsert(rs[k], rs[p], mid + 1, r, v);\n\t}\n\tint query(int x, int y, int lca, int lca_f, int l, int r, int k) {\n\t\tif (l == r)\treturn l;\n\t\tint mid = (l + r) >> 1, Cnt = cnt[ls[x]] + cnt[ls[y]] - cnt[ls[lca]] - cnt[ls[lca_f]];\n\t\tif (k <= Cnt)\treturn query(ls[x], ls[y], ls[lca], ls[lca_f], l, mid, k);\n\t\telse\treturn query(rs[x], rs[y], rs[lca], rs[lca_f], mid + 1, r, k - Cnt);\n\t}\n}ct;\nstruct HLD {\t//Heavy-Light Decomposition\n\tint pre[(N << 1) + 10], now[N + 10], child[(N << 1) + 10], tot;\n\tint Fa[N + 10], Heavy[N + 10], Size[N + 10], Deep[N + 10], Top[N + 10];\n\tvoid link(int x, int y) { pre[++tot] = now[x], now[x] = tot, child[tot] = y; }\n\tvoid connect(int x, int y) { link(x, y), link(y, x); }\n\tvoid Dfs(int x, int fa) {\n\t\tDeep[x] = Deep[Fa[x] = fa] + (Size[x] = 1);\n\t\tct.insert(root[Fa[x]], root[x], 1, T, V[x]);\n\t\tfor (int p = now[x]; p; p = pre[p]) {\n\t\t\tint son = child[p];\n\t\t\tif (son == Fa[x])\tcontinue;\n\t\t\tDfs(son, x), Size[x] += Size[son];\n\t\t\tif (!Heavy[x] || Size[x] > Size[Heavy[x]])\n\t\t\t\tHeavy[x] = son;\n\t\t}\n\t}\n\tvoid Chain(int x) {\n\t\tTop[x] = Heavy[Fa[x]] == x ? Top[Fa[x]] : x;\n\t\tif (Heavy[x])\tChain(Heavy[x]);\n\t\tfor (int p = now[x]; p; p = pre[p]) {\n\t\t\tint son = child[p];\n\t\t\tif (son == Fa[x] || son == Heavy[x])\tcontinue;\n\t\t\tChain(son);\n\t\t}\n\n\t}\n\tint LCA(int x, int y) {\n\t\twhile (Top[x] != Top[y]) {\n\t\t\tif (Deep[Top[x]] < Deep[Top[y]])\n\t\t\t\tswap(x, y);\n\t\t\tx = Fa[Top[x]];\n\t\t}\n\t\treturn Deep[x] < Deep[y] ? x : y;\n\t}\n}hld;\nint main() {\n\tint n = read(0), m = read(0);\n\tfor (int i = 1; i <= n; i++)\tV[i] = list[i] = read(0);\n\tsort(list + 1, list + 1 + n);\n\tT = unique(list + 1, list + 1 + n) - list - 1;\n\tfor (int i = 1; i <= n; i++)\tV[i] = lower_bound(list + 1, list + 1 + T, V[i]) - list;\n\tfor (int i = 1; i < n; i++) {\n\t\tint x = read(0), y = read(0);\n\t\thld.connect(x, y);\n\t}\n\thld.Dfs(1, 0), hld.Chain(1);\n\tint LastAns = 0;\n\tfor (int i = 1; i <= m; i++) {\n\t\tint x = read(0) ^ LastAns, y = read(0) ^ LastAns, k = read(0) ^ LastAns;\n\t\tint LCA = hld.LCA(x, y);\n\t\tprintf(\""%d\\n\"", LastAns = list[ct.query(root[x], root[y], root[LCA], root[hld.Fa[LCA]], 1, T, k)]);\n\t}\n\treturn 0;\n}",ACCEPTED,5389,55596 1584913174084055040,5ef6bfb7df617ee153ace2dc87c884bf1c63baf69085e910a7d6318d01bb8393,2022-10-25 22:22:01,C++,100.0,1584548952896585729,1579746048826138624,1039131349729988608,"#include\n#define ll long long\nusing namespace std;\nint main(){\n\tll n,m,k,ii,i,j,T,dq;\n\tscanf(\""%lld%lld%lld\"",&n,&m,&k);\n\tif(n==2 or k*(n-1)+1\nint main()\n{\n while(0)\n {\n \n }\n return 0;\n},WRONG_ANSWER,5,372 1584019078809251840,efe1b03b335e1198978600449bde03d519a74115fb069e587ca4fc0ba8a19135,2022-10-23 11:09:12,C++,0.0,1583723226093993984,1579746048826138624,1039131349729988608,#include\nint main()\n{\n while(1)\n {\n \n }\n return 0;\n},TIME_LIMIT_EXCEEDED,500,352 1584046748364312576,a112bd18804e7dab51c2782656a9ddac8154c5a237a2cf966ed32161d788167f,2022-10-23 12:59:09,C++,0.0,1583126617194905600,1580104802964856832,1039132601020895232,"#include\n#define int long long\n#define endl '\\n'\nusing namespace std;\t\n\tint n,m,k;\n\tconst int maxn=200005;\n\t\n\tconst int mod=998244353; \n\tint fa[maxn],hson[maxn],sz[maxn],dep[maxn];\n\tint tot,no[maxn],top[maxn],dfn[maxn];\n\tstruct Seg{\n\t\tint lc,rc;\n\t\tint dat;\n\t}tree[maxn*50];\n\tint segtot,root[maxn];\n\tmapmp;\n\tint b[maxn];\n\tint a[maxn];\n\tint build(int l,int r){\n\t\tint p=++segtot;\n\t\tif(l==r) {\n\t\t\ttree[p].dat=0;\n\t\t\treturn p;\n\t\t}\n\t\tint mid=(l+r)>>1;\n\t\ttree[p].lc=build(l,mid);\n\t\ttree[p].rc=build(mid+1,r);\n\t\ttree[p].dat=tree[tree[p].lc].dat+tree[tree[p].rc].dat;\n\t\treturn p;\n\t}\n\tint insert(int now,int l,int r,int x,int val){\n\t\tint p=++segtot;\n\t\ttree[p]=tree[now];\n\t\tif(l==r){\n\t\t\ttree[p].dat+=val;\n\t\t\treturn p;\n\t\t}\n\t\tint mid=(l+r)>>1;\n\t\tif(x<=mid){\n\t\t\ttree[p].lc=insert(tree[now].lc,l,mid,x,val);\n\t\t}\n\t\telse{\n\t\t\ttree[p].rc=insert(tree[now].rc,mid+1,r,x,val);\n\t\t}\n\t\ttree[p].dat=tree[tree[p].lc].dat+tree[tree[p].rc].dat;\n\t\treturn p;\n\t}\n\t//几个数比val小 \n\tint k_th(int p,int q,int l,int r,int val){\n\t\tif(l==r)\treturn val>r;\n\t\tint mid=(l+r)>>1;\n\t\tint lcnt=tree[tree[p].lc].dat-tree[tree[q].lc].dat;\n\t\tif(mid>val){\n\t\t\treturn k_th(tree[p].lc,tree[q].lc,l,mid,val);\n\t\t}\n\t\telse\n\t\t\treturn lcnt+k_th(tree[p].rc,tree[q].rc,mid+1,r,val);\n\t}\n\tvectore[maxn];\n\tvoid dfs1(int x,int f){\n\t\tfa[x]=f;\n\t\tdep[x]=dep[f]+1;\n\t\tsz[x]=1;\n\t\tint maxsz=-1;\n\t\tfor(auto y:e[x]){\n\t\t\tif(y==f)\tcontinue;\n\t\t\tdfs1(y,x);\n\t\t\tsz[x]+=sz[y];\n\t\t\tif(sz[y]>maxsz){\n\t\t\t\thson[x]=y;\n\t\t\t\tmaxsz=sz[y];\n\t\t\t}\n\t\t}\n\t\treturn ;\n\t}\n\tvoid hld(int x,int tp){\n\t\tdfn[x]=++tot;\n\t\tno[tot]=x;\n\t\ttop[x]=tp;\n\t\tif(!hson[x])\treturn;\n\t\thld(hson[x],tp);\n\t\tfor(auto y:e[x]){\n\t\t\tif(y==fa[x]||y==hson[x])\tcontinue;\n\t\t\thld(y,y);\n\t\t}\n\t}\n\tint qq(int x,int y,int val){\n\t\tint rec=0;\n\t\twhile(top[x]!=top[y]){\n\t\t\tif(dep[top[x]]dep[y]) swap(x,y);\n\t\t//dfn[x],dfn[y]\n\t\trec+=k_th(root[dfn[y]],root[dfn[x]-1],1,n,val);\n\t}\n\tint res(int x,int y,int k){\n\t\tint l=1,r=n,mid;\n\t\twhile(l>1;\n\t\t\tint t=qq(x,y,mid);\n\t\t\tif(t>=k-1){\n\t\t\t\tr=mid;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tl=mid+1;\n\t\t\t}\n\t\t}\n\t\treturn b[mid];\n\t}\n\tvoid solve(){\n\t\tcin>>n>>m;\n\t\troot[0]=build(1,n);\n\t\tsetst;\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tcin>>b[i];\n\t\t\ta[i]=b[i];\n\t\t\tst.insert(b[i]);\n\t\t}\n\t\tint cnt=0;\n\t\tfor(auto i:st){\n\t\t\tmp[i]=++cnt;\n\t\t\tb[cnt]=i;\n\t\t}\n\t\tfor(int i=1;i<=n;i++){\n\t\t\ta[i]=mp[a[i]];\n\t\t}\n//\t\tfor(int i=1;i<=n;i++){\n//\t\t\tcout<>u>>v;\n\t\t\te[u].push_back(v);\n\t\t\te[v].push_back(u);\n\t\t}\n\t\tdfs1(1,1);\n\t\thld(1,1);\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tcout<>x>>y>>k;\n\t\t\tx^=las;\n\t\t\ty^=las;\n\t\t\tk^=las;\n//\t\t\tcout<