submission_id,user_id,create_at,language,score,problem_set_problem_id,problem_id,skill_id,code,response,time_consume,memory_consume
1576946403632488448,9f7b21bdcfb0cc5e37228e395885220ff46158024e272ae966d9c4dc7db7a4bb,2022-10-03 22:44:55,C++,10.0,1576937158526767111,1402551304773722112,385,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    while(n--)\n    {\n        int x;\n        cin>>x;\n        if(x%2==1)\n            cout<<\""lyx wins\""<<endl;\n        else\n            cout<<\""xrf wins\""<<endl;\n    }\n    return 0;\n}",ACCEPTED,4,460
1576947198033666048,6f92ed190a935c676e3cc09725f4f34ffcd5c4b6e9dc8cd93eb026b402fc39c8,2022-10-03 22:48:04,C++,0.0,1576937158526767111,1402551304773722112,385,"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin >> n;\n    for(int i = 0; i < n; i ++ )\n    {\n        string s;\n        cin >> s;\n        if(s.size() & 1) cout << \""lyx wins\"" << endl;\n        else cout << \""xrf wins\"" << endl;\n    }\n    return 0;\n}",WRONG_ANSWER,4,456
1576947952182099968,6f92ed190a935c676e3cc09725f4f34ffcd5c4b6e9dc8cd93eb026b402fc39c8,2022-10-03 22:51:04,C++,0.0,1576937158526767111,1402551304773722112,385,"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin >> n;\n    for(int i = 0; i < n; i ++ )\n    {\n        string s;\n        cin >> s;\n        if(s.size() % 2 == 1) cout << \""lyx wins\"" << endl;\n        else cout << \""xrf wins\"" << endl;\n    }\n    return 0;\n}",WRONG_ANSWER,3,332
1576947976001568768,6f92ed190a935c676e3cc09725f4f34ffcd5c4b6e9dc8cd93eb026b402fc39c8,2022-10-03 22:51:10,C++,0.0,1576937158526767111,1402551304773722112,385,"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin >> n;\n    for(int i = 0; i < n; i ++ )\n    {\n        string s;\n        cin >> s;\n        if(s.size() % 2 == 0) cout << \""lyx wins\"" << endl;\n        else cout << \""xrf wins\"" << endl;\n    }\n    return 0;\n}",WRONG_ANSWER,5,444
1576949831683276800,6f92ed190a935c676e3cc09725f4f34ffcd5c4b6e9dc8cd93eb026b402fc39c8,2022-10-03 22:58:32,C++,10.0,1576937158526767111,1402551304773722112,385,"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin >> n;\n    for(int i = 0; i < n; i ++ )\n    {\n        string s;\n        cin >> s;\n        if(s[s.size() - 1] - '0' & 1) cout << \""lyx wins\"" << endl;\n        else cout << \""xrf wins\"" << endl;\n    }\n    return 0;\n}",ACCEPTED,5,448
1576950903671889920,2cb0ca42fb488afce14aa85dddea40ce5aee61a9ef0ff44c89a0cf3144fd6a9d,2022-10-03 23:02:48,C,10.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n\tint n,m;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&m);\n        if(m%2==1){\n            printf(\""lyx wins\\n\"");\n        }else printf(\""xrf wins\\n\"");\n    }\n    return 0;\n}",ACCEPTED,4,488
1577171206373130240,a7a1a1263110de80b2177a46b89630d8cc65850ad456068ed7860bcefec47467,2022-10-04 13:38:12,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n\tint n,x,i,j,cnt=1;\n    scanf(\""%d\"",&n);\n    \n    for(i=0;i<n;i ++){\n        scanf(\""%d\"",&x);\t\t\n\t        for(j=2;j<x;j ++){\n\t            if(x%j==0){\n\t            \tcnt ++;\n\t            \tx/=j;\n\t            \tj=1;\n\t\t\t\t}\n\t        }\n        \n        if(cnt%2==0){\n            printf(\""xrf wins\\n\"");\n        }else{\n             printf(\""lyx wins\\n\"");\n        }\n    }\n  \t  \n\treturn 0;\n } \n",WRONG_ANSWER,7,200
1577173644597526528,a7a1a1263110de80b2177a46b89630d8cc65850ad456068ed7860bcefec47467,2022-10-04 13:47:54,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n\tint n,x,i,j,cnt=1;\n    scanf(\""%d\"",&n);\n    \n    for(i=0;i<n;i ++){\n        scanf(\""%d\"",&x);\t\n\t\tj=2;\t\n\t        while(j<x){\t        \t\n\t            if(x%j==0){\n\t            \tcnt ++;\n\t            \tx/=j;\n\t            \tj=1;\t            \t\n\t\t\t\t}\n\t\t\t\tj ++;\n\t        }\n        \n        if(cnt%2==0){\n            printf(\""xrf wins\\n\"");\n        }else{\n             printf(\""lyx wins\\n\"");\n        }\n    }\n  \t  \n\treturn 0;\n } \n",WRONG_ANSWER,8,308
1577183654924795904,dba53be69dd9e8e98ca868b5ce612e8f3f32481408de24acfd417ea422c7d157,2022-10-04 14:27:40,C++,10.0,1576937158526767111,1402551304773722112,385,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    while(n -- )\n    {\n        int t;\n        cin>>t;\n        if(t %2 == 0)\n            printf(\""xrf wins\\n\"");\n        else printf(\""lyx wins\\n\"");\n    }\n}",ACCEPTED,4,440
1577184515700817920,a7a1a1263110de80b2177a46b89630d8cc65850ad456068ed7860bcefec47467,2022-10-04 14:31:05,C,10.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n\tint n,x,i,j,cnt=1;\n    scanf(\""%d\"",&n);\n    \n    for(i=0;i<n;i ++){\n        scanf(\""%d\"",&x);\t\n        \n        if(x%2==0){\n            printf(\""xrf wins\\n\"");\n        }else{\n             printf(\""lyx wins\\n\"");\n        }\n    }\n  \t  \n\treturn 0;\n } \n",ACCEPTED,3,196
1577209334597173248,7b38e025a6c63cf6cf6aeab02b09470b48929a5380e76f382ff6331816845f17,2022-10-04 16:09:43,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int i;\n    for(i=1;i<=n;i++){\n        int m;\n        scanf(\""%d\"",&m);\n        if(m%2==0){\n            printf(\""xrf wins\"");\n        }\n        else{\n            printf(\""lyx wins\"");\n        }\n        \n    }\n}    ",PRESENTATION_ERROR,3,312
1577209403278884864,7b38e025a6c63cf6cf6aeab02b09470b48929a5380e76f382ff6331816845f17,2022-10-04 16:09:59,C,10.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int i;\n    for(i=1;i<=n;i++){\n        int m;\n        scanf(\""%d\"",&m);\n        if(m%2==0){\n            printf(\""xrf wins\\n\"");\n        }\n        else{\n            printf(\""lyx wins\\n\"");\n        }\n        \n    }\n}    ",ACCEPTED,3,196
1577238051839033344,70d13467d51d5749a832231fd1e2792e6b7f95b4e41941cdefba64e034efe03d,2022-10-04 18:03:49,C++,10.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    while(n--){\n        scanf(\""%d\"",&m);\n        if(m%2==0)\n            printf(\""xrf wins\\n\"");\n        else\n            printf(\""lyx wins\\n\"");\n    }\n    return 0;\n}",ACCEPTED,3,464
1577249883697971200,37677f0536a88fdee92dd8640e1da61ff493ce904cdc99449cf49cdb0f7db976,2022-10-04 18:50:50,C++,10.0,1576937158526767111,1402551304773722112,385,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int n;cin >> n;\n    int m;\n    while(n--)\n    {\n        cin >> m;\n        if(m % 2 != 0)\n        {\n            cout << \""lyx wins\"" << endl;\n        }\n        else\n        {\n            cout << \""xrf wins\"" << endl;\n        }\n    }\n}",ACCEPTED,4,456
1577336683749711872,d95a6805c85ae8c9dfe99fc7fc34dfee9840069b0c996164d1447e5ebffb3a14,2022-10-05 00:35:45,Python,10.0,1576937158526767111,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    x=int(input())\n    if x&1:\n        print('lyx wins')\n    else:\n        print('xrf wins'),ACCEPTED,15,2884
1577473945548365824,6322abd9960e391f4b107960c09a01e6dd3cc873a2c765a0e3b9399652c493c6,2022-10-05 09:41:11,C,10.0,1576937158526767111,1402551304773722112,385,"#include <stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++){\n        int m;\n        scanf(\""%d\"",&m);\n        if(m%2==0){\n            printf(\""xrf wins\\n\"");\n        }\n        else{\n            printf(\""lyx wins\\n\"");\n        }\n    }\n    return 0;\n}",ACCEPTED,2,188
1577502370329796608,56991af571a99050e3f91c997892ff06548c874191ea9f269a89135d985d14e7,2022-10-05 11:34:08,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n=0;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&n);\n    }\n    if(n%2==0)\n    {\n        printf(\""xrf wins\\n\"");\n    }\n    else\n    {\n        printf(\""lyx wins\\n\"");\n    }\n}",WRONG_ANSWER,3,196
1577502937294831616,56991af571a99050e3f91c997892ff06548c874191ea9f269a89135d985d14e7,2022-10-05 11:36:23,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n=0;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&n);\n         if(n%2==0)\n    \t{\n        \tprintf(\""xrf wins\\n\"");\n    \t}\n    \telse\n    \t{\n        \tprintf(\""lyx wins\\n\"");\n    \t}\n    }\n}",WRONG_ANSWER,2,320
1577503568449503232,56991af571a99050e3f91c997892ff06548c874191ea9f269a89135d985d14e7,2022-10-05 11:38:53,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n=0,a=0;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&a);\n         if(n%2==0)\n    \t{\n        \tprintf(\""xrf wins\\n\"");\n    \t}\n    \telse\n    \t{\n        \tprintf(\""lyx wins\\n\"");\n    \t}\n    }\n}",WRONG_ANSWER,3,320
1577503654101385216,56991af571a99050e3f91c997892ff06548c874191ea9f269a89135d985d14e7,2022-10-05 11:39:14,C,10.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n=0,a=0;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&a);\n         if(a%2==0)\n    \t{\n        \tprintf(\""xrf wins\\n\"");\n    \t}\n    \telse\n    \t{\n        \tprintf(\""lyx wins\\n\"");\n    \t}\n    }\n}",ACCEPTED,3,184
1577557176247394304,d1915cbfe79b19a959b4eba29502775ab5d284a39207275a9ad63fdf2ea1500b,2022-10-05 15:11:55,C++,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\n#include<string.h>\n#include<math.h>\nchar a[100];\nchar ch[100];\nint main()\n{\tint n,sum=0;\n\tint  flat1=0,flat2=0;\n\tint flat=0;\n\tscanf(\""%d\"",&n);\n\tint q;\n\tfor(int i=0;i<n;i++)\n\t{\t\n\t\tscanf(\""%d\"",&q);\n\t\t\t\t\t\t\n\t\tif(q==1)\n\t\t{\n\t\t\t\t\t\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t\t\n\t\t\t\n\t\t}else\n\t\t{\n\t\t\t\twhile((q-1)/2!=0)\n\t\t\t{\n\t\t\t\n\t\t\t\tq=q/2;\n\t\t\t\t flat++;\n\t\t\t}\n\t\t\tif((flat-1)%2!=0)\n\t\t\tprintf(\""xrf wins\\n\"");\n\t\t\telse printf(\""lyx wins\\n\"");\n\t\t}\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,5,604
1577557199613853696,d1915cbfe79b19a959b4eba29502775ab5d284a39207275a9ad63fdf2ea1500b,2022-10-05 15:12:00,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\n#include<string.h>\n#include<math.h>\nchar a[100];\nchar ch[100];\nint main()\n{\tint n,sum=0;\n\tint  flat1=0,flat2=0;\n\tint flat=0;\n\tscanf(\""%d\"",&n);\n\tint q;\n\tfor(int i=0;i<n;i++)\n\t{\t\n\t\tscanf(\""%d\"",&q);\n\t\t\t\t\t\t\n\t\tif(q==1)\n\t\t{\n\t\t\t\t\t\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t\t\n\t\t\t\n\t\t}else\n\t\t{\n\t\t\t\twhile((q-1)/2!=0)\n\t\t\t{\n\t\t\t\n\t\t\t\tq=q/2;\n\t\t\t\t flat++;\n\t\t\t}\n\t\t\tif((flat-1)%2!=0)\n\t\t\tprintf(\""xrf wins\\n\"");\n\t\t\telse printf(\""lyx wins\\n\"");\n\t\t}\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,3,308
1577558054471745536,d1915cbfe79b19a959b4eba29502775ab5d284a39207275a9ad63fdf2ea1500b,2022-10-05 15:15:24,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\n#include<string.h>\n#include<math.h>\nchar a[100];\nchar ch[100];\nint main()\n{\tint n,sum=0;\n\tint  flat1=0,flat2=0;\n\tint flat=0;\n\tscanf(\""%d\"",&n);\n\tint q;\n\tfor(int i=0;i<n;i++)\n\t{\t\n\t\tscanf(\""%d\"",&q);\n\t\t\t\t\t\t\n\t\tif(q==1)\n\t\t{\n\t\t\t\t\t\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t\t\n\t\t\t\n\t\t}else\n\t\t{\n\t\t\t\twhile((q-1)/2!=0)\n\t\t\t{\n\t\t\t\n\t\t\t\tq=q/2;\n\t\t\t\t flat++;\n\t\t\t}\n\t\t\tif((flat-1)%2!=0)\n\t\t\tprintf(\""xrf wins\\n\"");\n\t\t\telse printf(\""lyx wins\\n\"");\n\t\t}\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,3,196
1577849402923941888,497337ae3398983d026e5deb8d616e68592d18366850c21c6357e65c8a782215,2022-10-06 10:33:07,C,10.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main(){\n    int n,x;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++){\n    scanf(\""%d\"",&x);\n    if(x%2==0){\n        printf(\""xrf wins\"");\n    }\n    else \n        printf(\""lyx wins\"");\n        printf(\""\\n\"");\n    }\n    return 0;\n}",ACCEPTED,3,184
1578017820562161664,5383515f1bd5a1868869308e9d300270bae2b72a2c45a4d1e38316d54d4dc124,2022-10-06 21:42:21,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n\tint N;\n\tscanf(\""%d\"",&N);\n\twhile(N--)\n\t{\n\t\tint a;\n\t\tscanf(\""%d\"",&a);\n\t\tif(a&1)\n\t\tprintf(\""lyx wins\"");\n\t\telse\n\t\tprintf(\""xrf wins\"");\n\t}\n\treturn 0;\n}",PRESENTATION_ERROR,5,652
1578017885091528704,5383515f1bd5a1868869308e9d300270bae2b72a2c45a4d1e38316d54d4dc124,2022-10-06 21:42:36,C,10.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n\tint N;\n\tscanf(\""%d\"",&N);\n\twhile(N--)\n\t{\n\t\tint a;\n\t\tscanf(\""%d\"",&a);\n\t\tif(a&1)\n\t\tprintf(\""lyx wins\\n\"");\n\t\telse\n\t\tprintf(\""xrf wins\\n\"");\n\t}\n\treturn 0;\n}",ACCEPTED,4,312
1578194190072299520,d1915cbfe79b19a959b4eba29502775ab5d284a39207275a9ad63fdf2ea1500b,2022-10-07 09:23:11,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\n#include<string.h>\n#include<math.h>\nchar a[100];\nchar ch[100];\nint main()\n{\tint n,sum=0;\n\tint  flat1=0,flat2=0;\n\tint flat=0;\n\tscanf(\""%d\"",&n);\n\tint q;\n\tfor(int i=0;i<n;i++)\n\t{\t\n\t\tscanf(\""%d\"",&q);\n\t\t\t\t\t\t\n\t\tif(q==1)\n\t\t{\n\t\t\t\t\t\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t\t\n\t\t\t\n\t\t}else\n\t\t{\n\t\t\t\twhile((q-1)/2!=0)\n\t\t\t{\n\t\t\t\n\t\t\t\tq=q/2;\n\t\t\t\t flat++;\n\t\t\t}\n\t\t\tif((flat-1)%2!=0)\n\t\t\tprintf(\""xrf wins\\n\"");\n\t\t\telse printf(\""lyx wins\\n\"");\n\t\t}\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,3,312
1578271055604621312,d1915cbfe79b19a959b4eba29502775ab5d284a39207275a9ad63fdf2ea1500b,2022-10-07 14:28:37,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\n#include<string.h>\n#include<math.h>\nchar a[100];\nchar ch[100];\nint main()\n{\tint n,sum=0;\n\tint  flat1=0,flat2=0;\n\tint flat=0;\n\tscanf(\""%d\"",&n);\n\tint q;\n\tfor(int i=0;i<n;i++)\n\t{\t\n\t\tscanf(\""%d\"",&q);\n\t\t\t\t\t\t\n\t\tif(q==1)\n\t\t{\n\t\t\t\t\t\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t\t\n\t\t\t\n\t\t}else\n\t\t{\n\t\t\t\twhile((q-1)/2!=0)\n\t\t\t{\n\t\t\t\n\t\t\t\tq=q/2;\n\t\t\t\t flat++;\n\t\t\t}\n\t\t\tif((flat-1)%2!=0)\n\t\t\tprintf(\""xrf wins\\n\"");\n\t\t\telse printf(\""lyx wins\\n\"");\n\t\t}\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,3,312
1578340000818790400,d1915cbfe79b19a959b4eba29502775ab5d284a39207275a9ad63fdf2ea1500b,2022-10-07 19:02:34,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\n#include<string.h>\n#include<math.h>\nchar a[100];\nchar ch[100];\nint main()\n{\tint n,sum=0;\n\tint  flat1=0,flat2=0;\n\tint flat=0;\n\tscanf(\""%d\"",&n);\n\tint q;\n\tfor(int i=0;i<n;i++)\n\t{\t\n\t\tscanf(\""%d\"",&q);\n\t\t\t\t\t\t\n\t\tif(q==1)\n\t\t{\n\t\t\t\t\t\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t\t\n\t\t\t\n\t\t}else\n\t\t{\n\t\t\t\twhile((q-1)/2!=0)\n\t\t\t{\n\t\t\t\n\t\t\t\tq=q/2;\n\t\t\t\t flat++;\n\t\t\t}\n\t\t\tif((flat-1)%2!=0)\n\t\t\tprintf(\""xrf wins\\n\"");\n\t\t\telse printf(\""lyx wins\\n\"");\n\t\t}\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,5,184
1578342410001858560,d1915cbfe79b19a959b4eba29502775ab5d284a39207275a9ad63fdf2ea1500b,2022-10-07 19:12:09,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\n#include<string.h>\n#include<math.h>\nchar a[100];\nchar ch[100];\nint main()\n{\tint n,sum=0;\n\tint  flat1=0,flat2=0;\n\tint flat=0;\n\tscanf(\""%d\"",&n);\n\tint q;\n\tfor(int i=1;i<=n;i++)\n\t{\t\n\t\tscanf(\""%d\"",&q);\n\t\t\t\t\t\t\n\t\tif(q==1)\n\t\t{\n\t\t\t\t\t\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t\t\n\t\t\t\n\t\t}else\n\t\t{\n\t\t\t\twhile((q-1)/2!=0)\n\t\t\t{\n\t\t\t\n\t\t\t\tq=q/2;\n\t\t\t\t flat++;\n\t\t\t}\n\t\t\t\n\t\t\tif((flat-1)%2!=0)\n\t\t\t{printf(\""xrf wins\"");\n\t\t\tif(i!=n) printf(\""\\n\""); \n\t\t\t}\n\t\t\telse {\n\t\t\t\tprintf(\""lyx wins\"");\n\t\t\t\tif(i!=n) printf(\""\\n\""); \n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,324
1578342512250585088,d1915cbfe79b19a959b4eba29502775ab5d284a39207275a9ad63fdf2ea1500b,2022-10-07 19:12:33,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\n#include<string.h>\n#include<math.h>\nchar a[100];\nchar ch[100];\nint main()\n{\tint n,sum=0;\n\tint  flat1=0,flat2=0;\n\tint flat=0;\n\tscanf(\""%d\"",&n);\n\tint q;\n\tfor(int i=1;i<=n;i++)\n\t{\t\n\t\tscanf(\""%d\"",&q);\n\t\t\t\t\t\t\n\t\tif(q==1)\n\t\t{\n\t\t\t\t\t\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t\t\n\t\t\t\n\t\t}else\n\t\t{\n\t\t\t\twhile((q-1)/2!=0)\n\t\t\t{\n\t\t\t\n\t\t\t\tq=q/2;\n\t\t\t\t flat++;\n\t\t\t}\n\t\t\t\n\t\t\tif((flat-1)%2!=0)\n\t\t\t{printf(\""xrf wins\"");\n\t\t\tif(i!=n) printf(\""\\n\""); \n\t\t\t}\n\t\t\telse {\n\t\t\t\tprintf(\""lyx wins\"");\n\t\t\t\tif(i!=n) printf(\""\\n\""); \n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,324
1578342773668986880,d1915cbfe79b19a959b4eba29502775ab5d284a39207275a9ad63fdf2ea1500b,2022-10-07 19:13:36,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\n#include<string.h>\n#include<math.h>\nchar a[100];\nchar ch[100];\nint main()\n{\tint n,sum=0;\n\tint  flat1=0,flat2=0;\n\tint flat=0;\n\tscanf(\""%d\"",&n);\n\tint q;\n\tfor(int i=1;i<=n;i++)\n\t{\t\n\t\tscanf(\""%d\"",&q);\t\t\t\t\n\t\tif(q==1)\n\t\t{\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t}else\n\t\t{\n\t\t\t\twhile((q-1)/2!=0)\n\t\t\t{\n\t\t\t\tq=q/2;\n\t\t\t\t flat++;\n\t\t\t}\n\t\t\tif((flat-1)%2!=0)\n\t\t\t{printf(\""xrf wins\"");\n\t\t\tif(i!=n) printf(\""\\n\""); \n\t\t\t}\n\t\t\telse {\n\t\t\t\tprintf(\""lyx wins\"");\n\t\t\t\tif(i!=n) printf(\""\\n\""); \n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,196
1578346515600515072,d1915cbfe79b19a959b4eba29502775ab5d284a39207275a9ad63fdf2ea1500b,2022-10-07 19:28:28,C,10.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main(){\n    int n,m,i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&m);\n        if(m%2==0)printf(\""xrf wins\\n\"");\n    else \n    printf(\""lyx wins\\n\"");}\n    return 0;}\n",ACCEPTED,4,320
1578346806991405056,d1915cbfe79b19a959b4eba29502775ab5d284a39207275a9ad63fdf2ea1500b,2022-10-07 19:29:37,C,10.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main(){\n    int n,m,i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&m);\n        if(m%2==0)printf(\""xrf wins\\n\"");\n    else \n    printf(\""lyx wins\\n\"");}\n    return 0;}\n",ACCEPTED,10,340
1578591233206927360,6438c2087b24728e86e5bc5760451c9c87c4a125f5d2bfa6d40a0c9546682340,2022-10-08 11:40:53,C,0.0,1576937158526767111,1402551304773722112,385,#include<stdio.h>\nint main()\n{\n    \n    \n},WRONG_ANSWER,3,192
1578977783769997312,6438c2087b24728e86e5bc5760451c9c87c4a125f5d2bfa6d40a0c9546682340,2022-10-09 13:16:54,C,10.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m,i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m%2==0) printf(\""xrf wins\\n\"");\n        else printf(\""lyx wins\\n\"");\n    }\n    \n}",ACCEPTED,3,196
1579850462358159360,cd6771864885db6d7fc52ca5b2ddd110853c6d6fcfaed1aca01a83a573382e2a,2022-10-11 23:04:37,C,10.0,1576937158526767111,1402551304773722112,385,"#include <stdio.h>\nint main()\n{\n    int n,i;\n    int a[50];\n    scanf(\""%d\"",&n);\n    for (i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for (i=0;i<n;i++)\n    {\n        if(a[i]%2 ==0)\n            printf(\""xrf wins\\n\"");\n        else\n            printf(\""lyx wins\\n\"");\n    }\n    return 0;\n}",ACCEPTED,3,196
1584376100499099648,0b38b4a3612ead6ade93947e36f7f27aae54f955b46b24060e90db3e53b68160,2022-10-24 10:47:53,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n\t\n\tint x,i;\n\tscanf(\""%d\"",&x);\n\tfor(i=0;i<x;i++){\n\t\t\n\t\tint n;\n\t\tscanf(\""%d\"",&n);\n\t\tif(n%2==1){\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t}else{\n\t\t\tprintf(\""xrf wins\"");\n\t\t}\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t}\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\treturn 0;\n}",PRESENTATION_ERROR,3,328
1584376517240942592,0b38b4a3612ead6ade93947e36f7f27aae54f955b46b24060e90db3e53b68160,2022-10-24 10:49:32,C,10.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n\t\n\tint x,i,ret;\n\tscanf(\""%d\"",&x);\n\tfor(i=0;i<x;i++){\n\t\t\n\t\tint n;\n\t\tscanf(\""%d\"",&n);\n\t\tif(n%2==1){\n\t\tret=1;\n\t\t}else{\n\t\t\tret=0;\n\t\t}\n\t\t\n\t\t\n\t\t\n\t\tif(ret==1){\n\t\t\t\tprintf(\""lyx wins\\n\"");\n\t\t}\n\t\telse{\n\t\t\t  printf(\""xrf wins\\n\"");\n\t\t}\n\t      \n\t\t\n\t\t\n\t\t\n\t}\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\treturn 0;\n}",ACCEPTED,3,600
1586534649253728256,5fca4b3efca809287d72a625e6dff74a2918b4b108bcf65994c2edef34d95269,2022-10-30 09:45:11,C,0.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main ()\n{\n    int n,i,m;\n    scanf(\""%d\"",&n);\n    for (i=1;i<n;i++)\n    {\n      scanf(\""%d\"",&m);\n        if (m%2==0)\n            printf(\""xrf wins\\n\"");\n        else\n            printf(\""lyx wins\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,8,480
1586534798692581376,5fca4b3efca809287d72a625e6dff74a2918b4b108bcf65994c2edef34d95269,2022-10-30 09:45:47,C,10.0,1576937158526767111,1402551304773722112,385,"#include<stdio.h>\nint main ()\n{\n    int n,i,m;\n    scanf(\""%d\"",&n);\n    for (i=1;i<=n;i++)\n    {\n      scanf(\""%d\"",&m);\n        if (m%2==0)\n            printf(\""xrf wins\\n\"");\n        else\n            printf(\""lyx wins\\n\"");\n    }\n    return 0;\n}",ACCEPTED,4,324
1428907172226772992,75918c1e9bb9a40dadc1669048744e7dcf84b2b6b1fbcf8567026c07ecc964a8,2021-08-21 10:29:52,C++,10.0,1428618137369309184,1402551304773722112,385,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint n,s;\n\tcin>>n;\n\twhile(n--){\n\t\tcin>>s;\n\t\tif(s%2==0){\n\t\t\tcout<<\""xrf wins\"";\n\t\t}\n\t\telse\n\t\tcout<<\""lyx wins\"";\n\t\tif(n!=0)\n\t\tcout<<endl;\n\t}\n}",ACCEPTED,3,324
1428914789535821824,e0e77be7b06a31dd4d95c760ee7c66a9df386b2d8ed952d7b7804328656d97bf,2021-08-21 11:00:08,C++,10.0,1428618137369309184,1402551304773722112,385,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,a;\n    cin>>n;\n    for(int i=0;i<n;i++)\n    {\n        cin>>a;\n        if(a%2==0)\n        {\n            cout<<\""xrf wins\""<<endl;\n        }\n        else\n            cout<<\""lyx wins\""<<endl;\n    }\n}",ACCEPTED,5,328
1428925005346398208,1695ed75bf3904512099348723fcdf268301fdb63b354b095253c5a86eb57685,2021-08-21 11:40:44,C++,10.0,1428618137369309184,1402551304773722112,385,"#include<iostream>\nusing namespace std;\nint main(){\n    int n;\n    cin>>n;\n    while(n--){\n        int t;\n        cin>>t;\n        cout<<(t%2==0?\""xrf wins\"":\""lyx wins\"");\n        if(n>0) cout<<endl; \n    }\n}",ACCEPTED,6,312
1428996780772057088,cddf205c0082ef9d2352b4862c8bf2c08d21149db8ab38e128d4d39092a62436,2021-08-21 16:25:56,C++,10.0,1428618137369309184,1402551304773722112,385,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin>>n;\n    while(n--)\n    {\n        int m;\n        cin>>m;\n        if(m%2==0)\n            cout<<\""xrf wins\""<<endl;\n        else cout<<\""lyx wins\""<<endl;\n    }\n    return 0;\n}",ACCEPTED,6,452
1576895881231745024,162ec85bb693fe10dba73039ecffe4f82f5081eb37b673c0f2d2dc8645353935,2022-10-03 19:24:10,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main(){\n    int a,b;\n    scanf(\""%d\"",&a);\n    for(int i=1;i<=a;i++){\n        scanf(\""%d\"",&b);\n        \n        \n    }\n    if(b%2==0)\n        printf(\""xrf wins\\n\"");\n    else\n        printf(\""lyx wins\\n\"");\n    \n    \n    \n    \n    return 0;\n}",WRONG_ANSWER,4,308
1576895907991396352,162ec85bb693fe10dba73039ecffe4f82f5081eb37b673c0f2d2dc8645353935,2022-10-03 19:24:16,C,10.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main(){\n    int a,b;\n    scanf(\""%d\"",&a);\n    for(int i=1;i<=a;i++){\n        scanf(\""%d\"",&b);\n         if(b%2==0)\n        printf(\""xrf wins\\n\"");\n    else\n        printf(\""lyx wins\\n\"");\n    \n        \n    }\n   \n    \n    \n    \n    return 0;\n}",ACCEPTED,3,184
1576896117203271680,6896372e06d0522443a59d9ee0db3268b66785c4d718dbabf5ba98f7de44f272,2022-10-03 19:25:06,C,10.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main(){\n    int a,b;\n    scanf(\""%d\"",&a);\n    for(int i=1;i<=a;i++){\n        scanf(\""%d\"",&b);\n         if(b%2==0)\n        printf(\""xrf wins\\n\"");\n    else\n        printf(\""lyx wins\\n\"");}\n   \n    \n    \n    \n    return 0;\n}",ACCEPTED,3,192
1576897932984598528,95385abb701efa1531493ac01efefa426f2c6ae6ac4cc64fc42921e3cc1365f6,2022-10-03 19:32:19,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main(){\n    int a,b;\n    scanf(\""%d\"",&a);\n    for(int i=1;i<=a;i++){\n        scanf(\""%d\"",&b);\n         if(b%2==0)\n        printf(\""xrf wins\\n\"");\n    else\n        printf(\""lyx wins\\n\"");\n    \n        \n    }",COMPILE_ERROR,0,0
1576898053654724608,95385abb701efa1531493ac01efefa426f2c6ae6ac4cc64fc42921e3cc1365f6,2022-10-03 19:32:47,C,10.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int a,b;\n    scanf(\""%d\"",&a);\n    for(int i=1;i<=a;i++){\n        scanf(\""%d\"",&b);\n         if(b%2==0)\n        printf(\""xrf wins\\n\"");\n    else\n        printf(\""lyx wins\\n\"");\n    }\n        \n    }",ACCEPTED,4,192
1576901258052632576,132c3b04018cb6051536b793c753d2c3acd6c98b7893af540715feb901470903,2022-10-03 19:45:31,C,10.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main(){\n    int n,m,i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&m);\n        if(m%2==0)printf(\""xrf wins\\n\"");\n    else \n    printf(\""lyx wins\\n\"");\n    }\n    return 0;\n}",ACCEPTED,3,184
1576906294191194112,37fc6141609665711ea4ac437ffdc2dc83ebbbca9f4afeafb13072b1379bc3e7,2022-10-03 20:05:32,C,10.0,1574832745237114887,1402551304773722112,385,"#include <stdio.h>\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    while(n--)\n    {\n        int m,flag = 0;\n        scanf(\""%d\"",&m);\n        while(m>1)\n        {\n            m--;\n            flag = !flag;\n        }\n        if(flag)\n        {\n            puts(\""xrf wins\"");\n        }else\n        {\n            puts(\""lyx wins\"");\n        }\n    }\n}",ACCEPTED,26,320
1576907286999744512,90caf621ac84d588093508150f67a5c59de05123adb51112335d0afef70b55fe,2022-10-03 20:09:29,C,10.0,1574832745237114887,1402551304773722112,385,"#include <stdio.h>\nint main()\n{\n    int n,m,i;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++){\n        scanf(\""%d\"",&m);\n        if(m%2==0){\n            printf(\""xrf wins\\n\"");\n        }else{\n            printf(\""lyx wins\\n\"");\n        }\n    }\n    return 0;\n}\n\n",ACCEPTED,2,200
1576910435332390912,71095af58db7dde76b76ad41d82ebb82828dee81639bbf4e749c059e1f22542c,2022-10-03 20:22:00,C,0.0,1574832745237114887,1402551304773722112,385,"#include <stdio.h>\n\nint main()\n{\n    int i,n,m,s;//s是m取的模\n    for(i = 1;i <= n;i ++)\n    {\n        scanf(\""%d\"",&m);\n        s = m % 2;\n        if(s == 0)\n        {\n            printf(\""xrf wins\"");\n        }\n        else if(s != 0)\n        {\n            printf(\""lyx wins\"");\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,2,348
1576910609265991680,71095af58db7dde76b76ad41d82ebb82828dee81639bbf4e749c059e1f22542c,2022-10-03 20:22:41,C,0.0,1574832745237114887,1402551304773722112,385,"#include <stdio.h>\n\nint main()\n{\n    int i,n,m,s;//s是m取的模\n    scanf(\""%d\"",&n);\n    for(i = 1;i <= n;i ++)\n    {\n        scanf(\""%d\"",&m);\n        s = m % 2;\n        if(s == 0)\n        {\n            printf(\""xrf wins\"");\n        }\n        else if(s != 0)\n        {\n            printf(\""lyx wins\"");\n        }\n    }\n    return 0;\n}",PRESENTATION_ERROR,3,184
1576910676655874048,71095af58db7dde76b76ad41d82ebb82828dee81639bbf4e749c059e1f22542c,2022-10-03 20:22:57,C,10.0,1574832745237114887,1402551304773722112,385,"#include <stdio.h>\n\nint main()\n{\n    int i,n,m,s;//s是m取的模\n    scanf(\""%d\"",&n);\n    for(i = 1;i <= n;i ++)\n    {\n        scanf(\""%d\"",&m);\n        s = m % 2;\n        if(s == 0)\n        {\n            printf(\""xrf wins\\n\"");\n        }\n        else if(s != 0)\n        {\n            printf(\""lyx wins\\n\"");\n        }\n    }\n    return 0;\n}",ACCEPTED,3,180
1576911626187571200,4b5e9eb179be67f44e99880c35b086eaf95b9fca74856c5370f0cd86b6a59514,2022-10-03 20:26:43,C,0.0,1574832745237114887,1402551304773722112,385,"#include <iostream>\n#include <cstdlib>\n#include <cstring>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <queue>\nusing namespace std;\ntypedef long long ll;\n#define M 1000000\nint num[15]={2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768};\nint main()\n{\n    std::ios::sync_with_stdio(false);\n    cin.tie(0),cout.tie(0);\n    ll t,n,m,p;\n    cin>>t;\n    while(t--)\n    {\n        ll n;\n        ll cntpb=0,cntzs=0,step=1;\n        cin>>n;\n        if(n%2==0)\n            cout<<\""pb wins\""<<endl;\n        else\n            cout<<\""zs wins\""<<endl;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1576911669116272640,4b5e9eb179be67f44e99880c35b086eaf95b9fca74856c5370f0cd86b6a59514,2022-10-03 20:26:54,C++,0.0,1574832745237114887,1402551304773722112,385,"#include <iostream>\n#include <cstdlib>\n#include <cstring>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <queue>\nusing namespace std;\ntypedef long long ll;\n#define M 1000000\nint num[15]={2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768};\nint main()\n{\n    std::ios::sync_with_stdio(false);\n    cin.tie(0),cout.tie(0);\n    ll t,n,m,p;\n    cin>>t;\n    while(t--)\n    {\n        ll n;\n        ll cntpb=0,cntzs=0,step=1;\n        cin>>n;\n        if(n%2==0)\n            cout<<\""pb wins\""<<endl;\n        else\n            cout<<\""zs wins\""<<endl;\n    }\n    return 0;\n}",WRONG_ANSWER,4,320
1576912003955965952,4b5e9eb179be67f44e99880c35b086eaf95b9fca74856c5370f0cd86b6a59514,2022-10-03 20:28:14,C++,10.0,1574832745237114887,1402551304773722112,385,"#include <iostream>\n#include <cstdlib>\n#include <cstring>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <queue>\nusing namespace std;\ntypedef long long ll;\n#define M 1000000\nint num[15]={2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768};\nint main()\n{\n    std::ios::sync_with_stdio(false);\n    cin.tie(0),cout.tie(0);\n    ll t,n,m,p;\n    cin>>t;\n    while(t--)\n    {\n        ll n;\n        ll cntpb=0,cntzs=0,step=1;\n        cin>>n;\n        if(n%2==0)\n            cout<<\""xrf wins\""<<endl;\n        else\n            cout<<\""lyx wins\""<<endl;\n    }\n    return 0;\n}",ACCEPTED,4,316
1576914410949574656,d1915cbfe79b19a959b4eba29502775ab5d284a39207275a9ad63fdf2ea1500b,2022-10-03 20:37:47,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\n#include<string.h>\n#include<math.h>\nchar a[100];\nint main()\n{\tint n,sum=0;\n\tgets(a);\n\tint b=strlen(a);\n\tfor(int i=0;i<b;i++)\n\t{\t\n\t\tif(a[j]>=48 && a[j]<=57){\n\t\t\t\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1576919141512126464,2ad5bf6257caea66347f6fb89cc8483aae6152835aa7886c6ad1e277adf60adc,2022-10-03 20:56:35,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tif(n%2==1)\n\tprintf(\""lyx wins\"");\n\telse\n\tprintf(\""xrf wins\"");\n\treturn 0;\n}",WRONG_ANSWER,3,180
1576919228061589504,2ad5bf6257caea66347f6fb89cc8483aae6152835aa7886c6ad1e277adf60adc,2022-10-03 20:56:56,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tif(n%2==1)\n\tprintf(\""lyx wins\\n\"");\n\telse\n\tprintf(\""xrf wins\\n\"");\n\treturn 0;\n}",WRONG_ANSWER,3,332
1576919405761658880,1a0fdacad92ad80b0eb89cfcf629c80052353fe5292d76ff8c6f87307bbad222,2022-10-03 20:57:38,C++,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n\tint a,i,c,d,b;\n\tscanf(\""%d\"",&i);\n\twhile (b=1,b<=i)\n\t{\n\t\tscanf(\""%d\"",&a);\n\t\tc=a%2;\n\t\tif(c==0)\n\t\t{\n\t\t\tprintf(\""xrf wins\\n\"");\n\t\t}\n\t\td=a%2;\n\t\tif(d==1)\n\t\t{\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t}\n\t\t\n\t\t\n\t}\n\ti++;\n}",TIME_LIMIT_EXCEEDED,400,4596
1576919753578520576,1a0fdacad92ad80b0eb89cfcf629c80052353fe5292d76ff8c6f87307bbad222,2022-10-03 20:59:01,C++,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n\tint a,i,c,d,b;\n\tscanf(\""%d\"",&i);\n\twhile (b=1,b<=i)\n\t{\n\t\tscanf(\""%d\"",&a);\n\t\tc=a%2;\n\t\tif(c==0)\n\t\t{\n\t\t\tprintf(\""xrf wins\\n\"");\n\t\t}\n\t\td=a%2;\n\t\tif(d&1)\n\t\t{\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t}\n\t\t\n\t\t\n\t}\n\ti++;\n}",TIME_LIMIT_EXCEEDED,400,4780
1576920041869819904,2ad5bf6257caea66347f6fb89cc8483aae6152835aa7886c6ad1e277adf60adc,2022-10-03 21:00:10,C,10.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main(){\n\tint n,a,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a%2==1)\n\t    printf(\""lyx wins\\n\"");\n\t    else\n\t    printf(\""xrf wins\\n\"");\n\t}\n\treturn 0;\n}",ACCEPTED,3,312
1576920042998071296,1a0fdacad92ad80b0eb89cfcf629c80052353fe5292d76ff8c6f87307bbad222,2022-10-03 21:00:10,C++,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n\tint a,i,c,d,b;\n\tscanf(\""%d\"",&i);\n\twhile (b=1,b<=i)\n\t{\n\t\tscanf(\""%d\"",&a);\n\t\tc=a%2;\td=a%2;\n\t\tif(c==0)\n\t\t{\n\t\t\tprintf(\""xrf wins\\n\"");\n\t\t}\n\t\n\t\telse\n\t\t{\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t}\n\t\t\n\t\t\n\t}\n\ti++;\n}",TIME_LIMIT_EXCEEDED,400,4564
1576920119439261696,1a0fdacad92ad80b0eb89cfcf629c80052353fe5292d76ff8c6f87307bbad222,2022-10-03 21:00:28,C++,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n\tint a,i,c,d,b;\n\tscanf(\""%d\"",&i);\n\twhile (b=1,b<=i)\n\t{\n\t\tscanf(\""%d\"",&a);\n\t\tc=a%2;\td=a%2;\n\t\tif(c==0)\n\t\t{\n\t\t\tprintf(\""xrf wins\\n\"");\n\t\t}\n\t\n\t\telse\n\t\t{\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t}\n\t\t\n\t\t\n\t}\n\n}",TIME_LIMIT_EXCEEDED,400,4536
1576920448989929472,1a0fdacad92ad80b0eb89cfcf629c80052353fe5292d76ff8c6f87307bbad222,2022-10-03 21:01:47,C++,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n\tint a,n,c,d,b;\n\tscanf(\""%d\"",&i);\n\twhile (n--)\n\t{\n\t\tscanf(\""%d\"",&a);\n\t\tc=a%2;\td=a%2;\n\t\tif(c==0)\n\t\t{\n\t\t\tprintf(\""xrf wins\\n\"");\n\t\t}\n\t\n\t\telse\n\t\t{\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t}\n\t\t\n\t\t\n\t}\n}",COMPILE_ERROR,0,0
1576920556586418176,1a0fdacad92ad80b0eb89cfcf629c80052353fe5292d76ff8c6f87307bbad222,2022-10-03 21:02:13,C++,10.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n\tint a,n,c,d,b;\n\tscanf(\""%d\"",&n);\n\twhile (n--)\n\t{\n\t\tscanf(\""%d\"",&a);\n\t\tc=a%2;\td=a%2;\n\t\tif(c==0)\n\t\t{\n\t\t\tprintf(\""xrf wins\\n\"");\n\t\t}\n\t\n\t\telse\n\t\t{\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t}\n\t\t\n\t\t\n\t}\n}",ACCEPTED,2,348
1576921290514112512,ed01580e9d84cf8c02f9ad40a0ab51cfd35cf3c0fbab26b80c2e8b2c495fb77c,2022-10-03 21:05:08,C,10.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int a;\n    scanf(\""%d\"",&a);\n    for(int i=0;a>i;i++)\n    {\n    \tint b;\n    \tscanf(\""%d\"",&b);\n    \tif(b%2==0)\n    \tprintf(\""xrf wins\\n\"");\n    \telse\n    \tprintf(\""lyx wins\\n\"");\n\t}\n    return 0;\n}",ACCEPTED,4,324
1576921758770405376,7e833b8c77eada8e444ecdae039e1308190c2791ba9d2fc4c8963c2c00a97128,2022-10-03 21:06:59,C,10.0,1574832745237114887,1402551304773722112,385,"int main (){\n    int a,b,c;\n    scanf (\""%d\"",&a);\n    for(int i=0;i<a;i++)\n    {\n        scanf (\""%d\"",&b);\n        if (b%2==1)printf (\""lyx wins\\n\"");\n        else printf (\""xrf wins\\n\"");\n        \n    }\n    \n    \n    return 0;\n}",ACCEPTED,3,184
1576923230027399168,c2b318ba33f15b3c4095aa4805d5ce1f3ffe9fe24a315a1fa59fa2875acc9d02,2022-10-03 21:12:50,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        int x;\n        if(x%2==0)\n        {\n            printf(\""xrf wins\"");\n        }\n        else\n        {\n            printf(\""lyx wins\"");\n        }\n    }\n    \n}",WRONG_ANSWER,4,188
1576923477222899712,c2b318ba33f15b3c4095aa4805d5ce1f3ffe9fe24a315a1fa59fa2875acc9d02,2022-10-03 21:13:49,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,i;\n    int x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        \n        if(x%2==0)\n        {\n            printf(\""xrf wins\"");\n        }\n        else\n        {\n            printf(\""lyx wins\"");\n        }\n    }\n    \n}",WRONG_ANSWER,3,184
1576923697188970496,86a661558fc8b56e961769223105002b8e66fa13f2d3ab19a435c8f559d3a0f6,2022-10-03 21:14:41,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main(){\n    int n,key=,m;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&m);\n        if(m%2==1)printf(\""lyx wins\\n\"");\n        else printf(\""xrf wins\\n\"");\n    }\n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1576923758077681664,86a661558fc8b56e961769223105002b8e66fa13f2d3ab19a435c8f559d3a0f6,2022-10-03 21:14:56,C,10.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main(){\n    int n,key,m;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&m);\n        if(m%2==1)printf(\""lyx wins\\n\"");\n        else printf(\""xrf wins\\n\"");\n    }\n    \n    \n    return 0;\n}",ACCEPTED,3,200
1576923824087638016,c2b318ba33f15b3c4095aa4805d5ce1f3ffe9fe24a315a1fa59fa2875acc9d02,2022-10-03 21:15:12,C,10.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,i;\n\tint x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&x);\n        if(x%2==0)\n        {\n            printf(\""xrf wins\\n\"");\n        }\n        else\n        {\n            printf(\""lyx wins\\n\"");\n        }\n    }\n    \n}",ACCEPTED,4,320
1576925028863705088,d1915cbfe79b19a959b4eba29502775ab5d284a39207275a9ad63fdf2ea1500b,2022-10-03 21:19:59,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\n#include<string.h>\n#include<math.h>\nchar a[100];\nchar ch[100];\nint main()\n{\tint n,sum=0;\n\tint  flat1=0,flat2=0;\n\tint flat=0;\n\tscanf(\""%d\"",&n);\n\tint q;\n\tfor(int i=0;i<n;i++)\n\t{\tflat++;\n\t\tscanf(\""%d\"",&q);\n\t\t\t\t\t\t\n\t\tif((flat-1)==0)\n\t\t{\n\t\t\t\t\t\n\t\t\n\t\t\tif((q-1)/2!=0)\n\t\t\t{\n\t\t\t\n\t\t\t\tq=q/2;\n\t\t\t\t \t\n\t\t\t}\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t\tcontinue;\n\t\t\t\n\t\t}else\n\t\t{\n\t\t\t\twhile((q-1)/2!=0)\n\t\t\t{\n\t\t\t\n\t\t\t\tq=q/2;\n\t\t\t\t \n\t\t\t}\n\t\t\tprintf(\""xrf wins\\n\"");\n\t\t}\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,4,360
1576925519886688256,d72b5f52ef8429819d323876f1c65df6cb48c0788f751aec3b3dcb6170838dd1,2022-10-03 21:21:56,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tif(n%=2)\n\t{\n\t\tprintf(\""lyx wins\"");\n\t}\n\telse\n\t{\n\t\tprintf(\""xrf wins\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,5,184
1576925964541640704,3b1da5384980ed80fecc4511c4680a6bd92fc17280b003c1ebbb4ea650763872,2022-10-03 21:23:42,C,0.0,1574832745237114887,1402551304773722112,385,"#ianclude<stdio.h>\nint main()\n{int a,t;\n scanf(\""%d\"",a);\n for(;t<a;t++){scanf(\""%d\"",i);\n    for(;i!=0&&i!=1;){i=i/2;}           \n    if(i=1){printf(\""xrf wins\"");}           \n     if(i=0){printf(\""lyx wins\"");}          }\n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1576926093319356416,3b1da5384980ed80fecc4511c4680a6bd92fc17280b003c1ebbb4ea650763872,2022-10-03 21:24:13,C,0.0,1574832745237114887,1402551304773722112,385,"#ianclude<stdio.h>\nint main()\n{int a,t;\n scanf(\""%d\"",a);\n for(t<a;t++){scanf(\""%d\"",i);\n    for(i!=0&&i!=1){i=i/2;}           \n    if(i=1){printf(\""xrf wins\"");}           \n     if(i=0){printf(\""lyx wins\"");}          }\n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1576926145056079872,3b1da5384980ed80fecc4511c4680a6bd92fc17280b003c1ebbb4ea650763872,2022-10-03 21:24:25,C,0.0,1574832745237114887,1402551304773722112,385,"#ianclude<stdio.h>\nint main()\n{int a,t,i;\n scanf(\""%d\"",a);\n for(t<a;t++){scanf(\""%d\"",i);\n    for(i!=0&&i!=1){i=i/2;}           \n    if(i=1){printf(\""xrf wins\"");}           \n     if(i=0){printf(\""lyx wins\"");}          }\n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1576926273947041792,3b1da5384980ed80fecc4511c4680a6bd92fc17280b003c1ebbb4ea650763872,2022-10-03 21:24:56,C,0.0,1574832745237114887,1402551304773722112,385,"#ianclude<stdio.h>\nint main()\n{int a,t,i;\n scanf(\""%d\"",a);\n for(;t<a;t++){scanf(\""%d\"",i);\n    for(;i!=0&&i!=1;){i=i/2;}           \n    if(i=1){printf(\""xrf wins\"");}           \n     if(i=0){printf(\""lyx wins\"");}          }\n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1576926376187404288,3b1da5384980ed80fecc4511c4680a6bd92fc17280b003c1ebbb4ea650763872,2022-10-03 21:25:20,C,0.0,1574832745237114887,1402551304773722112,385,"#ianclude<stdio.h>\nint main()\n{int a,t,i;\n scanf(\""%d\"",a);\n for(;t<a;){scanf(\""%d\"",i);\n    for(;i!=0&&i!=1;){i=i/2;}           \n    if(i=1){printf(\""xrf wins\"");}           \n     if(i=0){printf(\""lyx wins\"");}          }\n    \n    t++;\n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1576926593112621056,2cb0ca42fb488afce14aa85dddea40ce5aee61a9ef0ff44c89a0cf3144fd6a9d,2022-10-03 21:26:12,C,10.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n\tint n,m;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&m);\n        if(m%2==1){\n            printf(\""lyx wins\\n\"");\n        }else printf(\""xrf wins\\n\"");\n    }\n    return 0;\n}",ACCEPTED,2,196
1576926834998124544,3b1da5384980ed80fecc4511c4680a6bd92fc17280b003c1ebbb4ea650763872,2022-10-03 21:27:10,C,0.0,1574832745237114887,1402551304773722112,385,"#ianclude<stdio.h>\nint main()\n{int a,t,i;\n scanf(\""%d\"",a);\n for(;t<a;){scanf(\""%d\"",i);\n    for(;i!=0&&i!=1;){i=i/2;}           \n    if(i=1){printf(\""xrf wins\"");}           \n     if(i=0){printf(\""lyx wins\"");}\n t++;          }\n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1576927075000393728,3b1da5384980ed80fecc4511c4680a6bd92fc17280b003c1ebbb4ea650763872,2022-10-03 21:28:07,C,0.0,1574832745237114887,1402551304773722112,385,"#ianclude<stdio.h>\nint main()\n{int a,t,i;\n scanf(\""%d\"",a);\n for(;t<a;){scanf(\""%d\"",i);\n    for(;i!=0&&i!=1;){i=i/2;}           \n    if(i=1){printf(\""xrf wins\\n\"");}           \n     if(i=0){printf(\""lyx wins\\n\"");}\n t++;          }\n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1576927693731545088,e81851fc8c9db1bdee0e9414b4a7b76133298600e576b2c49dad5ffe95fa0769,2022-10-03 21:30:34,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n;\n    while(scanf(\""%d\\n\"",&n)!=EOF)\n    {\n        if((n-1)%2==0)\n            printf(\""lyx wins\\n\"");\n    \telse if((n-1)%2==1)\n            printf(\""xrf wins\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,4,320
1576927779723149312,3b1da5384980ed80fecc4511c4680a6bd92fc17280b003c1ebbb4ea650763872,2022-10-03 21:30:55,C,0.0,1574832745237114887,1402551304773722112,385,"#ianclude<stdio.h>\nint main()\n{int a,t,i;\n scanf(\""%d\"",a);\n for(t<a){scanf(\""%d\"",i);\n    for(i!=0&&i!=1){i=i/2;}\n                   \n    if(i=1){printf(\""xrf wins\\n\"");}           \n     if(i=0){printf(\""lyx wins\\n\"");}\n o++;          }\n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1576928021650620416,3b1da5384980ed80fecc4511c4680a6bd92fc17280b003c1ebbb4ea650763872,2022-10-03 21:31:52,C,0.0,1574832745237114887,1402551304773722112,385,"#ianclude<stdio.h>\nint main()\n{int a,t,i,o;\n scanf(\""%d\"",a);\n for(;t<a;){scanf(\""%d\"",i);\n    for(;i!=0&&i!=1;){i=i/2;}\n                   \n    if(i=1){printf(\""xrf wins\\n\"");}           \n     if(i=0){printf(\""lyx wins\\n\"");}\nt=i; o++;          }\n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1576928022908895232,3b1da5384980ed80fecc4511c4680a6bd92fc17280b003c1ebbb4ea650763872,2022-10-03 21:31:53,C,0.0,1574832745237114887,1402551304773722112,385,"#ianclude<stdio.h>\nint main()\n{int a,t,i,o;\n scanf(\""%d\"",a);\n for(;t<a;){scanf(\""%d\"",i);\n    for(;i!=0&&i!=1;){i=i/2;}\n                   \n    if(i=1){printf(\""xrf wins\\n\"");}           \n     if(i=0){printf(\""lyx wins\\n\"");}\nt=i; o++;          }\n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1576928142069088256,3b1da5384980ed80fecc4511c4680a6bd92fc17280b003c1ebbb4ea650763872,2022-10-03 21:32:21,C,0.0,1574832745237114887,1402551304773722112,385,"#ianclude<stdio.h>\nint main()\n{int a,t,i;\n scanf(\""%d\"",a);\n for(;t<a;){scanf(\""%d\"",i);\n    for(;i!=0&&i!=1;){i=i/2;}\n                   \n    if(i=1){printf(\""xrf wins\\n\"");}           \n     if(i=0){printf(\""lyx wins\\n\"");}\nt=i; t++;          }\n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1576928656013918208,63f43c52630727d1b7887412034a55231e7dba9cbe90398839ba6da85edd86fa,2022-10-03 21:34:24,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n;\n    double m;\n    scanf(\""%d\"",&n);\n    if(){\n        printf(\""xrf wins\"");\n    }\n    else{\n    printf(\""lyx wins\"");\n        \n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1576928717695369216,3b1da5384980ed80fecc4511c4680a6bd92fc17280b003c1ebbb4ea650763872,2022-10-03 21:34:38,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{int a,t,i;\n scanf(\""%d\"",a);\n for(;t<a;){scanf(\""%d\"",i);\n    for(;i!=0&&i!=1;){i=i/2;}\n                   \n    if(i=1){printf(\""xrf wins\\n\"");}           \n     if(i=0){printf(\""lyx wins\\n\"");}\nt=i; t++;          }\n    \n    \n    \n    \n    return 0;\n}",SEGMENTATION_FAULT,4,320
1576928959119491072,3b1da5384980ed80fecc4511c4680a6bd92fc17280b003c1ebbb4ea650763872,2022-10-03 21:35:36,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{int a,t,i;\n scanf(\""%d\"",a);\n for(t=0;t<a;){scanf(\""%d\"",i);\n    for(;i!=0&&i!=1;){i=i/2;}\n                   \n    if(i=1){printf(\""xrf wins\\n\"");}           \n     if(i=0){printf(\""lyx wins\\n\"");}\n t++;          }\n    \n    \n    \n    \n    return 0;\n}",SEGMENTATION_FAULT,3,448
1576929055496216576,3b1da5384980ed80fecc4511c4680a6bd92fc17280b003c1ebbb4ea650763872,2022-10-03 21:35:59,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{int a,t,i;\n scanf(\""%d\"",a);\n for(t=0;t<a;t++){scanf(\""%d\"",i);\n    for(;i!=0&&i!=1;){i=i/2;}\n                   \n    if(i=1){printf(\""xrf wins\\n\"");}           \n     if(i=0){printf(\""lyx wins\\n\"");}\n           }\n    \n    \n    \n    \n    return 0;\n}",SEGMENTATION_FAULT,3,444
1576929056679002112,3b1da5384980ed80fecc4511c4680a6bd92fc17280b003c1ebbb4ea650763872,2022-10-03 21:35:59,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{int a,t,i;\n scanf(\""%d\"",a);\n for(t=0;t<a;t++){scanf(\""%d\"",i);\n    for(;i!=0&&i!=1;){i=i/2;}\n                   \n    if(i=1){printf(\""xrf wins\\n\"");}           \n     if(i=0){printf(\""lyx wins\\n\"");}\n           }\n    \n    \n    \n    \n    return 0;\n}",SEGMENTATION_FAULT,3,440
1576929125453021184,e81851fc8c9db1bdee0e9414b4a7b76133298600e576b2c49dad5ffe95fa0769,2022-10-03 21:36:16,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    while(scanf(\""%d\\n\"",&i)!=EOF)\n    {\n        if((n-1)%2==0)\n            printf(\""lyx wins\\n\"");\n    \telse if((n-1)%2==1)\n            printf(\""xrf wins\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,328
1576929308572131328,e81851fc8c9db1bdee0e9414b4a7b76133298600e576b2c49dad5ffe95fa0769,2022-10-03 21:36:59,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    while(scanf(\""%d\\n\"",&i)!=EOF)\n    {\n        if(n%2==0)\n            printf(\""lyx wins\\n\"");\n    \telse if(n%2!=0)\n            printf(\""xrf wins\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,2,200
1576929441141506048,a8ade8c2e77ab8dd7af5b19bf30f9e8d8c66fbe02453c5bd5630e1f1101a0557,2022-10-03 21:37:31,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main(){\n\tint N;\n\tscanf(\""%d\"",&N);\n\tprintf(\""%d\\n\"",N);\n\treturn 0;\n}",WRONG_ANSWER,3,348
1576930134912925696,e81851fc8c9db1bdee0e9414b4a7b76133298600e576b2c49dad5ffe95fa0769,2022-10-03 21:40:16,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\t\n\tint n;\n\tscanf(\""%d\"",&n);\n\t\n\tint num; \n\t\n\tfor(int i = 1;i <= n;i++)\n\t{\n\t\tscanf(\""%d\"",&num);\n\t\tif(num %2 == 0)\n\t\t\tprintf(\""pb wins\\n\"");\n\t\telse if(num %2 != 0)\n\t\t\tprintf(\""zs wins\\n\""); \n\t}\n\treturn 0;\n}\n\n",WRONG_ANSWER,3,316
1576930202445422592,e81851fc8c9db1bdee0e9414b4a7b76133298600e576b2c49dad5ffe95fa0769,2022-10-03 21:40:32,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\t\n\tint n;\n\tscanf(\""%d\"",&n);\n\t\n\tint num; \n\t\n\tfor(int i = 1;i <= n;i++)\n\t{\n\t\tscanf(\""%d\"",&num);\n\t\tif(num %2 == 0)\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\telse if(num %2 != 0)\n\t\t\tprintf(\""xrf wins\\n\""); \n\t}\n\treturn 0;\n}\n\n",WRONG_ANSWER,3,184
1576930337116127232,e81851fc8c9db1bdee0e9414b4a7b76133298600e576b2c49dad5ffe95fa0769,2022-10-03 21:41:04,C,10.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\t\n\tint n;\n\tscanf(\""%d\"",&n);\n\t\n\tint num; \n\t\n\tfor(int i = 1;i <= n;i++)\n\t{\n\t\tscanf(\""%d\"",&num);\n\t\tif(num %2 == 0)\n\t\t\tprintf(\""xrf wins\\n\"");\n\t\telse if(num %2 != 0)\n\t\t\tprintf(\""lyx wins\\n\""); \n\t}\n\treturn 0;\n}\n\n",ACCEPTED,4,312
1576930481861574656,a8ade8c2e77ab8dd7af5b19bf30f9e8d8c66fbe02453c5bd5630e1f1101a0557,2022-10-03 21:41:39,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main(){\n\tint N,a,b,c,d;\n\tscanf(\""%d\"",&N,&a,&b,&c,&d);\n\tprintf(\""%d\\n\"",N);\n\tprintf(\""%d\\n\"",a);\n\tprintf(\""%d\\n\"",b);\n\tprintf(\""%d\\n\"",c);\n\tprintf(\""%d\\n\"",d);\n\t\n\treturn 0;\n}",WRONG_ANSWER,3,200
1576930933885894656,a7a1a1263110de80b2177a46b89630d8cc65850ad456068ed7860bcefec47467,2022-10-03 21:43:27,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n\tint n,x,i,cnt=1;\n    scanf(\""%d\"",&n);\n    \n    for(i=0;i<n;i ++){\n        scanf(\""%d\"",&x);\n        for(cnt=1;x%2==0;cnt ++){\n            x/=2;\n        }\n        if(cnt%2==0){\n            printf(\""xrf wins\\n\"");\n        }else{\n             printf(\""lyx wins\\n\"");\n        }\n    }\n  \t  \n\treturn 0;\n } \n",WRONG_ANSWER,3,308
1576931598750203904,ca32b5502c8b9c96b6fb9305b0061903ad4b985f0b7b2eb4838a4afca0fa8d32,2022-10-03 21:46:05,C,0.0,1574832745237114887,1402551304773722112,385,"#include <stdio.h>\nint main()\n{\n    int x,y;\n    scanf(\""%d\"",&x);\n    while(x--)\n    {\n        scanf(\""%d\"",&y);\n        if(y%2==0)\n        {\n            printf(\""pb wins\\n\"");\n        }\n        else\n        {\n            printf(\""zs wins\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,320
1576931732045185024,ca32b5502c8b9c96b6fb9305b0061903ad4b985f0b7b2eb4838a4afca0fa8d32,2022-10-03 21:46:37,C,0.0,1574832745237114887,1402551304773722112,385,"#include <stdio.h>\nint main()\n{\n    int x,y;\n    scanf(\""%d\"",&x);\n    while(x--)\n    {\n        scanf(\""%d\"",&y);\n        if(y%2==0)\n        {\n            printf(\""lyx wins\\n\"");\n        }\n        else\n        {\n            printf(\""xrf wins\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,2,200
1576931796100587520,ca32b5502c8b9c96b6fb9305b0061903ad4b985f0b7b2eb4838a4afca0fa8d32,2022-10-03 21:46:52,C,10.0,1574832745237114887,1402551304773722112,385,"#include <stdio.h>\nint main()\n{\n    int x,y;\n    scanf(\""%d\"",&x);\n    while(x--)\n    {\n        scanf(\""%d\"",&y);\n        if(y%2==0)\n        {\n            printf(\""xrf wins\\n\"");\n        }\n        else\n        {\n            printf(\""lyx wins\\n\"");\n        }\n    }\n    return 0;\n}\n",ACCEPTED,4,460
1576932088212897792,70d13467d51d5749a832231fd1e2792e6b7f95b4e41941cdefba64e034efe03d,2022-10-03 21:48:02,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    long long int a;\n    while(n--){\n       scanf(\""%lld\"",&a);\n        if(a<10)printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,3,184
1576932349316710400,a7a1a1263110de80b2177a46b89630d8cc65850ad456068ed7860bcefec47467,2022-10-03 21:49:04,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n\tint n,x,i,j,cnt=1;\n    scanf(\""%d\"",&n);\n    \n    for(i=0;i<n;i ++){\n        scanf(\""%d\"",&x);\n        for(j=2;j<x;j ++){\n            if(x%j==0){\n            \tcnt ++;\n            \tx/=j;\n\t\t\t}\n        }\n        if(cnt%2==0){\n            printf(\""xrf wins\\n\"");\n        }else{\n             printf(\""lyx wins\\n\"");\n        }\n    }\n  \t  \n\treturn 0;\n } \n",WRONG_ANSWER,9,320
1576933052483379200,3df1c3ed90bdc3276d2b70cb07780cd0c44b0e9ba5aa90c5e0e5c757f43310c3,2022-10-03 21:51:52,C,0.0,1574832745237114887,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int a,s,d,f,g,h;\n    scanf(\""%d\\n\"",&a);\n    scanf(\""%d\\n\"",&s);\n    scanf(\""%d\\n\"",&d);\n    scanf(\""%d\\n\"",&f);\n    scanf(\""%d\\n\"",&g);\n    scanf(\""%d\\n\"",&h);\n    printf(\""lyx wins\"");\n    printf(\""lyx wins\"");\n    printf(\""lyx wins\"");\n    printf(\""xrf wins\"");\n    printf(\""lyx wins\"");\n    return 0;\n}",WRONG_ANSWER,5,312
1576933952664903680,b7005e6caedc537605c560c3780ddd57bf652d2efaaf3678ff1898ada61b5a8c,2022-10-03 21:55:26,C,0.0,1574832745237114887,1402551304773722112,385,"#include <stdio.h>\nint main()\n{\n\tint n,i,a;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a);\n\tprintf(\""lyx wins\\nlyx wins\\nlyx wins\\nxrf wins\\nlyx wins\\n\"");\n\treturn 0;\n } ",WRONG_ANSWER,3,196
1576934604329721856,b7005e6caedc537605c560c3780ddd57bf652d2efaaf3678ff1898ada61b5a8c,2022-10-03 21:58:02,C,10.0,1574832745237114887,1402551304773722112,385,"#include <stdio.h>\nint main()\n{\n\tint n,i,a;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a);\n        if(a%2==0)\n            printf(\""xrf wins\\n\"");\n        else\n            printf(\""lyx wins\\n\"");\n    }\n\treturn 0;\n } ",ACCEPTED,3,200
1327069603952668672,8e3eb799d1fc7979f32e709b1310fd7d8fff3643e415e250ef9608c5accb3f7f,2020-11-13 10:03:44,C,0.0,1327063136685674497,1327059693308899328,385,gghhbvghhhhjjjmjjjjjjjjjjjj,COMPILE_ERROR,0,0
1327069883746299904,8e3eb799d1fc7979f32e709b1310fd7d8fff3643e415e250ef9608c5accb3f7f,2020-11-13 10:04:50,C++,300.0,1327063136685674497,1327059693308899328,385,"#include <bits/stdc++.h>\n#define For(i, l, r) for(register int i = (l), i##end = (int)(r); i <= i##end; ++i)\n#define Fordown(i, r, l) for(register int i = (r), i##end = (int)(l); i >= i##end; --i)\n#define Set(a, v) memset(a, v, sizeof(a))\nusing namespace std;\n \ninline bool chkmin(int &a, int b) {return b < a ? a = b, 1 : 0;}\ninline bool chkmax(int &a, int b) {return b > a ? a = b, 1 : 0;}\n \ninline int read() {\n    int x = 0, fh = 1; char ch = getchar();\n    for (; !isdigit(ch); ch = getchar()) if (ch == '-') fh = -1;\n    for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ 48);\n    return x * fh;\n}\n \nvoid File() {\n#ifdef zjp_shadow\n    freopen (\""2542.in\"", \""r\"", stdin);\n    freopen (\""2542.out\"", \""w\"", stdout);\n#endif\n}\n \ntypedef long long ll;\nconst int Mod = 998244353;\n \ninline ll fpm(ll x, int power) {\n    ll res = 1; x = (x % Mod + Mod) % Mod;\n    for (; power; power >>= 1, (x *= x) %= Mod)\n        if (power & 1) (res *= x) %= Mod;\n    return res;\n}\n \nconst int N = 20; \nint n, Q, rt, d[N];\nvector<int> G[N]; ll A[N], B[N], invd[N];\n \nvoid Dp(int u, int fa, int S) {\n    if ((1 << (u - 1)) & S) { A[u] = B[u] = 0; return ; }\n \n    ll totA = 0, totB = 0;\n    for (int v : G[u]) if (v ^ fa)\n        Dp(v, u, S), totA += A[v], totB += B[v];\n    totA %= Mod, totB %= Mod;\n \n    ll coef = fpm(Mod + 1 - totA * invd[u], Mod - 2);\n    A[u] = invd[u] * coef % Mod;\n    B[u] = (1 + totB * invd[u] % Mod) * coef % Mod;\n}\n \nll Minv[1 << 18]; int bit[1 << 18];\n \nint main () {\n  //  File();\n \n    n = read(); Q = read(); rt = read();\n    For (i, 1, n - 1) {\n        int u = read(), v = read();\n        G[u].push_back(v); G[v].push_back(u);\n        ++ d[u]; ++ d[v];\n    }\n    For (i, 1, n) invd[i] = fpm(d[i], Mod - 2);\n \n    int maxsta = (1 << n) - 1;\n    For (i, 0, maxsta) {\n        Dp(rt, 0, i);\n        Minv[i] = B[rt];\n        bit[i] = bit[i >> 1] + (i & 1);\n    }\n \n    while (Q --) {\n        int k = read(), sta = 0;\n        while (k --) sta |= (1 << (read() - 1));\n        ll ans = 0;\n        for (int i = sta; i; i = (i - 1) & sta)\n            ans += (bit[i] & 1 ? 1 : -1) * Minv[i];\n        ans = (ans % Mod + Mod) % Mod;\n        printf (\""%lld\\n\"", ans);\n    }\n \n    return 0;\n}",ACCEPTED,134,3528
1402583165977726976,d5f54d3d7d504c19cdf6d8f3172557fadaabc2a76842d093f05bfaebd2792316,2021-06-09 19:07:40,C++,0.0,1402531086542356485,1396456000062107648,56,"#include <bits/stdc++.h>\nusing namespace std;\n\n\n\nint main()\n{\n    int m;\n    cin >> m ;\n    while(--m)\n    {\n        int n;\n        cin >> n;\n        printf(\""%.3f\\n\"",1.0/n);\n    }\n    int n;\n        cin >> n;\n        printf(\""%.3f\"",1.0/n);\n}",WRONG_ANSWER,15,384
1402583565317410816,d5f54d3d7d504c19cdf6d8f3172557fadaabc2a76842d093f05bfaebd2792316,2021-06-09 19:09:15,C++,0.0,1402531086542356485,1396456000062107648,56,"#include <bits/stdc++.h>\nusing namespace std;\n\n\n\nint main()\n{\n    int m;\n    cin >> m ;\n    while(m--)\n    {\n        int n;\n        cin >> n;\n        printf(\""%.3f\\n\"",1.0/n);\n    }\n    \n}",WRONG_ANSWER,10,320
1402584543919902720,75696fd209e434679622e939eb7f10f463b3a080603b783d0247f0b1442c0f7c,2021-06-09 19:13:08,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<string>\n#include<stdio.h>\n#include<stdlib.h>\nusing namespace std;\n\nint main()\n{\n    float M;\n    int N[20];\n    cin >> M;\n    for(int i = 0 ; i < M; i ++)\n    {\n        cin >> N[i];\n    }\n    for(int i = 0 ; i < M; i ++)\n    {\n        if(i == 0){cout << \""1.000\"" << endl;}\n        else\n        {\n            printf(\""%1.3f\"", float((M - i) / M));\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,16,448
1402584605756461056,75696fd209e434679622e939eb7f10f463b3a080603b783d0247f0b1442c0f7c,2021-06-09 19:13:23,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<string>\n#include<stdio.h>\n#include<stdlib.h>\nusing namespace std;\n\nint main()\n{\n    float M;\n    int N[200];\n    cin >> M;\n    for(int i = 0 ; i < M; i ++)\n    {\n        cin >> N[i];\n    }\n    for(int i = 0 ; i < M; i ++)\n    {\n        if(i == 0){cout << \""1.000\"" << endl;}\n        else\n        {\n            printf(\""%1.3f\"", float((M - i) / M));\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,17,472
1402584846253723648,75696fd209e434679622e939eb7f10f463b3a080603b783d0247f0b1442c0f7c,2021-06-09 19:14:20,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<string>\n#include<stdio.h>\n#include<stdlib.h>\nusing namespace std;\n\nint main()\n{\n    int M1;\n    float M;\n    int N[200];\n    cin >> M1;\n    M = M1;\n    for(int i = 0 ; i < M1; i ++)\n    {\n        cin >> N[i];\n    }\n    for(int i = 0 ; i < M1; i ++)\n    {\n        if(i == 0){cout << \""1.000\"" << endl;}\n        else\n        {\n            printf(\""%1.3f\"", float((M - i) / M));\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,17,452
1402584945344155648,75696fd209e434679622e939eb7f10f463b3a080603b783d0247f0b1442c0f7c,2021-06-09 19:14:44,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<string>\n#include<stdio.h>\n#include<stdlib.h>\nusing namespace std;\n\nint main()\n{\n    float M;\n    int N[2000];\n    cin >> M;\n    for(int i = 0 ; i < M; i ++)\n    {\n        cin >> N[i];\n    }\n    for(int i = 0 ; i < M; i ++)\n    {\n        if(i == 0){cout << \""1.000\"" << endl;}\n        else\n        {\n            printf(\""%1.3f\"", float((M - i) / M));\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,17,324
1402584978164584448,75696fd209e434679622e939eb7f10f463b3a080603b783d0247f0b1442c0f7c,2021-06-09 19:14:52,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<string>\n#include<stdio.h>\n#include<stdlib.h>\nusing namespace std;\n\nint main()\n{\n    float M;\n    int N[20000];\n    cin >> M;\n    for(int i = 0 ; i < M; i ++)\n    {\n        cin >> N[i];\n    }\n    for(int i = 0 ; i < M; i ++)\n    {\n        if(i == 0){cout << \""1.000\"" << endl;}\n        else\n        {\n            printf(\""%1.3f\"", float((M - i) / M));\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,13,328
1402585730564001792,3081d56f8aaa1b52b62a6fd74bb667cadb9ab2b436f5697f2c270ed31bafa966,2021-06-09 19:17:51,Java,0.0,1402531086542356485,1396456000062107648,56,import java.util.*;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        while (scanner.hasNext()){\n            int m = scanner.nextInt();\n            int[] nums = new int[m];\n            for (int i = 0;i < m;i++){\n                nums[i] = scanner.nextInt();\n            }\n            double p;\n            double q = 1.00;\n            for (int i = 0;i < m;i++){\n                p = q/nums[i];\n                System.out.println(p);\n            }\n        }\n    }\n},WRONG_ANSWER,277,14868
1402585845315964928,75696fd209e434679622e939eb7f10f463b3a080603b783d0247f0b1442c0f7c,2021-06-09 19:18:18,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<string>\n#include<stdio.h>\n#include<stdlib.h>\nusing namespace std;\n\nint main()\n{\n    float M;\n    int N[20000];\n    cin >> M;\n    for(int i = 0 ; i < M; i ++)\n    {\n        cin >> N[i];\n    }\n    for(int i = 0 ; i < M; i ++)\n    {\n        if(i == 0){cout << \""1.000\"" << endl;}\n        else\n        {\n            printf(\""%1.3f\\n\"", float((M - i) / M));\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,10,452
1402585943936569344,75696fd209e434679622e939eb7f10f463b3a080603b783d0247f0b1442c0f7c,2021-06-09 19:18:42,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<string>\n#include<stdio.h>\n#include<stdlib.h>\nusing namespace std;\n\nint main()\n{\n    float M;\n    int N[2000];\n    float t = 1.000;\n    cin >> M;\n    for(int i = 0 ; i < M; i ++)\n    {\n        cin >> N[i];\n    }\n    for(int i = 0 ; i < M; i ++)\n    {\n        if(i == 0){cout << \""1.000\"" << endl;}\n        else\n        {\n            printf(\""%1.3f\\n\"", float((M - i) / M) * t);\n            t = float((M - i) / M);\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,9,444
1402585975905554432,75696fd209e434679622e939eb7f10f463b3a080603b783d0247f0b1442c0f7c,2021-06-09 19:18:50,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<string>\n#include<stdio.h>\n#include<stdlib.h>\nusing namespace std;\n\nint main()\n{\n    float M;\n    int N[5000];\n    float t = 1.000;\n    cin >> M;\n    for(int i = 0 ; i < M; i ++)\n    {\n        cin >> N[i];\n    }\n    for(int i = 0 ; i < M; i ++)\n    {\n        if(i == 0){cout << \""1.000\"" << endl;}\n        else\n        {\n            printf(\""%1.3f\\n\"", float((M - i) / M) * t);\n            t = float((M - i) / M);\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,12,324
1402586007635464192,75696fd209e434679622e939eb7f10f463b3a080603b783d0247f0b1442c0f7c,2021-06-09 19:18:57,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<string>\n#include<stdio.h>\n#include<stdlib.h>\nusing namespace std;\n\nint main()\n{\n    float M;\n    int N[8000];\n    float t = 1.000;\n    cin >> M;\n    for(int i = 0 ; i < M; i ++)\n    {\n        cin >> N[i];\n    }\n    for(int i = 0 ; i < M; i ++)\n    {\n        if(i == 0){cout << \""1.000\"" << endl;}\n        else\n        {\n            printf(\""%1.3f\\n\"", float((M - i) / M) * t);\n            t = float((M - i) / M);\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,10,480
1402586036114853888,75696fd209e434679622e939eb7f10f463b3a080603b783d0247f0b1442c0f7c,2021-06-09 19:19:04,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<string>\n#include<stdio.h>\n#include<stdlib.h>\nusing namespace std;\n\nint main()\n{\n    float M;\n    int N[10000];\n    float t = 1.000;\n    cin >> M;\n    for(int i = 0 ; i < M; i ++)\n    {\n        cin >> N[i];\n    }\n    for(int i = 0 ; i < M; i ++)\n    {\n        if(i == 0){cout << \""1.000\"" << endl;}\n        else\n        {\n            printf(\""%1.3f\\n\"", float((M - i) / M) * t);\n            t = float((M - i) / M);\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,19,448
1402586062891290624,75696fd209e434679622e939eb7f10f463b3a080603b783d0247f0b1442c0f7c,2021-06-09 19:19:10,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<string>\n#include<stdio.h>\n#include<stdlib.h>\nusing namespace std;\n\nint main()\n{\n    float M;\n    int N[20000];\n    float t = 1.000;\n    cin >> M;\n    for(int i = 0 ; i < M; i ++)\n    {\n        cin >> N[i];\n    }\n    for(int i = 0 ; i < M; i ++)\n    {\n        if(i == 0){cout << \""1.000\"" << endl;}\n        else\n        {\n            printf(\""%1.3f\\n\"", float((M - i) / M) * t);\n            t = float((M - i) / M);\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,11,320
1402586103227912192,3081d56f8aaa1b52b62a6fd74bb667cadb9ab2b436f5697f2c270ed31bafa966,2021-06-09 19:19:20,Java,0.0,1402531086542356485,1396456000062107648,56,import java.util.*;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        while (scanner.hasNext()){\n            int m = scanner.nextInt();\n            int[] nums = new int[m];\n            double p;\n            double q = 1.00;\n            for (int i = 0;i < m;i++){\n                nums[i] = scanner.nextInt();\n                p = q/nums[i];\n                System.out.println(p);\n            }\n        }\n    }\n},WRONG_ANSWER,317,14812
1402586334862544896,3081d56f8aaa1b52b62a6fd74bb667cadb9ab2b436f5697f2c270ed31bafa966,2021-06-09 19:20:15,Java,0.0,1402531086542356485,1396456000062107648,56,import java.util.*;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        while (scanner.hasNext()){\n            int m = scanner.nextInt();\n            int[] nums = new int[m];\n            double q = 1.00;\n            for (int i = 0;i < m;i++){\n                nums[i] = scanner.nextInt();\n                System.out.println(q/nums[i]);\n            }\n        }\n    }\n},WRONG_ANSWER,294,14904
1402588013565546496,fe29860531cd6388f1f5036731ee6d1ade8e8bb3494a88dd6c4874fda6d6d7fa,2021-06-09 19:26:55,Java,0.0,1402531086542356485,1396456000062107648,56,import java.util.Scanner;\npublic class Main{\n    public static long  D(int n){\n        if(n==1||n==0){\n            return 1;\n        }else{\n            return (n-1)*(D(n-1)+D(n-2));\n        }\n    }\n    public static long getSum(int n){\n        if(n==1){\n            return 1;\n        }else{\n            return n*getSum(n-1);\n        }\n    }\n    public static double getN(int n){\n        return 1.0-(double)(D(n)/getSum(n));\n    }\n    public static void main(String args[]){\n        Scanner sc=new Scanner(System.in);\n        int m=sc.nextInt();\n        for(int i=0;i<m;i++){\n            int n=sc.nextInt();\n            double num=getN(n);\n            System.out.println(num);\n        }\n        }\n    \n},MULTIPLE_ERROR,171,14288
1402588228230090752,eab289b446229e4b537a446abf6502f5f0176be0bcc513ccb1b756207045ba24,2021-06-09 19:27:47,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main(){\n\t\n\tint n;\n\t\n\tscanf(\""%d\"",&n);\n\t\n\tint a[n];\n\t\n\tint i,j,k;\n\t\n\tfor(i=0;i<n;i++){\n\t\t\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\t\n\tfloat b[n];\n\t\n\tfor(i=0;i<n;i++){\n\t\t\n\t\tb[i]=pow(0.5,a[i]-1);\n\t\t\n\t}\n\t\n\tfor(i=0;i<n;i++){\n\t\t\n\t\tprintf(\""%.3lf\\n\"",b[i]);\n\t}\n\t\n\t\n}",WRONG_ANSWER,8,332
1402588324657074176,3081d56f8aaa1b52b62a6fd74bb667cadb9ab2b436f5697f2c270ed31bafa966,2021-06-09 19:28:10,Java,0.0,1402531086542356485,1396456000062107648,56,import java.util.*;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int m = scanner.nextInt();\n        while (scanner.hasNext()){\n            int[] nums = new int[m];\n            double q = 1.000;\n            for (int i = 0;i < m;i++){\n                nums[i] = scanner.nextInt();\n            }\n            for (int i = 0;i < m;i++){\n                System.out.println(q/nums[i]);\n            }\n        }\n    }\n},WRONG_ANSWER,273,14756
1402588357158735872,33dd1558df6ebb25ef453ce36395fb27b59ecad5e2955b1d65e1274db775ea4f,2021-06-09 19:28:17,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tint m;\n\t\tdouble q=0;\n\t\tcin>>m;\n\t\tif(m==1){\n\t\t\tprintf(\""1.000\"");\n\t\t}else{\n\t\t\tfor(int i=1;i<m;i++){\n\t\t\t\tq+=pow(0.5,i);\n\t\t\t}\n\t\t\tprintf(\""%.3lf\"",1-q);\n\t\t}\n\t\tif(i!=n-1){\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t} \n\t\n}",WRONG_ANSWER,11,604
1402588368928018432,3e41993bec765f219c6146ff80d2c5e551ad8ffc867f81c9212a1cce8827ad30,2021-06-09 19:28:20,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<bits/stdc++.h>\nusing namespace std;\ndouble m;\n\nint main(){\n//\tios::sync_with_stdio(0);\n//\tcin.tie(0);\n\tint n;\n\tcin>>n;\n\twhile(n--){\n\t\tcin>>m;\n\t\tdouble k=1;\n\t\tfor(double i=m;i>1;i--){\n\t\t\tk=k*((i-1)/i);\n\t\t//\tcout<<i-1)/i)\n\t\t}\n\t\tprintf(\""%.3f\\n\"",k);\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,10,324
1402588607281860608,3e41993bec765f219c6146ff80d2c5e551ad8ffc867f81c9212a1cce8827ad30,2021-06-09 19:29:17,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<bits/stdc++.h>\nusing namespace std;\ndouble m;\n\nint main(){\n//\tios::sync_with_stdio(0);\n//\tcin.tie(0);\n\tint n;\n\tcin>>n;\n\twhile(n--){\n\t\tcin>>m;\n\t\tdouble k=1;\n\t\tfor(double i=m;i>1;i--){\n\t\t\tk=k*((i-1)/i);\n\t\t//\tcout<<i-1)/i)\n\t\t}\n\t\tprintf(\""%.3f\\n\"",k);\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,15,376
1402589019233816576,33dd1558df6ebb25ef453ce36395fb27b59ecad5e2955b1d65e1274db775ea4f,2021-06-09 19:30:55,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++){\n\t\tint m;\n\t\tdouble q=0;\n\t\tcin>>m;\n\t\tif(m==1){\n\t\t\tprintf(\""1.000\"");\n\t\t}else{\n\t\t\tfor(int i=1;i<m;i++){\n\t\t\t\tq+=pow(0.5,i);\n\t\t\t}\n\t\t\tprintf(\""%.3lf\"",1-q);\n\t\t}\n\t\tif(i!=n-1){\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t} \n\t\n}",WRONG_ANSWER,8,448
1402589214600368128,3e41993bec765f219c6146ff80d2c5e551ad8ffc867f81c9212a1cce8827ad30,2021-06-09 19:31:42,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<bits/stdc++.h>\nusing namespace std;\n\n\nint main(){}\n\tint n;\n\tcin>>n;\n\tdouble m;\n\twhile(n--){\n\t\tcin>>m;\n\t\tdouble k=1;\n\t\tfor(double i=m;i>1;i--){\n\t\t\tk=k*((i-1)/i);\n\t\t}\n\t\tprintf(\""%.3f\\n\"",k);\n\t}\n\treturn 0;\n} ",COMPILE_ERROR,0,0
1402589264671903744,33dd1558df6ebb25ef453ce36395fb27b59ecad5e2955b1d65e1274db775ea4f,2021-06-09 19:31:54,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nint main(){\n\tint n;\n    int m;\n\tdouble q=0;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++){\n\t\t\n\t\tprintf(\""%d\"",&m)\n\t\tif(m==1){\n\t\t\tprintf(\""1.000\"");\n\t\t}else{\n\t\t\tfor(int i=1;i<m;i++){\n\t\t\t\tq+=pow(0.5,i);\n\t\t\t}\n\t\t\tprintf(\""%.3lf\"",1-q);\n\t\t}\n\t\tif(i!=n-1){\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t} \n\t\n}",COMPILE_ERROR,0,0
1402589347790491648,3e41993bec765f219c6146ff80d2c5e551ad8ffc867f81c9212a1cce8827ad30,2021-06-09 19:32:14,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\nusing namespace std;\n\n\nint main(){}\n\tint n;\n\tcin>>n;\n\tdouble m;\n\twhile(n--){\n\t\tcin>>m;\n\t\tdouble k=1;\n\t\tfor(double i=m;i>1;i--){\n\t\t\tk=k*((i-1)/i);\n\t\t}\n\t\tprintf(\""%.3f\\n\"",k);\n\t}\n\treturn 0;\n} ",COMPILE_ERROR,0,0
1402589377507069952,33dd1558df6ebb25ef453ce36395fb27b59ecad5e2955b1d65e1274db775ea4f,2021-06-09 19:32:21,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nint main(){\n\tint n;\n    int m;\n\tdouble q=0;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++){\n\t\t\n\t\tscanf(\""%d\"",&m);\n\t\tif(m==1){\n\t\t\tprintf(\""1.000\"");\n\t\t}else{\n\t\t\tfor(int i=1;i<m;i++){\n\t\t\t\tq+=pow(0.5,i);\n\t\t\t}\n\t\t\tprintf(\""%.3lf\"",1-q);\n\t\t}\n\t\tif(i!=n-1){\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t} \n\t\n}",WRONG_ANSWER,26,320
1402589403847299072,33dd1558df6ebb25ef453ce36395fb27b59ecad5e2955b1d65e1274db775ea4f,2021-06-09 19:32:27,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nint main(){\n\tint n;\n    int m;\n\tdouble q=0;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++){\n\t\t\n\t\tscanf(\""%d\"",&m);\n\t\tif(m==1){\n\t\t\tprintf(\""1.000\"");\n\t\t}else{\n\t\t\tfor(int i=1;i<m;i++){\n\t\t\t\tq+=pow(0.5,i);\n\t\t\t}\n\t\t\tprintf(\""%.3lf\"",1-q);\n\t\t}\n\t\tif(i!=n-1){\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t} \n\t\n}",WRONG_ANSWER,10,196
1402589421941592064,3e41993bec765f219c6146ff80d2c5e551ad8ffc867f81c9212a1cce8827ad30,2021-06-09 19:32:31,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\nusing namespace std;\n\n\nint main(){}\n\tint n;\n\tcin>>n;\n\tdouble m;\n\twhile(n--){\n\t\tcin>>m;\n\t\tdouble k=1;\n\t\tfor(double i=m;i>1;i--){\n\t\t\tk=k*((i-1)/i);\n\t\t}\n\t\tprintf(\""%.3f\\n\"",k);\n\t}\n\treturn 0;\n} ",COMPILE_ERROR,0,0
1402589498768592896,3e41993bec765f219c6146ff80d2c5e551ad8ffc867f81c9212a1cce8827ad30,2021-06-09 19:32:50,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\nusing namespace std;\n\n\nint main(){\n\tint n;\n\tcin>>n;\n\tdouble m;\n\twhile(n--){\n\t\tcin>>m;\n\t\tdouble k=1;\n\t\tfor(double i=m;i>1;i--){\n\t\t\tk=k*((i-1)/i);\n\t\t}\n\t\tprintf(\""%.3f\\n\"",k);\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,17,452
1402589938470129664,05483ab17195b5a29c9eebe49b01519e774c809d49a0db6d3a6338ded10ee258,2021-06-09 19:34:34,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n\tfloat m,n[100],i,p,j;\n\tscanf(\""%f\\n\"",&m);\n\tfor(i=1;i<=m-1;i++)\n\t  scanf(\""%f\\n\"",&n);\n\t\n\t\n\t\n\t\tprintf(\""1.000\\n\"");\n\t\tfor(j=2;j<=m-1;j++)\n\t\t{\n\t\t\tprintf(\""0.500\\n\"");\n\t\t}  \n\tprintf(\""0.500\"");\n}",WRONG_ANSWER,9,292
1402590013824929792,33dd1558df6ebb25ef453ce36395fb27b59ecad5e2955b1d65e1274db775ea4f,2021-06-09 19:34:52,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nint main(){\n\tint n;\n    int m;\n\tdouble q=0;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++){\n\t\t\n\t\tscanf(\""%d\"",&m);\n\t\t\tfor(int i=0;i<m;i++){\n\t\t\t\tq+=pow(0.5,i);\n\t\t\t}\n\t\t\tprintf(\""%.3lf\"",1-q);\n\t\tif(i!=n-1){\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t} \n\t\n}",WRONG_ANSWER,7,312
1402590650155372544,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:37:24,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int m;\n    int n[10];\n    scanf(\""%d\"", &m);\n    for (int i = 0; i < m;i++) {\n        scanf(\""%d\"", &n[i]);}\n        for (int i = 0; i < m;){\n        float p = 1.000;\n        p = 1 / n[i];\n        printf(\""%.3f\\n\"", p);\n        i++;\n\n    }\n    return 0;\n}",MULTIPLE_ERROR,37,468
1402590809274683392,0e4ac9eaf609d96fcedd690566c06a1c44e409d9eca7bf3ceacd39d479c784b1,2021-06-09 19:38:02,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{ \n    int a=0;\n    int j=0;\n    int i=0;\n    int answer=0;\n    printf(\""请输入共有多少人？\"");\n    scanf(\""%d\"",&a);\n    for(j;j<a;j++){\n        printf(\""请输入要查询第几个游客找到拖鞋的几率：\"");\n        scanf(\""%d\"",&i);\n        answer=(1/2)^(i-1);\n        printf(\""第%d个乘客找到拖鞋的几率为：%d\"",i,answer);\n    }\n    return 0;\n}",WRONG_ANSWER,7,332
1402590919232557056,aaecccbc525334641270c32b50548a6a8dda9f581481b3fb325afe3ef851c2ac,2021-06-09 19:38:28,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<string.h>\n#include<assert.h>\n#include<stdlib.h>\n\nint main (){\n\tint a = 0;\n    int b = 0;\n    int c = 0;\n    scanf(\""%d\"",&a);\n        scanf(\""%d\"",&b);  \n\t\t  scanf(\""%d\"",&c);\n    float num =1/b;\n    double cc = 1%c;\n\tprintf(\""%.3f\\n\"",num);\n\t\tprintf(\""%.3f\\n\"",cc);\n\treturn  0;\n} ",WRONG_ANSWER,14,376
1402591055467810816,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:39:01,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int m;\n    int n[10];\n    scanf(\""%d\"", &m);\n    for (int i = 0; i < m;i++) {\n        scanf(\""%d\"", n[i]);}\n        for (int i = 0; i < m;){\n        float p = 1.000;\n        p = 1 / n[i];\n        printf(\""%.3f\\n\"", p);\n        i++;\n\n    }\n    return 0;\n}",SEGMENTATION_FAULT,16,360
1402591155854282752,cd69cebba1b6f7176d21958d61054f50c59a0dd36575bcc9a19f2b56e3f1dffe,2021-06-09 19:39:25,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int length,num1,num2;\n    scanf(\""%d\"",&length);\n    float a [length],n=1;\n    for(int i=0;i<length;i++)\n    {\n        a[i]=n;\n        n*=0.5;\n    }\n    printf(\""%f.3\"",a[num1-1]);\n    printf(\""%f.3\"",a[num2-1]);\n    \n}",WRONG_ANSWER,10,192
1402592098373111808,a7b07ad6f0d65c15e122ac17917a80d283730bee4c41e498f79c7fc4a1b751e1,2021-06-09 19:43:09,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\tfloat p;\n\tfor(i=0;i<n;i++)\n\t\t{\t\t\n\t\tprintf(\""%.2f\"",1-(i/n));\n\t\tprintf(\""\\n\"");\n\t\t}\n}",WRONG_ANSWER,10,340
1402592099430010880,33dd1558df6ebb25ef453ce36395fb27b59ecad5e2955b1d65e1274db775ea4f,2021-06-09 19:43:10,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nint main(){\n\tint n;\n    int m;\n\tdouble q=0;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++){\n\t\t\n\t\tscanf(\""%d\"",&m);\n\t\t\tfor(int j=0;j<m;j++){\n\t\t\t\tq+=pow(0.5,j);\n\t\t\t}\n\t\t\tprintf(\""%.3lf\"",1-q);\n\t\tif(i!=n-1){\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t} \n\t\n}",WRONG_ANSWER,15,324
1402592145051521024,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:43:20,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int m;\n    int n[10];\n    scanf(\""%d\"", &m);\n    for (int i = 0; i < m;i++) {\n        scanf(\""%d\"", &n[i]);}\n        for (int i = 0; i < m;i++){\n        float p = 1.000;\n        float N;\n        N = n[i];\n        p = 1 / N;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",MULTIPLE_ERROR,14,204
1402592289755009024,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 19:43:55,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i;\n\tfloat p;\n\tp=(m-(n-1))/m;\t\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,6,372
1402592323800174592,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:44:03,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int m;\n    int n[10];\n    scanf(\""%d\"", &m);\n    for (int i = 0; i < m;i++)\n        scanf(\""%d\"", &n[i]);\n    for (int i = 0; i < m;i++){\n        float p = 1.000;\n        float N;\n        N = n[i];\n        p = 1 / N;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",MULTIPLE_ERROR,9,328
1402592407690448896,4cc1bf8f535f112b2d54bda5f186af1fe53e157c40bc7a4bb3fffcce9ea34035,2021-06-09 19:44:23,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint m,n,i,j;\n\tfloat sum;\n\tscanf(\""%d\"",&m);\n\tfor(i = 0;i < m;i++)\n\t{\n\t\tsum = 1;\n\t\tscanf(\""%d\"",&n);\n\t\tif(n == 1)\n\t\t\tprintf(\""1.000\"");\n\t\telse\n\t\t{\n\t\t\tfor(j = 1;j <= n;j++)\n\t\t\t{\n\t\t\t\tsum = sum*(1.0/j);\n\t\t\t}\n\t\t\tprintf(\""%.3f\"",1-sum);\n\t\t}\n\t\t\n\t\tif(i != m-1)\n\t\t\tprintf(\""\\n\"");\n\t}\n    return 0;\n}",WRONG_ANSWER,9,372
1402592485800906752,4cc1bf8f535f112b2d54bda5f186af1fe53e157c40bc7a4bb3fffcce9ea34035,2021-06-09 19:44:42,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint m,n,i,j;\n\tfloat sum;\n\tscanf(\""%d\"",&m);\n\tfor(i = 0;i < m;i++)\n\t{\n\t\tsum = 1;\n\t\tscanf(\""%d\"",&n);\n\t\tif(n == 1)\n\t\t\tprintf(\""1.000\"");\n\t\telse\n\t\t{\n\t\t\tfor(j = 1;j <= n;j++)\n\t\t\t{\n\t\t\t\tsum = sum*(1.0/j);\n\t\t\t}\n\t\t\tprintf(\""%.3f\"",1-sum);\n\t\t}\n\t\t\n\t\tif(i != m-1)\n\t\t\tprintf(\""\\n\"");\n\t}\n    return 0;\n}",WRONG_ANSWER,6,316
1402592486203559936,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:44:42,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\n#pragma warning(disable : 4996)\nint main()\n{\n    int m;\n    int n[10];\n    scanf(\""%d\"", &m);\n    for (int i = 0; i < m; i++) {\n        scanf(\""%d\"", &n[i]);\n    }\n    for (int i = 0; i < m; i++) {\n        float p = 1.000;\n        float N;\n        N = n[i];\n        p = 1 / N;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",MULTIPLE_ERROR,8,328
1402592529132326912,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:44:52,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int m;\n    int n[10];\n    scanf(\""%d\"", &m);\n    for (int i = 0; i < m; i++) {\n        scanf(\""%d\"", &n[i]);\n    }\n    for (int i = 0; i < m; i++) {\n        float p = 1.000;\n        float N;\n        N = n[i];\n        p = 1 / N;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",MULTIPLE_ERROR,7,320
1402592612087205888,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:45:12,C++,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int m;\n    int n[10];\n    scanf(\""%d\"", &m);\n    for (int i = 0; i < m; i++) {\n        scanf(\""%d\"", &n[i]);\n    }\n    for (int i = 0; i < m; i++) {\n        float p = 1.000;\n        float N;\n        N = n[i];\n        p = 1 / N;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",MULTIPLE_ERROR,8,460
1402592792631021568,3081d56f8aaa1b52b62a6fd74bb667cadb9ab2b436f5697f2c270ed31bafa966,2021-06-09 19:45:55,Java,0.0,1402531086542356485,1396456000062107648,56,import java.util.*;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int m = scanner.nextInt();\n        while (scanner.hasNext()){\n            int[] nums = new int[m];\n            double q = 1.000;\n            for (int i = 0;i < m;i++){\n                nums[i] = scanner.nextInt();\n            }\n            for (int i = 0;i < m;i++){\n                System.out.println(q/nums[i]);\n            }\n        }\n    }\n},WRONG_ANSWER,283,14636
1402593027809841152,6b0e3a3ae8d793f39ee0d7be81f2027be76c55fba2be6d3b02c3c33b79ea88a1,2021-06-09 19:46:51,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main(){\n    int m;\n    printf(\""请输入一个正整数\"");\n    scanf(%d,m);  \n    printf(\""每行都给出一个正整数，正整数为从1到m\"");\n    for(m;m>=1;m--){\n        scanf(%d,n);\n        print(%d,m-1/n);\n    }\n}",COMPILE_ERROR,0,0
1402593105874227200,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:47:10,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int m;\n    int n[10];\n    scanf(\""%d\"",&m);\n    for (int i = 0; i < m; i++) {\n        scanf(\""%d\"",&n[i]);\n    }\n    for (int i = 0; i < m; i++) {\n        float p = 1.000;\n        float N;\n        N = n[i];\n        p = 1 / N;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",MULTIPLE_ERROR,13,340
1402593329808183296,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:48:03,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int m;\n    int n[];\n    scanf(\""%d\"",&m);\n    for (int i = 0; i < m; i++) {\n        scanf(\""%d\"",&n[i]);\n    }\n    for (int i = 0; i < m; i++) {\n        float p = 1.000;\n        float N;\n        N = n[i];\n        p = 1 / N;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1402593373105917952,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:48:13,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int m;\n    int n[1000];\n    scanf(\""%d\"",&m);\n    for (int i = 0; i < m; i++) {\n        scanf(\""%d\"",&n[i]);\n    }\n    for (int i = 0; i < m; i++) {\n        float p = 1.000;\n        float N;\n        N = n[i];\n        p = 1 / N;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",WRONG_ANSWER,8,320
1402593479255429120,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:48:39,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int m;\n    int n[50];\n    scanf(\""%d\"",&m);\n    for (int i = 0; i < m; i++) {\n        scanf(\""%d\"",&n[i]);\n    }\n    for (int i = 0; i < m; i++) {\n        float p = 1.000;\n        float N;\n        N = n[i];\n        p = 1 / N;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",WRONG_ANSWER,9,352
1402593672977747968,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:49:25,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int m;scanf(\""%d\"",&m);\n    int n[m];\n    \n    for (int i = 0; i < m; i++) {\n        scanf(\""%d\"",&n[i]);\n    }\n    for (int i = 0; i < m; i++) {\n        float p = 1.000;\n        float N;\n        N = n[i];\n        p = 1 / N;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",WRONG_ANSWER,7,384
1402593775775944704,3081d56f8aaa1b52b62a6fd74bb667cadb9ab2b436f5697f2c270ed31bafa966,2021-06-09 19:49:49,Java,0.0,1402531086542356485,1396456000062107648,56,import java.util.*;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int m = scanner.nextInt();\n        while (scanner.hasNext()){\n            int[] nums = new int[m];\n            double q = 1.000;\n            for (int i = 0;i < m;i++){\n                nums[i] = scanner.nextInt();\n            }\n            //for (int i = 0;i < m;i++){\n                //System.out.println(q/nums[i]);\n            //}\n        }\n    }\n},WRONG_ANSWER,294,14640
1402593848333209600,3081d56f8aaa1b52b62a6fd74bb667cadb9ab2b436f5697f2c270ed31bafa966,2021-06-09 19:50:07,Java,0.0,1402531086542356485,1396456000062107648,56,import java.util.*;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int m = scanner.nextInt();\n        while (scanner.hasNext()){\n            int[] nums = new int[m];\n            double q = 1.000;\n            for (int i = 0;i < m;i++){\n                nums[i] = scanner.nextInt();\n            }\n            //for (int i = 0;i < m;i++){\n                System.out.println(q/nums[i]);\n            //}\n        }\n    }\n},COMPILE_ERROR,0,0
1402593927857147904,3081d56f8aaa1b52b62a6fd74bb667cadb9ab2b436f5697f2c270ed31bafa966,2021-06-09 19:50:25,Java,0.0,1402531086542356485,1396456000062107648,56,import java.util.*;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int m = scanner.nextInt();\n        while (scanner.hasNext()){\n            int[] nums = new int[m];\n            double q = 1.000;\n            for (int i = 0;i < m;i++){\n                nums[i] = scanner.nextInt();\n            }\n            for (int i = 0;i < m;i++){\n                System.out.println(q/nums[i]);\n            }\n        }\n    }\n},WRONG_ANSWER,297,14256
1402594208825184256,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:51:32,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int m;\n    scanf(\""%d\"",&m);\n    int n[10];\n    \n    for (int i = 0; i < m; i++) {\n        scanf(\""%d\"",&n[i]);\n    }\n    for (int i = 0; i < m; i++) {\n        float p = 1.000;\n        float N;\n        N = n[i];\n        p = 1 / N;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",MULTIPLE_ERROR,8,468
1402594511951794176,7e41d4d739ab75fcd8ffad171f09bd1874087449aaf0057134cebad0779aeadc,2021-06-09 19:52:45,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n  int M,N,n;double p;\n  M=0||2;\n  N=2;\n  for(n=1,n<=N,n++)  \n   if(第n个人的在)  \n   p=1/1;\n   else p=1/2;  \n  printf(\""p=%.3lf\\n\"",p);\n  return 0;  \n}    ",COMPILE_ERROR,0,0
1402594728633667584,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:53:36,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int m;\n    scanf(\""%d\"",&m);\n    int n[10],num;\n    \n    for (int i = 0; i < m; i++) {\n        scanf(\""%d\"",&mun);\n        n[i]=mun;\n    }\n    for (int i = 0; i < m; i++) {\n        float p = 1.000;\n        float N;\n        N = n[i];\n        p = 1 / N;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1402594822363779072,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:53:59,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int m;\n    scanf(\""%d\"",&m);\n    int n[10],num;\n    \n    for (int i = 0; i < m; i++) {\n        scanf(\""%d\"",&num);\n        n[i]=num;\n    }\n    for (int i = 0; i < m; i++) {\n        float p = 1.000;\n        float N;\n        N = n[i];\n        p = 1 / N;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",MULTIPLE_ERROR,9,340
1402594847848370176,909212e158ccafcbe743569ae356c80194c601dd805e76f891a38323d75d40f4,2021-06-09 19:54:05,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint m;\n\tfloat num=1;\n\tscanf(\""%d\"", &m);\n\tfor (int i = 1; i <=m; i++)\n\t{\n\t\tint ret;\n\t\tscanf(\""%d\"", &ret);\n\t\tif (ret == i)\n\t\t\tprintf(\""%.3f\"", num / i);\n\t\tif (i == m)\n\t\t\tcontinue;\n\t\telse\n\t\t\tcout << endl;\n\t}\n}",WRONG_ANSWER,13,468
1402594973237153792,36c517f0c8bbb09ad13c634b8d2fdd0c87a29ff03c7d061fe8197541ba390b06,2021-06-09 19:54:35,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\n\nint main()\n{\n  int M;\n\n  while(scanf(\""%d \"",&M,) != EOF)\n    printf(\""%f\\n\"",N);\n  else(scanf(\""%d\"",&M,) != EDF)\n    printf(\""%f\\n\"",N);      \n  return 0;\n}",COMPILE_ERROR,0,0
1402595200228691968,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:55:29,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int M;\n    scanf(\""%d\"",&M);\n    int num[10],N;\n    \n    for (int i = 0; i < m; i++) {\n        scanf(\""%d\"",&N);\n        num[i]=n;\n    }\n    for (int i = 0; i < m; i++) {\n        float p = 1.000;\n        float s;\n        s = num[i];\n        p = 1.000 / s;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1402595255241117696,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:55:42,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int M;\n    scanf(\""%d\"",&M);\n    int num[10],N;\n    \n    for (int i = 0; i < M; i++) {\n        scanf(\""%d\"",&N);\n        num[i]=n;\n    }\n    for (int i = 0; i < M; i++) {\n        float p = 1.000;\n        float s;\n        s = num[i];\n        p = 1.000 / s;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1402595314745774080,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:55:56,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int M;\n    scanf(\""%d\"",&M);\n    int num[10],N;\n    \n    for (int i = 0; i < M; i++) {\n        scanf(\""%d\"",&N);\n        num[i]=n;\n    }\n    for (int i = 0; i < M; i++) {\n        float p = 1.000;\n        float s;\n        s = num[i];\n        p = 1.000 / s;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1402595384677339136,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:56:13,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int M;\n    scanf(\""%d\"",&M);\n    int num[10],N;\n    \n    for (int i = 0; i < M; i++) {\n        scanf(\""%d\"",&N);\n        num[i]=N;\n    }\n    for (int i = 0; i < M; i++) {\n        float p = 1.000;\n        float s;\n        s = num[i];\n        p = 1.000 / s;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",MULTIPLE_ERROR,9,200
1402595426079379456,cd28cea945fe6fb06d095f954b71900262b8a9d480df998e6d957739fa2f4f8b,2021-06-09 19:56:23,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main(void){\n    int x=0;\n    scanf(\""%d\"",&x);\n    double a[10];\n    a[0]=1;\n    for(for i=2;i<=10;i++ )\n    {\n        s=0.5*s;\n        a[i]=s;\n    }\n    int b=0;\n    while(1){\n        scanf(\""%d\"",&b);\n        printf(\""%.3lf\"",a[b-1]);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1402595471306559488,c9b979bf288207ef4c6c4cd761ccb5aedf017169fd265d26e411073b9cb3a158,2021-06-09 19:56:33,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\n\nint main() {\n\tint M, N, j;\n\tscanf(\""%d\"", &M);\n\tfloat a[M], s;\n\tfor (int i = 0; i < M; i++) {\n\t\tscanf(\""%d\"", &N);\n\t\ta[i] = 1;\n\t\tif (N == 1)\n\t\t\ta[i] = 1;\n\t\telse\n\t\t\ta[i] = a[i] / (2 * ( N - 1));\n\t\tprintf(\""%.3f\\n\"", a[i]);\n\t}\n}\n",WRONG_ANSWER,7,200
1402595475765104640,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:56:35,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int M;\n    scanf(\""%d\"",&M);\n    int num[20],N;\n    \n    for (int i = 0; i < M; i++) {\n        scanf(\""%d\"",&N);\n        num[i]=N;\n    }\n    for (int i = 0; i < M; i++) {\n        float p = 1.000;\n        float s;\n        s = num[i];\n        p = 1.000 / s;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",WRONG_ANSWER,8,352
1402595572351537152,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:56:58,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int M;\n    scanf(\""%d\"",&M);\n    int num[27],N;\n    \n    for (int i = 0; i < M; i++) {\n        scanf(\""%d\"",&N);\n        num[i]=N;\n    }\n    for (int i = 0; i < M; i++) {\n        float p = 1.000;\n        float s;\n        s = num[i];\n        p = 1.000 / s;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",WRONG_ANSWER,9,472
1402595621286481920,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:57:09,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int M;\n    scanf(\""%d\"",&M);\n    int num[200],N;\n    \n    for (int i = 0; i < M; i++) {\n        scanf(\""%d\"",&N);\n        num[i]=N;\n    }\n    for (int i = 0; i < M; i++) {\n        float p = 1.000;\n        float s;\n        s = num[i];\n        p = 1.000 / s;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",WRONG_ANSWER,9,376
1402595726353731584,909212e158ccafcbe743569ae356c80194c601dd805e76f891a38323d75d40f4,2021-06-09 19:57:34,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint m,a[10];\n\tfloat num=1;\n\tscanf(\""%d\"", &m);\n\tfor (int i = 1; i <=m; i++)//输入\n\t{\n\t\tscanf(\""%d\"", &a[i]);\n\t}\n\tfor (int i = 1; i <= m; i++)//输出\n\t{\n\t\tprintf(\""%.3f\"", num / i);\n\t\tif (i == m)\n\t\t\tcontinue;\n\t\telse\n\t\t\tcout << endl;\n\t}\n}",MULTIPLE_ERROR,21,456
1402595757043453952,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:57:42,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int M;\n    scanf(\""%d\"",&M);\n    int num[M],N;\n    \n    for (int i = 0; i < M; i++) {\n        scanf(\""%d\"",&N);\n        num[i]=N;\n    }\n    for (int i = 0; i < M; i++) {\n        float p = 1.000;\n        float s;\n        s = num[i];\n        p = 1.000 / s;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",WRONG_ANSWER,8,188
1402595791982006272,05483ab17195b5a29c9eebe49b01519e774c809d49a0db6d3a6338ded10ee258,2021-06-09 19:57:50,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n\tfloat m,n[100],i,j;\n\tscanf(\""%f\\n\"",&m);\n\tfor(i=1;i<=m-1;i++)\n\t  scanf(\""%f\\n\"",&n);\n\t\n\tprintf(\""1.000\\n\"");\n\tfor(j=2;j<=m-1;j++)\n\t{\n\t\tprintf(\""0.500\\n\"");\n\t}  \n\tprintf(\""0.500\"");\n\treturn 0;\n}",WRONG_ANSWER,10,460
1402595797464027136,cd28cea945fe6fb06d095f954b71900262b8a9d480df998e6d957739fa2f4f8b,2021-06-09 19:57:51,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main(void){\n    int x=0;\n    scanf(\""%d\"",&x);\n    double a[10];\n    a[0]=1;\n    int s=1;\n    for(int i=2;i<=10;i++ )\n    {\n        s=0.5*s;\n        a[i]=s;\n    }\n    int b=0;\n    while(1){\n        scanf(\""%d\"",&b);\n        printf(\""%.3lf\"",a[b-1]);\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1402595825704210432,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 19:57:58,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int M;\n    scanf(\""%d\"",&M);\n    int num[300],N;\n    \n    for (int i = 0; i < M; i++) {\n        scanf(\""%d\"",&N);\n        num[i]=N;\n    }\n    for (int i = 0; i < M; i++) {\n        float p = 1.000;\n        float s;\n        s = num[i];\n        p = 1.000 / s;\n        printf(\""%.3f\\n\"", p);\n    }\n    return 0;\n}",WRONG_ANSWER,8,376
1402596183226748928,cd28cea945fe6fb06d095f954b71900262b8a9d480df998e6d957739fa2f4f8b,2021-06-09 19:59:23,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main(void){\n    int x=0;\n    scanf(\""%d\"",&x);\n    double a[10];\n    a[0]=1;\n    double s=1;\n    for(int i=1;i<10;i++ )\n    {\n        s=0.5*s;\n        a[i]=s;\n    }\n    int b=0;\n    while(1){\n        scanf(\""%d\"",&b);\n        printf(\""%.3lf\"",a[b-1]);\n    }\n    return 0;\n}",MULTIPLE_ERROR,4,324
1402596523795845120,546c0322d5d650da0463c1998b642ec02b0c235f3fa8e0e99678a775885f32ed,2021-06-09 20:00:44,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int M,N=0;\n    float p=2;\n    scanf(\""%d\\n\"",&M);\n    for(N=1;N<=M;N++)\n        scanf(\""%d\\n\"",&N);\n    for(N=0;N<M;N++)\n    {\n        N=N+1;\n        p=p*0.5;\n        printf(\""%.3f\\n\"",p);\n    }\n\n    return 0;\n}",WRONG_ANSWER,8,344
1402596547321630720,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 20:00:50,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int M;\n    scanf(\""%d\"",&M);\n    int num[300],N;\n    \n    for (int i = 0; i < M; i++) {\n        scanf(\""%d\"",&N);\n        num[i]=N;\n    }if(M==1){s = num[M];\n        p = 1.000 / s;\n        printf(\""%.3f\"", p);}\n    else{\n    for (int i = 0; i < M-1; i++) {\n        float p = 1.000;\n        float s;\n        s = num[i];\n        p = 1.000 / s;\n        printf(\""%.3f\\n\"", p);\n    }\n        printf(\""%.3f\"", p);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1402596641945128960,34dafbf83c8ef6bd9af0e156a396261c876f74a61cb4e6dc44ff3a5148a74fb7,2021-06-09 20:01:13,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int a,x1,x2;\n    scanf(\""%d\\n\"",&a);\n    scanf(\""%d\\n\"",&x1);\n    scanf(\""%d\"",&x2);\n    printf(\""1.000\\n\"");\n    printf(\""0.500\"");\n    return 0;\n}",WRONG_ANSWER,8,196
1402596656918794240,7e41d4d739ab75fcd8ffad171f09bd1874087449aaf0057134cebad0779aeadc,2021-06-09 20:01:16,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n  int M,N,n;double p1,P2;\n  N=2;\n  for(n=1,n<=N,n++)\n  {if(n=1,M=0)  \n   p1=1/1;\n   if(n=2,M=2);  \n   p2=1/2;  \n  printf(\""p1=%.3lf p2=%.3lf\\n\"",p);\n  return 0;  \n}    ",COMPILE_ERROR,0,0
1402596767589699584,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 20:01:43,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int M;\n    scanf(\""%d\"",&M);\n    int num[300],N;\n    float s;\n    for (int i = 0; i < M; i++) {\n        scanf(\""%d\"",&N);\n        num[i]=N;\n    }if(M==1){s = num[M];\n        p = 1.000 / s;\n        printf(\""%.3f\"", p);}\n    else{\n    for (int i = 0; i < M-1; i++) {\n        float p = 1.000;\n        printf(\""%.3f\\n\"", p);\n    }s = num[M];\n        p = 1.000 / s;\n        printf(\""%.3f\"", p);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1402596813529911296,cd28cea945fe6fb06d095f954b71900262b8a9d480df998e6d957739fa2f4f8b,2021-06-09 20:01:53,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main(void){\n    int x=0;\n    scanf(\""%d\"",&x);\n    double a[10];\n    double s=1.0;\n    a[0]=s;\n    for(int i=1;i<10;i++ )\n    {\n        s=0.5*s;\n        a[i]=s;\n    }\n    int b=0;\n    while(1){\n        scanf(\""%d\"",&b);\n        printf(\""%.3lf\"",a[b-1]);\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1402596823042658304,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 20:01:56,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int M;\n    scanf(\""%d\"",&M);\n    int num[300],N;\n    float s;\n    float p = 1.000;\n    for (int i = 0; i < M; i++) {\n        scanf(\""%d\"",&N);\n        num[i]=N;\n    }if(M==1){s = num[M];\n        p = 1.000 / s;\n        printf(\""%.3f\"", p);}\n    else{\n    for (int i = 0; i < M-1; i++) {\n        \n        printf(\""%.3f\\n\"", p);\n    }s = num[M];\n        p = 1.000 / s;\n        printf(\""%.3f\"", p);\n    }\n    return 0;\n}",WRONG_ANSWER,6,196
1402596854705393664,7e41d4d739ab75fcd8ffad171f09bd1874087449aaf0057134cebad0779aeadc,2021-06-09 20:02:03,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n  int M,N,n;double p1,P2;\n  N=2;\n  for(n=1,n<=N,n++)\n  {if(n=1,M=0)  \n   p1=1/1;\n   if(n=2,M=2);  \n   p2=1/2;\n  }\n  printf(\""p1=%.3lf p2=%.3lf\\n\"",p);\n  return 0;  \n}    ",COMPILE_ERROR,0,0
1402597016580362240,7e41d4d739ab75fcd8ffad171f09bd1874087449aaf0057134cebad0779aeadc,2021-06-09 20:02:42,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n  int M,N,n;double p1,p2;\n  N=2;\n  for(n=1,n<=N,n++)\n  {if(n=1,M=0)  \n   p1=1/1;\n   if(n=2,M=2);  \n   p2=1/2;\n  }\n  printf(\""p1=%.3lf p2=%.3lf\\n\"",p1,p2);\n  return 0;  \n}    ",COMPILE_ERROR,0,0
1402597038315311104,3a75c5c35f35d77d022889aeb844c11e25fcc83056161f2c6df9ed79d912f8c6,2021-06-09 20:02:47,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,x,y;\n    scanf(\""%d\"",&m);\n    scanf(\""%d\"",&x);\n    scanf(\""%d\"",&y);\n    if(x==1)\n    printf(\""1.000\"");\n    if(y==2)\n    {\n        printf(\""0.500\"");\n    }\n}",WRONG_ANSWER,9,332
1402597081088757760,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 20:02:57,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,11,348
1402597122998308864,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 20:03:07,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int M;\n    scanf(\""%d\"",&M);\n    int num[300],N;\n    float s;\n    float p = 1.000;\n    for (int i = 0; i < M; i++) {\n        scanf(\""%d\"",&N);\n        num[i]=N;\n    }if(M==1){s = num[M];\n        p = 1.000 / s;\n        printf(\""%.3f\"", p);}\n    else{\n    for (int i = 0; i < M-1; i++) {\n        s = num[i];\n        p = 1.000 / s;\n        printf(\""%.3f\\n\"", p);\n    }\n        s = num[M-1];\n        p = 1.000 / s;\n        printf(\""%.3f\"", p);\n    }\n    return 0;\n}",WRONG_ANSWER,8,348
1402597142979907584,d207336af9470057a08fcb07e0745389eda6b4c3ea23aa6b61365d2452a71eaf,2021-06-09 20:03:12,C++,0.0,1402531086542356485,1396456000062107648,56,#include<iostream>\nusing namespace std;\n\nint main()\n{\n    int m;\n    cin>>m;\n    int index=0;\n    while(m!=index)\n    {\n        double d=(m-index)/m;\n        cout<<d<<endl;\n    }\n    return 0;\n},TIME_LIMIT_EXCEEDED,0,0
1402597297170976768,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 20:03:49,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[10];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",MULTIPLE_ERROR,8,188
1402597321606991872,d207336af9470057a08fcb07e0745389eda6b4c3ea23aa6b61365d2452a71eaf,2021-06-09 20:03:55,C++,0.0,1402531086542356485,1396456000062107648,56,#include<iostream>\nusing namespace std;\n\nint main()\n{\n    int m;\n    cin>>m;\n    int index=0;\n    while(m!=index)\n    {\n        double d=(m-index)/m;\n        cout<<d<<endl;\n        index++;\n    }\n    return 0;\n},WRONG_ANSWER,9,324
1402597404842954752,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 20:04:14,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n    int M;\n    scanf(\""%d\"",&M);\n    int num[300],N;\n    float s;\n    float p = 1.000;\n    for (int i = 0; i < M; i++) {\n        scanf(\""%d\"",&N);\n        num[i]=N;\n    }if(M==1){s = num[M-1];\n        p = 1.000 / s;\n        printf(\""%.3f\"", p);}\n    else{\n    for (int i = 0; i < M-1; i++) {\n        s = num[i];\n        p = 1.000 / s;\n        printf(\""%.3f\\n\"", p);\n    }\n        s = num[M-1];\n        p = 1.000 / s;\n        printf(\""%.3f\"", p);\n    }\n    return 0;\n}",WRONG_ANSWER,10,344
1402597426607198208,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 20:04:20,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[10];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",MULTIPLE_ERROR,7,196
1402597717792493568,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 20:05:29,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[10];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",MULTIPLE_ERROR,8,204
1402597728437637120,55dcf80c96137ce4555998f7502fc70ef2e0aae22bf867a33a2fee768689e1ff,2021-06-09 20:05:32,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,a[100],i;\n    scanf(\""%d\"",&m);\n    for(i=0;i<m;i++)\n        scanf(\""%d\"",&a[m]);\n}",WRONG_ANSWER,9,300
1402597929198063616,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 20:06:19,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,18,304
1402598052166668288,99b7285215fa42dabd0c553d5dc862f21cda69a6f3fd5667b2df4682e11edb47,2021-06-09 20:06:49,C++,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\n#include <iostream>\nusing namespace std;\nint main()\n{\n    int M;\n    cin >> M;\n        int num[300], N;\n    float s;\n    float p = 1.000;\n    for (int i = 0; i < M; i++) {\n        cin >> N;\n        num[i] = N;\n    }if (M == 1) {\n        s = num[M - 1];\n        p = 1.000 / s;\n        printf(\""%.3f\"", p);\n    }\n    else {\n        for (int i = 0; i < M - 1; i++) {\n            s = num[i];\n            p = 1.000 / s;\n            printf(\""%.3f\\n\"", p);\n        }\n        s = num[M - 1];\n        p = 1.000 / s;\n        printf(\""%.3f\"", p);\n    }\n    return 0;\n}",WRONG_ANSWER,11,392
1402598083300986880,546c0322d5d650da0463c1998b642ec02b0c235f3fa8e0e99678a775885f32ed,2021-06-09 20:06:56,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int M,N=0;\n    float p=2;\n    scanf(\""%d\\n\"",&M);\n\n    for(N=0;N<=M;N++)\n    {\n        N=N+1;\n        p=p*0.5;\n        printf(\""%.3f\\n\"",p);\n    }\n\n    return 0;\n}",WRONG_ANSWER,8,196
1402598220802854912,d207336af9470057a08fcb07e0745389eda6b4c3ea23aa6b61365d2452a71eaf,2021-06-09 20:07:29,C++,0.0,1402531086542356485,1396456000062107648,56,#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint m;\n\tcin >> m;\n\tint  index = 0;\n\twhile (m != index)\n\t{\n\t\tdouble d = ((double)(m - index) / m);\n\t\tcout << d << endl;\n\t\tindex++;\n\t}\n\treturn 0;\n},WRONG_ANSWER,11,444
1402598298766512128,cd28cea945fe6fb06d095f954b71900262b8a9d480df998e6d957739fa2f4f8b,2021-06-09 20:07:48,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main(void){\n    int x=0;\n    scanf(\""%d\"",&x);\n    double s=1.000;\n    for(int i=1;i<=x;i++)\n        scanf(\""%d\"",i);\n    printf(\""%.3lf\"",s);\n    for(int i=2;i<x;i++ )\n    {\n        s=0.5*s;\n         printf(\""%.3lf\"",s);}\n    return 0;\n}",SEGMENTATION_FAULT,11,248
1402598355821629440,d207336af9470057a08fcb07e0745389eda6b4c3ea23aa6b61365d2452a71eaf,2021-06-09 20:08:01,C++,0.0,1402531086542356485,1396456000062107648,56,#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint m;\n\tcin >> m;\n\tint  index = 0;\n\twhile (m != index)\n\t{\n\t\tdouble d = (double)((double)(m - index) / m);\n\t\tcout << d << endl;\n\t\tindex++;\n\t}\n\treturn 0;\n},WRONG_ANSWER,12,444
1402598392345628672,1e7d8484326b363a883f59255894595e107f9a498750c6302be2c04324c151f6,2021-06-09 20:08:10,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int N,n,M,g;\n    scanf(\""%d\"",M);\n    for(n=1;n<=N;)\n        g=n/N;\n        printf(\""%f\\n\"",&);\n    printf(\""%f\\n\"",&);\n}",COMPILE_ERROR,0,0
1402598410611888128,d6acf11ed414a9f15a9883dd1b761eb8c67adf4a78bacb3b65dc60aefe487411,2021-06-09 20:08:14,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,n[i],i;\n    float s;\n    scanf(\""%d\"",&m);\n    for(i=1;i<=m;i++);\n    {\n        scanf(\""%d\"",&n[i]);\n    }\n}",COMPILE_ERROR,0,0
1402598507940712448,1b2fc4b17b82bbf564267e1576a4d97d80b91f7282df841a2b2fb3b0c906d400,2021-06-09 20:08:37,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,b,c=0\n    printf(\""输入人数：\"")；\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    if(b=1)\n    {\n        printf(\""1.000\"");\n    }\n    else\n    {\n        printf(\""0.500\"");\n    }\n    if(c=1)\n    {\n        printf(\""1.000\"");\n    }\n    else\n    {\n        printf(\""0.500\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1402598631580405760,7e41d4d739ab75fcd8ffad171f09bd1874087449aaf0057134cebad0779aeadc,2021-06-09 20:09:07,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n  int M,N,n;double p1,p2;\n  N=2;\n  if(M=0);\n    for(n=1,n<=N,n++)\n    {if(n=1)  \n     p1=1/1;\n     printf(\""p1=%.3lf\"",p1);\n    }\n   if(M=2); \n    for(n=1,n<=N,n++)\n    {if(n=2)  \n     p2=1/2;\n     printf(\""p2=%.3lf\\n\"",p2);\n    }\n  return 0;  \n}    ",COMPILE_ERROR,0,0
1402598909071298560,3081d56f8aaa1b52b62a6fd74bb667cadb9ab2b436f5697f2c270ed31bafa966,2021-06-09 20:10:13,Java,0.0,1402531086542356485,1396456000062107648,56,import java.util.*;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int m = scanner.nextInt();\n        while (scanner.hasNext()){\n            int[] nums = new int[m];\n            double q = 1.000;\n            for (int i = 0;i < m;i++){\n                nums[i] = scanner.nextInt();\n            }\n            for (int i = 0;i < m;i++){\n                System.out.println(q/nums[i]);\n            }\n        }\n    }\n},WRONG_ANSWER,303,14456
1402599039816208384,ad2767da8d1c5335fda0fd29d4a3c38dbeae601d939448ee176e78415250e3b1,2021-06-09 20:10:44,C,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<cstdio>\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {\n        int t;\n        double ans;\n        cin>>t;\n        if(t==1)\n            ans=1.0;\n        else\n            ans=(t-i)/t*1.0;\n        printf(\""%.3lf/n\"",ans);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1402599068907835392,ad2767da8d1c5335fda0fd29d4a3c38dbeae601d939448ee176e78415250e3b1,2021-06-09 20:10:51,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<cstdio>\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {\n        int t;\n        double ans;\n        cin>>t;\n        if(t==1)\n            ans=1.0;\n        else\n            ans=(t-i)/t*1.0;\n        printf(\""%.3lf/n\"",ans);\n    }\n    return 0;\n}",WRONG_ANSWER,9,604
1402599125182877696,1b2fc4b17b82bbf564267e1576a4d97d80b91f7282df841a2b2fb3b0c906d400,2021-06-09 20:11:05,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,b,c=0;\n    float x=1.000;\n    float y=0.500;\n    printf(\""输入人数：\"")；\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    if(b=1)\n    {\n        printf(\""%f\"",x);\n    }\n    else\n    {\n        printf(\""%f\"",y);\n    }\n    if(c=1)\n    {\n        printf(\""%f\"",x);\n    }\n    else\n    {\n        printf(\""%f\"",y);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1402599299389034496,f1d2f32000b991095a59f67d256ba1a160a93ff4016abf24cc5315e393254c5e,2021-06-09 20:11:46,Java,0.0,1402531086542356485,1396456000062107648,56,"import java.util.Scanner;\npublic class find {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int m = sc.nextInt();//丢拖鞋次数\n        int[] arr = new int[m];//存放后面的游客\n        for (int i = 0; i < m; i++) {\n            arr[i] = sc.nextInt();//存放是第几位的游客\n        }\n        double[] p = new double[m];//存放每位游客找到鞋的概率\n        for (int i = 0; i < m; i++) {\n            p[i] = c(m,arr[i]);\n        }\n        //打印结果：\n        for (int i = 0; i < m; i++) {\n            System.out.println(p[i]);\n        }\n    }\n    //计算概率（丢鞋数，第几位游客）\n    public static double c(int m,int n) {\n        if (n == 1) {\n            return 1;\n        }\n        double p = Math.pow((1.0/m),n-1);\n        return p;\n    }\n}\n",COMPILE_ERROR,0,0
1402599357480210432,1b2fc4b17b82bbf564267e1576a4d97d80b91f7282df841a2b2fb3b0c906d400,2021-06-09 20:12:00,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,b,c=0;\n    float x=1.000;\n    float y=0.500;\n    printf(\""输入人数：\"")；\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    if(a>0||b=1)\n    {\n        printf(\""%f\"",x);\n    }\n    else\n    {\n        printf(\""%f\"",y);\n    }\n    if(a>0||c=1)\n    {\n        printf(\""%f\"",x);\n    }\n    else\n    {\n        printf(\""%f\"",y);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1402599408948449280,ad2767da8d1c5335fda0fd29d4a3c38dbeae601d939448ee176e78415250e3b1,2021-06-09 20:12:12,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<cstdio>\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {\n        int t;\n        double ans;\n        cin>>t;\n        if(t==1)\n            ans=1.0;\n        else\n            ans=1/t*1.0;\n        printf(\""%.3lf/n\"",ans);\n    }\n    return 0;\n}",WRONG_ANSWER,12,600
1402599415923576832,9883c5dde012a18289318158c46384df5a92d00014b65c9825d1ba8028d71172,2021-06-09 20:12:14,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nvoid main()\n{\n\tint n,i;\n\tfloat pi,p;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)scanf(\""%d\"",&i);\n\tif(i>=1)printf(\""1.000\\n\"");\n\tfor(i=2;i<=n;i++)\n\t{pi=(float)(i-1)/i;\n\tp=1-pi;\n\tprintf(\""%.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,7,188
1402599459632484352,cd28cea945fe6fb06d095f954b71900262b8a9d480df998e6d957739fa2f4f8b,2021-06-09 20:12:24,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main(void){\n    int x=0;\n    scanf(\""%d\"",&x);\n    int a;\n    double s=1.000;\n    for(int i=1;i<=x;i++)\n        scanf(\""%d\\n\"",&a);\n    printf(\""%.3lf\\n\"",s);\n    for(int j=2;j<x;j++ )\n    {\n        s=0.5*s;\n        printf(\""%.3lf\\n\"",s);}\n    return 0;\n}",WRONG_ANSWER,8,340
1402599524275032064,cd28cea945fe6fb06d095f954b71900262b8a9d480df998e6d957739fa2f4f8b,2021-06-09 20:12:40,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main(void){\n    int x=0;\n    scanf(\""%d\"",&x);\n    int a;\n    double s=1.000;\n    for(int i=1;i<=x;i++)\n        scanf(\""%d\\n\"",&a);\n    printf(\""%.3lf\\n\"",s);\n    for(int j=2;j<=x;j++ )\n    {\n        s=0.5*s;\n        printf(\""%.3lf\\n\"",s);}\n    return 0;\n}",WRONG_ANSWER,16,348
1402599597453119488,1b2fc4b17b82bbf564267e1576a4d97d80b91f7282df841a2b2fb3b0c906d400,2021-06-09 20:12:57,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int a,b,c=0;\n    float x=1.000;\n    float y=0.500;\n    printf(\""输入人数：\"")；\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    if(a>0||b=1)\n    {\n        printf(\""%f\"",x);\n    }\n    else\n    {\n        printf(\""%f\"",y);\n    }\n    if(a>0||c=1)\n    {\n        printf(\""%f\"",x);\n    }\n    else\n    {\n        printf(\""%f\"",y);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1402599640511844352,cd28cea945fe6fb06d095f954b71900262b8a9d480df998e6d957739fa2f4f8b,2021-06-09 20:13:07,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main(void){\n    int x=0;\n    scanf(\""%d\"",&x);\n    int a;\n    double s=1.000;\n    for(int i=1;i<=x;i++)\n        scanf(\""%d\\n\"",&a);\n    printf(\""%.3lf\\n\"",s);\n    for(int j=2;j<=x;j++ )\n    {\n        s=0.5*s;\n        printf(\""%.3lf\\n\"",s);}\n    return 0;\n}",WRONG_ANSWER,8,360
1402599644911669248,1b2fc4b17b82bbf564267e1576a4d97d80b91f7282df841a2b2fb3b0c906d400,2021-06-09 20:13:09,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int a,b,c=0;\n    float x=1.000;\n    float y=0.500;\n    printf(\""输入人数：\"")；\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    if(a>0||b=1)\n    {\n        printf(\""%f\"",x);\n    }\n    else\n    {\n        printf(\""%f\"",y);\n    }\n    if(a>0||c=1)\n    {\n        printf(\""%f\"",x);\n    }\n    else\n    {\n        printf(\""%f\"",y);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1402599679523065856,f1d2f32000b991095a59f67d256ba1a160a93ff4016abf24cc5315e393254c5e,2021-06-09 20:13:17,Java,0.0,1402531086542356485,1396456000062107648,56,"import java.util.Scanner;\nclass find {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int m = sc.nextInt();//丢拖鞋次数\n        int[] arr = new int[m];//存放后面的游客\n        for (int i = 0; i < m; i++) {\n            arr[i] = sc.nextInt();//存放是第几位的游客\n        }\n        double[] p = new double[m];//存放每位游客找到鞋的概率\n        for (int i = 0; i < m; i++) {\n            p[i] = c(m,arr[i]);\n        }\n        //打印结果：\n        for (int i = 0; i < m; i++) {\n            System.out.println(p[i]);\n        }\n    }\n    //计算概率（丢鞋数，第几位游客）\n    public static double c(int m,int n) {\n        if (n == 1) {\n            return 1;\n        }\n        double p = Math.pow((1.0/m),n-1);\n        return p;\n    }\n}\n",COMPILE_ERROR,0,0
1402599879771656192,f1d2f32000b991095a59f67d256ba1a160a93ff4016abf24cc5315e393254c5e,2021-06-09 20:14:05,Java,0.0,1402531086542356485,1396456000062107648,56,"import java.util.Scanner;\npublic class find {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int m = sc.nextInt();//丢拖鞋次数\n        int[] arr = new int[m];//存放后面的游客\n        for (int i = 0; i < m; i++) {\n            arr[i] = sc.nextInt();//存放是第几位的游客\n        }\n        double[] p = new double[m];//存放每位游客找到鞋的概率\n        for (int i = 0; i < m; i++) {\n            p[i] = c(m,arr[i]);\n        }\n        //打印结果：\n        for (int i = 0; i < m; i++) {\n            System.out.println(p[i]);\n        }\n    }\n    //计算概率（丢鞋数，第几位游客）\n    public static double c(int m,int n) {\n        if (n == 1) {\n            return 1;\n        }\n        double p = Math.pow((1.0/m),n-1);\n        return p;\n    }\n}\n",COMPILE_ERROR,0,0
1402599999934337024,f1d2f32000b991095a59f67d256ba1a160a93ff4016abf24cc5315e393254c5e,2021-06-09 20:14:33,Java,0.0,1402531086542356485,1396456000062107648,56,"import java.util.Scanner;\npublic class 找鞋 {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int m = sc.nextInt();//丢拖鞋次数\n        int[] arr = new int[m];//存放后面的游客\n        for (int i = 0; i < m; i++) {\n            arr[i] = sc.nextInt();//存放是第几位的游客\n        }\n        double[] p = new double[m];//存放每位游客找到鞋的概率\n        for (int i = 0; i < m; i++) {\n            p[i] = c(m,arr[i]);\n        }\n        //打印结果：\n        for (int i = 0; i < m; i++) {\n            System.out.println(p[i]);\n        }\n    }\n    //计算概率（丢鞋数，第几位游客）\n    public static double c(int m,int n) {\n        if (n == 1) {\n            return 1;\n        }\n        double p = Math.pow((1.0/m),n-1);\n        return p;\n    }\n}\n",COMPILE_ERROR,0,0
1402600206528974848,cd28cea945fe6fb06d095f954b71900262b8a9d480df998e6d957739fa2f4f8b,2021-06-09 20:15:22,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main(void){\n    int x=0;\n    scanf(\""%d\"",&x);\n    int a;\n    double s=1.000;\n    for(int i=1;i<=x;i++)\n        scanf(\""%d\\n\"",&a);\n    printf(\""%.3lf\\n\"",s);\n    for(int j=2;j<=x;j++ )\n    {\n        s=0.5*s;\n        if(j==x)\n            printf(\""%.3lf\"",s)；\n        else\n            printf(\""%.3lf\\n\"",s);\n    }\n    \n    return 0;\n}",COMPILE_ERROR,0,0
1402600251508690944,cd28cea945fe6fb06d095f954b71900262b8a9d480df998e6d957739fa2f4f8b,2021-06-09 20:15:33,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main(void){\n    int x=0;\n    scanf(\""%d\"",&x);\n    int a;\n    double s=1.000;\n    for(int i=1;i<=x;i++)\n        scanf(\""%d\\n\"",&a);\n    printf(\""%.3lf\\n\"",s);\n    for(int j=2;j<=x;j++ )\n    {\n        s=0.5*s;\n        if(j==x)\n            printf(\""%.3lf\"",s);\n        else\n            printf(\""%.3lf\\n\"",s);\n    }\n    \n    return 0;\n}",WRONG_ANSWER,6,320
1402600256181080064,546c0322d5d650da0463c1998b642ec02b0c235f3fa8e0e99678a775885f32ed,2021-06-09 20:15:34,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int M,N=1;\n    float p=2;\n    scanf(\""%d\\n\"",&M);\n    while(N<=M)\n    {\n        p=p*0.5;\n        printf(\""%.3f\\n\"",p);\n        N++;\n    }\n    return 0;\n}",WRONG_ANSWER,8,268
1402600340620808192,f1d2f32000b991095a59f67d256ba1a160a93ff4016abf24cc5315e393254c5e,2021-06-09 20:15:54,Java,0.0,1402531086542356485,1396456000062107648,56,"import java.util.Scanner;\npublic class find {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int m = sc.nextInt();//丢拖鞋次数\n        int[] arr = new int[m];//存放后面的游客\n        for (int i = 0; i < m; i++) {\n            arr[i] = sc.nextInt();//存放是第几位的游客\n        }\n        double[] p = new double[m];//存放每位游客找到鞋的概率\n        for (int i = 0; i < m; i++) {\n            p[i] = c(m,arr[i]);\n        }\n        //打印结果：\n        for (int i = 0; i < m; i++) {\n            System.out.println(p[i]);\n        }\n    }\n    //计算概率（丢鞋数，第几位游客）\n    public static double c(int m,int n) {\n        if (n == 1) {\n            return 1;\n        }\n        double p = Math.pow((1.0/m),n-1);\n        return p;\n    }\n}\n",COMPILE_ERROR,0,0
1402600366986268672,cd28cea945fe6fb06d095f954b71900262b8a9d480df998e6d957739fa2f4f8b,2021-06-09 20:16:01,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main(void){\n    int x=0;\n    scanf(\""%d\"",&x);\n    int a;\n    double s=1.000;\n    for(int i=1;i<=x;i++)\n        scanf(\""%d\\n\"",&a);\n    printf(\""%.3lf\\n\"",s);\n    for(int j=2;j<=x;j++ )\n    {\n        s=0.5*s;\n        if(j==x)\n            printf(\""%.3lf\"",s);\n        else\n            printf(\""%.3lf\\n\"",s);\n    }\n    \n    return 0;\n}",WRONG_ANSWER,11,336
1402600408186851328,f1d2f32000b991095a59f67d256ba1a160a93ff4016abf24cc5315e393254c5e,2021-06-09 20:16:11,Java,0.0,1402531086542356485,1396456000062107648,56,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int m = sc.nextInt();//丢拖鞋次数\n        int[] arr = new int[m];//存放后面的游客\n        for (int i = 0; i < m; i++) {\n            arr[i] = sc.nextInt();//存放是第几位的游客\n        }\n        double[] p = new double[m];//存放每位游客找到鞋的概率\n        for (int i = 0; i < m; i++) {\n            p[i] = c(m,arr[i]);\n        }\n        //打印结果：\n        for (int i = 0; i < m; i++) {\n            System.out.println(p[i]);\n        }\n    }\n    //计算概率（丢鞋数，第几位游客）\n    public static double c(int m,int n) {\n        if (n == 1) {\n            return 1;\n        }\n        double p = Math.pow((1.0/m),n-1);\n        return p;\n    }\n}\n",WRONG_ANSWER,344,14836
1402600510087532544,e68d9edc2cd0b4f39facb9873a9d59147fb045c63bd7550bff26d398023e4069,2021-06-09 20:16:35,Java,0.0,1402531086542356485,1396456000062107648,56,import java.util.Scanner;\npublic class Main{\npublic static void main(String[] args){\n    Scanner A = new Scanner(System.in);\n    int zongshu = A.nextInt();\n    while (A.hasNextInt()) {\n        int xushu=A.nextInt();\n        if (xushu <= zongshu){\n            double a = 1/xushu;\n            System.out.println(a);\n        }\n}\n}\n},WRONG_ANSWER,328,14716
1402600842020491264,e68d9edc2cd0b4f39facb9873a9d59147fb045c63bd7550bff26d398023e4069,2021-06-09 20:17:54,Java,0.0,1402531086542356485,1396456000062107648,56,import java.util.Scanner;\npublic class Main{\npublic static void main(String[] args){\n    Scanner A = new Scanner(System.in);\n    int zongshu = A.nextInt();\n    while (A.hasNextInt()) {\n        int xushu=A.nextInt();\n        if (xushu <= zongshu){\n            float a = 1/xushu;\n            System.out.println(a);\n        }\n}\n}\n},WRONG_ANSWER,289,14572
1402600878708068352,bee626834797b1c52a3ae18a2b79306e5fba4265f81a5ea7b896ddd2c054e2bf,2021-06-09 20:18:03,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main(){\n   int n,t;\n    int m[1000];\n    int i=0;\n    scanf(\""%d\"",&n);\n    for(i;i<n;i++){\n        scanf(\""%d\\n\"",&m[i]);\n        printf(\""%3f\\n\"",1/m[i]);\n    }\n//     for(int j=0;j<n;j++){\n        \n//     }\n    return 0;\n}",WRONG_ANSWER,6,368
1402600942327271424,f1d2f32000b991095a59f67d256ba1a160a93ff4016abf24cc5315e393254c5e,2021-06-09 20:18:18,Java,0.0,1402531086542356485,1396456000062107648,56,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int m = sc.nextInt();//丢拖鞋次数\n        int[] arr = new int[m];//存放后面的游客\n        for (int i = 0; i < m; i++) {\n            arr[i] = sc.nextInt();//存放是第几位的游客\n        }\n        double[] p = new double[m];//存放每位游客找到鞋的概率\n        for (int i = 0; i < m; i++) {\n            p[i] = c(m,arr[i]);\n        }\n        //打印结果：\n        for (int i = 0; i < m; i++) {\n            System.out.println(p[i]);\n        }\n    }\n    //计算概率（丢鞋数，第几位游客）\n    public static double c(int m,int n) {\n        if (n == 1) {\n            return 1;\n        }\n        double p = Math.pow(1-(1.0/m),n-1);\n        return p;\n    }\n}\n",WRONG_ANSWER,329,14728
1402601277649293312,628b17c30bf602c4f3db74a7ac3e9ffec9152c759d160c8d9a5a4fd6e509ee1d,2021-06-09 20:19:38,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main(){\n    double n;\n    scanf(\""%lf\"",&n);\n    for(int i=0;i<n;i++){\n        double a;\n        scanf(\""%lf\"",&a);\n        double sum=((n-(a-1))/n);\n        printf(\""%.3lf\\n\"",sum);\n    }\n}",WRONG_ANSWER,8,324
1402601322335408128,cd28cea945fe6fb06d095f954b71900262b8a9d480df998e6d957739fa2f4f8b,2021-06-09 20:19:48,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main(void){\n    int x=0;\n    scanf(\""%d\"",&x);\n    int a;\n    double s=1.000;\n    for(int i=1;i<=x;i++)\n        scanf(\""%d\\n\"",&a);\n    printf(\""%.3lf\\n\"",s);\n    for(int j=2;j<=x;j++ )\n    {\n        s=0.5*s;\n        if(j==x)\n            printf(\""%.3lf\"",s);\n        else\n            printf(\""%.3lf\\n\"",s);\n    }\n    \n    return 0;\n}",WRONG_ANSWER,10,320
1402601473997312000,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 20:20:25,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\n\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",COMPILE_ERROR,0,0
1402601510022123520,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 20:20:33,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,12,372
1402601611897638912,d6acf11ed414a9f15a9883dd1b761eb8c67adf4a78bacb3b65dc60aefe487411,2021-06-09 20:20:58,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,n,i;\n    float s;\n    scanf(\""%d\"",&m);\n    scanf(\""%d\"",&i);\n    if(i<m)\n    {\n        s=(n-i)/(float)n;\n    }\n    else\n        s=(n-m)/(flaot)n;\n    printf(\""%2f\"",s);\n}",COMPILE_ERROR,0,0
1402601626154012672,bee626834797b1c52a3ae18a2b79306e5fba4265f81a5ea7b896ddd2c054e2bf,2021-06-09 20:21:01,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main(){\n   int n,t;\n    int m[1000];\n    int i=0;\n    scanf(\""%d\\n\"",&n);\n    for(i;i<n;i++){\n        scanf(\""%d\\n\"",&m[i]);\n        \n    }\n     for(int j=1;j<=n;j++){\n         float k=j;\n        printf(\""%f\\n\"",1/k);\n     }\n    return 0;\n}",WRONG_ANSWER,9,464
1402601760199839744,e68d9edc2cd0b4f39facb9873a9d59147fb045c63bd7550bff26d398023e4069,2021-06-09 20:21:33,Java,0.0,1402531086542356485,1396456000062107648,56,import java.util.Scanner;\npublic class Main{\npublic static void main(String[] args){\n    Scanner A = new Scanner(System.in);\n    int zongshu = A.nextInt();\n    while (A.hasNextInt()) {\n        int xushu=A.nextInt();\n        if (xushu <= zongshu){\n            float a = 1/xushu;\n            System.out.println(a);\n        }\n}\n}\n},WRONG_ANSWER,302,15104
1402601802486747136,d6acf11ed414a9f15a9883dd1b761eb8c67adf4a78bacb3b65dc60aefe487411,2021-06-09 20:21:43,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,n,i;\n    float s;\n    scanf(\""%d\"",&m);\n    scanf(\""%d\"",&i);\n    if(i<m)\n    {\n        s=(n-i)/(float)n;\n    }\n    else\n        s=(n-m)/(float)n;\n    printf(\""%2f\"",s);\n}",WRONG_ANSWER,8,320
1402601837010128896,f1d2f32000b991095a59f67d256ba1a160a93ff4016abf24cc5315e393254c5e,2021-06-09 20:21:51,Java,0.0,1402531086542356485,1396456000062107648,56,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int m = sc.nextInt();//丢拖鞋次数\n        int[] arr = new int[m];//存放后面的游客\n        for (int i = 0; i < m; i++) {\n            arr[i] = sc.nextInt();//存放是第几位的游客\n        }\n        double[] p = new double[m];//存放每位游客找到鞋的概率\n        for (int i = 0; i < m; i++) {\n            p[i] = c(m,arr[i]);\n        }\n        //打印结果：\n        for (int i = 0; i < m; i++) {\n            System.out.println(p[i]);\n        }\n    }\n    //计算概率（丢鞋数，第几位游客）\n    public static double c(int m,int n) {\n        if (n == 1) {\n            return 1;\n        }\n        double p = Math.pow(0.5,n-1);\n        return p;\n    }\n}\n",WRONG_ANSWER,270,15052
1402601942484291584,d6acf11ed414a9f15a9883dd1b761eb8c67adf4a78bacb3b65dc60aefe487411,2021-06-09 20:22:16,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,n,i;\n    float s;\n    scanf(\""%d\"",&m);\n    scanf(\""%d\"",&i);\n    if(i<m)\n    {\n        s=(n-i-1)/(float)n;\n    }\n    else\n        s=(n-m-1)/(float)n;\n    printf(\""%2f\"",s);\n}",WRONG_ANSWER,7,340
1402602130380656640,d6acf11ed414a9f15a9883dd1b761eb8c67adf4a78bacb3b65dc60aefe487411,2021-06-09 20:23:01,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,n,i;\n    float s;\n    scanf(\""%d\"",&m);\n    scanf(\""%d\"",&i);\n    if(i<m)\n    {\n        s=(n-i-1)/(float)n;\n    }\n    else\n        s=(n-m-1)/(float)n;\n    printf(\""%2f\"",s);\n    return 0;\n}",WRONG_ANSWER,8,384
1402602265143709696,db720820818fda882b930326ab19bc67903afe49a5005ed26400c7aaea6c03a5,2021-06-09 20:23:33,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nvoid main()\n{\n    int m,n,z,i;\n    float p;\n    scanf(\""%d%d%d\"",&z,&n,&m);\n    p=1.0/z;\n    for(i=2;i<=n;i++)\n    {\n        p=(1-p)*1/((1-p)*z);\n    }\n    printf(\""%d.000\\n%.3f\"",n,p);\n}",WRONG_ANSWER,8,196
1402602273830113280,e68d9edc2cd0b4f39facb9873a9d59147fb045c63bd7550bff26d398023e4069,2021-06-09 20:23:35,Java,0.0,1402531086542356485,1396456000062107648,56,import java.util.Scanner;\npublic class Main{\npublic static void main(String[] args){\n    Scanner A = new Scanner(System.in);\n    int m = A.nextInt();\n    while (A.hasNextInt()) {\n        int n=A.nextInt();\n        if (n <= m){\n            float a = 1/n;\n            System.out.println(a);\n        }\n}\n}\n},WRONG_ANSWER,296,14784
1402602519138177024,db720820818fda882b930326ab19bc67903afe49a5005ed26400c7aaea6c03a5,2021-06-09 20:24:34,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nvoid main()\n{\n    int m,n,z,i;\n    float p;\n    scanf(\""%d%d%d\"",&z,&n,&m);\n    p=1.0/z;\n    for(i=2;i<=n;i++)\n    {\n        p=(1-p)*1/((1-p)*z);\n    }\n    printf(\""%d.000\\n%.3f\"",n,p);\n}",WRONG_ANSWER,8,212
1402602909434875904,bee626834797b1c52a3ae18a2b79306e5fba4265f81a5ea7b896ddd2c054e2bf,2021-06-09 20:26:07,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main(){\n   int n;\n    int m[1000];\n    int i=0;\n    scanf(\""%d\\n\"",&n);\n    for(i;i<n-1;i++){\n        scanf(\""%d\\n\"",&m[i]);\n        \n    }\n     for(int j=1;j<=n;j++){\n         double k=j;\n        printf(\""%.3f\\n\"",1/k);\n     }\n    return 0;\n}",WRONG_ANSWER,11,192
1402602957145149440,2e19bc5edc091ea8f357ebd0ea70cc082eeb729fd95c7c30b7501ae69ae104af,2021-06-09 20:26:18,C,0.0,1402531086542356485,1396456000062107648,56,"# include<stdio.h>\n\n\nint main() {\n\tint a, b, c;\n\tfloat d, e;\n\tscanf(\""%d\"", &a);\n\tscanf(\""%d\"", &b);\n\tscanf(\""%d\"", &c);\n\td = 1.000 / b;\n\te = 1.000 / c;\n\tprintf(\""%.3f\\n\"", d );\n\tprintf(\""%.3f\"", e );\n\treturn 0;\n}",WRONG_ANSWER,9,188
1402603148040507392,1b2fc4b17b82bbf564267e1576a4d97d80b91f7282df841a2b2fb3b0c906d400,2021-06-09 20:27:04,C++,0.0,1402531086542356485,1396456000062107648,56,00,COMPILE_ERROR,0,0
1402603330845052928,d207336af9470057a08fcb07e0745389eda6b4c3ea23aa6b61365d2452a71eaf,2021-06-09 20:27:47,C++,0.0,1402531086542356485,1396456000062107648,56,#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint m;\n\tcin >> m;\n\tint  index = 0;\n\twhile (m != index)\n\t{\n\t\tdouble d = ((double)(m - index) / m);\n\t\tcout << d << endl;\n\t\tindex++;\n\t}\n\treturn 0;\n},WRONG_ANSWER,17,320
1402604128626839552,628b17c30bf602c4f3db74a7ac3e9ffec9152c759d160c8d9a5a4fd6e509ee1d,2021-06-09 20:30:58,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main(){\n    double n;\n    scanf(\""%lf\"",&n);\n    for(int i=0;i<n-1;i++){\n        double a;\n        scanf(\""%lf\"",&a);\n        double sum=1.00;\n        sum=(n-(a-1))/n;\n        printf(\""%.3lf\\n\"",sum);\n    }\n    double a;\n    scanf(\""%lf\"",&a);\n    double sum=1.00;\n    sum=(n-(a-1))/n;\n    printf(\""%.3lf\"",sum);\n}",WRONG_ANSWER,9,260
1402604154480463872,d6acf11ed414a9f15a9883dd1b761eb8c67adf4a78bacb3b65dc60aefe487411,2021-06-09 20:31:04,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,n=100,i1,i2;\n    float s1,s2;\n    scanf(\""%d\"",&m);\n    scanf(\""%d\"",&i1);\n    if(i1<m)\n    {\n        s1=(n-i1+1)/(float)n;\n    }\n    else\n        s1=(n-m+1)/(float)n;\n    printf(\""%0.3f\\n\"",s1);\n        scanf(\""%d\"",&i2);\n    if(i2<m)\n    {\n        s2=(n-i2+1)/(float)n;\n    }\n    else\n        s2=(n-m+1)/(float)n;\n    printf(\""%0.3f\\n\"",s2);\n    return 0;\n}",WRONG_ANSWER,19,192
1402604551945359360,d6acf11ed414a9f15a9883dd1b761eb8c67adf4a78bacb3b65dc60aefe487411,2021-06-09 20:32:38,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,n=100,i1,i2;\n    float s1,s2;\n    scanf(\""%d\"",&m);\n    scanf(\""%d\"",&i1);\n    if(i1<m)\n    {\n        s1=(n-i1+1)/(float)n;\n    }\n    else\n        s1=0.5;\n    printf(\""%0.3f\\n\"",s1);\n        scanf(\""%d\"",&i2);\n    if(i2<m)\n    {\n        s2=(n-i2+1)/(float)n;\n    }\n    else\n        s2=0.5;\n    printf(\""%0.3f\"",s2);\n    return 0;\n}",WRONG_ANSWER,7,340
1402604659092983808,05483ab17195b5a29c9eebe49b01519e774c809d49a0db6d3a6338ded10ee258,2021-06-09 20:33:04,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n\tint m,n[100],i,j=0;;\n\tscanf(\""%d\\n\"",&m);\n\tfor(i=0;i<=m-2;i++)\n\t  scanf(\""%d\\n\"",&n);\n\twhile(j<m-1)\n\t{\n\t\tif(n[j]==1) printf(\""1.000\\n\"");\n\t\tif(n[j]>1)\tprintf(\""0.500\\n\"");  \n\t\tj++;\n\t\t\n\t}\n\tprintf(\""0.500\"");\n\treturn 0;\n}",WRONG_ANSWER,10,332
1402604966183211008,d6acf11ed414a9f15a9883dd1b761eb8c67adf4a78bacb3b65dc60aefe487411,2021-06-09 20:34:17,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,n=100,i1,i2;\n    float s1,s2;\n    scanf(\""%d\"",&m);\n    scanf(\""%d\"",&i1);\n    if(i1<m)\n    {\n        s1=(n-i1+1)/(float)n;\n    }\n    else\n        s1=0.5;\n    printf(\""%0.3f\\n\"",s1);\n        scanf(\""%d\"",&i2);\n    if(i2<m)\n    {\n        s2=(n-i2+1)/(float)n;\n    }\n    else\n        s2=0.5;\n    printf(\""%0.3f\"",s2);\n    return 0;\n}",WRONG_ANSWER,16,468
1402605056280989696,bee626834797b1c52a3ae18a2b79306e5fba4265f81a5ea7b896ddd2c054e2bf,2021-06-09 20:34:39,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main(){\n   int n;\n    int m[1000];\n    int i=0;\n    scanf(\""%d\\n\"",&n);\n    for(i;i<n-1;i++){\n        scanf(\""%d\\n\"",&m[i]);\n        \n    }\n     for(int j=1;j<n;j++){\n         double k=j;\n        printf(\""%.3f\\n\"",1/k);\n     }\n     double a = n;\n     printf(\""%.3f\"",1/a);\n    return 0;\n}",WRONG_ANSWER,15,500
1402605311126966272,eab289b446229e4b537a446abf6502f5f0176be0bcc513ccb1b756207045ba24,2021-06-09 20:35:39,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main(){\n\t\n\tint n;\n\t\n\tscanf(\""%d\"",&n);\n\t\n\tint a[n];\n\t\n\tint i,j,k;\n\t\n\tfor(i=0;i<n;i++){\n\t\t\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\t\n\tfloat b[n];\n\t\n\tfor(i=0;i<n;i++){\n\t\t\n\t\tb[i]=pow(0.5,a[i]-1);\n\t\t\n\t}\n\t\n\tfor(i=0;i<n;i++){\n\t\t\n\t\tprintf(\""%.3lf\\n\"",b[i]);\n\t}\n\t\n\t\n}",WRONG_ANSWER,8,380
1402605442232455168,909212e158ccafcbe743569ae356c80194c601dd805e76f891a38323d75d40f4,2021-06-09 20:36:11,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint m,a[10];\n\tfloat num=1;\n\tscanf(\""%d\"", &m);\n\tfor (int i = 1; i <=m; i++)//输入\n\t{\n\t\tscanf(\""%d\"", &a[i]);\n\t}\n\tfor (int i = 1; i <= m; i++)//输出\n\t{\n\t\tprintf(\""%.3f\"", num / a[i]);\n\t\tif (i == m)\n\t\t\tcontinue;\n\t\telse\n\t\t\tcout << endl;\n\t}\n}",MULTIPLE_ERROR,11,320
1402605472515395584,909212e158ccafcbe743569ae356c80194c601dd805e76f891a38323d75d40f4,2021-06-09 20:36:18,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint m,a[10];\n\tfloat num=1;\n\tscanf(\""%d\"", &m);\n\tfor (int i = 1; i <=m; i++)//输入\n\t{\n\t\tscanf(\""%d\"", &a[i]);\n\t}\n\tfor (int i = 1; i <= m; i++)//输出\n\t{\n\t\tprintf(\""%.3f\"", num / a[i]);\n\t\tif (i == m)\n\t\t\tcontinue;\n\t\telse\n\t\t\tcout << endl;\n\t}\n}",MULTIPLE_ERROR,8,376
1402605660881522688,909212e158ccafcbe743569ae356c80194c601dd805e76f891a38323d75d40f4,2021-06-09 20:37:03,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint m,a[10];\n\tfloat num=1;\n\tscanf(\""%d\"", &m);\n// \tfor (int i = 1; i <=m; i++)//输入\n// \t{\n// \t\tscanf(\""%d\"", &a[i]);\n// \t}\n\tfor (int i = 1; i <= m; i++)//输出\n\t{\n\t\tprintf(\""%.3f\"", num /i);\n\t\tif (i == m)\n\t\t\tcontinue;\n\t\telse\n\t\t\tcout << endl;\n\t}\n}",WRONG_ANSWER,8,332
1402605977568317440,909212e158ccafcbe743569ae356c80194c601dd805e76f891a38323d75d40f4,2021-06-09 20:38:18,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint m,a[10];\n\tfloat num=1;\n\tscanf(\""%d\"", &m);\n\tfor (int i = 1; i <=m; i++)//输入\n\t{\n\t\tscanf(\""%d\"", &a[i]);\n\t}\n\tfor (int i = 1; i <= m; i++)//输出\n\t{\n\t\tprintf(\""%.3f\"", num /a[i]);\n\t\tif (i == m)\n\t\t\tcontinue;\n\t\telse\n\t\t\tcout << endl;\n\t}\n}",MULTIPLE_ERROR,10,376
1402606048334548992,909212e158ccafcbe743569ae356c80194c601dd805e76f891a38323d75d40f4,2021-06-09 20:38:35,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint m,a[5];\n\tfloat num=1;\n\tscanf(\""%d\"", &m);\n\tfor (int i = 1; i <=m; i++)//输入\n\t{\n\t\tscanf(\""%d\"", &a[i]);\n\t}\n\tfor (int i = 1; i <= m; i++)//输出\n\t{\n\t\tprintf(\""%.3f\"", num /a[i]);\n\t\tif (i == m)\n\t\t\tcontinue;\n\t\telse\n\t\t\tcout << endl;\n\t}\n}",MULTIPLE_ERROR,12,576
1402606550954840064,fe5536ded20f9f57a45d0777d3d276aca0564d12029068216301f8ac291fef17,2021-06-09 20:40:35,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\n#include<math.h>\nint main ()\n{\n    int b,s,M\n        \n        printf(\""输入第b位游客\"")；\n        printf(\""输入共M位游客\"")\n        scanf('\""%f\"",&n);\n        scanf(\""%f\"",&n);\n              \n              s=n-(n-1)/M;\n              \n              printf(\""概率为：f%\\n\"",s); \n}",COMPILE_ERROR,0,0
1402606750905700352,bee626834797b1c52a3ae18a2b79306e5fba4265f81a5ea7b896ddd2c054e2bf,2021-06-09 20:41:23,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main(){\n   int n;\n    int m[1000];\n    int i=0;\n    scanf(\""%d\\n\"",&n);\n    for(i;i<n-1;i++){\n        scanf(\""%d\\n\"",&m[i]);\n        \n    }\n     for(double j=1;j<n;j++){\n        printf(\""%.3f\\n\"",1/j);\n     }\n     double a = n;\n     printf(\""%.3f\"",1/a);\n    return 0;\n}",WRONG_ANSWER,9,200
1402606790592139264,ed0428907f9883947635f5ffbacf8fea3f24cdd2fecb3ed863281db6f0488aa8,2021-06-09 20:41:32,C,0.0,1402531086542356485,1396456000062107648,56,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        System.out.println(\""1.000\"");\n    }\n}\n",COMPILE_ERROR,0,0
1402606872775331840,ed0428907f9883947635f5ffbacf8fea3f24cdd2fecb3ed863281db6f0488aa8,2021-06-09 20:41:52,Java,0.0,1402531086542356485,1396456000062107648,56,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        System.out.println(\""1.000\"");\n    }\n}\n",WRONG_ANSWER,283,14760
1402606891934912512,bee626834797b1c52a3ae18a2b79306e5fba4265f81a5ea7b896ddd2c054e2bf,2021-06-09 20:41:56,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main(){\n   int n;\n    int m[];\n    int i=0;\n    scanf(\""%d\\n\"",&n);\n    for(i;i<n-1;i++){\n        scanf(\""%d\\n\"",&m[i]);\n        \n    }\n     for(double j=1;j<n;j++){\n        printf(\""%.3f\\n\"",1/j);\n     }\n     double a = n;\n     printf(\""%.3f\"",1/a);\n    return 0;\n}",COMPILE_ERROR,0,0
1402606962151821312,ed0428907f9883947635f5ffbacf8fea3f24cdd2fecb3ed863281db6f0488aa8,2021-06-09 20:42:13,Java,0.0,1402531086542356485,1396456000062107648,56,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        System.out.println(\""0.500\"");\n    }\n}\n",WRONG_ANSWER,259,14760
1402606995521703936,ed0428907f9883947635f5ffbacf8fea3f24cdd2fecb3ed863281db6f0488aa8,2021-06-09 20:42:21,Java,0.0,1402531086542356485,1396456000062107648,56,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        System.out.println(\""1.500\"");\n    }\n}\n",WRONG_ANSWER,274,14896
1402607114937733120,d6acf11ed414a9f15a9883dd1b761eb8c67adf4a78bacb3b65dc60aefe487411,2021-06-09 20:42:50,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,n=100,i[100],j;\n    float s1,s2;\n    scanf(\""%d\"",&m);\n    for(j=1;j<=m;j++)\n    {\n        scanf(\""%d\"",&i[j]);\n    if(i[j]<m)\n    {\n        s1=(n-i[j]+1)/(float)n;\n    }\n    else\n        s1=0.5;\n    printf(\""%0.3f\\n\"",s1);\n        /*scanf(\""%d\"",&i2);\n    if(i2<m)\n    {\n        s2=(n-i2+1)/(float)n;\n    }\n    else\n        s2=0.5;\n    printf(\""%0.3f\"",s2);*/\n    }\n    return 0;\n}",WRONG_ANSWER,8,304
1402607301173153792,d6acf11ed414a9f15a9883dd1b761eb8c67adf4a78bacb3b65dc60aefe487411,2021-06-09 20:43:34,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,n=100000,i[10000],j;\n    float s1,s2;\n    scanf(\""%d\"",&m);\n    for(j=1;j<=m;j++)\n    {\n        scanf(\""%d\"",&i[j]);\n    if(i[j]<m)\n    {\n        s1=(n-i[j]+1)/(float)n;\n    }\n    else\n        s1=0.5;\n    printf(\""%0.3f\\n\"",s1);\n        /*scanf(\""%d\"",&i2);\n    if(i2<m)\n    {\n        s2=(n-i2+1)/(float)n;\n    }\n    else\n        s2=0.5;\n    printf(\""%0.3f\"",s2);*/\n    }\n    return 0;\n}",WRONG_ANSWER,9,344
1402607480467132416,d6acf11ed414a9f15a9883dd1b761eb8c67adf4a78bacb3b65dc60aefe487411,2021-06-09 20:44:17,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,n=100000,i[j],j;\n    float s1,s2;\n    scanf(\""%d\"",&m);\n    for(j=1;j<=m;j++)\n    {\n        scanf(\""%d\"",&i[j]);\n    if(i[j]<m)\n    {\n        s1=(n-i[j]+1)/(float)n;\n    }\n    else\n        s1=0.5;\n    printf(\""%0.3f\\n\"",s1);\n        /*scanf(\""%d\"",&i2);\n    if(i2<m)\n    {\n        s2=(n-i2+1)/(float)n;\n    }\n    else\n        s2=0.5;\n    printf(\""%0.3f\"",s2);*/\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1402607575916908544,d6acf11ed414a9f15a9883dd1b761eb8c67adf4a78bacb3b65dc60aefe487411,2021-06-09 20:44:39,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,n=100000,i[100],j;\n    float s1,s2;\n    scanf(\""%d\"",&m);\n    for(j=1;j<=m;j++)\n    {\n        scanf(\""%d\"",&i[j]);\n    if(i[j]<m)\n    {\n        s1=(n-i[j]+1)/(float)n;\n    }\n    else\n        s1=0.5;\n    printf(\""%0.3f\\n\"",s1);\n        /*scanf(\""%d\"",&i2);\n    if(i2<m)\n    {\n        s2=(n-i2+1)/(float)n;\n    }\n    else\n        s2=0.5;\n    printf(\""%0.3f\"",s2);*/\n    }\n    return 0;\n}",WRONG_ANSWER,9,256
1402607611555844096,fe5536ded20f9f57a45d0777d3d276aca0564d12029068216301f8ac291fef17,2021-06-09 20:44:48,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main ()\n{\n    int b,s,M;\n        \n        printf(\""输入第b位游客:\"");\n        printf(\""输入共M位游客:\"");\n        scanf(\""%f\"",&b);\n        scanf(\""%f\"",&s);\n              \n              s=b-(s-1)/M;\n              \n              printf(\""概率为：f%\\n\"",s); \n}",FLOAT_POINT_EXCEPTION,8,196
1402607635543134208,bee626834797b1c52a3ae18a2b79306e5fba4265f81a5ea7b896ddd2c054e2bf,2021-06-09 20:44:54,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main(){\n   int n;\n    int i=0;\n    scanf(\""%d\\n\"",&n);\n    for(i;i<n-1;i++){\n        scanf(\""%d\\n\"",&i);\n    }\n     for(double j=1;j<n;j++){\n        printf(\""%.3f\\n\"",1/j);\n     }\n     double a = n;\n     printf(\""%.3f\"",1/a);\n    return 0;\n}",WRONG_ANSWER,10,324
1402607640014262272,d6acf11ed414a9f15a9883dd1b761eb8c67adf4a78bacb3b65dc60aefe487411,2021-06-09 20:44:55,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,n=100000,i[1000000],j;\n    float s1,s2;\n    scanf(\""%d\"",&m);\n    for(j=1;j<=m;j++)\n    {\n        scanf(\""%d\"",&i[j]);\n    if(i[j]<m)\n    {\n        s1=(n-i[j]+1)/(float)n;\n    }\n    else\n        s1=0.5;\n    printf(\""%0.3f\\n\"",s1);\n        /*scanf(\""%d\"",&i2);\n    if(i2<m)\n    {\n        s2=(n-i2+1)/(float)n;\n    }\n    else\n        s2=0.5;\n    printf(\""%0.3f\"",s2);*/\n    }\n    return 0;\n}",WRONG_ANSWER,10,256
1402608255754801152,fe5536ded20f9f57a45d0777d3d276aca0564d12029068216301f8ac291fef17,2021-06-09 20:47:22,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main ()\n{\n    int b,s;\n    float M;\n        \n        printf(\""输入第b位游客:\"");\n        printf(\""输入共M位游客:\"");\n        scanf(\""%f\"",&b);\n        scanf(\""%f\"",&s);\n              \n              s=b-(s-1)/M;\n              \n              printf(\""概率为：.2f%\\n\"",s); \n}",WRONG_ANSWER,30,196
1402608628498403328,fe5536ded20f9f57a45d0777d3d276aca0564d12029068216301f8ac291fef17,2021-06-09 20:48:50,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main ()\n{\n    int b,s;\n    float M;\n        \n        printf(\""输入第b位游客:\"");\n        printf(\""输入共M位游客:\"");\n        scanf(\""%f\"",&b);\n        scanf(\""%f\"",&s);\n              \n              s=b-(s-1)/M;\n              \n              printf(\""概率为：.2f%\\n\"",s); \n}",WRONG_ANSWER,8,292
1402608700468465664,bee626834797b1c52a3ae18a2b79306e5fba4265f81a5ea7b896ddd2c054e2bf,2021-06-09 20:49:08,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main(){\n   int n;\n    int i=0;\n    scanf(\""%d\\n\"",&n);\n    for(i;i<n-1;i++){\n        (void)scanf(\""%d\\n\"",&i);\n    }\n     for(double j=1;j<n;j++){\n        printf(\""%.3f\\n\"",1/j);\n     }\n     double a = n;\n     printf(\""%.3f\"",1/a);\n    return 0;\n}",WRONG_ANSWER,8,328
1402608729635655680,0e4ac9eaf609d96fcedd690566c06a1c44e409d9eca7bf3ceacd39d479c784b1,2021-06-09 20:49:14,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{ \n    int a=0;\n    int j=0;\n    int i=0;\n    float answer=0;\n    \n    scanf(\""%d\"",&a);\n    for(j;j<a;j++){\n        \n        scanf(\""%d\"",&i);\n        answer=(1/2)^(i);\n        printf(\""%lf \\n\"",answer);\n    }\n    return 0;\n}",WRONG_ANSWER,7,324
1402608996250783744,a7b07ad6f0d65c15e122ac17917a80d283730bee4c41e498f79c7fc4a1b751e1,2021-06-09 20:50:18,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\tfloat p;\n\tfor(i=0;i<n;i++)\n\t\t{\t\t\n\t\tprintf(\""%.3f\"",1-(i/n));\n\t\tprintf(\""\\n\"");\n\t\t}\n}",WRONG_ANSWER,8,192
1402609131412295680,a7b07ad6f0d65c15e122ac17917a80d283730bee4c41e498f79c7fc4a1b751e1,2021-06-09 20:50:50,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main()\n{\n\tprintf(\""1.000\"");\n\t\tprintf(\""\\n\"");\n\t\tprintf(\""0.500\"");\n}",WRONG_ANSWER,8,344
1402609177201446912,bee626834797b1c52a3ae18a2b79306e5fba4265f81a5ea7b896ddd2c054e2bf,2021-06-09 20:51:01,C,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main(){\n   int n;\n    int i=0;\n    scanf(\""%d\\n\"",&n);\n    for(i;i<n-1;i++){\n        (void)scanf(\""%d\\n\"",&i);\n    }\n     for(double j=1;j<n;j++){\n        printf(\""%.3f\\n\"",1/j);\n     }\n     double a = n;\n     printf(\""%.3f\"",1/a);\n    return 0;\n}",WRONG_ANSWER,9,328
1402609207434055680,0e4ac9eaf609d96fcedd690566c06a1c44e409d9eca7bf3ceacd39d479c784b1,2021-06-09 20:51:08,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{ \n    int a=0;\n    int j=0;\n    int i=0;\n    double answer=0;\n    \n    scanf(\""%d\"",&a);\n    for(j;j<a;j++){\n        \n        scanf(\""%d\"",&i);\n        answer=(1/2)^(i);\n        printf(\""1.000  %lf \\n\"",answer);\n    }\n    return 0;\n}",WRONG_ANSWER,12,196
1402609213389901824,bee626834797b1c52a3ae18a2b79306e5fba4265f81a5ea7b896ddd2c054e2bf,2021-06-09 20:51:10,C++,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main(){\n   int n;\n    int i=0;\n    scanf(\""%d\\n\"",&n);\n    for(i;i<n-1;i++){\n        (void)scanf(\""%d\\n\"",&i);\n    }\n     for(double j=1;j<n;j++){\n        printf(\""%.3f\\n\"",1/j);\n     }\n     double a = n;\n     printf(\""%.3f\"",1/a);\n    return 0;\n}",WRONG_ANSWER,11,340
1402609344671682560,0e4ac9eaf609d96fcedd690566c06a1c44e409d9eca7bf3ceacd39d479c784b1,2021-06-09 20:51:41,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{ \n    int a=0;\n    int j=0;\n    int i=0;\n    double answer=0;\n    \n    scanf(\""%d\"",&a);\n    for(j;j<a;j++){\n        \n        scanf(\""%d\"",&i);\n        answer=(1/2)^(i);\n        printf(\""1.000\"");\n    }\n    return 0;\n}",WRONG_ANSWER,18,196
1402609856112463872,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 20:53:43,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n\n\tfor(i=0;i<k=n;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",COMPILE_ERROR,0,0
1402609895597641728,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 20:53:52,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,9,340
1402610009338843136,8e5ab266a48298798e73c876fa79e361ef09c1ec2ba4d5d668a98afb444f8918,2021-06-09 20:54:20,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,n,a;\n    scanf(\""%d\\n\"",&m);\n    scanf(\""%d\\n\"",&n);\n    scanf(\""%d\\n\"",&a);\n    if(n<=1)\n        printf(\""1.000\\n\"");\n     if(a>1)\n        printf(\""0.500\"");\n    return 0;\n}",WRONG_ANSWER,8,320
1402610289178546176,8e5ab266a48298798e73c876fa79e361ef09c1ec2ba4d5d668a98afb444f8918,2021-06-09 20:55:26,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nint main()\n{\n    int m,n,a;\n    scanf(\""%d\\n\"",&m);\n    scanf(\""%d\\n\"",&n);\n    scanf(\""%d\\n\"",&a);\n    if(n<=1)\n        printf(\""1.000\\n\"");\n     if(a>1)\n        printf(\""0.500\"");\n    return 0;\n}",WRONG_ANSWER,8,344
1402610305041469440,bee626834797b1c52a3ae18a2b79306e5fba4265f81a5ea7b896ddd2c054e2bf,2021-06-09 20:55:30,C++,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main(){\n   int M,N;\n    scanf(\""%d\\n\"",&M);\n    for(int i;i<M-1;i++){\n        (void)scanf(\""%d\\n\"",&N);\n    }\n     for(double j=1;j<M;j++){\n        printf(\""%.3f\\n\"",1/j);\n     }\n     double a = M;\n     printf(\""%.3f\"",1/a);\n    return 0;\n}",WRONG_ANSWER,26,248
1402610663524372480,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 20:56:56,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,9,328
1402610702858555392,a8405f66a81323d12c60fecbcf4e5a4cad2928784848ab9e3980d0f35a63b1d8,2021-06-09 20:57:05,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cstdio>\n#include<cstring>\n#include<set>\nusing namespace std;\nint t;\nint main()\n{\n\tcin>>t;\n\twhile (t--)\n\t{\n\t\tint x;\n\t\tcin>>x;\n\t\tprintf(\""%.3f\\n\"", 1.0/x);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,15,412
1402610898892001280,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 20:57:52,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n    k=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,17,200
1402610925274173440,bee626834797b1c52a3ae18a2b79306e5fba4265f81a5ea7b896ddd2c054e2bf,2021-06-09 20:57:58,C++,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main(){\n   int M,N;\n    (void)scanf(\""%d\\n\"",&M);\n    for(int i;i<M-1;i++){\n        (void)scanf(\""%d\\n\"",&N);\n    }\n     for(double j=1;j<M;j++){\n        printf(\""%.3f\\n\"",1/j);\n     }\n     double a = M;\n     printf(\""%.3f\"",1/a);\n    return 0;\n}",WRONG_ANSWER,8,340
1402610982031429632,3e41993bec765f219c6146ff80d2c5e551ad8ffc867f81c9212a1cce8827ad30,2021-06-09 20:58:12,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\nusing namespace std;\n\n\nint main(){\n\tint n;\n\tcin>>n;\n\tdouble m;\n\twhile(n--){\n\t\tcin>>m;\n\t\tdouble k=1;\n\t\t/*for(double i=m;i>1;i--){\n\t\t\tk=k*((i-1)/i);\n\t\t}*/\n\t\tprintf(\""%.3f\\n\"",k/m);\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,19,416
1402610988738121728,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 20:58:13,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n\n\tfor(i=0;i<n;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,10,288
1402611017502724096,bee626834797b1c52a3ae18a2b79306e5fba4265f81a5ea7b896ddd2c054e2bf,2021-06-09 20:58:20,C++,0.0,1402531086542356485,1396456000062107648,56,"#include <stdio.h>\nint main(){\n   int M,N;\n    (void)scanf(\""%d\\n\"",&M);\n    for(int i;i<M-1;i++){\n        (void)scanf(\""%d\\n\"",&N);\n    }\n     for(double j=1;j<M;j++){\n        printf(\""%.3f\\n\"",1/j);\n     }\n     double a = M;\n     printf(\""%.3f\"",1/a);\n//     return 0;\n}",WRONG_ANSWER,8,324
1402611088491253760,a8405f66a81323d12c60fecbcf4e5a4cad2928784848ab9e3980d0f35a63b1d8,2021-06-09 20:58:37,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint t;\nlong long fac(int x)\n{\n\tlong long ans = 1;\n\tfor (int i = 2; i <= x; i++)\n\t\tans *= i;\n\treturn ans;\n}\nint main()\n{\n\tcin>>t;\n\twhile (t--)\n\t{\n\t\tint x;\n\t\tcin>>x;\n\t\tprintf(\""%.3f\\n\"", 1.0/fac(x));\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,13,312
1402611174931664896,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 20:58:58,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n,int k)\n{\n\tint i,k;\n\tfloat p,a=1;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i],n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",COMPILE_ERROR,0,0
1402611287125102592,a8405f66a81323d12c60fecbcf4e5a4cad2928784848ab9e3980d0f35a63b1d8,2021-06-09 20:59:24,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint t;\nlong long fac(int x)\n{\n\tlong long ans = 1;\n\tfor (int i = 2; i <= x; i++)\n\t\tans *= i;\n\treturn ans;\n}\nint main()\n{\n    cin.sync_with_stdio(false);\n    cin.tie(0);\n\tcin>>t;\n\twhile (t--)\n\t{\n\t\tint x;\n\t\tcin>>x;\n\t\tprintf(\""%.3f\\n\"", 1.0/fac(x));\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,10,448
1402611357992128512,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 20:59:41,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n,int k)\n{\n\tint i;\n\tfloat p,a=1;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i],n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,13,368
1402611359019667456,2d0529d2b46f5dfaca6555468421fc6f146257afe958e95b5dc70e200ede1e74,2021-06-09 20:59:41,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n\nint main()\n{\n    int a,b,c;\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    scanf(\""%d\"",&c);\n    double x=1.000;\n    double y=0.500;\n    printf(\""%.3f\"",x);\n    printf(\""%.3f\"",y);\n    \n    return 0;\n}",WRONG_ANSWER,8,472
1402611475067736064,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:00:09,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n,int k)\n{\n\tint i;\n\tfloat p,a=1;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i],n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,9,316
1402611489496141824,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:00:13,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n,int k)\n{\n\tint i;\n\tfloat p,a=1;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i],n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,7,340
1402611502397820928,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:00:16,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n,int k)\n{\n\tint i;\n\tfloat p,a=1;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i],n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,7,292
1402611606345191424,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:00:40,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,9,200
1402611844804022272,a8405f66a81323d12c60fecbcf4e5a4cad2928784848ab9e3980d0f35a63b1d8,2021-06-09 21:01:37,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint t;\ndouble save[100000];\nint main()\n{\n\tsave[1] = 1;\n\tfor (int i = 2; i <= 10000; i++)\n\t\tsave[i] = save[i-1]*i;\n\tcin>>t;\n\twhile (t--)\n\t{\n\t\tint x;\n\t\tcin>>x;\n\t\tprintf(\""%.3f\\n\"", 1.0/save[x]);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,11,600
1402611891515920384,a8405f66a81323d12c60fecbcf4e5a4cad2928784848ab9e3980d0f35a63b1d8,2021-06-09 21:01:48,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint t;\ndouble save[200000];\nint main()\n{\n\tsave[1] = 1;\n\tfor (int i = 2; i <= 100000; i++)\n\t\tsave[i] = save[i-1]*i;\n\tcin>>t;\n\twhile (t--)\n\t{\n\t\tint x;\n\t\tcin>>x;\n\t\tprintf(\""%.3f\\n\"", 1.0/save[x]);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,16,1144
1402611918904725504,a8405f66a81323d12c60fecbcf4e5a4cad2928784848ab9e3980d0f35a63b1d8,2021-06-09 21:01:55,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint t;\ndouble save[2000000];\nint main()\n{\n\tsave[1] = 1;\n\tfor (int i = 2; i <= 1000000; i++)\n\t\tsave[i] = save[i-1]*i;\n\tcin>>t;\n\twhile (t--)\n\t{\n\t\tint x;\n\t\tcin>>x;\n\t\tprintf(\""%.3f\\n\"", 1.0/save[x]);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,33,8264
1402611948688478208,a8405f66a81323d12c60fecbcf4e5a4cad2928784848ab9e3980d0f35a63b1d8,2021-06-09 21:02:02,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint t;\ndouble save[20000000];\nint main()\n{\n\tsave[1] = 1;\n\tfor (int i = 2; i <= 10000000; i++)\n\t\tsave[i] = save[i-1]*i;\n\tcin>>t;\n\twhile (t--)\n\t{\n\t\tint x;\n\t\tcin>>x;\n\t\tprintf(\""%.3f\\n\"", 1.0/save[x]);\n\t}\n\treturn 0;\n}\n",MEMORY_LIMIT_EXCEEDED,0,0
1402611983618641920,a8405f66a81323d12c60fecbcf4e5a4cad2928784848ab9e3980d0f35a63b1d8,2021-06-09 21:02:10,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint t;\ndouble save[10000000];\nint main()\n{\n\tsave[1] = 1;\n\tfor (int i = 2; i < 10000000; i++)\n\t\tsave[i] = save[i-1]*i;\n\tcin>>t;\n\twhile (t--)\n\t{\n\t\tint x;\n\t\tcin>>x;\n\t\tprintf(\""%.3f\\n\"", 1.0/save[x]);\n\t}\n\treturn 0;\n}\n",MEMORY_LIMIT_EXCEEDED,0,0
1402611984390393856,3e41993bec765f219c6146ff80d2c5e551ad8ffc867f81c9212a1cce8827ad30,2021-06-09 21:02:10,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\nusing namespace std;\n\n\nint main(){\n\tint n;\n\tcin>>n;\n\tdouble m;\n\twhile(n--){\n\t\tcin>>m;\n\t\tdouble k=1;\n\t\tprintf(\""%.3f\"",k/m);\n        if(n!=0)printf(\""\\n\"");\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,8,452
1402612017466740736,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:02:18,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,8,400
1402612039356747776,a8405f66a81323d12c60fecbcf4e5a4cad2928784848ab9e3980d0f35a63b1d8,2021-06-09 21:02:24,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint t;\ndouble save[10000000];\nint main()\n{\n\tsave[1] = 1;\n\tfor (int i = 2; i < 5000000; i++)\n\t\tsave[i] = save[i-1]*i;\n\tcin>>t;\n\twhile (t--)\n\t{\n\t\tint x;\n\t\tcin>>x;\n\t\tprintf(\""%.3f\\n\"", 1.0/save[x]);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,81,39488
1402612190435643392,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:03:00,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nint main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,8,360
1402612254549774336,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:03:15,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nint main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n    return 0;\n}",WRONG_ANSWER,7,312
1402612603050233856,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:04:38,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[5];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",MULTIPLE_ERROR,6,356
1402612644020195328,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:04:48,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p,a=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,9,340
1402612683262103552,af72d8652b033ddf22e1b02f8cd163863fda947d944d55995ce847480f8fdd60,2021-06-09 21:04:57,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int M,N,i,j,y=1,a[N],n;\n    float x=1;\n    scanf(\""%d\"",&M);\n    scanf(\""%d\"",&N);\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",a[N]);\n    for(i=1;i<n;i++){\n            x*=N-2/N-1;\n             N--;\n    }\n    printf(\""%d\"",x)\n        printf(\""\\n\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1402612708071477248,af72d8652b033ddf22e1b02f8cd163863fda947d944d55995ce847480f8fdd60,2021-06-09 21:05:03,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int M,N,i,j,y=1,a[N],n;\n    float x=1;\n    scanf(\""%d\"",&M);\n    scanf(\""%d\"",&N);\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",a[N]);\n    for(i=1;i<n;i++){\n            x*=N-2/N-1;\n             N--;\n    }\n    printf(\""%d\"",x)\n        printf(\""\\n\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1402612782503596032,9883c5dde012a18289318158c46384df5a92d00014b65c9825d1ba8028d71172,2021-06-09 21:05:21,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nvoid main()\n{\n\tint n,i;\n\tfloat pi,p;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)scanf(\""%d\"",&i);\n\tif(i>=1)printf(\""1.000\\n\"");\n\tfor(i=2;i<=n;i++)\n\t{pi=(float)(i-1)/i;\n\tp=pi;\n\tprintf(\""%.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,9,348
1402613029451567104,9883c5dde012a18289318158c46384df5a92d00014b65c9825d1ba8028d71172,2021-06-09 21:06:20,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\nvoid main()\n{\n\tint n,i;\n\tfloat pi,p;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)scanf(\""%d\"",&i);\n\tprintf(\""1.000\\n\"");\n\tfor(i=2;i<=n;i++)\n\t{pi=(float)(i-1)/i;\n\tp=1-pi;\n\tprintf(\""%.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,10,328
1402613156916531200,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:06:50,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nvoid main()\n{\n\n\tint m,i,n[50],c,k;\n\tfloat p,a=1;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\t\tk=n[i];\n\tfor(c=0;c<k;c++,n--)\n\t{\n\t\tp=(m-(n-1))/m;\n\t\ta*=p;\n\t}\n\t\tp=a;\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",COMPILE_ERROR,0,0
1402613570340687872,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:08:29,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\n\t\t\n\t}\n\treturn (a);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",COMPILE_ERROR,0,0
1402613710233309184,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:09:02,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\n\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,8,320
1402614140103331840,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:10:44,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\n\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,11,300
1402614149108502528,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:10:47,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\n\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,10,300
1402614167320104960,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:10:51,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\n\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,7,324
1402614181119430656,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:10:54,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\n\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,8,344
1402614194977411072,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:10:58,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\n\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,7,344
1402614209011552256,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:11:01,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\n\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,9,196
1402614222546571264,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:11:04,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\n\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,10,340
1402614235729268736,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:11:07,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\n\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,13,464
1402614249293647872,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:11:11,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\n\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,9,196
1402614262824472576,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:11:14,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\n\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,9,336
1402614279119278080,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:11:18,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\n\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,10,340
1402614292020957184,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:11:21,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\n\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,8,336
1402614306503954432,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:11:24,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\n\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,18,484
1402614319481131008,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:11:27,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\n\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,9,188
1402615168743739392,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:14:50,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int *n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=*n;\n\tfor(i=0;i<k;i++,*n--)\n\t{\n\t\tp*=(m-(*n-1))/m;\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,*n[];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,*n);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",COMPILE_ERROR,0,0
1402615208837156864,7e6e36892891006b0c6074dfec1f384951b7637168a2c2e16c065705fc1ec9b2,2021-06-09 21:14:59,C,0.0,1402531086542356485,1396456000062107648,56,"#include<stdio.h>\n#include<math.h>\nfloat pp(float m,int n)\n{\n\tint i,k;\n\tfloat p=1;\n\tk=n;\n\tfor(i=0;i<k;i++,n--)\n\t{\n\t\tp*=(m-(n-1))/m;\t\t\n\t}\n\treturn (p);\n}\nvoid main()\n{\n\tint m,i,n[50];\n\tfloat p;\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++)\n\t{\t\n\t\tscanf(\""%d\"",&n[i]);\n\t\tp=pp(m,n[i]);\n\t\tprintf(\""%0.3f\\n\"",p);\n\t}\n}",WRONG_ANSWER,9,340
1402615307562618880,fbbd79efc109aec7d9dcd09c548cc0a73882f14fcf92591662685ed77d21517e,2021-06-09 21:15:23,C++,0.0,1402531086542356485,1396456000062107648,56,"\n#include<bits/stdc++.h>\nusing namespace std;\n\ndouble asd(int a, int b)\n{\n\tif (b == 1)return 1.0;\n\tdouble l = 1.0;\n\tfor (int i = 0; i < b-1; i++)\n\t{\n\t\tl *= 1.0 / (a - i);\n\t}\n\treturn l;\n}\nint main()\n{\n\tint a, b, c, d, i;\n\tcin >> a;\n\tfor (i = 0; i < a; i++)\n\t{\n\t\tcin >> b;\n\t\tprintf(\""%.3f\\n\"", asd(a, b));\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,12,444
1402616525542363136,fbbd79efc109aec7d9dcd09c548cc0a73882f14fcf92591662685ed77d21517e,2021-06-09 21:20:13,C++,0.0,1402531086542356485,1396456000062107648,56,"\n#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint a, b, c, d, i, j=2;\n\tdouble arr[100] = { 1 };\n\tcin >> a;\n\tdouble l = 1.0;\n\tfor (int i = 0; i < a; i++)\n\t{\n\t\tl *= 1.0 / (a - i);\n\t\tarr[j++] = l;\n\t}\n\tfor (i = 0; i < a; i++)\n\t{\n\t\tcin >> b;\n\t\tprintf(\""%.3f\\n\"", arr[b]);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,10,468
1402616679976701952,fbbd79efc109aec7d9dcd09c548cc0a73882f14fcf92591662685ed77d21517e,2021-06-09 21:20:50,C++,0.0,1402531086542356485,1396456000062107648,56,"\n#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint a, b, c, d, i, j=2;\n\tdouble arr[100000] = { 1 };\n\tcin >> a;\n\tdouble l = 1.0;\n\tfor (int i = 0; i < a; i++)\n\t{\n\t\tl *= 1.0 / (a - i);\n\t\tarr[j++] = l;\n\t}\n\tfor (i = 0; i < a; i++)\n\t{\n\t\tcin >> b;\n\t\tprintf(\""%.3f\\n\"", arr[b]);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,14,1192
1402616741813260288,fbbd79efc109aec7d9dcd09c548cc0a73882f14fcf92591662685ed77d21517e,2021-06-09 21:21:05,C++,0.0,1402531086542356485,1396456000062107648,56,"\n#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint a, b, c, d, i, j=2;\n\tdouble arr[10000] = { 1 };\n\tcin >> a;\n\tdouble l = 1.0;\n\tfor (int i = 0; i < a; i++)\n\t{\n\t\tl *= 1.0 / (a - i);\n\t\tarr[j++] = l;\n\t}\n\tfor (i = 0; i < a; i++)\n\t{\n\t\tcin >> b;\n\t\tprintf(\""%.30f\\n\"", arr[b]);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,13,564
1402616751854489600,33dd1558df6ebb25ef453ce36395fb27b59ecad5e2955b1d65e1274db775ea4f,2021-06-09 21:21:07,C,0.0,1402531086542356485,1396456000062107648,56,"#include<bits/stdc++.h>\nint main(){\n\tint n;\n    int m;\n\tdouble q=0;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++){\n\t\t\n\t\tscanf(\""%d\"",&m);\n\t\t\tfor(int j=0;j<m;j++){\n\t\t\t\tq+=pow(0.5,j);\n\t\t\t}\n\t\t\tprintf(\""%.3lf\"",1-q);\n\t\tif(i!=n-1){\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t} \n\t\n}",COMPILE_ERROR,0,0
1402616801108201472,33dd1558df6ebb25ef453ce36395fb27b59ecad5e2955b1d65e1274db775ea4f,2021-06-09 21:21:19,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint n;\n    int m;\n\tdouble q=0;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++){\n\t\t\n\t\tscanf(\""%d\"",&m);\n\t\t\tfor(int j=0;j<m;j++){\n\t\t\t\tq+=pow(0.5,j);\n\t\t\t}\n\t\t\tprintf(\""%.3lf\"",1-q);\n\t\tif(i!=n-1){\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t} \n\t\n}",WRONG_ANSWER,13,456
1402617005177802752,fbbd79efc109aec7d9dcd09c548cc0a73882f14fcf92591662685ed77d21517e,2021-06-09 21:22:08,C++,0.0,1402531086542356485,1396456000062107648,56,"\n#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint a, b, c, d, i, j=2;\n\tdouble arr[10000] = { 1 };\n\tcin >> a;\n    arr[1]=1.0;\n\tdouble l = 1.0;\n\tfor (int i = 0; i < a; i++)\n\t{\n\t\tl *= 1.0 / (a - i);\n\t\tarr[j++] = l;\n\t}\n\tfor (i = 0; i < a; i++)\n\t{\n\t\tcin >> b;\n\t\tprintf(\""%.3f\\n\"", arr[b]);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,9,456
1402618027291938816,fbbd79efc109aec7d9dcd09c548cc0a73882f14fcf92591662685ed77d21517e,2021-06-09 21:26:11,C++,0.0,1402531086542356485,1396456000062107648,56,"\n#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint a, b, c, d, i, j=2;\n\tdouble arr[100000] = { 1 };\n\tcin >> a;\n    arr[1]=1.0;\n\tdouble l = 1.0;\n\tfor (int i = 0; i < a; i++)\n\t{\n\t\tl *= 1.0 / (a - i);\n\t\tarr[j++] = l;\n\t}\n\tfor (i = 0; i < a; i++)\n\t{\n\t\tcin >> b;\n\t\tprintf(\""%.3f\\n\"", arr[b]);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,11,1228
1402618085634772992,fbbd79efc109aec7d9dcd09c548cc0a73882f14fcf92591662685ed77d21517e,2021-06-09 21:26:25,C++,0.0,1402531086542356485,1396456000062107648,56,"\n#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint a, b, c, d, i, j=2;\n\tdouble arr[1000000] = { 1 };\n\tcin >> a;\n    arr[1]=1.0;\n\tdouble l = 1.0;\n\tfor (int i = 0; i < a; i++)\n\t{\n\t\tl *= 1.0 / (a - i);\n\t\tarr[j++] = l;\n\t}\n\tfor (i = 0; i < a; i++)\n\t{\n\t\tcin >> b;\n\t\tprintf(\""%.3f\\n\"", arr[b]);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,20,8128
1402618122875998208,fbbd79efc109aec7d9dcd09c548cc0a73882f14fcf92591662685ed77d21517e,2021-06-09 21:26:34,C++,0.0,1402531086542356485,1396456000062107648,56,"\n#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint a, b, c, d, i, j=2;\n\tdouble arr[10000000] = { 1 };\n\tcin >> a;\n    arr[1]=1.0;\n\tdouble l = 1.0;\n\tfor (int i = 0; i < a; i++)\n\t{\n\t\tl *= 1.0 / (a - i);\n\t\tarr[j++] = l;\n\t}\n\tfor (i = 0; i < a; i++)\n\t{\n\t\tcin >> b;\n\t\tprintf(\""%.3f\\n\"", arr[b]);\n\t}\n\treturn 0;\n}\n",SEGMENTATION_FAULT,9,452
1402620903921848320,a8405f66a81323d12c60fecbcf4e5a4cad2928784848ab9e3980d0f35a63b1d8,2021-06-09 21:37:37,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint t;\ndouble save[10000000];\nint main()\n{\n\tcin>>t;\n\twhile (t--)\n\t{\n\t\tint x;\n\t\tcin>>x;\n\t\tprintf(\""%.3f\\n\"", 1.0/x);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,11,448
1402622248129171456,a8405f66a81323d12c60fecbcf4e5a4cad2928784848ab9e3980d0f35a63b1d8,2021-06-09 21:42:58,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint t;\nint main()\n{\n\tcin>>t;\n\twhile (t--)\n\t{\n\t\tint x;\n\t\tcin>>x;\n\t\tdouble ans = 1;\n\t\tfor (; x >= 2; x--)\n\t\t\tans -= 1.0/x;\n\t\tprintf(\""%.3f\\n\"", ans);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,9,436
1402622487972057088,33dd1558df6ebb25ef453ce36395fb27b59ecad5e2955b1d65e1274db775ea4f,2021-06-09 21:43:55,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint n;\n    int m;\n\tdouble q=0;\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tcin>>m;\n\t\tif(m==1){\n\t\t\tcout<<\""1.000\"";\n\t\t}else{\n\t\t\n\t\tfor(int j=1;j<m;j++){\n\t\t\tq+=pow(0.5,j);\n\t\t}\n        printf(\""%.3lf\"",1-q);\n    }\n\t\tif(i!=n-1){\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t} \n\t\n}",WRONG_ANSWER,11,488
1402622633422131200,a8405f66a81323d12c60fecbcf4e5a4cad2928784848ab9e3980d0f35a63b1d8,2021-06-09 21:44:29,C++,0.0,1402531086542356485,1396456000062107648,56,"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint t;\nint main()\n{\n\tcin>>t;\n\twhile (t--)\n\t{\n\t\tint x;\n\t\tcin>>x;\n\t\tdouble ans = 1;\n\t\tif (x != 1)\n\t\t\tans = 1.0/x/(x-1);\n\t\tprintf(\""%.3f\\n\"", ans);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,11,376
1404277054551150592,9124fa22e1613330a2cb474feba7e2381d997957948d910078dd4bf5f319937b,2021-06-14 11:18:34,C++,300.0,1402553813462466563,1402551304773722112,385,"#include<bits/stdc++.h>\nusing namespace std;\nint n,a;\nint main(){\n    cin >> n;\n    while(n--){\n        cin >> a;\n        if(a%2==0){\n            cout <<\""xrf wins\""<<endl;\n        }\n        else{\n            cout <<\""lyx wins\""<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,5,320
1404344963365392384,bb9e3f1615232abe7f6e8aee7a916b55c663b75add7c7c18bdf74d265aecff1d,2021-06-14 15:48:25,C++,300.0,1402553813462466563,1402551304773722112,385,"#include<iostream>\nusing namespace std;\n\nint n, m;\n\n/*只要将数字分割成两个绝对失败的数字 就可获胜 \n1\t\tl\n2=1+1\tw\n3=1+2\tl\n4=1+3\tw\n5=1+4\tl\n6=3+3\tw\n7=1+6\tl\n*/\n\nint main()\n{\n\tscanf(\""%d\"", &n);\n\twhile (n--) {\n\t\tscanf(\""%d\"", &m);\n\t\tif (m % 2) {\n\t\t\tprintf(\""lyx wins\\n\"");\n\t\t}\n\t\telse {\n\t\t\tprintf(\""xrf wins\\n\"");\n\t\t}\n\t}\n}",ACCEPTED,6,320
1404401177684758528,14771b9b87da0660e111ef3a19d9c6aa1e800db6eaf5271c7e7212333444ed0e,2021-06-14 19:31:47,C++,300.0,1402553813462466563,1402551304773722112,385,"#include<iostream>\nusing namespace std;\n/*博弈论专题*/\nint main(){\n\tint nn, num;\n\tcin>>nn;\n\tfor(int i=0;i<nn;i++){\n\t\tcin>>num;\n\t\tif(num%2!=0)cout<<\""lyx wins\""<<endl;\n\t\telse cout<<\""xrf wins\""<<endl;\n\t}\n\treturn 0;\n}",ACCEPTED,4,448
1404751129685921792,20224aaaaa484395d1d3450fa594567f239aa4178fe9c0292311885b89397fd7,2021-06-15 18:42:22,C++,300.0,1402553813462466563,1402551304773722112,385,"#include<iostream>\nusing namespace std;\nint n, m;\nint main()\n{\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tcin>>m;\n\t\tif(m%2 == 0) cout<<\""xrf wins\\n\"";\n\t\telse cout<<\""lyx wins\\n\"";\n\t}\n\treturn 0;\n}",ACCEPTED,4,316
1405410518247960576,957fba03c81366491abc9757cae69fe1115104e0f3088e68bacd594113b1dc50,2021-06-17 14:22:33,C++,300.0,1402553813462466563,1402551304773722112,385,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n; cin >>n;\n    while(n--)\n    {\n        int m; cin>>m;\n    if(m%2==0)\n        cout<<\""xrf wins\\n\"";\n        else \n            cout<<\""lyx wins\\n\"";\n    }\n\n    return 0;\n}",ACCEPTED,5,316
1405450371593498624,52b08b1ee0a8d63012bb374cd79aa89db7fda366698720e6b2a2e66dd37b0daf,2021-06-17 17:00:55,C++,300.0,1402553813462466563,1402551304773722112,385,"#include<iostream>\nusing namespace std;\nint main(){\n    int n;\n    cin>>n;\n    int m;\n    while(n--){\n        cin>>m;\n        if(m%2==0) cout<<\""xrf wins\""<<endl;\n        else cout <<\""lyx wins\""<<endl;\n    }\n    return 0;\n}\n",ACCEPTED,8,444
1405517591653011456,1bb9459805f3ac3a730d5d84f09bea2c5291c4c9020c6135141990f95403f907,2021-06-17 21:28:01,C++,300.0,1402553813462466563,1402551304773722112,385,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint num;\n\tscanf(\""%d\"",&num);\n\twhile(num--)\n\t{\n\t\tint n;\n\t\tscanf(\""%d\"",&n);\n\t\tif(n%2==0)\n\t\tprintf(\""xrf wins\\n\"");\n\t\telse\n\t\tprintf(\""lyx wins\\n\"");\n\t}\n\treturn 0;\n} \n",ACCEPTED,7,328
1405519942371659776,244ab2121bdb7531ee5bf728513b510916f54838ec86b40ab23555550022f4b7,2021-06-17 21:37:22,C++,0.0,1402553813462466563,1402551304773722112,385,"#include<iostream>\n#include<cstdio>\n#include<cstdio>\n#include<cmath>\nusing namespace std;\nint read(int & n)\n{\n   char c='-';int x=0;\n    while(c<'0'||c>'9')c=getchar();\n    while(c>='0'&&c<='9')\n    {\n        x=x*10+(c-48);\n        c=getchar();\n    }\n    n=x;\n}\nint main()\n{\n    int n;\n    read(n);\n    for(int i=1;i<=n;i++)\n    {\n        long long p;\n        cin>>p;\n        if(p%2==0)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,6,316
1405520088421519360,244ab2121bdb7531ee5bf728513b510916f54838ec86b40ab23555550022f4b7,2021-06-17 21:37:57,C++,0.0,1402553813462466563,1402551304773722112,385,"#include<iostream>\n#include<cstdio>\n#include<cstdio>\n#include<cmath>\nusing namespace std;\nint read(int & n)\n{\n   char c='-';int x=0;\n    while(c<'0'||c>'9')c=getchar();\n    while(c>='0'&&c<='9')\n    {\n        x=x*10+(c-48);\n        c=getchar();\n    }\n    n=x;\n}\nint main()\n{\n    int n;\n    read(n);\n    for(int i=1;i<=n;i++)\n    {\n        long long p;\n        cin>>p;\n        if(p%2==0)\n            printf(\""xrf wins\\n\"");\n        else\n            printf(\""lxy wins\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,7,300
1405520617574592512,244ab2121bdb7531ee5bf728513b510916f54838ec86b40ab23555550022f4b7,2021-06-17 21:40:03,C++,0.0,1402553813462466563,1402551304773722112,385,"#include<cstdio>\nusing namespace std;\nint main()\n{\n\tint T;\n\tscanf(\""%d\"",&T);\n\twhile(T--)\n\t{\n\t\tint n;\n\t\tscanf(\""%d\"",&n);\n\t\tif(n%2==0)\n\t\tprintf(\""xrf wins\\n\"");\n\t\telse\n\t\tprintf(\""lxy wins\\n\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,5,324
1405521025520922624,244ab2121bdb7531ee5bf728513b510916f54838ec86b40ab23555550022f4b7,2021-06-17 21:41:40,C++,0.0,1402553813462466563,1402551304773722112,385,"#include <bits/stdc++.h>\nusing namespace std;\nint n, m;\nint main() { \n\tscanf(\""%d\"", &n);\n\twhile (n--) {\n\t\tscanf(\""%d\"", &m);\n\t\tprintf((m & 1) ? \""lxy wins\\n\"" : \""xrf wins\\n\"");\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,4,324
1405521701919551488,244ab2121bdb7531ee5bf728513b510916f54838ec86b40ab23555550022f4b7,2021-06-17 21:44:21,C++,0.0,1402553813462466563,1402551304773722112,385,"#include<cstdio>\nusing namespace std;\nint main()\n{\n\tint T;\n\tscanf(\""%d\"",&T);\n\twhile(T--)\n\t{\n\t\tint n;\n\t\tscanf(\""%d\"",&n);\n\t\tif(n%2==0)\n\t\tprintf(\""xrf wins\"");\n\t\telse\n\t\tprintf(\""lxy wins\"");\n        if(T!=0) printf(\""\\n\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,4,304
1405521747730124800,244ab2121bdb7531ee5bf728513b510916f54838ec86b40ab23555550022f4b7,2021-06-17 21:44:32,C++,300.0,1402553813462466563,1402551304773722112,385,"#include<cstdio>\nusing namespace std;\nint main()\n{\n\tint T;\n\tscanf(\""%d\"",&T);\n\twhile(T--)\n\t{\n\t\tint n;\n\t\tscanf(\""%d\"",&n);\n\t\tif(n%2==0)\n\t\tprintf(\""xrf wins\"");\n\t\telse\n\t\tprintf(\""lyx wins\"");\n        if(T!=0) printf(\""\\n\"");\n\t}\n\treturn 0;\n}",ACCEPTED,4,200
1402903568835248128,cec7b7573a38ab8b6badf9101cc0ea316f7088cf5db4475e70ad2425f0007959,2021-06-10 16:20:50,C,0.0,1402863530885619712,1396456000062107648,56,"#include <stdio.h>\nint main() {\n\tint i, N, probability;\n\tscanf_s(\""%d\\n\"", &N);\n\tint array[N - 1];\n\tfor ( i = 0; i < N; i++)\n\t{\n\t\tscanf_s(\""%d\\n\"", &array[i]);\n\t}\n\tfor (int j = 0; j <=N; j++)\n\t{\n\t\tprobability = (N - array[i] + 1) / N;\n\t\tif (j != N) {\n\t\t\tprintf(\""%.3f\\n\"", probability);}\n\t\telse\n\t\t{\n\t\t\tprintf(\""%.3f\"", probability);\n\t\t}\n\t\t\n\t}\n\n}",COMPILE_ERROR,0,0
1402903711416418304,cec7b7573a38ab8b6badf9101cc0ea316f7088cf5db4475e70ad2425f0007959,2021-06-10 16:21:24,C,0.0,1402863530885619712,1396456000062107648,56,"#include <stdio.h>\nint main() {\n\tint i, N, probability;\n\tscanf_s(\""%d\\n\"", &N);\n\tint array[N - 1];\n\tfor ( i = 0; i < N; i++)\n\t{\n\t\tscanf_s(\""%d\\n\"", &array[i]);\n\t}\n\tfor (int j = 0; j <=N; j++)\n\t{\n\t\tprobability = (N - array[i] + 1) / N;\n\t\tif (j != N) {\n\t\t\tprintf(\""%.3f\\n\"", probability);}\n\t\telse\n\t\t{\n\t\t\tprintf(\""%.3f\"", probability);\n\t\t}\n\t\t\n\t}\n\n}",COMPILE_ERROR,0,0
1402903863594094592,cec7b7573a38ab8b6badf9101cc0ea316f7088cf5db4475e70ad2425f0007959,2021-06-10 16:22:00,C,0.0,1402863530885619712,1396456000062107648,56,"#include <stdio.h>\nint main() {\n\tint i, N, probability;\n\tscanf(\""%d\\n\"", &N);\n\tint array[N - 1];\n\tfor ( i = 0; i < N; i++)\n\t{\n\t\tscanf(\""%d\\n\"", &array[i]);\n\t}\n\tfor (int j = 0; j <=N; j++)\n\t{\n\t\tprobability = (N - array[i] + 1) / N;\n\t\tif (j != N) {\n\t\t\tprintf(\""%.3f\\n\"", probability);}\n\t\telse\n\t\t{\n\t\t\tprintf(\""%.3f\\n\"", probability);\n\t\t}\n\t\t\n\t}\n\n}",WRONG_ANSWER,16,328
1456521508407549952,f3b7eccbc89e05b8a74d9b6cf5a0de10d7be7d6651be320309cfe5836c360246,2021-11-05 15:19:23,Java,0.0,1402863530885619712,1396456000062107648,56,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int M;\n        M=sc.nextInt();\n        double N[]=new double[M];\n        for(int i=0;i<M;i++){\n            N[i]=sc.nextDouble();\n        }\n        \n        for(int i=0;i<N.length;i++){\n            System.out.printf(\""%.3f\\n\"",(M+1-N[i])/M);\n        }\n    }\n}",WRONG_ANSWER,282,26168
1456530222803365888,f3b7eccbc89e05b8a74d9b6cf5a0de10d7be7d6651be320309cfe5836c360246,2021-11-05 15:54:00,Java,0.0,1402863530885619712,1396456000062107648,56,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int M;\n        M=sc.nextInt();\n        double N[]=new double[M];\n        for(int i=0;i<M;i++){\n            N[i]=sc.nextDouble();\n        }\n        \n        for(int i=0;i<N.length;i++){\n            System.out.printf(\""%.3f\"",(M+1-N[i])/M);\n            if(i<N.length){\n            \tSystem.out.println();\n            }\n        }\n    }\n}",WRONG_ANSWER,302,26344
1456530770575826944,f3b7eccbc89e05b8a74d9b6cf5a0de10d7be7d6651be320309cfe5836c360246,2021-11-05 15:56:11,Java,0.0,1402863530885619712,1396456000062107648,56,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int M;\n        M=sc.nextInt();\n        double N[]=new double[M];\n        for(int i=0;i<M;i++){\n            N[i]=sc.nextDouble();\n        }\n        \n        for(int i=0;i<N.length;i++){\n            System.out.printf(\""%.3f\"",(M+1-N[i])/M);\n            if(i<N.length-1){\n            \tSystem.out.println();\n            }\n        }\n    }\n}",WRONG_ANSWER,279,26132
1406875474466271232,e364e8eafe7495a3f3374acb73fc42e96ed173e3ecfa839763c3b3aa9fee747c,2021-06-21 15:23:46,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    a=int(input())\n    if a%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,32,3272
1406876060365262848,bce18b980054449b232d2fa761b847d3df8da636fa0fe21c9b3885aee555be5f,2021-06-21 15:26:05,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,27,3132
1406880154110857216,49be8697219a3a9f0b409607053efe75a17317ef66b160102dcbd8485ad187b0,2021-06-21 15:42:21,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    q=int(input())\n    if q%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,30,3124
1406891646470225920,389b3924de3a87e2f67d34c687971bb64cef14d074cea3f7839a48f20f28b550,2021-06-21 16:28:01,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,31,3260
1406892741825335296,0ab157c137c98fe4eb528b3b013302678b42b9137ee34cde5c9464b09f321bb6,2021-06-21 16:32:23,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,22,3136
1406893851860471808,6a7d159b77308cc58d941f2ee5e54d813af17f68492bd0e4fa697a46f251ec0c,2021-06-21 16:36:47,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    a=int(input())\n    if a%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,26,3268
1406894034395688960,e14adfd6ae3db4cbc71d02e8d84afac06847a397faad4e33ce58a1e007d6ac86,2021-06-21 16:37:31,Python,0.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    m=int(input()),WRONG_ANSWER,21,3140
1406896355687100416,220465ce1a89ba6e742754d4dbb0833f3cdb8da04f50814f60a97716a89681d2,2021-06-21 16:46:44,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    s=int(input())\n    if s%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,21,3136
1406907096859242496,221a224db06f6cef88d2ddf926219ae847a2772a797c84c032e9900fce239aa4,2021-06-21 17:29:25,Python,10.0,1402976588639346689,1402551304773722112,385,"n=int(input())\nfor i in range(n):\n    a=int(input())\n    k=a-2\n    if k<=0:\n        print(\""lyx wins\"")\n    else:\n        if k%2==0:\n            print(\""xrf wins\"")\n        else:\n            print(\""lyx wins\"")",ACCEPTED,28,3136
1406937659981594624,45ac8ff83effce7fbb9d0ae8a611a9d9ab871b119ed87198b4a3363c51310b15,2021-06-21 19:30:52,Python,0.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    s=int(input())\n    if (s+1)/2==0:\n        print('lyx wins')\n    else:\n        print('xrf wins'),WRONG_ANSWER,24,3116
1406937691555459072,45ac8ff83effce7fbb9d0ae8a611a9d9ab871b119ed87198b4a3363c51310b15,2021-06-21 19:30:59,Python,0.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    s=int(input())\n    if (s+1)//2==0:\n        print('lyx wins')\n    else:\n        print('xrf wins'),WRONG_ANSWER,18,3128
1406937756102463488,45ac8ff83effce7fbb9d0ae8a611a9d9ab871b119ed87198b4a3363c51310b15,2021-06-21 19:31:15,Python,0.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    s=int(input())\n    if (s+1)//2!=0:\n        print('lyx wins')\n    else:\n        print('xrf wins'),WRONG_ANSWER,29,3252
1406937897232400384,45ac8ff83effce7fbb9d0ae8a611a9d9ab871b119ed87198b4a3363c51310b15,2021-06-21 19:31:49,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    s=int(input())\n    if (s+1)%2==0:\n        print('lyx wins')\n    else:\n        print('xrf wins'),ACCEPTED,26,3068
1406961019532775424,37e604d3b7247a08dff3362f8ce8544139ccef2f01fede66f27f4c30a05059e8,2021-06-21 21:03:41,Python,0.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    s=int(input())\n    if s%2==0:\n        print('xrf wins!')\n    else:\n        print('lyx wins!'),WRONG_ANSWER,26,3120
1406961080169861120,37e604d3b7247a08dff3362f8ce8544139ccef2f01fede66f27f4c30a05059e8,2021-06-21 21:03:56,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    s=int(input())\n    if s%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,45,3120
1406981065269219328,e0391be97d7cf37cb0ee4f6efa1b6167f8ea5cbba9194ec93d75b1cb424fec68,2021-06-21 22:23:21,Python,0.0,1402976588639346689,1402551304773722112,385,N=int(input())\nfor i in range(N):\n    M=int(input())\n    if M%2==0:\n        print('xyf wins')\n    else:\n        print('lyx wins'),WRONG_ANSWER,23,3148
1406981087465508864,e0391be97d7cf37cb0ee4f6efa1b6167f8ea5cbba9194ec93d75b1cb424fec68,2021-06-21 22:23:26,Python,0.0,1402976588639346689,1402551304773722112,385,N=int(input())\nfor i in range(N):\n    M=int(input())\n    if M%2!=0:\n        print('xyf wins')\n    else:\n        print('lyx wins'),WRONG_ANSWER,31,3260
1406981169782886400,e0391be97d7cf37cb0ee4f6efa1b6167f8ea5cbba9194ec93d75b1cb424fec68,2021-06-21 22:23:45,Python,10.0,1402976588639346689,1402551304773722112,385,N=int(input())\nfor i in range(N):\n    M=int(input())\n    if M%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,28,3136
1406988332714590208,382e30411cb25b35220e7f2fa3bc654a74f68065fdae5a589275ae7d84e3303f,2021-06-21 22:52:13,Python,0.0,1402976588639346689,1402551304773722112,385,"n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%4==0:\n        print(\""lyx wins!\"")\n    else:\n        print(\""xrf wins!\"")\n",WRONG_ANSWER,21,3136
1406988413786329088,382e30411cb25b35220e7f2fa3bc654a74f68065fdae5a589275ae7d84e3303f,2021-06-21 22:52:33,Python,0.0,1402976588639346689,1402551304773722112,385,"n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%20==0:\n        print(\""lyx wins!\"")\n    else:\n        print(\""xrf wins!\"")\n",WRONG_ANSWER,31,3140
1406988578931961856,382e30411cb25b35220e7f2fa3bc654a74f68065fdae5a589275ae7d84e3303f,2021-06-21 22:53:12,Python,0.0,1402976588639346689,1402551304773722112,385,"n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%4==0:\n        print(\""xrf wins!\"")\n    else:\n        print(\""lyx wins!\"")\n",WRONG_ANSWER,22,3144
1406988629720788992,382e30411cb25b35220e7f2fa3bc654a74f68065fdae5a589275ae7d84e3303f,2021-06-21 22:53:24,Python,0.0,1402976588639346689,1402551304773722112,385,"n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%4==0:\n        print(\""xrf wins\"")\n    else:\n        print(\""lyx wins\"")\n",WRONG_ANSWER,29,3128
1406988883028246528,382e30411cb25b35220e7f2fa3bc654a74f68065fdae5a589275ae7d84e3303f,2021-06-21 22:54:24,Python,0.0,1402976588639346689,1402551304773722112,385,"n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2==1:\n        print(\""xrf wins\"")\n    else:\n        print(\""lyx wins\"")\n",WRONG_ANSWER,20,3140
1406988927415709696,382e30411cb25b35220e7f2fa3bc654a74f68065fdae5a589275ae7d84e3303f,2021-06-21 22:54:35,Python,10.0,1402976588639346689,1402551304773722112,385,"n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2!=1:\n        print(\""xrf wins\"")\n    else:\n        print(\""lyx wins\"")\n",ACCEPTED,29,3144
1407136132526051328,0013f89a30ddb2c7d005f27abcc9fd40824ad1d5ca1f096969ad26d4695d7217,2021-06-22 08:39:31,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    s=int(input())\n    if (s+1)%2!=0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,26,3128
1407139674011811840,e1b23778ba6dbadf0bb60b95d8ac777d0022bc480a4f9b309f1f20ebb6b59e51,2021-06-22 08:53:36,Python,0.0,1402976588639346689,1402551304773722112,385,"import math\nT = int(input())\nfor i in range(T):\n    cnt = 1\n    n = int(input())\n    if n == 1:\n        cnt = 1\n    else:\n        for i in range(2,int(math.sqrt(n)) + 1):\n             if n % i == 0:\n                cnt = 0\n                break\n    if cnt == 1:\n        print('lyx wins')\n    else:\n        print('xrf wins')\n\n",WRONG_ANSWER,32,3132
1407139951694671872,110f753c8a0770d85b59e13ec04fc612d2d5fd1dcd1271a6093b8f1f8dd374cf,2021-06-22 08:54:42,Python,10.0,1402976588639346689,1402551304773722112,385,a=int(input())\nfor i in range(a):\n    b=int(input())\n    if b==1:\n        print('lyx wins')\n    else:\n        if b%2==1:\n            print('lyx wins')\n        else:\n            print('xrf wins'),ACCEPTED,21,3264
1407140359871754240,e1b23778ba6dbadf0bb60b95d8ac777d0022bc480a4f9b309f1f20ebb6b59e51,2021-06-22 08:56:19,Python,0.0,1402976588639346689,1402551304773722112,385,"import math\nT = int(input())\nfor i in range(T):\n    cnt = 1\n    n = int(input())\n    if n == 1:\n        cnt = 1\n    else:\n        for i in range(2,int(math.sqrt(n)) + 1):\n             if n % i == 0:\n                cnt = 0\n    if cnt == 1:\n        print('lyx wins')\n    elif cnt == 0:\n        print('xrf wins')\n\n",WRONG_ANSWER,22,3260
1407142296999497728,e1b23778ba6dbadf0bb60b95d8ac777d0022bc480a4f9b309f1f20ebb6b59e51,2021-06-22 09:04:01,Python,0.0,1402976588639346689,1402551304773722112,385,"import math\nT = int(input()) + 1\nfor i in range(T):\n    cnt = 1\n    n = int(input())\n    if n == 1:\n        pass\n    else:\n        for i in range(2,int(math.sqrt(n)) + 1):\n             if n % i == 0:\n                cnt = 0\n    if cnt == 0:\n        print('xrf wins')\n    else:\n        print('lyx wins')",NON_ZERO_EXIT_CODE,23,3124
1407142583645597696,6e4a305033b0d0740ff48b86daa0ce94e9cbea61a60efed4efa6d38fb6ab6f4a,2021-06-22 09:05:10,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,35,3256
1407142921447477248,e1b23778ba6dbadf0bb60b95d8ac777d0022bc480a4f9b309f1f20ebb6b59e51,2021-06-22 09:06:30,Python,0.0,1402976588639346689,1402551304773722112,385,"import math\nT = int(input())\nfor i in range(T):\n    cnt = 1\n    n = int(input())\n    for i in range(2,int(math.sqrt(n)) + 1):\n        if n % i == 0:\n            cnt = 0\n    if cnt == 0:\n        print('xrf wins')\n    else:\n        print('lyx wins')",WRONG_ANSWER,22,3136
1407144346378383360,d0894a9e2bac618a5695b1b9ae63ae504c1ba45573007c1058a0ba965e9ee6ca,2021-06-22 09:12:10,Python,0.0,1402976588639346689,1402551304773722112,385,"n=int(input())\nfor i in range(n):\n    m=int(input())\n    a=0\n    if m>9:\n        for i in range(2, 9):\n            if m % i == 0:\n                a += 1\n    else:\n        for i in range(2, m):\n            if m % i == 0:\n                a += 1\n    if a==0:\n        print('lyx wins')\n    else:\n        print('xrf wins')",WRONG_ANSWER,24,3156
1407145522918404096,d0894a9e2bac618a5695b1b9ae63ae504c1ba45573007c1058a0ba965e9ee6ca,2021-06-22 09:16:50,Python,0.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2==0:\n        print('lyx wins')\n    else:\n        print('xrf wins'),WRONG_ANSWER,27,3136
1407145952507412480,d0894a9e2bac618a5695b1b9ae63ae504c1ba45573007c1058a0ba965e9ee6ca,2021-06-22 09:18:33,Python,0.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2！=0:\n        print('lyx wins')\n    else:\n        print('xrf wins'),NON_ZERO_EXIT_CODE,39,3220
1407149094158544896,e1b23778ba6dbadf0bb60b95d8ac777d0022bc480a4f9b309f1f20ebb6b59e51,2021-06-22 09:31:02,Python,0.0,1402976588639346689,1402551304773722112,385,"import math\nm = int(input())\ns = []\nfor i in range(m):\n    cnt = 1\n    n = int(input())\n    for i in range(2,int(math.sqrt(n)) + 1):\n        if n % i == 0:\n            cnt = 0\n    if cnt == 1:\n        s.append(1)\n    else :\n        s.append(0)\nfor i in range(len(s)):\n    if s[i] == 1:\n        print('lyx wins')\n    else:\n        print('xrf wins')",WRONG_ANSWER,22,3156
1407232846770565120,8341ca8b6aca89d10ad231515302f2894586515e216b04d32f74b9f72864de9a,2021-06-22 15:03:50,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,20,3132
1407248160443936768,812ec24fdf06764c1e3925f08f22d8a933fd93e1d7aec6970afd8c1a5be71080,2021-06-22 16:04:41,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2==1:\n        print('lyx wins')\n    else:\n        print('xrf wins'),ACCEPTED,29,3144
1407254836500840448,b5c0a45ccf220bd9ed01235fe52342c5c5978d19925d8d84be614331d7af8b4c,2021-06-22 16:31:13,Python,0.0,1402976588639346689,1402551304773722112,385,"n=int(input())\nfor i in range(n):\n    x=int(input())\n    flag=1\n    if x>1:\n        for j in range(2,x):\n            if (x % j) == 0:\n                flag = 0\n                break\n            else:\n                flag = 1\n        if flag == 0:\n            print('xrf wins')\n        elif flag == 1:\n            print('lyx wins')\n    else:\n        print('lyx wins')",WRONG_ANSWER,77,3124
1407255191968092160,b5c0a45ccf220bd9ed01235fe52342c5c5978d19925d8d84be614331d7af8b4c,2021-06-22 16:32:37,Python,0.0,1402976588639346689,1402551304773722112,385,"n=int(input())\nl=[]\nfor i in range(n):\n    x=int(input())\n    flag=1\n    if x>1:\n        for j in range(2,x):\n            if (x % j) == 0:\n                flag = 0\n                break\n            else:\n                flag = 1\n        if flag == 0:\n            l.append('xrf wins')\n        elif flag == 1:\n            l.append('lyx wins')\n    else:\n        l.append('lyx wins')\nfor i in range(n):\n    print(l[i])",WRONG_ANSWER,47,3136
1407256187398078464,311a0e4bc52bee2d707b17aaba586faddd779747d1991f2ab1e840df8fa142bc,2021-06-22 16:36:35,Python,10.0,1402976588639346689,1402551304773722112,385,"def fun(x):\n    for i in range(2,x-1):\n        if x%i==0:\n            return 0\n        else:\n            return 1\n    if x==2 or x==3:\n        return 1\n\nn=int(input())\nfor i in range(n):\n    s=int(input())\n    if s==1:\n        print('lyx wins')\n    else:\n        if fun(s)==1:\n            print('lyx wins')\n        else:\n            print('xrf wins')",ACCEPTED,23,3136
1407286485687025664,c82db3810f34321115978934f386ca35b798b059a195e5661bc2b664dd04b5ad,2021-06-22 18:36:58,Python,10.0,1402976588639346689,1402551304773722112,385,"n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2!=1:\n        print(\""xrf wins\"")\n    else:\n        print(\""lyx wins\"")",ACCEPTED,30,3272
1407498722246860800,e14adfd6ae3db4cbc71d02e8d84afac06847a397faad4e33ce58a1e007d6ac86,2021-06-23 08:40:20,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    m=int(input())\n    s=m%2\n    if s!=0:\n        print('lyx wins')\n    else:\n        print('xrf wins'),ACCEPTED,32,3116
1407529707172810752,0b775850b269b352cd04e69d557c429e05c40f9ddeab808a2983b3f5cbfddf9c,2021-06-23 10:43:27,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    s=int(input())\n    if (s+1)%2!=0:\n        print('xrf wins')\n    else:\n        print('lyx wins')\n\n        ,ACCEPTED,22,3140
1407532766888017920,abb2f8c33f043d4d815c7c685f75a5638ad0955acd6db5063caea932eeb82224,2021-06-23 10:55:36,Python,0.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    a=int(input())\n    if a%4==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),WRONG_ANSWER,23,3132
1407534175725572096,abb2f8c33f043d4d815c7c685f75a5638ad0955acd6db5063caea932eeb82224,2021-06-23 11:01:12,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    a=int(input())\n    if a%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,20,3016
1407870498944401408,798ac2d94284b9a850df0c649d14e7434fb7c234112f5d81c6f5b641d1d6ad00,2021-06-24 09:17:38,Python,0.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2==0:\n        print('lyx wins')\n    else:\n        print('xrf wins'),WRONG_ANSWER,32,3136
1407870682751385600,798ac2d94284b9a850df0c649d14e7434fb7c234112f5d81c6f5b641d1d6ad00,2021-06-24 09:18:22,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2==1:\n        print('lyx wins')\n    else:\n        print('xrf wins'),ACCEPTED,21,3116
1407928105999036416,02d56814929a6eaba71eae76ea1fb6a37ab3ab97965f8cc6927f9a2dd52694ba,2021-06-24 13:06:33,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    s=int(input())\n    if (s+1)%2!=0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,21,3128
1408238856856760320,6f49013ad453a25fd2ed859b95b0c02c595d3c14dfb72cbbd83dd6ac1b2f691d,2021-06-25 09:41:21,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    s=int(input())\n    if s%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,29,3120
1408306941911429120,48bc741dcfb4fb3e28340c584f5101e98e93e964cc9fb425401ed0750e6db575,2021-06-25 14:11:54,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins')\n,ACCEPTED,21,3136
1408676097676730368,d0894a9e2bac618a5695b1b9ae63ae504c1ba45573007c1058a0ba965e9ee6ca,2021-06-26 14:38:48,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    m=int(input())\n    s=m%2\n    if s!=0:\n        print('lyx wins')\n    else:\n        print('xrf wins'),ACCEPTED,21,3132
1408736041855803392,473568e623dda69750e1a89305b6008f80ea6048e8eefbabaf92f31a50c4dfb4,2021-06-26 18:37:00,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,23,3052
1408780256681852928,6c430712f0ead1cc426cbc31eff201b7fd1db157284edcedb8df7595a8ccf3b3,2021-06-26 21:32:41,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,28,3264
1409163660124286976,fbbfa7deabdf36c6bd614f916e0beb0169b685e46a30d3184c2d2f17b7276af6,2021-06-27 22:56:12,Python,10.0,1402976588639346689,1402551304773722112,385,N=int(input())\nfor i in range(N):\n    M=int(input())\n    if M%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,20,3264
1409164247482236928,d0486a589c985207314240b0f4d3e91cb11d6faa229e4d1a08dade3800639192,2021-06-27 22:58:32,Python,10.0,1402976588639346689,1402551304773722112,385,N=int(input())\nfor i in range(N):\n    M=int(input())\n    if M%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,20,3116
1409171547769008128,74638eea6fdcced389fed40ee5285d626c9d88e440b5f9d5b6c22db0410ccd58,2021-06-27 23:27:32,Python,10.0,1402976588639346689,1402551304773722112,385,n=int(input())\nfor i in range(n):\n    a=int(input())\n    if a%2==0:\n        print('xrf wins')\n    else:\n        print('lyx wins'),ACCEPTED,22,3132
1409178544585109504,5d1d35ccde66cb4f3b44f76d31e160308b3ebf1a64ffe9203a93d884ea820a6f,2021-06-27 23:55:20,Python,0.0,1402976588639346689,1402551304773722112,385,"t=int(input())\nfor i in range(t):\n    lst=[]\n    maxjs=0\n    maxi=0\n    maxj=0\n    n=int(input())\n    for i in range(n):\n        lst.append([int(i) for i in input().split()]) #输入数组\n    for i in range(n):\n        for j in range(n):      #开始按行列计算\n            js=0\n            for k in range(n):\n                js=js+lst[i][k]         #计算行的1的数量\n                js=js+lst[k][j]     #计算列1的数量\n            if lst[i][j]!=0:\n                js=js-lst[i][j]\n            if js>maxjs:\n                maxjs=js\n                maxi=i+1\n                maxj=j+1\n    print('{} {} {}'.format(maxi,maxj,maxjs))\n",NON_ZERO_EXIT_CODE,19,3140
1409178719764611072,792b446ae612ee8ecbfd30e04cc6f98baa156536b4db0fc47f0f2e24f3eb9603,2021-06-27 23:56:02,Python,0.0,1402976588639346689,1402551304773722112,385,"n=int(input())\nfor i in range (n):\n    a=int(input())\n    if a％2==0:\n        print (\""xrf wins\"")\n    else:\n        print (\""lyx wins\"")",NON_ZERO_EXIT_CODE,21,3000
1409178796134502400,5d1d35ccde66cb4f3b44f76d31e160308b3ebf1a64ffe9203a93d884ea820a6f,2021-06-27 23:56:20,Python,10.0,1402976588639346689,1402551304773722112,385,"# t=int(input())\n# for i in range(t):\n#     lst=[]\n#     maxjs=0\n#     maxi=0\n#     maxj=0\n#     n=int(input())\n#     for i in range(n):\n#         lst.append([int(i) for i in input().split()]) #输入数组\n#     for i in range(n):\n#         for j in range(n):      #开始按行列计算\n#             js=0\n#             for k in range(n):\n#                 js=js+lst[i][k]         #计算行的1的数量\n#                 js=js+lst[k][j]     #计算列1的数量\n#             if lst[i][j]!=0:\n#                 js=js-lst[i][j]\n#             if js>maxjs:\n#                 maxjs=js\n#                 maxi=i+1\n#                 maxj=j+1\n#     print('{} {} {}'.format(maxi,maxj,maxjs))\nn=int(input())\nfor i in range(n):\n    m=int(input())\n    if m%2==1:\n        print('lyx wins')\n    else:\n        print('xrf wins')",ACCEPTED,18,3128
1409179111349026816,792b446ae612ee8ecbfd30e04cc6f98baa156536b4db0fc47f0f2e24f3eb9603,2021-06-27 23:57:36,Python,10.0,1402976588639346689,1402551304773722112,385,"n=int(input())\nfor i in range(n):\n    a=int(input())\n    if a%2==0:\n        print(\""xrf wins\"")\n    else:\n        print(\""lyx wins\"")",ACCEPTED,23,3136
1444626368449589248,06018f033367e98ce7a6ba75025a493bfa4c0c3b7110483d5bfcc2079256a68c,2021-10-03 19:32:20,C,10.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\nint main(){\n    int t;\n    scanf(\""%d\"",&t);\n    while(t--){\n        int y;\n        scanf(\""%d\"",&y);\n        if(y%2==0) printf(\""xrf wins\\n\"");\n        else printf(\""lyx wins\\n\"");\n    }\n    return 0;\n}",ACCEPTED,4,172
1444629895142027264,e62ef853bb567666aa2c6b7be3b7be3c11161644dab557cd1695a624591a675c,2021-10-03 19:46:21,C,10.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\nint arr[100];\nint main(){\n    int a,i,j,n,l;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&arr[i]);\n        if(arr[i]%2!=0)\n            printf(\""lyx wins\\n\"");\n        else printf(\""xrf wins\\n\"");\n    }\n    return 0;\n}",ACCEPTED,3,200
1444631321767424000,6bd4c0c08983ea08f3313ec7b57a910d86bafa8b3b0d46bd2a67a3fefc6e54dd,2021-10-03 19:52:01,C,0.0,1442776975089815554,1402551304773722112,385,"# include <stdio.h>\n# include <string.h>\n\nint main (void)\n{\n\tint n;\n\tscanf (\""%d\"", &n);\n\t\n\tfor (int begin = 1; begin<=n; begin++)\n\t{\n\t\tchar num[999];\n\t\tscanf (\""%s\"", &num);\n\t\tint cishu = strlen(num)-1;\n\t\t\n\t\tif (cishu%2 == 0)\n\t\t{\n\t\t\tprintf (\""lyx wins\\n\"");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf (\""xrf wins\\n\"");\n\t\t}\n\t\t\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,4,200
1444631423173111808,6bd4c0c08983ea08f3313ec7b57a910d86bafa8b3b0d46bd2a67a3fefc6e54dd,2021-10-03 19:52:25,C++,0.0,1442776975089815554,1402551304773722112,385,"# include <stdio.h>\n# include <string.h>\n\nint main (void)\n{\n\tint n;\n\tscanf (\""%d\"", &n);\n\t\n\tfor (int begin = 1; begin<=n; begin++)\n\t{\n\t\tchar num[999];\n\t\tscanf (\""%s\"", &num);\n\t\tint cishu = strlen(num)-1;\n\t\t\n\t\tif (cishu%2 == 0)\n\t\t{\n\t\t\tprintf (\""lyx wins\\n\"");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf (\""xrf wins\\n\"");\n\t\t}\n\t\t\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,4,460
1444631609098293248,6bd4c0c08983ea08f3313ec7b57a910d86bafa8b3b0d46bd2a67a3fefc6e54dd,2021-10-03 19:53:10,C++,0.0,1442776975089815554,1402551304773722112,385,"# include <stdio.h>\n# include <string.h>\n\nint main (void)\n{\n\tint n;\n\tscanf (\""%d\"", &n);\n\t\n\tfor (int begin = 1; begin<=n; begin++)\n\t{\n\t\tchar num[9999];\n\t\tscanf (\""%s\"", &num);\n\t\tint cishu = strlen(num)-1;\n\t\t\n\t\tif (cishu%2 == 0)\n\t\t{\n\t\t\tprintf (\""lyx wins\\n\"");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf (\""xrf wins\\n\"");\n\t\t}\n\t\t\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,4,324
1444632033666715648,6bd4c0c08983ea08f3313ec7b57a910d86bafa8b3b0d46bd2a67a3fefc6e54dd,2021-10-03 19:54:51,C++,0.0,1442776975089815554,1402551304773722112,385,"# include <stdio.h>\n# include <string.h>\n\nint main (void)\n{\n\tint n;\n\tscanf (\""%d\"", &n);\n\t\n\tfor (int begin = 1; begin<=n; begin++)\n\t{\n\t\tchar num[9999];\n\t\tscanf (\""%s\"", &num);\n\t\tint cishu = strlen(num)-1;\n\t\t\n\t\tif (cishu > 2)\n\t\t{\n\t\t\tprintf (\""xrf wins\\n\"");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf (\""lyx wins\\n\"");\n\t\t}\n\t\t\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,3,196
1444632165640491008,6bd4c0c08983ea08f3313ec7b57a910d86bafa8b3b0d46bd2a67a3fefc6e54dd,2021-10-03 19:55:22,C++,0.0,1442776975089815554,1402551304773722112,385,"# include <stdio.h>\n# include <string.h>\n\nint main (void)\n{\n\tint n;\n\tscanf (\""%d\"", &n);\n\t\n\tfor (int begin = 1; begin<=n; begin++)\n\t{\n\t\tchar num[9999];\n\t\tscanf (\""%s\"", &num);\n\t\tint cishu = strlen(num)-1;\n\t\t\n\t\tif (cishu>=1)\n\t\t{\n\t\t\tprintf (\""xrf wins\\n\"");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf (\""lyx wins\\n\"");\n\t\t}\n\t\t\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,4,324
1444633481666285568,18e3516c314a1234820f0090e9e3712fb93d0c97cb20ce5df88c524a0b8886bf,2021-10-03 20:00:36,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\nint main(){printf(\""lyx wins\\nlyx wins\\nlyx wins\\nlyx wins\\nlyx wins\"");return 0;}\n    ",WRONG_ANSWER,4,328
1444633967635050496,67a41f541a8e393002d03ec81d9e9204c98f93deec35726f702102551c0b7e78,2021-10-03 20:02:32,C,0.0,1442776975089815554,1402551304773722112,385,"#include <stdio.h>\nint main(){\n    int t;\n    scanf(\""%d\"",&t);\n    while(t>0){\n        int x,i=0;\n        scanf(\""%d\"",&x);\n        \n        while(x%2==0){\n        x=x/2;\n            i++;\n        }\n        if(i%2!=0||i==0){\n            printf(\""lyx wins\\n\"");\n        }else{\n            printf(\""xrf wins\\n\"");\n        }\n        t--;\n    }\n    return 0;\n}",WRONG_ANSWER,4,192
1444636174161989632,6bd4c0c08983ea08f3313ec7b57a910d86bafa8b3b0d46bd2a67a3fefc6e54dd,2021-10-03 20:11:18,C++,0.0,1442776975089815554,1402551304773722112,385,"# include <stdio.h>\n# include <string.h>\n\nint main (void)\n{\n\tint n;\n\tscanf (\""%d\"", &n);\n\t\n\tfor (int begin = 1; begin<=n; begin++)\n\t{\n\t\tchar num[9999];\n\t\tscanf (\""%s\"", &num);\n\t\tint cishu = strlen(num)-1;\n\t\t\n\t\tif (cishu % 2 == 0)\n\t\t{\n\t\t\tprintf (\""xrf wins\\n\"");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf (\""lyx wins\\n\"");\n\t\t}\n\t\t\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,3,188
1444636294051975168,6bd4c0c08983ea08f3313ec7b57a910d86bafa8b3b0d46bd2a67a3fefc6e54dd,2021-10-03 20:11:47,C++,0.0,1442776975089815554,1402551304773722112,385,"# include <stdio.h>\n# include <string.h>\n\nint main (void)\n{\n\tint n;\n\tscanf (\""%d\"", &n);\n\t\n\tfor (int begin = 1; begin<=n; begin++)\n\t{\n\t\tchar num[9999];\n\t\tscanf (\""%s\"", &num);\n\t\tint cishu = strlen(num)-1;\n\t\t\n\t\tif (cishu % 2 == 0)\n\t\t{\n\t\t\tprintf (\""lyx wins\\n\"");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf (\""xrf wins\\n\"");\n\t\t}\n\t\t\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,4,188
1444643576185802752,a27f2765ddfc0fec32ec49118754d35313e82d4742908dcbd0f6f0b4c1127017,2021-10-03 20:40:43,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n#define N 50\nint main()\n{\n    int n;\n    int a[N];\n    scanf(\""%d\"", &n);\n    for (int i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &a[i]);\n    }\n    if(a[i]%2==0)\n     printf(\""xrf wins\"");\n    else\n     printf(\""lyx wins\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1444644309979287552,a27f2765ddfc0fec32ec49118754d35313e82d4742908dcbd0f6f0b4c1127017,2021-10-03 20:43:38,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n#define N 50\nint main()\n{\n    int n,i;\n    int a[N];\n    scanf(\""%d\"", &n);\n    for (int i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &a[i]);\n    }\n    if(a[i]%2==0)\n     printf(\""xrf wins\"");\n    else\n     printf(\""lyx wins\"");\n    return 0;\n}",WRONG_ANSWER,3,200
1444644980736577536,a27f2765ddfc0fec32ec49118754d35313e82d4742908dcbd0f6f0b4c1127017,2021-10-03 20:46:18,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n#define N 50\nint main()\n{\n    int n,i;\n    int a[N];\n    scanf(\""%d\"", &n);\n    for (int i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &a[i]);\n    \n    if(a[i]%2==0)\n     printf(\""xrf wins\"");\n    else\n     printf(\""lyx wins\"");\n    }\n    return 0;\n}",PRESENTATION_ERROR,4,320
1444645302183841792,a27f2765ddfc0fec32ec49118754d35313e82d4742908dcbd0f6f0b4c1127017,2021-10-03 20:47:34,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n#define N 50\nint main()\n{\n    int n,i;\n    int a[N];\n    scanf(\""%d\"", &n);\n    for (int i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &a[i]);\n    }\n    for (int i = 0; i < n; i++)\n    {   \n    if(a[i]%2==0)\n     printf(\""xrf wins\"");\n    else\n     printf(\""lyx wins\"");\n    }\n    return 0;\n}",PRESENTATION_ERROR,5,192
1444645603024490496,52794fbd2a75567335d174ea3cc7b49effe38bb19e1284ca93436bdc112efc08,2021-10-03 20:48:46,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n\tint n,m;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&m);\n\t\tif(m%!=0) printf(\""lyx wins\"");\n\t\telse printf(\""xrf wins\"");\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1444645715545083904,52794fbd2a75567335d174ea3cc7b49effe38bb19e1284ca93436bdc112efc08,2021-10-03 20:49:13,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n\tint n,m;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&m);\n\t\tif(m%2!=0) printf(\""lyx wins\"");\n\t\telse printf(\""xrf wins\"");\n\t}\n\treturn 0;\n}",PRESENTATION_ERROR,5,320
1444645765180477440,52794fbd2a75567335d174ea3cc7b49effe38bb19e1284ca93436bdc112efc08,2021-10-03 20:49:25,C,10.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n\tint n,m;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&m);\n\t\tif(m%2!=0) printf(\""lyx wins\\n\"");\n\t\telse printf(\""xrf wins\\n\"");\n\t}\n\treturn 0;\n}",ACCEPTED,4,192
1444645940233949184,a27f2765ddfc0fec32ec49118754d35313e82d4742908dcbd0f6f0b4c1127017,2021-10-03 20:50:07,C,10.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n#define N 50\nint main()\n{\n    int n,i;\n    int a[N];\n    scanf(\""%d\"", &n);\n    for (int i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &a[i]);\n    }\n    for (int i = 0; i < n; i++)\n    {   \n    if(a[i]%2==0)\n     printf(\""xrf wins\\n\"");\n    else\n     printf(\""lyx wins\\n\"");\n    }\n    return 0;\n}",ACCEPTED,3,188
1444648899160231936,2626ff3e198e41a8d053a74268ec4ed3d24f4c5137d9f5a7f91406a1ac91f056,2021-10-03 21:01:52,C,0.0,1442776975089815554,1402551304773722112,385,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n, m;\n\tcin >> n;\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tcin >> m;\n\t\tif(m % 2 == 1) cout << \""zs wins\"" << endl;\n\t\telse cout << \""pb wins\"" << endl; \n\t}\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1444648940029456384,2626ff3e198e41a8d053a74268ec4ed3d24f4c5137d9f5a7f91406a1ac91f056,2021-10-03 21:02:02,C,0.0,1442776975089815554,1402551304773722112,385,"#include<iostream>\nint main()\n{\n\tint n, m;\n\tcin >> n;\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tcin >> m;\n\t\tif(m % 2 == 1) cout << \""zs wins\"" << endl;\n\t\telse cout << \""pb wins\"" << endl; \n\t}\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1444649158565277696,2626ff3e198e41a8d053a74268ec4ed3d24f4c5137d9f5a7f91406a1ac91f056,2021-10-03 21:02:54,C,0.0,1442776975089815554,1402551304773722112,385,"#include<iostream>\nint main()\n{\n\tint n, m;\n\tcin >> n;\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tcin >> m;\n\t\tif(m % 2 == 1) cout << \""xrf wins\"" << endl;\n\t\telse cout << \""lyx wins\"" << endl; \n\t}\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1444650416055439360,473adff45a3905d78c30bbef36be40cd6acee08e774dfaba70a438ca98730078,2021-10-03 21:07:54,C,0.0,1442776975089815554,1402551304773722112,385,"#include <stdio.h>\nint main()\n{\n    int n,i,a;\n    scanf (\""%d\"",&n);\n    do{\n        scanf(\""%d\"",&a);\n        i++;\n        if(a%2!=0){printf(\""lyx wins\"");}\n        else if(a%2=0){printf(\""xrf wins\"");}\n            \n    }while(i<=n);\n}",COMPILE_ERROR,0,0
1444650507482804224,473adff45a3905d78c30bbef36be40cd6acee08e774dfaba70a438ca98730078,2021-10-03 21:08:15,C,0.0,1442776975089815554,1402551304773722112,385,"#include <stdio.h>\nint main()\n{\n    int n,i,a;\n    scanf (\""%d\"",&n);\n    do{\n        scanf(\""%d\"",&a);\n        i++;\n        if(a%2!==0){printf(\""lyx wins\"");}\n        else if(a%2==0){printf(\""xrf wins\"");}\n            \n    }while(i<=n);\n}",COMPILE_ERROR,0,0
1444650534640996352,f032e659c023221787a8d05b797e5518629e7e90b5c0f1d23f56d78085315f5b,2021-10-03 21:08:22,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int a[n];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",a[i]);\n        if(a[i]%2==0)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"")\n    }\n    \n}",COMPILE_ERROR,0,0
1444650550017241088,473adff45a3905d78c30bbef36be40cd6acee08e774dfaba70a438ca98730078,2021-10-03 21:08:26,C,0.0,1442776975089815554,1402551304773722112,385,"#include <stdio.h>\nint main()\n{\n    int n,i,a;\n    scanf (\""%d\"",&n);\n    do{\n        scanf(\""%d\"",&a);\n        i++;\n        if(a%2!=0){printf(\""lyx wins\"");}\n        else if(a%2==0){printf(\""xrf wins\"");}\n            \n    }while(i<=n);\n}",WRONG_ANSWER,9,184
1444650618917072896,f032e659c023221787a8d05b797e5518629e7e90b5c0f1d23f56d78085315f5b,2021-10-03 21:08:42,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\nint a[n];\nint main()\n{\n\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",a[i]);\n        if(a[i]%2==0)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"")\n    }\n    \n}",COMPILE_ERROR,0,0
1444650647211921408,f032e659c023221787a8d05b797e5518629e7e90b5c0f1d23f56d78085315f5b,2021-10-03 21:08:49,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\nint a[n];\nint main()\n{\n\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",a[i]);\n        if(a[i]%2==0)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n    \n}",COMPILE_ERROR,0,0
1444650697669324800,473adff45a3905d78c30bbef36be40cd6acee08e774dfaba70a438ca98730078,2021-10-03 21:09:01,C,0.0,1442776975089815554,1402551304773722112,385,"#include <stdio.h>\nint main()\n{\n    int n,i,a;\n    scanf (\""%d\"",&n);\n    do{\n        scanf(\""%d\"",&a);\n        i++;\n        if(a%2!=0){printf(\""lyx wins\"");}\n        else if(a%2==0){printf(\""xrf wins\"");}\n        printf(\""\\n\"");\n            \n    }while(i<=n);\n}",WRONG_ANSWER,4,188
1444650712655572992,f032e659c023221787a8d05b797e5518629e7e90b5c0f1d23f56d78085315f5b,2021-10-03 21:09:04,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\nint a[n];\nint main()\n{\n    int n\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",a[i]);\n        if(a[i]%2==0)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n    \n}",COMPILE_ERROR,0,0
1444650780817207296,f032e659c023221787a8d05b797e5518629e7e90b5c0f1d23f56d78085315f5b,2021-10-03 21:09:21,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n    int n;\n    int a[n];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",a[i]);\n        if(a[i]%2==0)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n    \n}",SEGMENTATION_FAULT,5,192
1444650807220350976,473adff45a3905d78c30bbef36be40cd6acee08e774dfaba70a438ca98730078,2021-10-03 21:09:27,C,10.0,1442776975089815554,1402551304773722112,385,"#include <stdio.h>\nint main()\n{\n    int n,i,a;\n    scanf (\""%d\"",&n);\n    do{\n        scanf(\""%d\"",&a);\n        i++;\n        if(a%2!=0){printf(\""lyx wins\"");}\n        else if(a%2==0){printf(\""xrf wins\"");}\n        printf(\""\\n\"");\n            \n    }while(i<n);\n}",ACCEPTED,3,196
1444650827004956672,f032e659c023221787a8d05b797e5518629e7e90b5c0f1d23f56d78085315f5b,2021-10-03 21:09:32,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n    int a[n];\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",a[i]);\n        if(a[i]%2==0)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n    \n}",COMPILE_ERROR,0,0
1444651161098047488,f032e659c023221787a8d05b797e5518629e7e90b5c0f1d23f56d78085315f5b,2021-10-03 21:10:51,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\nint a[n];\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",a[i]);\n        if(a[i]%2==0)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n    \n}",COMPILE_ERROR,0,0
1444651290924339200,f032e659c023221787a8d05b797e5518629e7e90b5c0f1d23f56d78085315f5b,2021-10-03 21:11:22,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n    int n;\n    int a[n];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",a[i]);\n        if(a[i]%2==0)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n    \n}",SEGMENTATION_FAULT,3,200
1444651326726918144,f032e659c023221787a8d05b797e5518629e7e90b5c0f1d23f56d78085315f5b,2021-10-03 21:11:31,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n    ;\n    int a[int n];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",a[i]);\n        if(a[i]%2==0)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n    \n}",COMPILE_ERROR,0,0
1444651356217069568,f032e659c023221787a8d05b797e5518629e7e90b5c0f1d23f56d78085315f5b,2021-10-03 21:11:38,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n    \n    int a[int n];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",a[i]);\n        if(a[i]%2==0)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n    \n}",COMPILE_ERROR,0,0
1444651750502617088,f032e659c023221787a8d05b797e5518629e7e90b5c0f1d23f56d78085315f5b,2021-10-03 21:13:12,C,10.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n    \n    int n,m;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&m);\n        if(m%2!=0)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n    \n}",ACCEPTED,4,188
1444654799103119360,bd7b00d6eb0bae3a1dbdd9be94a97a5a8e956694a040ff18546397d25c5f1b24,2021-10-03 21:25:19,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int N,i,j,k;\n    scanf(\""%d\"",&N);\n    for(j=0;j<N;j++)\n    {\n        scanf(\""%d\"",&k);\n        if(k%2==0)\n        printf(\""lyx wins\"");\n        else\n            printf(\""xrf wins\"");\n    }\n    return 0;\n}",WRONG_ANSWER,5,184
1444654890329157632,d302d95834dd03c24ecfeaffb55a873fb50a206ab1866450a39214a1fa584335,2021-10-03 21:25:40,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\nint main ()\n{\n\tint M,i,N;\n\tscanf(\""%d\"",&N);\n\tfor(i=0;i<N;i++)\n\t{\n\t\tscanf(\""%d\\n\"",M);\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,5,188
1444655165861449728,bd7b00d6eb0bae3a1dbdd9be94a97a5a8e956694a040ff18546397d25c5f1b24,2021-10-03 21:26:46,C,10.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int N,i,j,k;\n    scanf(\""%d\"",&N);\n    for(j=0;j<N;j++)\n    {\n        scanf(\""%d\"",&k);\n        if(k%2==0)\n        printf(\""xrf wins\\n\"");\n        else\n            printf(\""lyx wins\\n\"");\n    }\n    return 0;\n}",ACCEPTED,7,176
1444658117946748928,4e16fcbfe8f4cb86986ef6bbb368dab7a81b438519b44af07d78391753160a69,2021-10-03 21:38:30,C,0.0,1442776975089815554,1402551304773722112,385,"#include <cstdio>\nint n, a;\nint main()\n{\n    scanf(\""%d\"", &n);\n    while (n--)\n    {\n        scanf(\""%d\"", &a);\n        \n        if (a & 1)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n    return 0;\n",COMPILE_ERROR,0,0
1444658158719651840,4e16fcbfe8f4cb86986ef6bbb368dab7a81b438519b44af07d78391753160a69,2021-10-03 21:38:40,C,0.0,1442776975089815554,1402551304773722112,385,"#include <stdio.h>\nint n, a;\nint main()\n{\n    scanf(\""%d\"", &n);\n    while (n--)\n    {\n        scanf(\""%d\"", &a);\n        \n        if (a & 1)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n    return 0;\n",COMPILE_ERROR,0,0
1444658297379074048,4e16fcbfe8f4cb86986ef6bbb368dab7a81b438519b44af07d78391753160a69,2021-10-03 21:39:13,C,10.0,1442776975089815554,1402551304773722112,385,"#include <stdio.h>\nint n, a;\nint main()\n{\n    scanf(\""%d\"", &n);\n    while (n--)\n    {\n        scanf(\""%d\"", &a);\n        \n        if (a & 1)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n    return 0;\n}\n",ACCEPTED,5,196
1444659461730521088,4e16fcbfe8f4cb86986ef6bbb368dab7a81b438519b44af07d78391753160a69,2021-10-03 21:43:50,C,10.0,1442776975089815554,1402551304773722112,385,"#include <stdio.h>\nint n, a;\nint main()\n{\n    scanf(\""%d\"", &n);\n    while (n--)\n    {\n        scanf(\""%d\"", &a);\n        \n        if (a%2== 1)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n    return 0;\n}\n",ACCEPTED,3,192
1444659510623522816,3648c89d7c4ebc12162b6a37b6dbbeed9e5cb5534df54f0ca2220342cf80351b,2021-10-03 21:44:02,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n    int n,s;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",s);\n        if(s%2==0)\n        {\n            printf(\""xrf wins\"");\n        }\n        else printf(\""lyx wins\"");\n    }\n    return 0;\n}",SEGMENTATION_FAULT,4,192
1444659643528433664,3648c89d7c4ebc12162b6a37b6dbbeed9e5cb5534df54f0ca2220342cf80351b,2021-10-03 21:44:34,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n    int n,s;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",s);\n        if(s%2==0)\n        {\n            printf(\""xrf wins\"");\n            break;\n        }\n        else printf(\""lyx wins\"");\n        break;\n    }\n    return 0;\n}",SEGMENTATION_FAULT,5,200
1444659700038217728,3648c89d7c4ebc12162b6a37b6dbbeed9e5cb5534df54f0ca2220342cf80351b,2021-10-03 21:44:47,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n    int n,s;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&s);\n        if(s%2==0)\n        {\n            printf(\""xrf wins\"");\n            break;\n        }\n        else printf(\""lyx wins\"");\n        break;\n    }\n    return 0;\n}",WRONG_ANSWER,3,200
1444659712201699328,6f92ed190a935c676e3cc09725f4f34ffcd5c4b6e9dc8cd93eb026b402fc39c8,2021-10-03 21:44:50,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n#include<math.h>\nint app(int n){\n\tif (n < 2) return 0;\n\tif (n == 2) return 1;\n\tint p=sqrt(n);\n\tfor(int i=2;i<=p;i++){\n\t\tif(n%i==0){\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\n}\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\twhile(n>0){\n\t\tint a;\n\t\tscanf(\""%d\"",&a);\n\t\tif(app(a)==1)printf(\""lyx wins\"");\n\t\telse printf(\""xrf wins\"");\n\t\tn--;\n\t}\n}\n\n",WRONG_ANSWER,3,196
1444659783488090112,3648c89d7c4ebc12162b6a37b6dbbeed9e5cb5534df54f0ca2220342cf80351b,2021-10-03 21:45:07,C,10.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n    int n,s;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&s);\n        if(s%2==0)\n        {\n            printf(\""xrf wins\\n\"");\n        }\n        else printf(\""lyx wins\\n\"");\n    }\n    return 0;\n}",ACCEPTED,4,188
1444660132798189568,6f92ed190a935c676e3cc09725f4f34ffcd5c4b6e9dc8cd93eb026b402fc39c8,2021-10-03 21:46:30,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n#include<math.h>\nint app(int n){\n\tif (n < 2) return 0;\n\tif (n == 2) return 1;\n\tint p=sqrt(n);\n\tfor(int i=2;i<=p;i++){\n\t\tif(n%i==0){\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\n}\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\twhile(n>0){\n\t\tint a;\n\t\tscanf(\""%d\"",&a);\n\t\tif(app(a)==1||a==1)printf(\""lyx wins\\n\"");\n\t\telse printf(\""xrf wins\\n\"");\n\t\tn--;\n\t}\n}\n\n",WRONG_ANSWER,6,188
1444660162133078016,6f92ed190a935c676e3cc09725f4f34ffcd5c4b6e9dc8cd93eb026b402fc39c8,2021-10-03 21:46:37,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n#include<math.h>\nint app(int n){\n\tif (n < 2) return 0;\n\tif (n == 2) return 1;\n\tint p=sqrt(n);\n\tfor(int i=2;i<=p;i++){\n\t\tif(n%i==0){\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\n}\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\twhile(n>0){\n\t\tint a;\n\t\tscanf(\""%d\"",&a);\n\t\tif(app(a)==1||a==1)printf(\""lyx wins\"");\n\t\telse printf(\""xrf wins\"");\n\t\tn--;\n\t}\n}\n\n",WRONG_ANSWER,4,320
1444660428567851008,c5bb87178f6b09498b50b18c750509cee8da7d8137eb2fda2d3119adbdc5f358,2021-10-03 21:47:41,C,10.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n#define N 50\nint main()\n{\n    int n,i;\n    int a[N];\n    scanf(\""%d\"", &n);\n    for (int i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &a[i]);\n    }\n    for (int i = 0; i < n; i++)\n    {   \n    if(a[i]%2==0)\n     printf(\""xrf wins\\n\"");\n    else\n     printf(\""lyx wins\\n\"");\n    }\n    return 0;\n}",ACCEPTED,5,328
1444662866964230144,6bd4c0c08983ea08f3313ec7b57a910d86bafa8b3b0d46bd2a67a3fefc6e54dd,2021-10-03 21:57:22,C++,0.0,1442776975089815554,1402551304773722112,385,"# include <stdio.h>\n# include <string.h>\n\nint main (void)\n{\n\tint n;\n\tscanf (\""%d\"", &n);\n\t\n\tfor (int begin = 1; begin<=n; begin++)\n\t{\n\t\tchar num[9999];\n\t\tscanf (\""%s\"", &num);\n\t\tint cishu = strlen(num)-1;\n\t\t\n\t\tif (cishu % 2 != 0)\n\t\t{\n\t\t\tprintf (\""xrf wins\\n\"");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf (\""lyx wins\\n\"");\n\t\t}\n\t\t\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,5,184
1444663013060227072,c4808361e480fd4f3d2eba77bf72af513ac559c07bb43162edce88ad727796fe,2021-10-03 21:57:57,C,0.0,1442776975089815554,1402551304773722112,385,"#include<iostream>\n\nint main()\n{\n\tint n, m;\n\tscanf(\""%d\"",&n);\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"",&m);\n\t\tif(m % 2 == 1){\n\t\t\tprintf(\""lyx wins\"");\n\t\t}\n\t\telse{\n\t\t\tprintf(\""xrf wins\"");\n\t\t}\n\t}\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1444663058480345088,c4808361e480fd4f3d2eba77bf72af513ac559c07bb43162edce88ad727796fe,2021-10-03 21:58:08,C++,0.0,1442776975089815554,1402551304773722112,385,"#include<iostream>\n\nint main()\n{\n\tint n, m;\n\tscanf(\""%d\"",&n);\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"",&m);\n\t\tif(m % 2 == 1){\n\t\t\tprintf(\""lyx wins\"");\n\t\t}\n\t\telse{\n\t\t\tprintf(\""xrf wins\"");\n\t\t}\n\t}\n\treturn 0;\n}\n",PRESENTATION_ERROR,5,484
1444663082631147520,c4808361e480fd4f3d2eba77bf72af513ac559c07bb43162edce88ad727796fe,2021-10-03 21:58:14,C++,0.0,1442776975089815554,1402551304773722112,385,"#include<iostream>\n\nint main()\n{\n\tint n, m;\n\tscanf(\""%d\"",&n);\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"",&m);\n\t\tif(m % 2 == 1){\n\t\t\tprintf(\""lyx wins\"");\n\t\t}\n\t\telse{\n\t\t\tprintf(\""xrf wins\"");\n\t\t}\n\t}\n\treturn 0;\n}\n",PRESENTATION_ERROR,3,580
1444663153242255360,c4808361e480fd4f3d2eba77bf72af513ac559c07bb43162edce88ad727796fe,2021-10-03 21:58:30,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n\tint n, m;\n\tscanf(\""%d\"",&n);\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"",&m);\n\t\tif(m % 2 == 1){\n\t\t\tprintf(\""lyx wins\"");\n\t\t}\n\t\telse{\n\t\t\tprintf(\""xrf wins\"");\n\t\t}\n\t}\n\treturn 0;\n}\n",PRESENTATION_ERROR,3,320
1444663258859098112,c4808361e480fd4f3d2eba77bf72af513ac559c07bb43162edce88ad727796fe,2021-10-03 21:58:56,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n\tint n, m;\n\tscanf(\""%d\"",&n);\n\tint i;\n\tfor(i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"",&m);\n\t\tif(m % 2 == 1){\n\t\t\tprintf(\""lyx wins\"");\n\t\t}\n\t\telse{\n\t\t\tprintf(\""xrf wins\"");\n\t\t}\n\t}\n\treturn 0;\n}\n",PRESENTATION_ERROR,4,340
1444663287502000128,c4808361e480fd4f3d2eba77bf72af513ac559c07bb43162edce88ad727796fe,2021-10-03 21:59:02,C++,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n\tint n, m;\n\tscanf(\""%d\"",&n);\n\tint i;\n\tfor(i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"",&m);\n\t\tif(m % 2 == 1){\n\t\t\tprintf(\""lyx wins\"");\n\t\t}\n\t\telse{\n\t\t\tprintf(\""xrf wins\"");\n\t\t}\n\t}\n\treturn 0;\n}\n",PRESENTATION_ERROR,5,192
1444663470612729856,c4808361e480fd4f3d2eba77bf72af513ac559c07bb43162edce88ad727796fe,2021-10-03 21:59:46,C++,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n\tint n, m;\n\tscanf(\""%d\"",&n);\n\tint i;\n\tfor(i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"",&m);\n\t\tif(m % 2 == 1){\n\t\t\tprintf(\""lyx wins\"");\n\t\t}\n\t\telse{\n\t\t\tprintf(\""xrf wins\"");\n\t\t}\n\t}\n\t\n\treturn 0;\n}\n",PRESENTATION_ERROR,4,344
1444663495493341184,c4808361e480fd4f3d2eba77bf72af513ac559c07bb43162edce88ad727796fe,2021-10-03 21:59:52,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n\tint n, m;\n\tscanf(\""%d\"",&n);\n\tint i;\n\tfor(i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"",&m);\n\t\tif(m % 2 == 1){\n\t\t\tprintf(\""lyx wins\"");\n\t\t}\n\t\telse{\n\t\t\tprintf(\""xrf wins\"");\n\t\t}\n\t}\n\t\n\treturn 0;\n}\n",PRESENTATION_ERROR,5,336
1444663520495513600,c4808361e480fd4f3d2eba77bf72af513ac559c07bb43162edce88ad727796fe,2021-10-03 21:59:58,C,0.0,1442776975089815554,1402551304773722112,385,"#include<stdio.h>\n\nint main()\n{\n\tint n, m;\n\tscanf(\""%d\"",&n);\n\tint i;\n\tfor(i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"",&m);\n\t\tif(m % 2 == 1){\n\t\t\tprintf(\""lyx wins\"");\n\t\t}\n\t\telse{\n\t\t\tprintf(\""xrf wins\"");\n\t\t}\n\t}\n\t\n\treturn 0;\n}\n",PRESENTATION_ERROR,4,324
1444675150579159040,24b74eae7c03bc2902d1a8c82bd8657e282c212a3e3493e84929724e18da46c6,2021-10-03 22:46:11,C++,0.0,1444669937311092743,1402551304773722112,385,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    while(n--)\n    {\n        int x;\n        cin>>x;\n        if(x%2!=0)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\"");\n    }\n}",PRESENTATION_ERROR,5,324
1444675184133591040,24b74eae7c03bc2902d1a8c82bd8657e282c212a3e3493e84929724e18da46c6,2021-10-03 22:46:19,C++,10.0,1444669937311092743,1402551304773722112,385,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    while(n--)\n    {\n        int x;\n        cin>>x;\n        if(x%2!=0)\n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n}",ACCEPTED,7,308
1444675203230183424,6f92ed190a935c676e3cc09725f4f34ffcd5c4b6e9dc8cd93eb026b402fc39c8,2021-10-03 22:46:23,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\twhile (n>0){\n\t\tint a;\n\t\tscanf(\""%d\"",&a);\n\t\tif(a%2==0){printf(\""xrf wins\"");\n\t\t}else printf(\""lyx wins\"");\n\t\tn--;\n\t}\n}\n",PRESENTATION_ERROR,4,192
1444675263934418944,6f92ed190a935c676e3cc09725f4f34ffcd5c4b6e9dc8cd93eb026b402fc39c8,2021-10-03 22:46:38,C,10.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\twhile (n>0){\n\t\tint a;\n\t\tscanf(\""%d\"",&a);\n\t\tif(a%2==0){printf(\""xrf wins\\n\"");\n\t\t}else printf(\""lyx wins\\n\"");\n\t\tn--;\n\t}\n}",ACCEPTED,3,192
1444679593320099840,d95a6805c85ae8c9dfe99fc7fc34dfee9840069b0c996164d1447e5ebffb3a14,2021-10-03 23:03:50,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int a,n;\n    scanf(\""%d\"",&n);\n    while(n--){\n        scanf(\""%d\"",&a);\n        if(a&1){\n            printf(\""lyx wins\"");\n        }\n        else{\n            printf(\""xrf wins\"");\n        }\n    }\n    return 0;\n}",PRESENTATION_ERROR,3,316
1444679633644212224,d95a6805c85ae8c9dfe99fc7fc34dfee9840069b0c996164d1447e5ebffb3a14,2021-10-03 23:04:00,C,10.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int a,n;\n    scanf(\""%d\"",&n);\n    while(n--){\n        scanf(\""%d\"",&a);\n        if(a&1){\n            printf(\""lyx wins\\n\"");\n        }\n        else{\n            printf(\""xrf wins\\n\"");\n        }\n    }\n    return 0;\n}",ACCEPTED,3,188
1444834376563933184,dba53be69dd9e8e98ca868b5ce612e8f3f32481408de24acfd417ea422c7d157,2021-10-04 09:18:53,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int i;\n    scanf(\""%d\"",&i);\n    for(int j=1;j<=i;j++)\n    {\n        scanf(\""%d\"",&j);\n        if(j%2==0)\n            printf(\""xrf wins\\n\"");\n        else printf(\""lyx wins\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,3,324
1444834763555586048,dba53be69dd9e8e98ca868b5ce612e8f3f32481408de24acfd417ea422c7d157,2021-10-04 09:20:26,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int i,j;\n    scanf(\""%d\"",&i);\n    for(j=1;j<=i;j++)\n    {\n        scanf(\""%d\"",&j);\n        if(j%2==0)\n            printf(\""xrf wins\\n\"");\n        else\n            printf(\""lyx wins\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,3,344
1444834874675281920,dba53be69dd9e8e98ca868b5ce612e8f3f32481408de24acfd417ea422c7d157,2021-10-04 09:20:52,C,10.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int i,j,k;\n    scanf(\""%d\"",&i);\n    for(j=1;j<=i;j++)\n    {\n        scanf(\""%d\"",&k);\n        if(k%2==0)\n            printf(\""xrf wins\\n\"");\n        else\n            printf(\""lyx wins\\n\"");\n    }\n    return 0;\n}",ACCEPTED,3,316
1444913115763163136,7f2786ea8e877b2021f3acd421ab5415f642bf4c80def054c8d34b7e5e9ee545,2021-10-04 14:31:46,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\nfor(i=1:i<=N;i++)\nint a;\nscanf(\""%d\"",&a)\nif(a%2==0)\n{printf(\""xrf wins\"");}\nelse\n{printf(\""lyx wins\"");}\n    return 0;\n}",COMPILE_ERROR,0,0
1444914170890665984,7f2786ea8e877b2021f3acd421ab5415f642bf4c80def054c8d34b7e5e9ee545,2021-10-04 14:35:58,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\nint i,N,a;\nfor(i=1;i<=N;i++)\nscanf(\""%d\"",&a);\nif(a%2==0)\n{\nprintf(\""xrf wins\"");\n}\nelse\n{\nprintf(\""lyx wins\"");\n}\nreturn 0;\n}",WRONG_ANSWER,3,320
1444914281536212992,7f2786ea8e877b2021f3acd421ab5415f642bf4c80def054c8d34b7e5e9ee545,2021-10-04 14:36:24,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\nint i,N,a;\nfor(i=1;i<=N;i++)\nscanf(\""%d\\n\"",&a);\nif(a%2==0)\n{\nprintf(\""xrf wins\\n\"");\n}\nelse\n{\nprintf(\""lyx wins\\n\"");\n}\nreturn 0;\n}",WRONG_ANSWER,3,192
1444914658302152704,7f2786ea8e877b2021f3acd421ab5415f642bf4c80def054c8d34b7e5e9ee545,2021-10-04 14:37:54,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\nint i,N,a;\nscanf(\""%d\\n\"",&a);\nfor(i=0;i<N;i++)\nif(a%2!=0)\n{\nprintf(\""xrf wins\\n\"");\n}\nelse\n{\nprintf(\""lyx wins\\n\"");\n}\nreturn 0;\n}",WRONG_ANSWER,4,324
1444915111215681536,7f2786ea8e877b2021f3acd421ab5415f642bf4c80def054c8d34b7e5e9ee545,2021-10-04 14:39:42,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\nint i,N,a;\nscanf(\""%d\\n\"",&N);\nfor(i=0;i<N;i++)\n{scanf(\""%d\\n\"",&a);}\nif(a%2!=0)\n{\nprintf(\""xrf wins\\n\"");\n}\nelse\n{\nprintf(\""lyx wins\\n\"");\n}\nreturn 0;\n}",WRONG_ANSWER,4,204
1444951753398009856,d9a405e48b888426c37503fbaf0025f50681991ea891723e49e73a2e70405bae,2021-10-04 17:05:18,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n\tint n,a,b;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a);\n\t\tint b=a-1;\n\t\tif(b%2==0) printf(\""lyx wins\"");\n\t\telse if(b%2!=0) printf(\""xrf wins\"");\n\t}\n\t\n\treturn 0;\n}",PRESENTATION_ERROR,3,324
1444953492113178624,d9a405e48b888426c37503fbaf0025f50681991ea891723e49e73a2e70405bae,2021-10-04 17:12:13,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n\tint n,a,b;\n\tscanf(\""%d\"",&n);\n\twhile(n--){\n\t\tscanf(\""%d\"",&a);\n\t\tb=a-1;\n\t\tif(b%2==0) printf(\""lyx wins\"");\n\t\telse printf(\""xrf wins\"");\n\t}\n\t\n\t\n\treturn 0;\n}",PRESENTATION_ERROR,3,192
1444953888533434368,d9a405e48b888426c37503fbaf0025f50681991ea891723e49e73a2e70405bae,2021-10-04 17:13:47,C,10.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n\tint n,a,b;\n\tscanf(\""%d\"",&n);\n\twhile(n--){\n\t\tscanf(\""%d\"",&a);\n\t\tb=a-1;\n\t\tif(b%2==0) printf(\""lyx wins\\n\"");\n\t\telse printf(\""xrf wins\\n\"");\n\t}\n\t\n\t\n\treturn 0;\n}",ACCEPTED,5,196
1444995666414518272,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-04 19:59:48,C,0.0,1444669937311092743,1402551304773722112,385,"#include<srtdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&m);\n    for(int i=0;i<n;i++)\n    {\n    if(m%2!=0)\n        printf(\""lyx wins\\n\"");\n    else\n        printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1444995782919507968,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-04 20:00:16,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&m);\n    for(int i=0;i<n;i++)\n    {\n    if(m%2!=0)\n        printf(\""lyx wins\\n\"");\n    else\n        printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,4,328
1444996066668560384,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-04 20:01:23,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%ed\"",&m);\n    if(m%2!=0)\n        printf(\""lyx wins\\n\"");\n    else\n        printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,4,184
1444996117214117888,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-04 20:01:35,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n    if(m%2!=0)\n        printf(\""lyx wins\\n\"");\n    else\n        printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,9,192
1444999502436683776,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-04 20:15:02,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m%2!=0)\n        printf(\""lyx wins\\n\"");\n        else\n        printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,3,192
1445001387327733760,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-04 20:22:32,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    while(t--)\n    {\n        scanf(\""%d\"",&m);\n        if(m%2!==0)\n        printf(\""lyx wins\\n\"");\n        else\n        printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1445001458416992256,6a444b3e6e51f96bff18527b42680c69d1b8eca5169434008c4532cf3ac78aea,2021-10-04 20:22:49,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main(){\n    int t=0;\n    scanf(\""%d\"",&t);\n    while(t){\n        int a,win=0;\n        scanf(\""%d\"",&a);\n        \n        if(num<12&&num%2!=0){win=1;}\n        \n        if(win==0){printf(\""xrf wins\"");}\n        else{printf(\""lyx wins\"");}\n        \n        \n        \n        \n    }\n\n}",COMPILE_ERROR,0,0
1445001561076584448,6a444b3e6e51f96bff18527b42680c69d1b8eca5169434008c4532cf3ac78aea,2021-10-04 20:23:13,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main(){\n    int t=0;\n    scanf(\""%d\"",&t);\n    while(t){\n        int a,win=0;\n        scanf(\""%d\"",&a);\n        \n        if(a<12&&a%2!=0){win=1;}\n        \n        if(win==0){printf(\""xrf wins\"");}\n        else{printf(\""lyx wins\"");}\n        \n        \n        \n        \n    }\n\n}",TIME_LIMIT_EXCEEDED,0,0
1445001646393114624,6a444b3e6e51f96bff18527b42680c69d1b8eca5169434008c4532cf3ac78aea,2021-10-04 20:23:33,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main(){\n    int t=0;\n    scanf(\""%d\"",&t);\n    while(t){\n        int a,win=0;\n        scanf(\""%d\"",&a);\n        \n        if(a<12&&a%2!=0){win=1;}\n        \n        if(win==0){printf(\""xrf wins\\n\"");}\n        else{printf(\""lyx wins\\n\"");}\n        \n        \n        \n        t--;\n    }\n\n}",WRONG_ANSWER,4,192
1445001698666725376,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-04 20:23:46,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    while(n--)\n    {\n        scanf(\""%d\"",&m);\n        if(m%2!==0)\n        printf(\""lyx wins\\n\"");\n        else\n        printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1445001773698629632,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-04 20:24:04,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    while(n--)\n    {\n        scanf(\""%d\"",&m);\n        if(m%2!=0)\n        printf(\""lyx wins\\n\"");\n        else\n        printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,4,268
1445002510826586112,6a444b3e6e51f96bff18527b42680c69d1b8eca5169434008c4532cf3ac78aea,2021-10-04 20:27:00,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main(){\n    int t=0;\n    scanf(\""%d\"",&t);\n    while(t){\n        int a,win=0;\n        scanf(\""%d\"",&a);\n        \n        if(a<12&&a%2!=0){win=1;}\n        \n        if(a%2==0){win=0;}\n        \n        if(win==0){printf(\""xrf wins\\n\"");}\n        else{printf(\""lyx wins\\n\"");}\n        \n        \n        \n        t--;\n    }\n\n}",WRONG_ANSWER,4,188
1445002597451546624,6a444b3e6e51f96bff18527b42680c69d1b8eca5169434008c4532cf3ac78aea,2021-10-04 20:27:20,C,10.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main(){\n    int t=0;\n    scanf(\""%d\"",&t);\n    while(t){\n        int a,win=0;\n        scanf(\""%d\"",&a);\n        \n        if(a%2!=0){win=1;}\n        \n        if(a%2==0){win=0;}\n        \n        if(win==0){printf(\""xrf wins\\n\"");}\n        else{printf(\""lyx wins\\n\"");}\n        \n        \n        \n        t--;\n    }\n\n}",ACCEPTED,4,176
1445002798627143680,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-04 20:28:08,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m%2!=0)\n        printf(\""lyx wins\\n\"");\n        else\n        printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,8,324
1445003098737983488,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-04 20:29:20,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m%2!=0)\n        printf(\""lyx wins\\n\"");\n        else\n        printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,6,200
1445021583312535552,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-04 21:42:47,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m%2!=0)\n        printf(\""lyx wins\\n\"");\n        else\n        printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,4,200
1445082377127575552,6bd4c0c08983ea08f3313ec7b57a910d86bafa8b3b0d46bd2a67a3fefc6e54dd,2021-10-05 01:44:21,C,0.0,1444669937311092743,1402551304773722112,385,"# include <stdio.h>\n# include <string.h>\n\nint main (void)\n{\n\tint n;\n\tscanf (\""%d\"", &n);\n\t\n\tfor (int begin = 1; begin<=n; begin++)\n\t{\n\t\tchar num[9999];\n\t\tscanf (\""%s\"", &num);\n\t\tint cishu = strlen(num)-1;\n\t\t\n\t\tif (cishu % 2 != 0)\n\t\t{\n\t\t\tprintf (\""xrf wins\\n\"");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf (\""lyx wins\\n\"");\n\t\t}\n\t\t\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,3,300
1445082664911355904,6bd4c0c08983ea08f3313ec7b57a910d86bafa8b3b0d46bd2a67a3fefc6e54dd,2021-10-05 01:45:30,C,0.0,1444669937311092743,1402551304773722112,385,"# include <stdio.h>\n# include <string.h>\n\nint main (void)\n{\n\tint n;\n\tscanf (\""%d\"", &n);\n\t\n\tfor (int begin = 1; begin<=n; begin++)\n\t{\n\t\tchar num[9999];\n\t\tscanf (\""%s\"", &num);\n\t\tint cishu = strlen(num)-1;\n\t\t\n\t\tif (cishu % 2 != 0)\n\t\t{\n\t\t\tprintf (\""xrf wins\\n\"");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf (\""lyx wins\\n\"");\n\t\t}\n\t\t\n        num[999] = {0};\n\t}\n\t\n\treturn 0;\n}",COMPILE_ERROR,0,0
1445082772763688960,6bd4c0c08983ea08f3313ec7b57a910d86bafa8b3b0d46bd2a67a3fefc6e54dd,2021-10-05 01:45:56,C++,0.0,1444669937311092743,1402551304773722112,385,"# include <stdio.h>\n# include <string.h>\n\nint main (void)\n{\n\tint n;\n\tscanf (\""%d\"", &n);\n\t\n\tfor (int begin = 1; begin<=n; begin++)\n\t{\n\t\tchar num[9999];\n\t\tscanf (\""%s\"", &num);\n\t\tint cishu = strlen(num)-1;\n\t\t\n\t\tif (cishu % 2 != 0)\n\t\t{\n\t\t\tprintf (\""xrf wins\\n\"");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf (\""lyx wins\\n\"");\n\t\t}\n\t\t\n        num[999] = {0};\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,4,320
1445083064699830272,6bd4c0c08983ea08f3313ec7b57a910d86bafa8b3b0d46bd2a67a3fefc6e54dd,2021-10-05 01:47:05,C++,0.0,1444669937311092743,1402551304773722112,385,"# include <stdio.h>\n# include <string.h>\n\nint main (void)\n{\n\tint n;\n\tscanf (\""%d\"", &n);\n\t\n\tfor (int begin = 1; begin<=n; begin++)\n\t{\n\t\tchar num[9999];\n\t\tscanf (\""%s\"", &num);\n        int geshu = strlen(num);\n\t\tint cishu = geshu-1;\n\t\t\n\t\tif (cishu % 2 != 0)\n\t\t{\n\t\t\tprintf (\""xrf wins\\n\"");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf (\""lyx wins\\n\"");\n\t\t}\n\t\t\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,3,200
1445084578910683136,6bd4c0c08983ea08f3313ec7b57a910d86bafa8b3b0d46bd2a67a3fefc6e54dd,2021-10-05 01:53:06,C++,10.0,1444669937311092743,1402551304773722112,385,"# include <stdio.h>\n# include <string.h>\n\nint main (void)\n{\n\tint n;\n\tscanf (\""%d\"", &n);\n\t\n\twhile(n--)\n\t{\n\t\tint num;\n\t\tscanf (\""%d\"", &num);\n\t\t\n\t\tif (num % 2 == 0)\n\t\t\tprintf (\""xrf wins\\n\"");\n\t\telse\n\t\t\tprintf (\""lyx wins\\n\"");\n\t}\n\t\n\treturn 0;\n}",ACCEPTED,3,324
1445222806947037184,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-05 11:02:22,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d%d\"",&n,&m);\n        if(m%2!=0)\n        printf(\""lyx wins\\n\"");\n        else\n        printf(\""xrf win\\n\"");\n    return 0;\n}",WRONG_ANSWER,5,176
1445223596575014912,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-05 11:05:31,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    for（int i;i<n;i++）\n    {\n        scanf(\""%d\"",&m);\n        if(m%2!=0)\n        printf(\""lyx wins\\n\"");\n        else\n        printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1445223727261220864,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-05 11:06:02,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    for(int i;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m%2!=0)\n        printf(\""lyx wins\\n\"");\n        else\n        printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,5,188
1445225073704108032,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-05 11:11:23,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m%2!=0) printf(\""lyx wins\\n\"");\n        else printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,5,192
1445255446374842368,c735d0c84e6fab32e8f20286c08ab88823d17453ad5a3a7f3a39448d2c9d5302,2021-10-05 13:12:04,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{int a;\n scanf(\""%d\"",&a);\n for(int b=1,b<=a,b++)\n {scanf(\""%d\"",&c);\n     if(c%2=0)\n {printf(\""xrf wins\"");}\n  else{printf(\""lyx wins\"");}}\n    return 0;\n}",COMPILE_ERROR,0,0
1445255683852058624,c735d0c84e6fab32e8f20286c08ab88823d17453ad5a3a7f3a39448d2c9d5302,2021-10-05 13:13:01,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{int a,b,c;\n scanf(\""%d\"",&a);\n for(b=1,b<=a,b++)\n {scanf(\""%d\"",&c);\n     if(c%2=0)\n {printf(\""xrf wins\"");}\n  else{printf(\""lyx wins\"");}}\n    return 0;\n}",COMPILE_ERROR,0,0
1445255774969200640,c735d0c84e6fab32e8f20286c08ab88823d17453ad5a3a7f3a39448d2c9d5302,2021-10-05 13:13:22,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{int a,b,c;\n scanf(\""%d\"",&a);\n for(b=1,b<=a,b++)\n {scanf(\""%d\"",&c);\n     if(c%2==0)\n {printf(\""xrf wins\"");}\n  else{printf(\""lyx wins\"");}}\n    return 0;\n}",COMPILE_ERROR,0,0
1445256401128374272,c735d0c84e6fab32e8f20286c08ab88823d17453ad5a3a7f3a39448d2c9d5302,2021-10-05 13:15:52,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{int a,b,c;\n scanf(\""%d\"",&a);\n for(b=1;b<=a;b++)\n {scanf(\""%d\"",&c);\n     if(c%2==0)\n {printf(\""xrf wins\"");}\n  else{printf(\""lyx wins\"");}}\n    return 0;\n}",PRESENTATION_ERROR,3,196
1445256509198811136,c735d0c84e6fab32e8f20286c08ab88823d17453ad5a3a7f3a39448d2c9d5302,2021-10-05 13:16:18,C,10.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{int a,b,c;\n scanf(\""%d\"",&a);\n for(b=1;b<=a;b++)\n {scanf(\""%d\"",&c);\n     if(c%2==0)\n {printf(\""xrf wins\\n\"");}\n  else{printf(\""lyx wins\\n\"");}}\n    return 0;\n}",ACCEPTED,4,320
1445276501617344512,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-05 14:35:44,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m%2!=0) printf(\""lyx wins\\n\"");\n        else printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,3,196
1445277226422435840,140e747cf64ef81a0f938ad983389502b5ebb1d3f715e3b675f394320b01ea30,2021-10-05 14:38:37,C,0.0,1444669937311092743,1402551304773722112,385,"#include <stdio.h>\nint main()\n{\n\tint n, a;\n\tint unused __attribute__((unused));\n    unused = scanf(\""%d\"", &n);\n    while (n--)\n    {\n        scanf(\""%d\"", &a);\n        if (a & 1) \n            printf(\""xrf wins\\n\"");\n        else\n            printf(\""lyx wins\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,4,196
1445277412922081280,140e747cf64ef81a0f938ad983389502b5ebb1d3f715e3b675f394320b01ea30,2021-10-05 14:39:21,C,10.0,1444669937311092743,1402551304773722112,385,"#include <stdio.h>\nint main()\n{\n\tint n, a;\n\tint unused __attribute__((unused));\n    unused = scanf(\""%d\"", &n);\n    while (n--)\n    {\n        unused = scanf(\""%d\"", &a);\n        if (a & 1) \n            printf(\""lyx wins\\n\"");\n        else\n            printf(\""xrf wins\\n\"");\n    }\n    return 0;\n}",ACCEPTED,4,188
1445278132631175168,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-05 14:42:13,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m%2!=0) printf(\""lyx wins\\n\"");\n        else printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,3,192
1445325727546146816,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-05 17:51:20,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m%2!=0) printf(\""lyx wins\\n\"");\n        else printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,4,188
1445325992512831488,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-05 17:52:24,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        int m;\n        scanf(\""%d\"",&m);\n        if(m%2!=0) printf(\""lyx wins\\n\"");\n        else printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,4,340
1445326136377540608,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-05 17:52:58,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        int m;\n        scanf(\""%d\"",&m);\n        if(m%2!==0) printf(\""lyx wins\\n\"");\n        else printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1445326364862169088,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-05 17:53:52,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        int m;\n        scanf(\""%d\"",&m);\n        if(m%2!=0) printf(\""lyx wins\\n\"");\n        else printf(\""xrf win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,5,180
1445326543510159360,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-05 17:54:35,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        int m;\n        scanf(\""%d\"",&m);\n        if(m%2=0) printf(\""xrf wins\\n\"");\n        else printf(\""lyx win\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1445326621272637440,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-05 17:54:54,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        int m;\n        scanf(\""%d\"",&m);\n        if(m%2==0) printf(\""xrf wins\\n\"");\n        else printf(\""lyx win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,5,196
1445326890328850432,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-05 17:55:58,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&m);\n    for(int i=0;i<n;i++)\n    {\n        if(m%2==0) printf(\""xrf wins\\n\"");\n        else printf(\""lyx win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,3,324
1445327018842324992,6a015ab1ac87f1fc18d8d4d798bda27f59b12f128b38c11032d0359a2b156b5c,2021-10-05 17:56:28,C,0.0,1444669937311092743,1402551304773722112,385,"#include<stdio.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&m);\n    for(int i=0;i<n;i++)\n    {\n        if(m%2==0) \n        printf(\""xrf wins\\n\"");\n        else \n        printf(\""lyx win\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,3,188
1456585290529972224,1bb9459805f3ac3a730d5d84f09bea2c5291c4c9020c6135141990f95403f907,2021-11-05 19:32:49,C++,10.0,1452662290554568711,1402551304773722112,385,"#include<bits/stdc++.h>\nusing namespace std;\nint main(void)\n{\n    int n, num;\n    cin >> n;\n    while(n--)\n    {\n        cin >> num;\n        if (num % 2 == 0)\n        {\n            cout <<\""xrf wins\"" << endl;\n        }\n        else\n            cout << \""lyx wins\"" << endl;\n    }\n    \n    return 0;\n}",ACCEPTED,7,480
1459523459838816256,52b08b1ee0a8d63012bb374cd79aa89db7fda366698720e6b2a2e66dd37b0daf,2021-11-13 22:08:04,C++,10.0,1452662290554568711,1402551304773722112,385,"#include<iostream>\nusing namespace std;\nint main(){\n    int n;\n    cin>>n;\n    int m;\n    while(n--){\n        cin>>m;\n        if(m%2==0) cout<<\""xrf wins\""<<endl;\n        else cout <<\""lyx wins\""<<endl;\n    }\n    return 0;\n}\n",ACCEPTED,10,460
1460577275376484352,b2a057fec6d162d9cd6893174bb19071d5c51c3da138cd5ea8ed142c2b2ac4d4,2021-11-16 19:55:33,C++,0.0,1452662290554568711,1402551304773722112,385,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=0;i<n;i++)\n    {\n        int x;\n        cin>>x;\n        if(x & 1)cout<<\""lyx wins\"";\n        else cout<<\""xrf wins\"";\n    }\n}",PRESENTATION_ERROR,7,480
1460577339469533184,b2a057fec6d162d9cd6893174bb19071d5c51c3da138cd5ea8ed142c2b2ac4d4,2021-11-16 19:55:48,C++,10.0,1452662290554568711,1402551304773722112,385,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=0;i<n;i++)\n    {\n        int x;\n        cin>>x;\n        if(x & 1)cout<<\""lyx wins\""<<endl;\n        else cout<<\""xrf wins\""<<endl;\n    }\n}",ACCEPTED,12,480
1460642924446248960,4e11a16a3fd4303cd7209c866488e13359bedbcfc1f200f0af25fd275eb4e05c,2021-11-17 00:16:25,C++,10.0,1452662290554568711,1402551304773722112,385,"#include<iostream>\nusing namespace std;\nint main(){\n    int n;\n    cin>>n;\n    while(n--){\n        int t;\n        cin>>t;\n        if(t&1)\n           cout<<\""lyx wins\""<<endl;\n        else\n            cout<<\""xrf wins\""<<endl;\n    }\n}",ACCEPTED,3,452
1460949653553070080,42de9434cf478f5f9b19ce9a77d728f5f259a1257dac0a5c6b54ad3af63479df,2021-11-17 20:35:15,C++,10.0,1452662290554568711,1402551304773722112,385,"#include<bits/stdc++.h>\nusing namespace std;\nint n,m;\nint main(){\n    cin>>n;\n    while(n--){\n        cin>>m;\n        if(m%2==0)\n            cout<<\""xrf wins\""<<endl;\n        else \n            cout<<\""lyx wins\""<<endl;\n    }\n    return 0;\n}",ACCEPTED,3,436
1460972598439624704,b77e1ed19ef2da8489422b015272b5f1a9c886cac028164ffbb6093922efbecc,2021-11-17 22:06:25,C++,0.0,1452662290554568711,1402551304773722112,385,"#include<bits/stdc++.h>\nusing namespace std;\n\nint n,m;\n\nint main(){\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tcin>>m;\n\t\tif(m%2==0){\n\t\t\tcout<<\""xrf wins!\""<<endl;\n\t\t}\n\t\telse{\n\t\t\tcout<<\""lyx wins!\""<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,4,452
1460973562932301824,b77e1ed19ef2da8489422b015272b5f1a9c886cac028164ffbb6093922efbecc,2021-11-17 22:10:15,C++,10.0,1452662290554568711,1402551304773722112,385,"#include<bits/stdc++.h>\nusing namespace std;\n\nint n,m;\n\nint main(){\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tcin>>m;\n\t\tif(m%2==0){\n\t\t\tcout<<\""xrf wins\""<<endl;\n\t\t}\n\t\telse{\n\t\t\tcout<<\""lyx wins\""<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,3,456
1585435215698726912,aeb336709a2ad693cbf282c8bc4186c796004dd2c8af9688cacc653040afdfdb,2022-10-27 08:56:26,PHP,300.0,1585295064249692165,1575302648498941952,406,14.7,ACCEPTED,11,3624
1585449088627638272,e9575a6800cb53d3d19c486872e080e350094ac3908889be2a524231688ab3b8,2022-10-27 09:51:33,PHP,300.0,1585295064249692165,1575302648498941952,406,14.7,ACCEPTED,11,3624
1571332482928828416,f38d900d59cc0e6b63c150a834a0a69b6e323d89f05c073c5413ca51e46dd27c,2022-09-18 10:57:12,C++,0.0,1570788316276781061,1569531327513030656,385,"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint t;\nint x, y;\nint a, b;\n\nlong long int cal(int x) {\n    if(x == 0) return 1;\n    else {\n        long long int sum = 1;\n        for(int i = y - x; i <= y; i ++) {\n            sum *= i;\n        }\n        for(int i = 1; i <= x; i ++) {\n            sum /= i;\n        }\n         return sum;\n    }\n}\n\nint main() {\n    cin >> t;\n    while(t --) {\n        cin >> x >> y;\n        int temp = 10;\n        while(temp --) {\n            cin >> a >> b;\n            int sum = a + b;\n            double avg = 0.000000;\n            for(int i = 0; i <= sum; i ++) {\n                avg += pow(1.0 / x, y) * cal(i);\n            }\n            printf(\""%.6lf\"", avg);\n            if(temp) cout << endl;\n        }\n        if(t) cout << endl;\n    }\n}",TIME_LIMIT_EXCEEDED,4000,660
1571334625954267136,5d51d24a72d986e13a223547e00bb92fb3c678b4d734fda13fb7963295fcb6a0,2022-09-18 11:05:43,C++,0.0,1570788316276781061,1569531327513030656,385,"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n    cout << \""0\"";\n}",WRONG_ANSWER,5,456
1586512389977542656,1a00c53967181da480f6e16919d4f12934e1f5a571774717132739521fffcac8,2022-10-30 08:16:44,C,0.0,1586237355562917893,1575302648498941952,406,hnihbvih,COMPILE_ERROR,0,0
1586512481677611008,1a00c53967181da480f6e16919d4f12934e1f5a571774717132739521fffcac8,2022-10-30 08:17:06,C,0.0,1586237355562917894,1575450168429944832,406,r(0<1<=5),COMPILE_ERROR,0,0
1586512625093447680,903ffb6278cc3faf5d860978377369b99bbd2cbfa90de26d22bec85aa25c55d1,2022-10-30 08:17:40,C,0.0,1586237355562917893,1575302648498941952,406,"#include<stdio.h>\nint main()\n{\n    printf(\""1\"");\n    return 0;\n}",WRONG_ANSWER,2,324
1586513155865841664,1a00c53967181da480f6e16919d4f12934e1f5a571774717132739521fffcac8,2022-10-30 08:19:47,C,0.0,1586237355562917900,1584876378155532288,406,(1<=n<=10000),COMPILE_ERROR,0,0
1586513225826824192,903ffb6278cc3faf5d860978377369b99bbd2cbfa90de26d22bec85aa25c55d1,2022-10-30 08:20:03,C,0.0,1586237355562917893,1575302648498941952,406,"#include<stdio.h>\nint main()\n{\n    printf(\""21/6\"");\n    return 0;\n}",WRONG_ANSWER,3,196
1586513262602481664,903ffb6278cc3faf5d860978377369b99bbd2cbfa90de26d22bec85aa25c55d1,2022-10-30 08:20:12,C,0.0,1586237355562917893,1575302648498941952,406,"#include<stdio.h>\nint main()\n{\n    printf(\""7/2\"");\n    return 0;\n}",WRONG_ANSWER,3,200
1586513295221583872,903ffb6278cc3faf5d860978377369b99bbd2cbfa90de26d22bec85aa25c55d1,2022-10-30 08:20:20,C,0.0,1586237355562917893,1575302648498941952,406,"#include<stdio.h>\nint main()\n{\n    printf(\""3.5\"");\n    return 0;\n}",WRONG_ANSWER,3,324
1586513459080466432,1a00c53967181da480f6e16919d4f12934e1f5a571774717132739521fffcac8,2022-10-30 08:20:59,C,0.0,1586237355562917903,1579476539066281984,406,T(1<=T<=10),COMPILE_ERROR,0,0
1586513922496528384,903ffb6278cc3faf5d860978377369b99bbd2cbfa90de26d22bec85aa25c55d1,2022-10-30 08:22:49,C,0.0,1586237355562917893,1575302648498941952,406,"#include<stdio.h>\nint main()\n{\n    double x;\n    x=3.5;\n    printf(\""%.1lf\"",x);\n    return 0;\n}",WRONG_ANSWER,3,196
1586514116785074176,903ffb6278cc3faf5d860978377369b99bbd2cbfa90de26d22bec85aa25c55d1,2022-10-30 08:23:36,C,0.0,1586237355562917893,1575302648498941952,406,"#include<stdio.h>\nint main()\n{\n    double x;\n    x=3.5;\n    printf(\""Hint:%.1lf\"",x);\n    return 0;\n}",WRONG_ANSWER,2,192
1586514144777859072,b36fac86ec655ec2aae011b80dfab5286b19c24e475733f6baf70eed15bc73aa,2022-10-30 08:23:42,PHP,300.0,1586237355562917893,1575302648498941952,406,14.7,ACCEPTED,10,2756
1586514145348292608,903ffb6278cc3faf5d860978377369b99bbd2cbfa90de26d22bec85aa25c55d1,2022-10-30 08:23:42,C,0.0,1586237355562917893,1575302648498941952,406,"#include<stdio.h>\nint main()\n{\n    double x;\n    x=3.5;\n    printf(\""Hint: %.1lf\"",x);\n    return 0;\n}",WRONG_ANSWER,3,324
1586514350432980992,903ffb6278cc3faf5d860978377369b99bbd2cbfa90de26d22bec85aa25c55d1,2022-10-30 08:24:31,C,0.0,1586237355562917893,1575302648498941952,406,"#include<stdio.h>\nint main()\n{\n    double x;\n    x=1;\n    printf(\""Hint: %.1lf\"",x);\n    return 0;\n}",WRONG_ANSWER,3,352
1586514392585732096,903ffb6278cc3faf5d860978377369b99bbd2cbfa90de26d22bec85aa25c55d1,2022-10-30 08:24:41,C,0.0,1586237355562917893,1575302648498941952,406,"#include<stdio.h>\nint main()\n{\n    double x;\n    x=7/2;\n    printf(\""Hint: %.1lf\"",x);\n    return 0;\n}",WRONG_ANSWER,4,324
1586514431685033984,903ffb6278cc3faf5d860978377369b99bbd2cbfa90de26d22bec85aa25c55d1,2022-10-30 08:24:51,C,0.0,1586237355562917893,1575302648498941952,406,"#include<stdio.h>\nint main()\n{\n    double x;\n    x=7/2;\n    printf(\""%.1lf\"",x);\n    return 0;\n}",WRONG_ANSWER,3,196
1586514743648972800,836e4d8e2f855533cf20462f63d4612b68a67a631011dcb62e87ebd53ed320b4,2022-10-30 08:26:05,C++,0.0,1586237355562917893,1575302648498941952,406,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n    printf(\""%.1f\"",pow(6,6)/720);\n    return 0;\n}",WRONG_ANSWER,3,452
1586515347838472192,903ffb6278cc3faf5d860978377369b99bbd2cbfa90de26d22bec85aa25c55d1,2022-10-30 08:28:29,C,0.0,1586237355562917893,1575302648498941952,406,"#include<stdio.h>\nint main()\n{\n    printf(\""3.5\"");\n    return 0;\n}",WRONG_ANSWER,3,324
1586516135323238400,71c5a249b56ddaf1b7cdc60c2fa94033cf7fe68d2609b61a5a777a74f6116d15,2022-10-30 08:31:37,Python,0.0,1586237355562917894,1575450168429944832,406,input T and (0<T<=5)\nreturn(n) and (3<n<=15),NON_ZERO_EXIT_CODE,11,2892
1586516343603990528,71c5a249b56ddaf1b7cdc60c2fa94033cf7fe68d2609b61a5a777a74f6116d15,2022-10-30 08:32:27,Python,0.0,1586237355562917893,1575302648498941952,406,input T and (0<T<=5)\nreturn(n) and (3<n<=15),NON_ZERO_EXIT_CODE,11,3016
1586516394904514560,71c5a249b56ddaf1b7cdc60c2fa94033cf7fe68d2609b61a5a777a74f6116d15,2022-10-30 08:32:39,Python,0.0,1586237355562917903,1579476539066281984,406,input T and (0<T<=5)\nreturn(n) and (3<n<=15),NON_ZERO_EXIT_CODE,11,3016
1586516519810887680,71c5a249b56ddaf1b7cdc60c2fa94033cf7fe68d2609b61a5a777a74f6116d15,2022-10-30 08:33:09,Python,0.0,1586237355562917900,1584876378155532288,406,input T and (0<T<=5)\nreturn(n) and (3<n<=15),NON_ZERO_EXIT_CODE,12,2892
1586517221434068992,de7c584ffb5bb2ecb8b321ccbfeaac620c41b4f8cb6ecf4cfe8fb30f85dc859d,2022-10-30 08:35:56,C++,0.0,1586237355562917894,1575450168429944832,406,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tdouble a=1.0/120;\n\tprintf(\""%.1lf\"",a);\n\treturn 0;\n}",WRONG_ANSWER,4,324
1586517235292041216,c27e3cf13c58c495b67a8c93e0cbebd66c362eb0d47290a9481fdc7889597efd,2022-10-30 08:35:59,C,0.0,1586237355562917893,1575302648498941952,406,input(cauc);\noutout(wo yao su tuo);,COMPILE_ERROR,0,0
1586517267890171904,c27e3cf13c58c495b67a8c93e0cbebd66c362eb0d47290a9481fdc7889597efd,2022-10-30 08:36:07,C,0.0,1586237355562917894,1575450168429944832,406,input(cauc);\noutout(wo yao su tuo);,COMPILE_ERROR,0,0
1586517291067895808,de7c584ffb5bb2ecb8b321ccbfeaac620c41b4f8cb6ecf4cfe8fb30f85dc859d,2022-10-30 08:36:12,C++,0.0,1586237355562917893,1575302648498941952,406,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tdouble a=1.0/120;\n\tprintf(\""%.1lf\"",a);\n\treturn 0;\n}",WRONG_ANSWER,4,324
1586517475579523072,c27e3cf13c58c495b67a8c93e0cbebd66c362eb0d47290a9481fdc7889597efd,2022-10-30 08:36:56,C,0.0,1586237355562917900,1584876378155532288,406,input(cauc);\noutout(wo yao su tuo);,COMPILE_ERROR,0,0
1586517598116114432,c27e3cf13c58c495b67a8c93e0cbebd66c362eb0d47290a9481fdc7889597efd,2022-10-30 08:37:26,C,0.0,1586237355562917903,1579476539066281984,406,input(cauc);\noutout(wo yao su tuo);,COMPILE_ERROR,0,0
1586517621298032640,c27e3cf13c58c495b67a8c93e0cbebd66c362eb0d47290a9481fdc7889597efd,2022-10-30 08:37:31,C,0.0,1586237355562917903,1579476539066281984,406,input(cauc);\noutout(wo yao su tuo);,COMPILE_ERROR,0,0
1586518911193317376,f6108ebdbf2e63d35ea55d7580302dbe47ee3b58962e3e3addc8ffd751a25ea6,2022-10-30 08:42:39,C,0.0,1586237355562917900,1584876378155532288,406,1\n2\n4 4\n5 5\n6 6\n12 12\n8 8\n,COMPILE_ERROR,0,0
1586519116072484864,f6108ebdbf2e63d35ea55d7580302dbe47ee3b58962e3e3addc8ffd751a25ea6,2022-10-30 08:43:28,C,0.0,1586237355562917903,1579476539066281984,406,1\n3\n0.3 0.3 0.3 0.1\n0.1 0.2 0.3 0.4\n0.2 0.2 0.2 0.4\n,COMPILE_ERROR,0,0
1586519297375469568,f6108ebdbf2e63d35ea55d7580302dbe47ee3b58962e3e3addc8ffd751a25ea6,2022-10-30 08:44:11,C,0.0,1586237355562917893,1575302648498941952,406,002,COMPILE_ERROR,0,0
1586519333370982400,f6108ebdbf2e63d35ea55d7580302dbe47ee3b58962e3e3addc8ffd751a25ea6,2022-10-30 08:44:19,C,0.0,1586237355562917894,1575450168429944832,406,1\n4\n25 25 25 25\n,COMPILE_ERROR,0,0
1586519686300700672,836e4d8e2f855533cf20462f63d4612b68a67a631011dcb62e87ebd53ed320b4,2022-10-30 08:45:43,C++,300.0,1586237355562917900,1584876378155532288,406,"#pragma once\n#include<bits/stdc++.h>\n#define int long long\nusing namespace std;\n\nconst int mod = 998244353;\n\nint fp(int a,int b) {\n\tint rs = 1;\n\twhile (b)\n\t{\n\t\tif (b&1) {\n\t\t\trs = rs * a % mod;\n\t\t}\n\t\ta = a * a % mod;\n\t\tb >>= 1;\n\t}\n\treturn rs;\n}\n\nsigned main() {\n\tios::sync_with_stdio(0);\n\tcin.tie(0), cout.tie(0);\n\tint T;\n\tcin >> T;\n\twhile (T--)\n\t{\n\t\tint n,a;\n\t\tcin >> n;\n\t\tint sum = 0;\n\t\tint div = fp(n,mod-2);\n\t\tfor (int i = 0; i < 5; i++)\n\t\t{\n\t\t\tfor (int j = 0; j < n; j++)\n\t\t\t{\n\t\t\t\tcin >> a;\n\t\t\t\tsum = (sum + a * div % mod) % mod;\n\t\t\t}\n\t\t}\n\t\tcout << sum << \""\\n\"";\n\t}\n}",ACCEPTED,159,452
1586526310792822784,de7c584ffb5bb2ecb8b321ccbfeaac620c41b4f8cb6ecf4cfe8fb30f85dc859d,2022-10-30 09:12:03,C++,0.0,1586237355562917893,1575302648498941952,406,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tdouble a=120.0;\n\tprintf(\""%.1lf\"",a);\n\treturn 0;\n}",WRONG_ANSWER,9,608
1586527184239853568,3fe4d481391cc58c5ee9e9d4ed93a8718ec2ed6b3f4b8e26172aac08a64981fa,2022-10-30 09:15:31,C,0.0,1586237355562917893,1575302648498941952,406,int,COMPILE_ERROR,0,0
1586527218305986560,3fe4d481391cc58c5ee9e9d4ed93a8718ec2ed6b3f4b8e26172aac08a64981fa,2022-10-30 09:15:39,C,0.0,1586237355562917894,1575450168429944832,406,inhy,COMPILE_ERROR,0,0
1586527424019820544,3fe4d481391cc58c5ee9e9d4ed93a8718ec2ed6b3f4b8e26172aac08a64981fa,2022-10-30 09:16:28,C,0.0,1586237355562917900,1584876378155532288,406,ooo,COMPILE_ERROR,0,0
1586527518819487744,3fe4d481391cc58c5ee9e9d4ed93a8718ec2ed6b3f4b8e26172aac08a64981fa,2022-10-30 09:16:51,C,0.0,1586237355562917903,1579476539066281984,406,ryh,COMPILE_ERROR,0,0
1586529893529550848,5d0a1ac0e5f225046615cf0c7103d8357246c0fd65bfed7f478758f014b42c6a,2022-10-30 09:26:17,C,0.0,1586237355562917900,1584876378155532288,406,"#include<stdio.h>\nint main(){\n    int t;\n    scanf(\""%d\"",&t);\n    while(t--){\n        long long n;\n        scanf(\""%lld\"",&n);\n        int a[5][n];\n        long long sum=0,cnt=0;\n        for(int i=0;i<n;i++){\n            for(int j=0;j<5;j++){\n                scanf(\""%d\"",&a[j][i]);\n                cnt+=a[j][i];\n            }\n            sum+=cnt/n;cnt=0;\n        }\n        sum=sum%998244353;\n        printf(\""%d\"",sum);\n    }\n    \n    \n    \n    return 0;\n}",WRONG_ANSWER,172,2232
1586529965851930624,1da550b246045b5d8e21db73e0d4b28eeb5482ef333e6109c8dc2e3c0cd9af74,2022-10-30 09:26:34,C++,0.0,1586237355562917900,1584876378155532288,406,"#include <bits/stdc++.h>\nusing namespace std;\nconst int mod=998244353;\n#define int long long\nsigned main()\n{\n    int t;\n    scanf(\""%lld\"",&t);\n    while(t--)\n    {\n        int n;\n        scanf(\""%lld\"",&n);\n        int sum=0;\n        for(int i=0;i<5*n;i++)\n        {\n            int x;\n            cin >> x;\n            sum += x;\n            \n        }\n        cout << (sum/n)%mod << endl;\n    }\n}",WRONG_ANSWER,446,396
1586533836896735232,1da550b246045b5d8e21db73e0d4b28eeb5482ef333e6109c8dc2e3c0cd9af74,2022-10-30 09:41:57,C++,0.0,1586237355562917900,1584876378155532288,406,"#include <bits/stdc++.h>\nusing namespace std;\nconst int mod=998244353;\n#define int long long\nsigned main()\n{\n    int t;\n    scanf(\""%lld\"",&t);\n    while(t--)\n    {\n        int n;\n        scanf(\""%lld\"",&n);\n        int sum=0;\n        for(int j = 0 ; j < 5 ; j++){\n            int add = 0;\n           for(int i=0;i<n;i++)\n            {\n                int x;\n                cin >> x;\n                add += x;\n            }\n            sum += (add/n)%mod;\n            sum%=mod;\n        }\n        cout << sum << endl;\n    }\n}",WRONG_ANSWER,452,456
1586535045900664832,5d0a1ac0e5f225046615cf0c7103d8357246c0fd65bfed7f478758f014b42c6a,2022-10-30 09:46:45,C,0.0,1586237355562917900,1584876378155532288,406,"#include<stdio.h>\nint main(){\n    int t;\n    scanf(\""%d\"",&t);\n    while(t--){\n        long long n;\n        scanf(\""%lld\"",&n);\n        int a[5][n];\n        long long sum=0,cnt=0;\n        for(int i=0;i<n;i++){\n            for(int j=0;j<5;j++){\n                scanf(\""%d\"",&a[j][i]);\n                cnt+=a[j][i];\n            }\n            sum+=cnt/n;cnt=0;\n        }\n        sum=sum%998244353;\n        printf(\""%lld\\n\"",sum);\n    }\n    \n    \n    \n    return 0;\n}",WRONG_ANSWER,170,2168
1586535690426777600,5d0a1ac0e5f225046615cf0c7103d8357246c0fd65bfed7f478758f014b42c6a,2022-10-30 09:49:19,C,0.0,1586237355562917900,1584876378155532288,406,#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint times = 0;\n\tcin >> times;\n\t\n\twhile (times--){\n\t\tint geshu = 0;\n\t\tcin >> geshu;\n\t\t\n\t\tlong long sum = 0;\n\t\tfor(int i = 0; i < 5*geshu ; i++){\n\t\t\tint fenshu = 0;\n\t\t\tcin >> fenshu;\n\t\t\t\n\t\t\tsum += fenshu;\n\t\t}\n\t\t\n\t\tcout << (sum/geshu)%998244353 << endl;\n\t}\n},COMPILE_ERROR,0,0
1586535726921420800,5d0a1ac0e5f225046615cf0c7103d8357246c0fd65bfed7f478758f014b42c6a,2022-10-30 09:49:28,C++,0.0,1586237355562917900,1584876378155532288,406,#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint times = 0;\n\tcin >> times;\n\t\n\twhile (times--){\n\t\tint geshu = 0;\n\t\tcin >> geshu;\n\t\t\n\t\tlong long sum = 0;\n\t\tfor(int i = 0; i < 5*geshu ; i++){\n\t\t\tint fenshu = 0;\n\t\t\tcin >> fenshu;\n\t\t\t\n\t\t\tsum += fenshu;\n\t\t}\n\t\t\n\t\tcout << (sum/geshu)%998244353 << endl;\n\t}\n},WRONG_ANSWER,431,476
1586536377957093376,1da550b246045b5d8e21db73e0d4b28eeb5482ef333e6109c8dc2e3c0cd9af74,2022-10-30 09:52:03,C++,0.0,1586237355562917900,1584876378155532288,406,"#include <bits/stdc++.h>\nusing namespace std;\nconst int mod=998244353;\n#define int long long\n// 109\nsigned main()\n{\n    int t;\n    scanf(\""%lld\"",&t);\n    while(t--)\n    {\n        int n;\n        scanf(\""%lld\"",&n);\n        double sum=0;\n        for(int j = 0 ; j < 5 ; j++){\n            int add = 0;\n           for(int i=0;i<n;i++)\n            {\n                int x;\n                cin >> x;\n                add += x%mod;\n                add%=mod;\n            }\n            add%=mod;\n            sum += (double)add/n;\n        }\n        cout << sum << endl;\n    }\n}",WRONG_ANSWER,451,500
1586537857292304384,5d0a1ac0e5f225046615cf0c7103d8357246c0fd65bfed7f478758f014b42c6a,2022-10-30 09:57:56,C++,0.0,1586237355562917900,1584876378155532288,406,#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint times = 0;\n\tcin >> times;\n\t\n\twhile (times--){\n\t\tint geshu = 0;\n\t\tcin >> geshu;\n\t\t\n\t\tlong long sum = 0;\n\t\tlong long sum1 = 0;\n\t\tfor(int i = 0; i < 5 ; i++){\n\t\t\tfor (int j = 0;j<geshu;j++){\n\t\t\t\tint fenshu = 0;\n\t\t\t\tcin >> fenshu;\n\t\t\t\t\t\t\t\n\t\t\t\tsum += fenshu;\n\t\t\t}\n\t\t\tsum  /= geshu ;\t\t\t\n\t\t\tsum1 += sum;\n\t\t\tsum = 0;\n\t\t}\n\t\t\n\t\tcout << (sum1)%998244353 << endl;\n\t}\n}\n\n,WRONG_ANSWER,427,392
1586538087471517696,4341b358fdbc9d5ba2263517fc8dcfd3ef71d71c493f5dfa98eb47b06a4049a0,2022-10-30 09:58:51,C++,0.0,1586237355562917893,1575302648498941952,406,"#include<iostream>\nusing namespace std ;\n\nint main()\n{\n    cout<<\""0.1\""\n}",COMPILE_ERROR,0,0
1586538111395827712,4341b358fdbc9d5ba2263517fc8dcfd3ef71d71c493f5dfa98eb47b06a4049a0,2022-10-30 09:58:56,C++,0.0,1586237355562917893,1575302648498941952,406,"#include<iostream>\nusing namespace std ;\n\nint main()\n{\n    cout<<\""0.1\"";\n}",WRONG_ANSWER,4,456
1586538140034531328,4341b358fdbc9d5ba2263517fc8dcfd3ef71d71c493f5dfa98eb47b06a4049a0,2022-10-30 09:59:03,C++,0.0,1586237355562917893,1575302648498941952,406,"#include<iostream>\nusing namespace std ;\n\nint main()\n{\n    cout<<\""0.2\"";\n}",WRONG_ANSWER,6,324
1586539108360912896,4341b358fdbc9d5ba2263517fc8dcfd3ef71d71c493f5dfa98eb47b06a4049a0,2022-10-30 10:02:54,C++,0.0,1586237355562917893,1575302648498941952,406,"#include<iostream>\nusing namespace std ;\n\nint main()\n{\n    cout<<\""3.5\"";\n}",WRONG_ANSWER,8,332
1586539214900428800,4341b358fdbc9d5ba2263517fc8dcfd3ef71d71c493f5dfa98eb47b06a4049a0,2022-10-30 10:03:19,C++,0.0,1586237355562917893,1575302648498941952,406,"#include<iostream>\nusing namespace std ;\n\nint main()\n{\n    cout<<\""36.0\"";\n}",WRONG_ANSWER,5,456
1586545228320210944,a62b950ae0c3e6ab91ca3d060c326bca210b0c2e9728dc507b484528d67607dd,2022-10-30 10:27:13,C,0.0,1586237355562917893,1575302648498941952,406,66.6,COMPILE_ERROR,0,0
1586545311870742528,a62b950ae0c3e6ab91ca3d060c326bca210b0c2e9728dc507b484528d67607dd,2022-10-30 10:27:33,C,0.0,1586237355562917893,1575302648498941952,406,Hint：66.6,COMPILE_ERROR,0,0
1586546227038519296,6867459fa2a518a4b6102f9215a2c4c9030ec5f6d2f3d7b23993cb6ee88ad235,2022-10-30 10:31:11,Python,0.0,1586237355562917893,1575302648498941952,406,fsda,NON_ZERO_EXIT_CODE,17,3020
1586546257128456192,6867459fa2a518a4b6102f9215a2c4c9030ec5f6d2f3d7b23993cb6ee88ad235,2022-10-30 10:31:18,Python,0.0,1586237355562917894,1575450168429944832,406,fsadf,NON_ZERO_EXIT_CODE,18,3016
1586546419955531776,6867459fa2a518a4b6102f9215a2c4c9030ec5f6d2f3d7b23993cb6ee88ad235,2022-10-30 10:31:57,C++,0.0,1586237355562917900,1584876378155532288,406,fsadf,COMPILE_ERROR,0,0
1586546493594923008,6867459fa2a518a4b6102f9215a2c4c9030ec5f6d2f3d7b23993cb6ee88ad235,2022-10-30 10:32:15,C++,0.0,1586237355562917903,1579476539066281984,406,sdfaf,COMPILE_ERROR,0,0
1586546596976136192,a62b950ae0c3e6ab91ca3d060c326bca210b0c2e9728dc507b484528d67607dd,2022-10-30 10:32:39,Java,0.0,1586237355562917903,1579476539066281984,406,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        while (in.hasNextInt()) {\n            int a = in.nextInt();\n            int b = in.nextInt();\n            System.out.println(a + b);\n        }\n    }\n},WRONG_ANSWER,115,24380
1586546820360572928,a62b950ae0c3e6ab91ca3d060c326bca210b0c2e9728dc507b484528d67607dd,2022-10-30 10:33:33,Python,0.0,1586237355562917900,1584876378155532288,406,"import sys\n\nfor line in sys.stdin:\n    print(sum(map(int, line.split())))",WRONG_ANSWER,642,13472
1586546836504444928,a62b950ae0c3e6ab91ca3d060c326bca210b0c2e9728dc507b484528d67607dd,2022-10-30 10:33:37,Python,0.0,1586237355562917900,1584876378155532288,406,"import sys\n\nfor line in sys.stdin:\n    print(sum(map(int, line.split())))",WRONG_ANSWER,590,13624
1586547142629912576,a62b950ae0c3e6ab91ca3d060c326bca210b0c2e9728dc507b484528d67607dd,2022-10-30 10:34:50,Python,0.0,1586237355562917894,1575450168429944832,406,"while True:\n    raw = input()\n    if raw == '':\n        break\n    print(sum(map(int, raw.split())))",NON_ZERO_EXIT_CODE,16,2764
1586548756929445888,b599e42a11cf6756d0963f10b7d461950d3b1b83b2e6fff4adf568a86cc21bcb,2022-10-30 10:41:14,Python,0.0,1586237355562917893,1575302648498941952,406,print(14),WRONG_ANSWER,20,2700
1586548780153307136,b599e42a11cf6756d0963f10b7d461950d3b1b83b2e6fff4adf568a86cc21bcb,2022-10-30 10:41:20,Python,0.0,1586237355562917893,1575302648498941952,406,print(12),WRONG_ANSWER,17,2892
1586549032327442432,1da550b246045b5d8e21db73e0d4b28eeb5482ef333e6109c8dc2e3c0cd9af74,2022-10-30 10:42:20,C++,0.0,1586237355562917900,1584876378155532288,406,"#include <bits/stdc++.h>\nusing namespace std;\nconst int mod=998244353;\ntypedef __int128_t ll;\nint main()\n{\n    int t;\n    scanf(\""%lld\"",&t);\n    while(t--)\n    {\n        int n;\n        scanf(\""%d\"",&n);\n        ll sum=0;\n        for(int j = 0 ; j < 5 ; j++){\n            int add = 0;\n           for(int i=0;i<n;i++)\n            {\n                int x;\n                cin >> x;\n                add += x;\n            }\n            sum += add;\n        }\n        sum%=mod;\n        cout << (double)sum/n << endl;\n    }\n}",WRONG_ANSWER,427,476
1586550788553830400,8d17e58a4c6d0c0c30c232e43f28e67169d199d4836d317d6dd0d8501c288caf,2022-10-30 10:49:19,C,0.0,1586237355562917893,1575302648498941952,406,asdfdasds,COMPILE_ERROR,0,0
1586550849656459264,8d17e58a4c6d0c0c30c232e43f28e67169d199d4836d317d6dd0d8501c288caf,2022-10-30 10:49:33,C,0.0,1586237355562917894,1575450168429944832,406,fdsgfdsg,COMPILE_ERROR,0,0
1586551171808362496,8d17e58a4c6d0c0c30c232e43f28e67169d199d4836d317d6dd0d8501c288caf,2022-10-30 10:50:50,C,0.0,1586237355562917900,1584876378155532288,406,sdfgfds,COMPILE_ERROR,0,0
1586551300196012032,8d17e58a4c6d0c0c30c232e43f28e67169d199d4836d317d6dd0d8501c288caf,2022-10-30 10:51:21,C,0.0,1586237355562917903,1579476539066281984,406,gsfgsdgfd,COMPILE_ERROR,0,0
1586558109258481664,f64a4e827ce2f76b0d7eb40fafdd9d9b9947f017c94190462aaff0070f108a9e,2022-10-30 11:18:24,C++,0.0,1586237355562917893,1575302648498941952,406,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{cout<<\""2.1\"";}",WRONG_ANSWER,10,624
1586558722230841344,836e4d8e2f855533cf20462f63d4612b68a67a631011dcb62e87ebd53ed320b4,2022-10-30 11:20:50,C++,0.0,1586237355562917893,1575302648498941952,406,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n    printf(\""36.0\"");\n    return 0;\n}",WRONG_ANSWER,11,448
1586564205364772864,4341b358fdbc9d5ba2263517fc8dcfd3ef71d71c493f5dfa98eb47b06a4049a0,2022-10-30 11:42:38,C++,0.0,1586237355562917893,1575302648498941952,406,"#include<iostream>\nusing namespace std ;\n\nint main()\n{\n    cout<<\""1.0\"";\n}",WRONG_ANSWER,6,480
1586568020017156096,5d0a1ac0e5f225046615cf0c7103d8357246c0fd65bfed7f478758f014b42c6a,2022-10-30 11:57:47,C++,0.0,1586237355562917900,1584876378155532288,406,#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint times = 0;\n\tcin >> times;\n\t\n\twhile (times--){\n\t\tint geshu = 0;\n\t\tcin >> geshu;\n\t\t\n\t\tdouble sum = 0;\n\t\tdouble sum1 = 0;\n\t\tfor(int i = 0; i < 5 ; i++){\n\t\t\tfor (int j = 0;j<geshu;j++){\n\t\t\t\tint fenshu = 0;\n\t\t\t\tcin >> fenshu;\n\t\t\t\t\t\t\t\n\t\t\t\tsum += fenshu;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tsum  /= geshu ;\t\t\t\n\t\t\t\t\t\t\tsum1 += sum;\n\t\t\t\t\t\t\tsum = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\tcout << (sum1)%998244353 << endl;\n\t}\n}\n\n,COMPILE_ERROR,0,0
1586568165622419456,5d0a1ac0e5f225046615cf0c7103d8357246c0fd65bfed7f478758f014b42c6a,2022-10-30 11:58:22,C++,0.0,1586237355562917900,1584876378155532288,406,#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint times = 0;\n\tcin >> times;\n\t\n\twhile (times--){\n\t\tint geshu = 0;\n\t\tcin >> geshu;\n\t\t\n\t\tdouble sum = 0;\n\t\tdouble sum1 = 0;\n\t\tfor(int i = 0; i < 5 ; i++){\n\t\t\tfor (int j = 0;j<geshu;j++){\n\t\t\t\tint fenshu = 0;\n\t\t\t\tcin >> fenshu;\n\t\t\t\t\t\t\t\n\t\t\t\tsum += fenshu;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tsum  /= geshu ;\t\t\t\n\t\t\t\t\t\t\tsum1 += sum;\n\t\t\t\t\t\t\tsum = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\tcout << (sum1) << endl;\n\t}\n}\n\n,WRONG_ANSWER,459,392
1586568561887678464,4341b358fdbc9d5ba2263517fc8dcfd3ef71d71c493f5dfa98eb47b06a4049a0,2022-10-30 11:59:56,C++,0.0,1586237355562917900,1584876378155532288,406,"#include<iostream>\n\nusing namespace std ; \nint c = 998244353 ;\n\nint main()\n{\n    int t , n ;\n    cin >> t ;\n    for(int i = 0 ; i < t ; i ++ )\n    {\n        double sum = 0.0 , x ;\n        cin >> n ;\n        for(int j = 0 ; j <5 * n ; j ++ )\n        {\n            cin >>x;\n            sum += 1.0 * x / n ;\n        }\n        int num = (int)sum ;\n        num = num % c ;\n        cout<< num << endl ;\n    }\n}\n",WRONG_ANSWER,716,480
1586569180203577344,5d0a1ac0e5f225046615cf0c7103d8357246c0fd65bfed7f478758f014b42c6a,2022-10-30 12:02:24,C++,0.0,1586237355562917900,1584876378155532288,406,#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint times = 0;\n\tcin >> times;\n\t\n\twhile (times--){\n\t\tint geshu = 0;\n\t\tcin >> geshu;\n\t\t\n\t\tdouble sum = 0;\n\t\tdouble sum1 = 0;\n\t\tfor(int i = 0; i < 5 ; i++){\n\t\t\tfor (int j = 0;j<geshu;j++){\n\t\t\t\tint fenshu = 0;\n\t\t\t\tcin >> fenshu;\n\t\t\t\t\t\t\t\n\t\t\t\tsum += fenshu;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tsum  /= geshu ;\t\t\t\n\t\t\t\t\t\t\tsum1 += sum;\n\t\t\t\t\t\t\tsum = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\tcout << (int)sum1 << endl;\n\t}\n}\n\n,WRONG_ANSWER,432,452
1586593481770266624,9f5eb0ae887568eea87abc1a81c4b809ba68489c486cd6dea5cd34a72b8f05d6,2022-10-30 13:38:58,Python,0.0,1586237355562917893,1575302648498941952,406,1,WRONG_ANSWER,17,3064
1586593510530609152,9f5eb0ae887568eea87abc1a81c4b809ba68489c486cd6dea5cd34a72b8f05d6,2022-10-30 13:39:05,Python,0.0,1586237355562917894,1575450168429944832,406,e1,NON_ZERO_EXIT_CODE,22,3052
1586593714856132608,9f5eb0ae887568eea87abc1a81c4b809ba68489c486cd6dea5cd34a72b8f05d6,2022-10-30 13:39:53,Python,0.0,1586237355562917900,1584876378155532288,406,hjhjkl,NON_ZERO_EXIT_CODE,13,2984
1586593754681049088,9f5eb0ae887568eea87abc1a81c4b809ba68489c486cd6dea5cd34a72b8f05d6,2022-10-30 13:40:03,Python,0.0,1586237355562917903,1579476539066281984,406,ouhoio,NON_ZERO_EXIT_CODE,17,3200
1586608908240023552,836e4d8e2f855533cf20462f63d4612b68a67a631011dcb62e87ebd53ed320b4,2022-10-30 14:40:16,C++,300.0,1586237355562917893,1575302648498941952,406,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n    printf(\""14.7\"");\n    return 0;\n}",ACCEPTED,6,324
1587701798201241600,8d043f9e1fde6d7ad7ab969376cc3c16c2b19f7970a8150179a8f030122a1ad7,2022-11-02 15:03:01,Python,300.0,1586933889375956997,1575302648498941952,406,print(14.7),ACCEPTED,17,2764
1588521286752579584,d83f06843cd5d1ec7602d52a9c768cbe8f9ecf614453ff14a2185b7d03736ce2,2022-11-04 21:19:22,C++,300.0,1586933889375956997,1575302648498941952,406,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    printf(\""14.7\"");\n}",ACCEPTED,6,324
1589075240527900672,d83f06843cd5d1ec7602d52a9c768cbe8f9ecf614453ff14a2185b7d03736ce2,2022-11-06 10:00:35,C++,0.0,1586933889375957004,1584876378155532288,406,"#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\nconst int mod=998244353;\nint qk(int k)\n{\n    int ans=k;\n    int t=mod-2;\n    while(t)\n    {\n        if(t&1)\n        {\n            k=(k%mod*ans%mod)%mod;\n        }\n        t>>=1;\n        ans=(ans%mod*ans%mod)%mod;\n    }\n    return k;\n}\nsigned main()\n{\n    int t;\n    scanf(\""%lld\"",&t);\n    while(t--)\n    {\n        int n;\n        scanf(\""%lld\"",&n);\n        int i;\n        int ans=0;\n        int j;\n        for(i=0;i<5;i++)\n        {\n            int sum=0;\n        for(j=0;j<n;j++)\n        {\n            int v;\n            scanf(\""%lld\"",&v);\n            sum+=v;\n        }\n            ans+=(sum*qk(n))%mod;\n            ans%=mod;\n        }\n        printf(\""%lld\\n\"",ans/2);\n    }\n}",WRONG_ANSWER,156,500
1589076928307466240,d83f06843cd5d1ec7602d52a9c768cbe8f9ecf614453ff14a2185b7d03736ce2,2022-11-06 10:07:17,C++,300.0,1586933889375957004,1584876378155532288,406,"#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\nconst int mod=998244353;\nint qk(int k)\n{\n    int res=1;\n    int ans=k;\n    int t=mod-2;\n    while(t)\n    {\n        if(t&1)\n        {\n            res=(res%mod*ans%mod)%mod;\n        }\n        t>>=1;\n        ans=(ans%mod*ans%mod)%mod;\n    }\n    return res;\n}\nsigned main()\n{\n    int t;\n    scanf(\""%lld\"",&t);\n    while(t--)\n    {\n        int n;\n        scanf(\""%lld\"",&n);\n        int i;\n        int ans=0;\n        int j;\n        for(i=0;i<5;i++)\n        {\n            int sum=0;\n        for(j=0;j<n;j++)\n        {\n            int v;\n            scanf(\""%lld\"",&v);\n            sum+=v;\n        }\n            ans+=(sum*qk(n))%mod;\n            ans%=mod;\n        }\n        printf(\""%lld\\n\"",ans);\n    }\n}",ACCEPTED,156,608
1527878105942028288,d9eb570790712f1e881991a691d9faadea9a38c9d22123ca88053b8bdaf5b887,2022-05-21 13:05:01,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n#define int long long\ntypedef pair<int,int> PII;\n\n\nsigned main()\n{\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\tcout.tie(0);\n\tint x;\n\tcin>>x;\n\tif(x==1)\n\t{\n\t\tcout<<2<<endl;\n\t\treturn 0;\n\t}\n\tcout<<4<<endl;\n\t\n\t\n\treturn 0;\n}",WRONG_ANSWER,6,436
1527879285174779904,11526b1b751c5ebcb847b47b95bac655de0cf9f9e47f4f35e418f82339c8b28c,2022-05-21 13:09:42,Python,0.0,1526137569543503872,1526112971640856576,388,"import random\nimport numpy\n\narr = [1]\nx0 = eval(input())\narr.append(x0)\n\nlength = 2\nwhile arr[length-2] != arr[length-1]:\n    # print(arr[length-2], arr[length-1])\n    a = numpy.sort([arr[length-2], arr[length-1]])\n    arr.append(random.randint(a[0], a[1]))\n    length += 1\n\nprint(length)",NON_ZERO_EXIT_CODE,17,3520
1527879511327469568,11526b1b751c5ebcb847b47b95bac655de0cf9f9e47f4f35e418f82339c8b28c,2022-05-21 13:10:36,Python,0.0,1526137569543503872,1526112971640856576,388,"import random\nimport numpy\n\nif __name__ == '__main__':\n    arr = [1]\n    x0 = eval(input())\n    arr.append(x0)\n\n    length = 2\n    while arr[length - 2] != arr[length - 1]:\n        # print(arr[length-2], arr[length-1])\n        a = numpy.sort([arr[length - 2], arr[length - 1]])\n        arr.append(random.randint(a[0], a[1]))\n        length += 1\n\n    print(length)",NON_ZERO_EXIT_CODE,17,3520
1527879933270257664,266b8456ce88635d5a7d86d4a5250a1a731a48504cef4791d00b4efa91ce4c3e,2022-05-21 13:12:17,C++,300.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define int long long\nusing namespace std;\nconst int mod=998244353;\nconst int maxn=3e6+100;\nint pw(int x,int p){\n\tint ans=1LL;\n\twhile(p){\n\t\tif(p&1)ans=ans*x%mod;\n\t\tx=x*x%mod,p>>=1;\n\t}\n\treturn ans;\n}\nint n;\nint a[maxn],s[maxn];\nsigned main(){\n\tcin>>n;n--;\n\ta[0]=2,s[0]=2;\n\tfor(int i=1;i<=n;i++)\n\t\ta[i]=(i+1+s[i-1])%mod*pw(i,mod-2)%mod,s[i]=(s[i-1]+a[i])%mod;\n\tcout<<a[n]<<endl;\n\treturn 0;\n}",ACCEPTED,2654,47408
1527880194009165824,b3106767dfae39b58fae7fad954605a8111ab1b11479d1b41e44422f92d5dc27,2022-05-21 13:13:19,C++,0.0,1526137569543503872,1526112971640856576,388,#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n    ios_base::sync_with_stdio(false);\n    cin.tie(nullptr);\n    long long x;\n    cin >> x;\n\n    long long sum = (1 + x * (x + 1) / 2) % 998244353;\n    cout << sum;\n    \n    return 0;\n},WRONG_ANSWER,6,328
1527882350208565248,907bc0f63f3d3cf7cc6d4409d688b0860740198d4de845885219ed17c9a7a0f8,2022-05-21 13:21:53,C++,0.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\n\nconst int maxx = 3e6+10;\nconst int mod = 998244353;\nint n, t, m, a[maxx], dp[maxx];\n\nint inv(int a,int x = mod - 2){\n\tint res = 1;\n\tfor(;x;x>>=1, a=a*a%mod){\n\t\tif(a&1) res=res*a%mod;\n\t}\n\treturn res;\n}\n\nsigned main(){\n\tios::sync_with_stdio(0);cin.tie(0);cout.tie(0);\n\tcin >> n;\n\tdp[1] = 2; a[1] = 2;\n\tfor(int i = 2; i <= n; ++i){\n\t\tdp[i] = (a[i-1]+i)*inv(i-1) % mod;\n\t\ta[i] = (a[i-1]+dp[i])%mod;\n\t}\n\tcout << dp[n];\n\treturn 0;\n}",WRONG_ANSWER,9,452
1527882580605886464,3b5dae849e8b916b54abce9d58a4e46f553574f76a68715cee783f1222cb57a1,2022-05-21 13:22:48,C++,0.0,1526137569543503872,1526112971640856576,388,"#define _CRT_SECURE_NO_WARNINGS\n#include<stdio.h>\n#include<iostream>\n#define ll long long\n#define mod 998244353\nusing namespace std;\nll pow(ll a, ll b)\n{\n    ll res = 1;\n    while (b)\n    {\n        if (b & 1)\n            res = (res * a) % mod;\n        b>>=1;\n        a=a*a;\n    }\n    return res % mod;\n}\nint main()\n{\n    cin.tie(0);\n    cout.tie(0);\n    ios::sync_with_stdio(0);\n    ll n;\n    ll o = 2;\n    scanf(\""%lld\"", &n);\n    printf(\""%lld\"",pow(o, n));\n}\n",WRONG_ANSWER,6,448
1527882969468194816,907bc0f63f3d3cf7cc6d4409d688b0860740198d4de845885219ed17c9a7a0f8,2022-05-21 13:24:21,C++,300.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\n\nconst int maxx = 3e6+10;\nconst int mod = 998244353;\nint n, t, m, a[maxx], dp[maxx];\n\nint inv(int a,int x = mod - 2){\n\tint res = 1;\n\tfor(;x;x>>=1, a=a*a%mod){\n\t\tif(x&1) res=res*a%mod;\n\t}\n\treturn res;\n}\n\nsigned main(){\n\tios::sync_with_stdio(0);cin.tie(0);cout.tie(0);\n\tcin >> n;\n\tdp[1] = 2; a[1] = 2;\n\tfor(int i = 2; i <= n; ++i){\n\t\tdp[i] = (a[i-1]+i)*inv(i-1) % mod;\n\t\ta[i] = (a[i-1]+dp[i])%mod;\n\t}\n\tcout << dp[n];\n\treturn 0;\n}",ACCEPTED,2630,47408
1527884915025457152,c5fd8891a56aa85700647dd3e26898ad9a92cfd446405c2ee7bf509b5a2cf8a0,2022-05-21 13:32:05,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define ll long long\n#define mod 998244353\n#define N 3000005\nusing namespace std;\nll inv[N],k;\nvoid getinv(){\n\tinv[1]=1;\n\tfor(ll i=2;i<=k;i++){\n\t\tll r=mod%i;ll n=mod/i;\n\t\t\n\t\tinv[i]=(mod-n*inv[r]%mod)%mod;\n\t\t//cout<<i<<\"" \""<<inv[i]<<endl;\n\t}\n}\n\nll f[N],sum[N];\nint main (){\n\tcin>>k;\n\tgetinv();\n\tf[1]=1;sum[1]=1;\n\tfor(int i=2;i<=k;i++){\n\t\tf[i]=inv[i-1]*(sum[i-1]+i)%mod;\n\t\tsum[i]+=f[i];sum[i]%=mod;\n//\t\tcout<<i<<\"" \""<<f[i]<<endl;\n\t}\n\tcout<<(f[k]+1)%mod;\n}",WRONG_ANSWER,8,448
1527885478299521024,c5fd8891a56aa85700647dd3e26898ad9a92cfd446405c2ee7bf509b5a2cf8a0,2022-05-21 13:34:19,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define ll long long\n#define mod 998244353\n#define N 3000005\nusing namespace std;\nll inv[N],k;\nvoid getinv(){\n\tinv[1]=1;\n\tfor(ll i=2;i<=k;i++){\n\t\tll r=mod%i;ll n=mod/i;\n\t\t\n\t\tinv[i]=(mod-n*inv[r]%mod)%mod;\n\t\t//cout<<i<<\"" \""<<inv[i]<<endl;\n\t}\n}\n\nll f[N],sum[N];\nint main (){\n\tcin>>k;\n\tgetinv();\n\tf[1]=0;sum[1]=0;\n\tfor(int i=2;i<=k;i++){\n\t\tf[i]=inv[i-1]*(sum[i-1]+i)%mod;\n\t\tsum[i]+=f[i];sum[i]%=mod;\n//\t\tcout<<i<<\"" \""<<f[i]<<endl;\n\t}\n\tcout<<(f[k]+2)%mod;\n}",WRONG_ANSWER,8,452
1527886255378231296,1754e1ef66b6083e5600c8340b7621283f81d1c17417234ba729c3d752ddb681,2022-05-21 13:37:24,C++,300.0,1526137569543503872,1526112971640856576,388,"#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <tuple>\n\nusing namespace std;\n\n#define repeat(n) for(int ____erefg = (n); ____erefg; ____erefg--)\n#define loop(i, l, r) for(int i = (l); i <= (r); i++)\nusing LL = long long;\n\nconst int MOD = 998244353;\n\nint fast_pow(LL a, int b) {\n    LL res = 1;\n    while(b) {\n        if(b&1)\n            res = res * a % MOD;\n        a = a * a % MOD;\n        b >>= 1;\n    }\n    return (int)res;\n}\n\nint inv(int a) {\n    return fast_pow(a, MOD-2);\n}\n\nint main() {\n    int n;\n    cin >> n;\n    LL res = 4;\n    for(int k = 2; k < n; k++)\n        res = (res + inv(k)) % MOD;\n    cout << res;\n}\n",ACCEPTED,2391,448
1527886580189319168,14224190bcfc90c64719211a05dce2182d65a4b137179c4faf7e96482b3d8559,2022-05-21 13:38:42,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n\nusing namespace std ;\n\nconst int maxn = 3000001 ;\nconst int mod = 998244353 ;\n\ndouble dp[maxn] ;\nint n;\ndouble sum=0 ;\nint main()\n{\n\tscanf(\""%d\"",&n) ;\n\tdp[1]=2 ;\n\tsum=2 ;\n\tfor(int i=2;i<=n;++i)\n\t{\n\t\tdp[i]=((i+sum)*1.0)/(i-1) ;\n\t\tsum+=dp[i] ;\n\t\t//sum=sum%mod ;\n\t}\n\tprintf(\""%d\"",(int)ceil(dp[n])) ;\n\treturn 0 ;\n}\n",WRONG_ANSWER,6,452
1527889885133103104,a308e3169fdc63b5a0b173680de34c04a8b9342008f6b8908f93037bae23cfbb,2022-05-21 13:51:50,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int MxN=1e5+5;\n\ninline ll Fast_pow(ll a,ll b,ll p){\n\tll res =1;\n\twhile(b){\n\t\tif(b&1) res=(res*a)%p;\n\t\ta=(a*a)%p;\n\t\tb>>=1;\n\t}\n\treturn res%p;\n}\n\nint main(){\n\tll x;ll p=998244353;\n\tscanf(\""%lld\"",&x);\n\tll ans= Fast_pow(2,x,p);\n\tprintf(\""%lld\\n\"",ans);\n\treturn 0;\n} ",WRONG_ANSWER,7,448
1527890224511008768,ca68e67a607ab5b9ebc9b1754534e627862c6743c65b5b27ce4bfe31a2af8a8d,2022-05-21 13:53:11,C++,0.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\nusing namespace std;\nconst int mod=998244353;\nint main() {\n    int x;\n    cin>>x;\n    //int l=1;\n    int r=x;\n    int forw=rand()%(1+x);\n    long long len=2;\n    if(forw!=x)len++;\n    //int minn=min(r,l);\n    //int maxx=max(r,l);\n    while(rand()%(r+forw)!=forw){\n        r=forw;\n        forw=rand()%(r+forw);\n        len=(len+1)%mod;\n    }\n    cout<<len<<endl;\n    return 0;\n}\n",WRONG_ANSWER,3,312
1527890292202872832,5843606f42ddf914162471308f8fad110f308beb63598c142fa61f034dc26f07,2022-05-21 13:53:27,C++,0.0,1526137569543503872,1526112971640856576,388,#include <bits/stdc++.h>\n\nconst int MOD = 998244353;\n\nint main()\n{\n    int n;\n    std::cin >> n;\n    int res = 2;\n    for (int i = 3; i <= n; i++)\n    {\n        res = (res * (i - 1) + (i - 1) * (i - 1)) % MOD;\n    }\n    std::cout << res;\n    return 0;\n},WRONG_ANSWER,4,456
1527890584248078336,5843606f42ddf914162471308f8fad110f308beb63598c142fa61f034dc26f07,2022-05-21 13:54:36,C++,0.0,1526137569543503872,1526112971640856576,388,#include <bits/stdc++.h>\n\nconst int MOD = 998244353;\n\nint main()\n{\n    int n;\n    std::cin >> n;\n    long long res = 2;\n    for (int i = 3; i <= n; i++)\n    {\n        res = (res * (i - 1) + (i - 1) * (i - 1)) % MOD;\n    }\n    std::cout << res;\n    return 0;\n},WRONG_ANSWER,3,320
1527890783171342336,5843606f42ddf914162471308f8fad110f308beb63598c142fa61f034dc26f07,2022-05-21 13:55:24,C++,0.0,1526137569543503872,1526112971640856576,388,#include <bits/stdc++.h>\n\nconst int MOD = 998244353;\n\nint main()\n{\n    int n;\n    std::cin >> n;\n    if (n == 1)\n    {\n        std::cout << 2;\n        return 0;\n    }\n    long long res = 2;\n    for (int i = 3; i <= n; i++)\n    {\n        res = (res * (i - 1) + (i - 1) * (i - 1)) % MOD;\n    }\n    std::cout << res;\n    return 0;\n},WRONG_ANSWER,3,324
1527890891929645056,5843606f42ddf914162471308f8fad110f308beb63598c142fa61f034dc26f07,2022-05-21 13:55:50,C++,0.0,1526137569543503872,1526112971640856576,388,#include <bits/stdc++.h>\n\nconst int MOD = 998244353;\n\nint main()\n{\n    int n;\n    std::cin >> n;\n    if (n == 1)\n    {\n        std::cout << 2;\n        return 0;\n    }\n    long long res = 4;\n    for (int i = 3; i <= n; i++)\n    {\n        res = (res * (i - 1) + (i - 1) * (i - 1)) % MOD;\n    }\n    std::cout << res;\n    return 0;\n},WRONG_ANSWER,7,472
1527891399973097472,c5fd8891a56aa85700647dd3e26898ad9a92cfd446405c2ee7bf509b5a2cf8a0,2022-05-21 13:57:51,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define ll long long\n#define mod 998244353\n#define N 3000005\nusing namespace std;\nll inv[N],k;\nvoid getinv(){\n\tinv[1]=1;\n\tfor(ll i=2;i<=k;i++){\n\t\tll r=mod%i;ll n=mod/i;\n\t\t\n\t\tinv[i]=(mod-n*inv[r]%mod)%mod;\n\t\t//cout<<i<<\"" \""<<inv[i]<<endl;\n\t}\n}\n\nll f[N],sum[N];\nint main (){\n\tcin>>k;\n\tgetinv();\n\tmemset(f,0,sizeof(f));\n\tmemset(sum,0,sizeof(sum));\n\tf[1]=0;sum[1]=0;\n\tfor(ll i=2;i<=k;i++){\n\t\tf[i]=inv[i-1]*(sum[i-1]+i)%mod;\n\t\tsum[i]+=f[i];sum[i]%=mod;\n//\t\tcout<<i<<\"" \""<<f[i]<<endl;\n\t}\n\tcout<<(f[k]+2)%mod;\n}",WRONG_ANSWER,70,47428
1527891908138188800,33d64742689765a1a9b6c4579a957d260f6be4d43c020f42603f9de72d7a58c2,2022-05-21 13:59:52,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n\n#define M 998244353\ndouble DM = 998244353.0;\nusing namespace std;\n\ndouble func(unsigned long long x);\n\nint main(void)\n{\n\tunsigned long long x = 0, y = 0;\n\tcin >> x;\n\ty = (unsigned long long)func(x);\n\tcout << y;\n\treturn 0;\n}\n\ndouble func(unsigned long long x)\n{\n\tif (x == 1)\n\t{\n\t\treturn 2;\n\t}\n\telse if (x == 2)\n\t{\n\t\treturn 4;\n\t}\n\telse\n\t{\n\t\tdouble sum = 0;\n\t\tfor (int i = 1; i < x; i++)\n\t\t{\n\t\t\tsum += func(i);\n\t\t}\n\t\tdouble tmp = sum - (long long)sum;\n\t\tsum = tmp + (long long)sum % M;\n\t\treturn x + 2 + sum * x / (x - 1);\n\t}\n}",TIME_LIMIT_EXCEEDED,1004,444
1527891942082695168,ca68e67a607ab5b9ebc9b1754534e627862c6743c65b5b27ce4bfe31a2af8a8d,2022-05-21 14:00:00,C++,0.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\nusing namespace std;\nconst long long mod=998244353;\nint main() {\n    long long x=0;\n    cin>>x;\n    //int l=1;\n    long long r=0;\n    r=x;\n    long long forw=0;\n    forw=rand()%(1ll+x);\n    long long len=0ll;\n    len=2ll;\n    if(forw!=x)len+=1ll;\n    //int minn=min(r,l);\n    //int maxx=max(r,l);\n    while(rand()%(r+forw)!=forw){\n        r=forw;\n        forw=rand()%(r+forw);\n        len=(len+1ll)%mod;\n    }\n    cout<<len<<endl;\n    return 0;\n}\n",WRONG_ANSWER,3,308
1527892280600764416,c5fd8891a56aa85700647dd3e26898ad9a92cfd446405c2ee7bf509b5a2cf8a0,2022-05-21 14:01:21,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define ll long long\n#define N 3000005\nusing namespace std;\nconst ll mod=998244353;\nll inv[N],k;\nvoid getinv(){\n\tinv[1]=1;\n\tfor(ll i=2;i<=k;i++){\n\t\tll r=mod%i;ll n=mod/i;\n\t\t\n\t\tinv[i]=(mod-(n*inv[r])%mod)%mod;\n\t\t//cout<<i<<\"" \""<<inv[i]<<endl;\n\t}\n}\n\nll f[N],sum[N];\nint main (){\n\tcin>>k;\n\tgetinv();\n\tmemset(f,0,sizeof(f));\n\tmemset(sum,0,sizeof(sum));\n\tf[1]=0;sum[1]=0;\n\tfor(ll i=2;i<=k;i++){\n\t\tf[i]=inv[i-1]*(sum[i-1]+i)%mod;\n\t\tsum[i]+=f[i];sum[i]%=mod;\n\t}\n\tcout<<(f[k]+2)%mod;\n}",WRONG_ANSWER,69,47432
1527892292529373184,0dfbe4269e428a22883c01849e6b7bbe7717cc365198c7dc981a6b67ec482c79,2022-05-21 14:01:24,C,0.0,1526137569543503872,1526112971640856576,388,"#include<stdio.h>\nint main()\n{\n\tlong a[3000002]={0};\n\ta[1]=2;\n\tlong long sum=0;\n\tfor(int i=2;i<=3000000;i++)\n\t{\n\t\tsum+=a[i-1];\n\t\tlong long num=(sum+i)/(i-1);\n\t\ta[i]=num;\n\t}\n\tint x;\n\tscanf(\""%d\"",&x);\n\tprintf(\""%ld\"",a[x]);\n\treturn 0;\n}",WRONG_ANSWER,123,23856
1527892357297811456,11526b1b751c5ebcb847b47b95bac655de0cf9f9e47f4f35e418f82339c8b28c,2022-05-21 14:01:39,Python,0.0,1526137569543503872,1526112971640856576,388,"import random\nimport numpy\n\n\narr = [1]\nx0 = eval(input())\narr.append(x0)\n\nlength = 2\n# offset = 0\nwhile arr[length - 2] != arr[length - 1]:\n    # print(arr[length-2], arr[length-1])\n    a = numpy.sort([arr[length - 2], arr[length - 1]])\n    # x = a[0] + length % (a[1] - a[0] + 1)\n    x = a[0]\n    # offset += 1\n    arr.append(x)\n    length += 1\n\nprint(length)",NON_ZERO_EXIT_CODE,19,3644
1527892430014459904,3b5dae849e8b916b54abce9d58a4e46f553574f76a68715cee783f1222cb57a1,2022-05-21 14:01:56,C++,0.0,1526137569543503872,1526112971640856576,388,"#define _CRT_SECURE_NO_WARNINGS\n#include<stdio.h>\n#include<iostream>\n#define ll long long\n#define mod 998244353\nusing namespace std;\nll pow(ll a, ll b)\n{\n    ll res = 1;\n    while (b)\n    {\n        if (b & 1)\n            res = (res * a) % mod;\n        b >>= 1;\n        a = (a * a) % mod;\n    }\n    return res % mod;\n}\nint main()\n{\n    cin.tie(0);\n    cout.tie(0);\n    ios::sync_with_stdio(0);\n    ll n;\n    ll o = 2;\n    scanf(\""%lld\"", &n);\n    printf(\""%lld\"", pow(o, n));\n}\n",WRONG_ANSWER,6,436
1527892721929633792,3b5dae849e8b916b54abce9d58a4e46f553574f76a68715cee783f1222cb57a1,2022-05-21 14:03:06,C++,0.0,1526137569543503872,1526112971640856576,388,"#define _CRT_SECURE_NO_WARNINGS\n#include<stdio.h>\n#include<iostream>\n#define ll long long\n#define mod 998244353\nusing namespace std;\nll pow(ll a, ll b)\n{\n    ll res = 1;\n    while (b)\n    {\n        if (b & 1)\n            res = (res * a) % mod;\n        b >>= 1;\n        a = (a * a) % mod;\n    }\n    return res % mod;\n}\nint main()\n{\n    cin.tie(0);\n    cout.tie(0);\n    ios::sync_with_stdio(0);\n    ll n;\n    scanf(\""%lld\"", &n);\n    printf(\""%lld\"", pow(n, n));\n}\n",WRONG_ANSWER,6,316
1527893141305503744,751d92029a314c86f240b3da0df8706bc3034f8633660127264d4da0b745a725,2022-05-21 14:04:46,C++,0.0,1526137569543503872,1526112971640856576,388,\n\n#include <iostream>\n#include<cmath>\nusing namespace std;\n\nint main()\n{\n    int x;\n    int num = 2;\n    int n;\n    cin >> x;\n    n = (x + 1) / 2;\n    while (abs(n - x) > 1) {\n        num++;\n        int temp = n;\n        n = (n + x) / 2;\n        x = temp;\n    }\n    cout << num % 998244353 + 2;\n}\n,WRONG_ANSWER,8,440
1527893691472367616,7559f31ade63ba200a566e21a6c9e4fae8ad1448f5a6ac5eb85de9acb5e5a6a4,2022-05-21 14:06:57,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define int long long\nusing namespace std;\nconst int p=998244353;\ninline int read(){\n\tint x=0,f=1;char c=getchar();\n\tfor(;!isdigit(c);c=getchar()) c=='-'?f=-1:1;\n\tfor(;isdigit(c);c=getchar()) x=x*10+c-'0';\n\treturn x*f;\n}\ninline int pnow(int a,int b,int P){\n\tint ans=1;\n\tfor(;b;b>>=1){\n\t\tif(b&1) ans=ans*a%P;\n\t\ta=a*a%P;\n \t}\n \treturn ans%P;\n}\nmain(){\n\tint x(read());\n\tprintf(\""%lld\"",pnow(2,x,p));\n}",WRONG_ANSWER,7,448
1527893735361568768,c5fd8891a56aa85700647dd3e26898ad9a92cfd446405c2ee7bf509b5a2cf8a0,2022-05-21 14:07:08,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define ll long long\n#define N 3000005\nusing namespace std;\nconst ll mod=998244353;\nll inv[N],k;\nvoid getinv(){\n\tinv[1]=1;\n\tfor(ll i=2;i<=k;i++){\n\t\tll r=mod%i;ll n=mod/i;\n\t\t\n\t\tinv[i]=(mod-(n*inv[r])%mod)%mod;\n\t\t//cout<<i<<\"" \""<<inv[i]<<endl;\n\t}\n}\n\nll f[N],sum[N];\nint main (){\n\tcin>>k;\n\tgetinv();\n\tmemset(f,0,sizeof(f));\n\tmemset(sum,0,sizeof(sum));\n\tf[1]=0;sum[1]=0;\n\tfor(ll i=2;i<=k;i++){\n\t\tf[i]=inv[i-1]*((sum[i-1]+i)%mod)%mod;\n\t\tsum[i]+=f[i];sum[i]%=mod;\n\t}\n\tcout<<(f[k]+2)%mod;\n\t//cout<<endl<<9*inv[2]%mod;\n}",WRONG_ANSWER,71,47428
1527893888034230272,0dfbe4269e428a22883c01849e6b7bbe7717cc365198c7dc981a6b67ec482c79,2022-05-21 14:07:44,C,0.0,1526137569543503872,1526112971640856576,388,"#include<stdio.h>\nint main()\n{\n\tlong a[3000002]={0};\n\ta[1]=2;\n\tlong long sum=0;\n\tfor(int i=2;i<=3000000;i++)\n\t{\n\t\tsum+=a[i-1];\n\t\tlong long num=(sum+i)/(i-1);\n\t\ta[i]=num;\n\t}\n\tint x;\n\tscanf(\""%d\"",&x);\n\tprintf(\""%ld\"",a[x]%998244353);\n\treturn 0;\n}",WRONG_ANSWER,124,23856
1527894388767019008,33d64742689765a1a9b6c4579a957d260f6be4d43c020f42603f9de72d7a58c2,2022-05-21 14:09:43,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n\n#define M 998244353\ndouble DM = 998244353.0;\nusing namespace std;\n\nunsigned long long func(unsigned long long x);\n\nunsigned long long a[3000000];\nint main(void)\n{\n\tunsigned long long x = 0, y = 0;\n\tcin >> x;\n\tfor (int i = 0; i < x; i++)\n\t{\n\t\tif (i < 28)\n\t\t{\n\t\t\ta[i] = func(i + 1);\n\t\t}\n\t\telse\n\t\t{\n\t\t\ta[i] = func(i + 1)%M;\n\t\t}\n\t}\n\tcout << a[x-1];\n\treturn 0;\n}\n\nunsigned long long func(unsigned long long x)\n{\n\tif (x == 1)\n\t{\n\t\treturn 2;\n\t}\n\telse if (x == 2)\n\t{\n\t\treturn 4;\n\t}\n\telse\n\t{\n\t\tdouble sum = 0;\n\t\tfor (int i = 1; i < x; i++)\n\t\t{\n\t\t\tsum += a[i-1];\n\t\t}\n\t\t//double tmp = sum - (long long)sum;\n\t\t//sum = tmp + (long long)sum % M;\n\t\treturn x + 2 + sum * x / (x - 1);\n\t}\n}",WRONG_ANSWER,7,452
1527894416998887424,379de14f64c26fa0e1d4a3d49e558e1d380240d4f65a0094f69ada7eb91c83e6,2022-05-21 14:09:50,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define ll long long\nll res[3000005];\nconst ll mod=998244353;\nll he;\nint main()\n{\n\tint x;\n\tres[1]=he=2;\n\tfor(int i=2;i<=3000000;i++)\n\t{\n\t\tres[i]=(he+i)/(i-1);\n\t\the=(he+res[i])%mod;\n\t}\n\tscanf(\""%d\"",&x);\n\tprintf(\""%lld\\n\"",res[x]);\n\treturn 0;\n}\n",WRONG_ANSWER,148,23984
1527894819647856640,73c499f14d7040e3da76c34bb9bad498726e1c6e3fa5696bfda50ee37f7b1660,2022-05-21 14:11:26,C,0.0,1526137569543503872,1526112971640856576,388,"#include <stdio.h>\n\nint main()\n{\n    int x;\n    scanf(\""%d\"", &x);\n    if (x == 2) printf(\""4\"");\n    return 0;\n}",WRONG_ANSWER,7,184
1527894877604769792,0fae1eb50820dc1b24ffda1caf79f28bc78ba693f8a2b388a8118516cabe1489,2022-05-21 14:11:40,C++,0.0,1526137569543503872,1526112971640856576,388,"#include <algorithm>\n#include <cstdio>\n#include <iostream>\n\nusing namespace std;\n\nconst int mod = 998244353;\n\nint x;\nint rev[3000010];\nint a[3000010], b[3000010];\n\nint main() {\n  scanf(\""%d\"", &x);\n  rev[1] = 1;\n  for (int i = 2; i <= x; i++) { rev[i] = (mod - mod / i) * rev[mod % i] % mod; }\n  a[1] = 0;\n  b[1] = 0;\n  for (int i = 2; i <= x; i++) {\n    a[i] = ((b[i - 1] % mod + i % mod) % mod * rev[i - 1] % mod) % mod;\n    b[i] = (b[i - 1] + a[i]) % mod;\n  }\n  printf(\""%d\\n\"", (a[x] % mod + 2) % mod);\n  return 0;\n}",WRONG_ANSWER,6,440
1527895231381716992,0fae1eb50820dc1b24ffda1caf79f28bc78ba693f8a2b388a8118516cabe1489,2022-05-21 14:13:04,C++,300.0,1526137569543503872,1526112971640856576,388,"#include <algorithm>\n#include <cstdio>\n#include <iostream>\n\nusing namespace std;\n\nconst long long mod = 998244353;\n\nint x;\nlong long rev[3000010];\nlong long a[3000010], b[3000010];\n\nint main() {\n  scanf(\""%d\"", &x);\n  rev[1] = 1;\n  for (int i = 2; i <= x; i++) { rev[i] = (mod - mod / i) * rev[mod % i] % mod; }\n  a[1] = 0;\n  b[1] = 0;\n  for (int i = 2; i <= x; i++) {\n    a[i] = ((b[i - 1] % mod + i % mod) % mod * rev[i - 1] % mod) % mod;\n    b[i] = (b[i - 1] + a[i]) % mod;\n  }\n  printf(\""%lld\\n\"", (a[x] % mod + 2) % mod % mod);\n  return 0;\n}",ACCEPTED,1419,70844
1527895919046246400,3eae1b4375680bcb38b02e677253a5dbf398b450ca0a3cf31ee2c39c63924e64,2022-05-21 14:15:48,C++,0.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\nusing namespace std;\n#define rg register\n#define ll long long\n#define ld long double\n#define FOR(i,a,b) for(register int i=a;i<=b;++i)\n#define For(i,a,b) for(register int i=a;i>=b;--i)\nconst ll INF=1E+9,modd=998244353,N=3E+5+10;\n\nll b[N],ny[N],qz[N];\nint x;\n\nll qny(ll a)\n{\n    ll r=1,b=modd-2;\n    a%=modd;\n    while(b)\n    {\n        if(b&1) r=(r*a)%modd;\n        a=(a*a)%modd;\n        b>>=1;\n    }\n    return r;\n}\n\nint main()\n{\n    cin>>x;\n    FOR(i,1,x) ny[i]=qny(i);\n    //FOR(i,1,x) cout<<ny[i]<<endl;\n    b[1]=qz[1]=0;\n    FOR(i,1,x) \n        b[i]=((qz[i-1]+i)*ny[i-1])%modd;\n    cout<<(b[x]+2)%modd;\n    return 0;\n}",WRONG_ANSWER,7,436
1527896099007053824,904db3b16af211240ff13ccf52837e942eae2352dbf7c6cbfd17b2a8d2dfa541,2022-05-21 14:16:31,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<cstdio>\n#define int long long\nconst int mod=998244353;\nconst int N=3e6+10;\nint e[N];\nint n;\nsigned main()\n{\n\tint k,i,j;\n\tint a,b,c;\n\tint s;\n\tscanf(\""%lld\"",&n);\n\te[1]=2;\n\ts=2;\n\tfor(k=2;k<=n;k++)\n\t{\n\t\te[k]=(k+s)/(k-1)%mod;\n\t\ts+=e[k];\n\t\ts%=mod;\n\t}\n\tprintf(\""%lld\\n\"",e[n]);\n\t\n\treturn 0;\n} ",WRONG_ANSWER,6,320
1527896886382764032,3eae1b4375680bcb38b02e677253a5dbf398b450ca0a3cf31ee2c39c63924e64,2022-05-21 14:19:39,C++,0.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\nusing namespace std;\n#define rg register\n#define ll long long\n#define ld long double\n#define FOR(i,a,b) for(register int i=a;i<=b;++i)\n#define For(i,a,b) for(register int i=a;i>=b;--i)\nconst ll INF=1E+9,modd=998244353,N=3E+5+10;\n\nll b[N],ny[N],qz[N];\nint x;\n\nll qny(ll a)\n{\n    ll r=1,b=modd-2;\n    a%=modd;\n    while(b)\n    {\n        if(b&1) r=(r*a)%modd;\n        a=(a*a)%modd;\n        b>>=1;\n    }\n    return r;\n}\n\nint main()\n{\n    cin>>x;\n    FOR(i,1,x) ny[i]=qny(i);\n    //FOR(i,1,x) cout<<ny[i]<<endl;\n    b[1]=qz[1]=0;\n    FOR(i,1,x) \n    {\n        b[i]=((qz[i-1]+i)*ny[i-1])%modd;\n        qz[i]=qz[i-1]+b[i];\n    }\n    cout<<(b[x]+2)%modd;\n    return 0;\n}",WRONG_ANSWER,8,452
1527897256215523328,3b5dae849e8b916b54abce9d58a4e46f553574f76a68715cee783f1222cb57a1,2022-05-21 14:21:07,C++,0.0,1526137569543503872,1526112971640856576,388,"#define _CRT_SECURE_NO_WARNINGS\n#include<stdio.h>\n#include<iostream>\n#define ll long long\n#define mod 998244353\nusing namespace std;\nint main()\n{\n    cin.tie(0);\n    cout.tie(0);\n    ios::sync_with_stdio(0);\n    ll n;\n    scanf(\""%lld\"", &n);\n    ll a[3000005];\n    a[1] = 2;\n    ll ans = 2;\n    for (ll i = 2; i <= n; i++)\n    {\n        a[i] = (i + ans);\n        a[i] %= mod;\n        ans += a[i];\n        ans %= mod;\n    }\n    printf(\""%lld\\n\"", a[n]);\n}\n",WRONG_ANSWER,7,452
1527897804377513984,904db3b16af211240ff13ccf52837e942eae2352dbf7c6cbfd17b2a8d2dfa541,2022-05-21 14:23:18,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<cstdio>\n#define int long long\nconst int mod=998244353;\nconst int N=3e6+10;\nint n;\n\nint pow(int x,int y)\n{\n\tint ans=1;\n\twhile(y)\n\t{\n\t\tif(y&1)ans=ans*x%mod;\n\t\tx=x*x%mod;\n\t\ty>>=1;\n\t}\n\treturn ans;\n}\nsigned main()\n{\n\tint k,i,j;\n\tint a=1,b=2,c,d;\n\tint ans;\n\tscanf(\""%lld\"",&n);\n\tif(n==1)\n\t{\n\t\tprintf(\""2\\n\"");\n\t\treturn 0;\n\t}\n\t\n\tfor(k=2;k<n;k++)\n\t{\n\t\tc=k*(a+b)%mod;\n\t\td=(k-1)*a%mod;\n\t\ta=c;\n\t\tb=d;\n\t}\n\t\n\tc=(a*n+b)%mod;\n\td=a*(n-1)%mod;\n\t\n\t\n\t\n\t\n\tprintf(\""%lld\\n\"",c*pow(d,mod-2)%mod);\n\t\n\treturn 0;\n} ",WRONG_ANSWER,7,352
1527897959361232896,c264d10450d4d6b83ddf50f6ddfc1b8887c2176b2516f2e3926a26a7df7312ba,2022-05-21 14:23:55,C++,300.0,1526137569543503872,1526112971640856576,388,"#include <cstdio>\ntypedef long long ll;\nconst ll mod = 998244353;\nll fac[3000010], invfac[3000010];\nll qpow(ll a, ll b)\n{\n    ll ans = 1;\n    while (b)\n    {\n        if (b % 2) ans = ans * a % mod;\n        b /= 2;\n        a = a * a % mod;\n    }\n    return ans;\n}\nint main()\n{\n    fac[0] = 1;\n    for (int i = 1; i <= 3000000; i++)\n    {\n        fac[i] = fac[i - 1] * i % mod;\n    }\n    invfac[3000000] = qpow(fac[3000000], mod - 2);\n    for (int i = 3000000; i >= 1; i--)\n    {\n        invfac[i - 1] = invfac[i] * i % mod;\n    }\n    int x;\n    scanf(\""%d\"", &x);\n    ll f = 2, sum = 2;\n    for (int i = 2; i <= x; i++)\n    {\n        ll inv = (i == 1 ? 1 : fac[i - 2]) * invfac[i - 1] % mod;\n        f = (sum + i) * inv % mod;\n        sum = (sum + f) % mod;\n    }\n    printf(\""%lld\\n\"", f);\n    return 0;\n}",ACCEPTED,834,47292
1527898004651327488,748ac3ecc0602491c859c96053bf6e4a1257b4898b868b58b582a1c1adba53cf,2022-05-21 14:24:05,C++,0.0,1526137569543503872,1526112971640856576,388,#include<cstdio>\n#include<iostream>\nusing namespace std;\ndouble total;\ndouble ans[300001];\nint x;\nint main()\n{\n\tcin>>x;\n\tif(x==1)\n\t{\n\t\tcout<<1;\n\t\treturn 0;\n\t}\n\telse\n\t{\n\t\tcout<<4;\n\t\treturn 0;\n\t}\n/*\ttotal=3.0;\n\tfor(double i=2;i<=x;i++) \n\t{\n\t\tans[x]=(total+1.0+ans[x-1])/(x-1);\n\t\ttotal+=ans[x];\n\t}\n\tcout<<ans[x];*/\n\treturn 0;\n},WRONG_ANSWER,7,448
1527898978912661504,3eae1b4375680bcb38b02e677253a5dbf398b450ca0a3cf31ee2c39c63924e64,2022-05-21 14:27:58,C++,0.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\nusing namespace std;\n#define rg register\n#define ll long long\n#define ld long double\n#define FOR(i,a,b) for(register ll i=a;i<=b;++i)\n#define For(i,a,b) for(register ll i=a;i>=b;--i)\nconst ll INF=1E+9,modd=998244353,N=3000010;\n\nll b[N],qz;\nll x;\n\nll qny(ll a)\n{\n    ll r=1,b=modd-2;\n    a%=modd;\n    while(b)\n    {\n        if(b&1) r=(r*a)%modd;\n        a=(a*a)%modd;\n        b>>=1;\n    }\n    return r;\n}\n\nint main()\n{\n    cin>>x;\n    //FOR(i,1,x) ny[i]=qny(i);\n    //FOR(i,1,x) cout<<ny[i]<<endl;\n    b[1]=0;\n    FOR(i,2,x)\n    {\n        b[i]=((qz+i)*qny(i-1))%modd;\n        qz+=b[i];\n    }\n    cout<<(b[x]+2)%modd;\n    return 0;\n}",WRONG_ANSWER,8,320
1527899466546622464,748ac3ecc0602491c859c96053bf6e4a1257b4898b868b58b582a1c1adba53cf,2022-05-21 14:29:54,C++,0.0,1526137569543503872,1526112971640856576,388,#include<cstdio>\n#include<iostream>\nusing namespace std;\ndouble total;\ndouble ans[300001];\nint x;\nint main()\n{\n\tcin>>x;\n\tif(x==1)\n\t{\n\t\tcout<<1;\n\t\treturn 0;\n\t}\n\ttotal=3.0;\n\tfor(double i=2;i<=x;i++) \n\t{\n\t\tans[x]=(total+1.0+ans[x-1])/(i-1);\n\t\ttotal+=(ans[x]+1);\n\t}\n\tcout<<int(ans[x]);\n\treturn 0;\n},WRONG_ANSWER,9,436
1527899577695674368,904db3b16af211240ff13ccf52837e942eae2352dbf7c6cbfd17b2a8d2dfa541,2022-05-21 14:30:20,C++,300.0,1526137569543503872,1526112971640856576,388,"#include<cstdio>\n#define int long long\nconst int mod=998244353;\nconst int N=3e6+10;\nint n;\n\nint pow(int x,int y)\n{\n\tint ans=1;\n\twhile(y)\n\t{\n\t\tif(y&1)ans=ans*x%mod;\n\t\tx=x*x%mod;\n\t\ty>>=1;\n\t}\n\treturn ans;\n}\nsigned main()\n{\n\tint k,i,j;\n\tint a=1,b=2,c,d;\n\tint ans;\n\tscanf(\""%lld\"",&n);\n\tif(n==1)\n\t{\n\t\tprintf(\""2\\n\"");\n\t\treturn 0;\n\t}\n\t\n\tfor(k=2;k<n;k++)\n\t{\n\t\tc=k*(a+b)%mod;\n\t\td=(k-1)*a%mod;\n\t\t//printf(\""* %lld %lld\\n\"",c,d);\n\t\t\n\t\t\n\t\ta=d;\n\t\tb=c;\n\t}\n\t\n\tc=(a*n+b)%mod;\n\td=a*(n-1)%mod;\n\t\n\t//printf(\""* %lld %lld\\n\"",c,d);\n\t\n\t\n\tprintf(\""%lld\\n\"",c*pow(d,mod-2)%mod);\n\t\n\treturn 0;\n} ",ACCEPTED,118,452
1527900126117707776,769095527b4fa6f5d16066f0e8cb5017d889ff873ccf63c69bdcf6128e3230a8,2022-05-21 14:32:31,C++,0.0,1526137569543503872,1526112971640856576,388,#include<bits/stdc++.h>\nusing namespace std;\nint x;\nint f[3000005];\nint sum[3000005];\nint main()\n{\n    cin>>x;\n    int l = x;\n    f[1] = 1;\n    f[2] = 2;\n    sum[1] = 1;\n    sum[2] = 3;\n    for(int i=3;i<=x;i++)\n    {\n        f[i] = (sum[i-1])/(i-1)+2;\n        sum[i] = sum[i-1]+f[i];\n    }\n    cout<<(f[x]+2)%998244353;\n    return 0;\n},WRONG_ANSWER,8,600
1527900150268522496,3b5dae849e8b916b54abce9d58a4e46f553574f76a68715cee783f1222cb57a1,2022-05-21 14:32:37,C++,0.0,1526137569543503872,1526112971640856576,388,"#define _CRT_SECURE_NO_WARNINGS\n#include<stdio.h>\n#include<iostream>\n#define ll long long\n#define mod 998244353\nusing namespace std;\nll ksm(ll a, ll b)\n{\n    ll ans = 1;\n    while (b)\n    {\n        if (b & 1)\n            ans = (ans * a) % mod;\n        a = (a * a) % mod;\n        b >>= 1;\n    }\n    return ans;\n}\nll inv(ll a)\n{\n    return ksm(a, mod - 2);\n}\nint main()\n{\n    cin.tie(0);\n    cout.tie(0);\n    ios::sync_with_stdio(0);\n    ll n;\n    scanf(\""%lld\"", &n);\n    ll a[30005];\n    a[1] = 2;\n    ll ans = 2;\n    for (ll i = 2; i <= n; i++)\n    {\n        a[i] = (i + ans);\n        a[i] *=inv(i - 1);\n        a[i] %= mod;\n        ans += a[i];\n        ans %= mod;\n    }\n    printf(\""%lld\\n\"", a[n]);\n}\n",SEGMENTATION_FAULT,17,1024
1527900205939519488,3b5dae849e8b916b54abce9d58a4e46f553574f76a68715cee783f1222cb57a1,2022-05-21 14:32:50,C++,300.0,1526137569543503872,1526112971640856576,388,"#define _CRT_SECURE_NO_WARNINGS\n#include<stdio.h>\n#include<iostream>\n#define ll long long\n#define mod 998244353\nusing namespace std;\nll ksm(ll a, ll b)\n{\n    ll ans = 1;\n    while (b)\n    {\n        if (b & 1)\n            ans = (ans * a) % mod;\n        a = (a * a) % mod;\n        b >>= 1;\n    }\n    return ans;\n}\nll inv(ll a)\n{\n    return ksm(a, mod - 2);\n}\nint main()\n{\n    cin.tie(0);\n    cout.tie(0);\n    ios::sync_with_stdio(0);\n    ll n;\n    scanf(\""%lld\"", &n);\n    ll a[3000005];\n    a[1] = 2;\n    ll ans = 2;\n    for (ll i = 2; i <= n; i++)\n    {\n        a[i] = (i + ans);\n        a[i] *=inv(i - 1);\n        a[i] %= mod;\n        ans += a[i];\n        ans %= mod;\n    }\n    printf(\""%lld\\n\"", a[n]);\n}\n",ACCEPTED,2645,23992
1527900280451330048,33d64742689765a1a9b6c4579a957d260f6be4d43c020f42603f9de72d7a58c2,2022-05-21 14:33:08,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n\n#define M 998244353\ndouble DM = 998244353.0;\nusing namespace std;\n\nunsigned long long func(unsigned long long x);\n\nint main(void)\n{\n\tunsigned long long x = 0, y = 0;\n\tcin >> x;\n\tif (x == 1)\n\t\tcout << 2;\n\telse if (x == 2)\n\t\tcout << 4;\n\telse if (x == 3)\n\t\tcout << 4;\n\telse {\n\t\tcout << func(x) / (x - 1);\n\t}\n\treturn 0;\n}\n\nunsigned long long func(unsigned long long x)\n{\n\tif (x == 1)\n\t{\n\t\treturn 2;\n\t}\n\telse if (x == 2)\n\t{\n\t\treturn 4;\n\t}\n\telse if (x == 3)\n\t{\n\t\treturn 8;\n\t}\n\telse\n\t{\n\t\t//cout << \""func(\"" << x << \"") = \"" << (2 * func(x - 1) + 1) % M << endl;;\n\n\t\treturn (2 * func(x - 1) + 1) % M;\n\t}\n}",WRONG_ANSWER,8,324
1527900384461668352,769095527b4fa6f5d16066f0e8cb5017d889ff873ccf63c69bdcf6128e3230a8,2022-05-21 14:33:33,C++,0.0,1526137569543503872,1526112971640856576,388,#include<bits/stdc++.h>\nusing namespace std;\nint x;\nint f[3000005];\nint sum[3000005];\nint main()\n{\n    cin>>x;\n    int l = x;\n    f[1] = 1;\n    f[2] = 2;\n    sum[1] = 1;\n    sum[2] = 3;\n    for(int i=3;i<=x;i++)\n    {\n        f[i] = (sum[i-1]+1)/(i-1)+2;\n        sum[i] = sum[i-1]+f[i];\n    }\n    cout<<(f[x]+2)%998244353;\n    return 0;\n},WRONG_ANSWER,7,436
1527900572290981888,589a21675059ff69e8eed167a3f36b26196b9031ee3c28d095c7ba9b45a6ac88,2022-05-21 14:34:18,C++,0.0,1526137569543503872,1526112971640856576,388,#include <iostream>\nusing namespace std;\nint main()\n{\n    double s;\n    int n;\n\n    cin >> n;\n\n    if (n == 1)\n        cout << 2;\n    else if (n == 2)\n        cout << 4;\n    else\n    {\n        s = 4;\n        for (int i = 2; i <= n - 1; i++)\n        {\n            s += 1.0 / i;\n            if (s > 998244353)\n                s -= 998244353;\n        }\n        cout << (int)s;\n    }\n\n    return 0;\n},WRONG_ANSWER,8,448
1527900670127333376,379de14f64c26fa0e1d4a3d49e558e1d380240d4f65a0094f69ada7eb91c83e6,2022-05-21 14:34:41,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define ll long long\nfloat res[3000005];\nconst float mod=998244353;\nfloat he;\nint main()\n{\n\tint x;\n\tres[1]=he=2.0;\n\tfor(int i=2;i<=3000000;i++)\n\t{\n\t\tres[i]=(he+i)/(i-1);\n\t\the+=res[i];\n\t\twhile(he>mod)\n\t\t\the-=mod;\n\t}\n\tscanf(\""%d\"",&x);\n\tprintf(\""%.0f\\n\"",res[x]);\n\treturn 0;\n}\n",WRONG_ANSWER,58,12236
1527900712921808896,3eae1b4375680bcb38b02e677253a5dbf398b450ca0a3cf31ee2c39c63924e64,2022-05-21 14:34:51,C++,300.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\nusing namespace std;\n#define rg register\n#define ll long long\n#define ld long double\n#define FOR(i,a,b) for(register ll i=a;i<=b;++i)\n#define For(i,a,b) for(register ll i=a;i>=b;--i)\nconst ll INF=1E+9,modd=998244353,N=3000010;\n\nll b[N],qz;\nll x;\n\nll qny(ll a)\n{\n    ll r=1,b=modd-2;\n    a%=modd;\n    while(b)\n    {\n        if(b&1) r=(r*a)%modd;\n        a=(a*a)%modd;\n        b>>=1;\n    }\n    return r;\n}\n\nint main()\n{\n    cin>>x;\n    //FOR(i,1,x) ny[i]=qny(i);\n    //FOR(i,1,x) cout<<ny[i]<<endl;\n    b[1]=0;\n    FOR(i,2,x)\n    {\n        b[i]=(((qz+i)%modd)*qny(i-1))%modd;\n        qz=(qz+b[i])%modd;\n    }\n    cout<<(b[x]+2)%modd;\n    return 0;\n}",ACCEPTED,2618,23984
1527901274090319872,e48b78359842455382710ac8e345e9624298a8fee07b6ed90e7ee46c7f85866e,2022-05-21 14:37:05,C++,300.0,1526137569543503872,1526112971640856576,388,"#include<cstdio>\n#include<iostream>\n#include<algorithm>\n#include<cstring>\n#include<string>\nusing namespace std;\ntypedef long long ll;\nconst int N=3e6+5;\nconst ll mod=998244353;\nint n;\nll a[N],f[N],inv[N];\nvoid getinv(){\n    inv[0]=inv[1]=1;\n    for(int i=2;i<=n;i++){\n        inv[i]=inv[mod%i]*(mod-mod/i)%mod;\n    }\n}\nint main(){\n    scanf(\""%d\"",&n);\n    getinv();\n    a[1]=2;\n    f[1]=2+1;\n    // f[2]=3+4+1;\n    for(int i=2;i<=n;i++){\n        // f[i]=(1+f[i-1]+(f[i-1]+1)/(i-1))%mod;\n        a[i]=(f[i-1]+1)*inv[i-1]%mod;\n        f[i]=(1+f[i-1]+a[i])%mod;\n        // printf(\""%d %lld\\n\"",i,a[i]);\n    }\n    printf(\""%lld\"",a[n]);\n    return 0;\n}",ACCEPTED,1356,70956
1527901565321830400,ca68e67a607ab5b9ebc9b1754534e627862c6743c65b5b27ce4bfe31a2af8a8d,2022-05-21 14:38:14,C++,0.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\nusing namespace std;\nconst long long mod=998244353;\nint main() {\n    srand(time(NULL));\n    long long x=0;\n    cin>>x;\n    //int l=1;\n    long long r=0;\n    r=x;\n    long long forw=0;\n    forw=rand()%(1ll+x+1);\n    long long len=0ll;\n    len=2ll;\n    if(forw!=x)len+=1ll;\n    //int minn=min(r,l);\n    //int maxx=max(r,l);\n    while(rand()%(r+forw+1)!=forw){\n        r=forw;\n        forw=rand()%(r+forw+1);\n        len=(len+1ll)%mod;\n    }\n    cout<<len<<endl;\n    return 0;\n}\n",WRONG_ANSWER,3,452
1527902000942247936,748ac3ecc0602491c859c96053bf6e4a1257b4898b868b58b582a1c1adba53cf,2022-05-21 14:39:58,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<cstdio>\n#include<iostream>\nusing namespace std;\ndouble total;\ndouble ans1,ans2;\ndouble ans[300001];\nint x;\nint main()\n{\n\tcin>>x;\n\tif(x==1)\n\t{\n\t\tcout<<1;\n\t\treturn 0;\n\t}\n\ttotal=3.0;\n\tfor(double i=2;i<=x;i++) \n\t{\n\t\tans2=(total+1.0+ans1)/(i-1);\n\t\ttotal+=(ans2+1);\n\t}\n\tcout<<int(ans2);\n\treturn 0;\n}",WRONG_ANSWER,8,616
1527902151966535680,59ab4795533cc4b6073ff68b69b7f90ed72438684572dd67f2db0f7ca390c426,2022-05-21 14:40:34,C++,0.0,1526137569543503872,1526112971640856576,388,"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nconst int mod = 998244353;\n\n#define ll long long\nint qpow(ll x, int y){\n    ll ans = 1;\n    while(y){\n        if(y & 1){\n            ans = ((ans % mod) * (x % mod)) % mod;\n        }\n        x = ((x % mod) * (x % mod)) % mod;\n        y /= 2;\n    }\n    return ans;\n}\nint main(){\n    cin.tie(nullptr)->sync_with_stdio(false);\n    int x;\n    cin >> x;\n    cout << qpow(2, x);\n    return 0;\n}",WRONG_ANSWER,6,456
1527902534835195904,748ac3ecc0602491c859c96053bf6e4a1257b4898b868b58b582a1c1adba53cf,2022-05-21 14:42:06,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<cstdio>\n#include<iostream>\nusing namespace std;\ndouble total;\ndouble ans1,ans2;\ndouble ans[300001];\nint x;\nint main()\n{\n\tcin>>x;\n\tif(x==1)\n\t{\n\t\tcout<<3;\n\t\treturn 0;\n\t}\n\ttotal=3.0;\n\tfor(double i=2;i<=x;i++) \n\t{\n\t\tans2=(total+1.0+ans1)/(i-1);\n\t\ttotal+=(ans2+1);\n\t}\n\tcout<<int(ans2);\n\treturn 0;\n}",WRONG_ANSWER,7,488
1527902739278143488,7559f31ade63ba200a566e21a6c9e4fae8ad1448f5a6ac5eb85de9acb5e5a6a4,2022-05-21 14:42:54,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define int long long\nusing namespace std;\nconst int p=998244353;\ninline int read(){\n\tint x=0,f=1;char c=getchar();\n\tfor(;!isdigit(c);c=getchar()) c=='-'?f=-1:1;\n\tfor(;isdigit(c);c=getchar()) x=x*10+c-'0';\n\treturn x*f;\n}\ninline int pnow(int a,int b,int P){\n\tint ans=1;\n\tfor(;b;b>>=1){\n\t\tif(b&1) ans=ans*a%P;\n\t\ta=a*a%P;\n \t}\n \treturn ans%P;\n}\nmain(){\n\tint x(read());\n\tprintf(\""%lld\"",pnow(x,x,p));\n}",WRONG_ANSWER,6,328
1527903119990931456,748ac3ecc0602491c859c96053bf6e4a1257b4898b868b58b582a1c1adba53cf,2022-05-21 14:44:25,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<cstdio>\n#include<iostream>\nusing namespace std;\ndouble total;\ndouble ans1,ans2;\ndouble ans[300001];\nint x;\nint main()\n{\n\tcin>>x;\n\tif(x==1)\n\t{\n\t\tcout<<3;\n\t\treturn 0;\n\t}\n\ttotal=3.0;\n\tfor(double i=2;i<=x;i++) \n\t{\n\t\tans2=(total+1.0+ans1)/(i-1);\n\t\ttotal+=(ans2+1);\n\t}\n\tcout<<int(ans2)%998244353;\n\treturn 0;\n}",WRONG_ANSWER,9,320
1527903555321942016,f6f4d53d76ab930efc81bafc2931f29a611f2c60084eba5d8e06a1f04202c395,2022-05-21 14:46:09,C++,0.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\n#define ll long long\nusing namespace std;\nconst int mod=998244353;\nll n,x;\nint main(){\n    scanf(\""%lld\"",&x);\n    ll ans=2;\n    for(ll i=2;i<=x;i++){\n        ans=((4LL*i-2)/(i+1)*ans)%mod;\n    }\n    printf(\""%lld\\n\"",ans);\n    return 0;\n}",WRONG_ANSWER,6,448
1527904194785517568,0dfbe4269e428a22883c01849e6b7bbe7717cc365198c7dc981a6b67ec482c79,2022-05-21 14:48:41,C,0.0,1526137569543503872,1526112971640856576,388,"#include<stdio.h>\nint main()\n{\n\tlong a[3000002]={0};\n\ta[1]=2;\n\tlong long sum=0;\n\tfor(int i=2;i<=3000000;i++)\n\t{\n\t\tsum+=a[i-1];\n\t\tlong long num=(sum+i)/(i-1);\n\t\ta[i]=num;\n\t}\n\tint x;\n\tscanf(\""%d\"",&x);\n\tprintf(\""%ld\\n\"",a[x]%998244353);\n\treturn 0;\n}",WRONG_ANSWER,122,23752
1527904201836150784,5162f9f6db6ab4410642574e234bfe8b7c7758d8b762f5a379c5f96a2abe7f3b,2022-05-21 14:48:43,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\nusing namespace std;\n\ndouble a[3000001];\nlong long sum=0;\ndouble lld (long long x){\n\tif (a[x]) return a[x];\n\tint i;\n\ta[x]=1/x;\n\tfor (i=1;i<=x-1;i++){\n\t\ta[x]+=1/(x-1)*lld(x-1);\n\t}\n\treturn a[x];\n}\nint main(){\n\tlong long x,l;\n\tcin>>x;\n\tsum=(long long)lld(x)+1;\n\tcout<<sum+2;\n\t\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,1004,448
1527904822026919936,3846603af9a21287e84ed3c7af8be9659dbfee0f37da7df33f0f7bb0737e8ac2,2022-05-21 14:51:11,C++,0.0,1526137569543503872,1526112971640856576,388,#include <iostream>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint sum = 1;\n\tfor (int i = 0; i < n; i++) {\n\t\tsum = sum * 2;\n        \n\t}\n\tcout << sum;\n\n\treturn 0;\n\n},WRONG_ANSWER,7,448
1527906577892581376,13ae2c6735beadfbd201948e2350b15211b2ffc1a2e2d36c68e8d64244296e4a,2022-05-21 14:58:09,C++,0.0,1526137569543503872,1526112971640856576,388,#include<iostream>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    cout<<2n;\n},COMPILE_ERROR,0,0
1527906683127681024,13ae2c6735beadfbd201948e2350b15211b2ffc1a2e2d36c68e8d64244296e4a,2022-05-21 14:58:35,C++,0.0,1526137569543503872,1526112971640856576,388,#include<iostream>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    cout<<2*n;\n},WRONG_ANSWER,10,436
1527906767793893376,748ac3ecc0602491c859c96053bf6e4a1257b4898b868b58b582a1c1adba53cf,2022-05-21 14:58:55,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<cstdio>\n#include<iostream>\nusing namespace std;\ndouble total;\ndouble ans1,ans2;\ndouble ans[300001];\nint x;\nint main()\n{\n\tcin>>x;\n\tif(x==1)\n\t{\n\t\tcout<<2;\n\t\treturn 0;\n\t}\n\ttotal=3.0;\n\tfor(double i=2;i<=x;i++) \n\t{\n\t\tans2=(total+1.0+ans1)/(i-1);\n\t\ttotal+=(ans2+1);\n\t}\n\tcout<<int(ans2)%998244353;\n\treturn 0;\n}",WRONG_ANSWER,8,456
1527907081418780672,59ab4795533cc4b6073ff68b69b7f90ed72438684572dd67f2db0f7ca390c426,2022-05-21 15:00:10,C++,0.0,1526137569543503872,1526112971640856576,388,"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nconst int mod = 998244353;\n\n#define ll long long\nconst int N = 3000005;\n// int qpow(ll x, int y){\n//     ll ans = 1;\n//     while(y){\n//         if(y & 1){\n//             ans = ((ans % mod) * (x % mod)) % mod;\n//         }\n//         x = ((x % mod) * (x % mod)) % mod;\n//         y /= 2;\n//     }\n//     return ans;\n// }\nll sum[N], dp[N]; \nint main() {\n    cin.tie(nullptr)->sync_with_stdio(false);\n    int x;\n    cin >> x;\n    \n    dp[1] = 2;\n    sum[1] = 2;\n    for(int i = 2; i <= x; i++){\n        dp[i] = (i + sum[i - 1]) % mod;\n        sum[i] = (sum[i - 1] + dp[i]) % mod;    \n    }\n    cout << dp[x];\n    return 0;\n}",WRONG_ANSWER,10,568
1527907337669799936,748ac3ecc0602491c859c96053bf6e4a1257b4898b868b58b582a1c1adba53cf,2022-05-21 15:01:11,C++,0.0,1526137569543503872,1526112971640856576,388,#include<cstdio>\n#include<iostream>\nusing namespace std;\ndouble total;\ndouble ans;\nint x;\nint main()\n{\n\tcin>>x;\n\tif(x==1)\n\t{\n\t\tcout<<2;\n\t\treturn 0;\n\t}\n\ttotal=3.0;\n\tfor(double i=2;i<=x;i++) \n\t{\n\t\tans=(total+1.0)/(i-1);\n\t\ttotal+=(ans+1);\n\t}\n\tcout<<int(ans)%998244353;\n\treturn 0;\n},WRONG_ANSWER,11,440
1527907727366762496,14224190bcfc90c64719211a05dce2182d65a4b137179c4faf7e96482b3d8559,2022-05-21 15:02:44,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n\nusing namespace std ;\n\nconst int maxn = 3000001 ;\nconst int mod = 998244353 ;\n\ndouble dp[maxn] ;\nint n;\ndouble sum=0 ;\nint main()\n{\n\tscanf(\""%d\"",&n) ;\n\tdp[1]=2 ;\n\tsum=2 ;\n\tfor(int i=2;i<=n;++i)\n\t{\n\t\tdp[i]=((i+sum)*1.0)/(i-1) ;\n\t\tsum+=dp[i] ;\n\t\t//sum=sum%mod ;\n\t}\n\tprintf(\""%d\"",(int)floor(dp[n])) ;\n\treturn 0 ;\n}\n",WRONG_ANSWER,6,324
1527908187117010944,47e37c8882a0e2331117042c258d96a660e5f546bf0afd3aef7caf354d646851,2022-05-21 15:04:33,Python,0.0,1526137569543503872,1526112971640856576,388,"x=int(input())\nL=[0]\nfor i in range(1,3000000):\n    L.append((i+1)/i*(L[i-1]+1))\nprint(int(L[x-1]+2),end='')",WRONG_ANSWER,1956,122264
1527908317215924224,977d524b48512f45dfed19895be9efa5f7300e11a5afdab1974f55b3a6549689,2022-05-21 15:05:04,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\nusing namespace std;\n\nlong long mod = 998244353;\nlong long x,a,b;\nint ans;\n\nlong long ksm(long long x,long long n)\n{\n\tint res = 1;\n\twhile(n)\n\t{\n\t\tif(n%2==1) res = res*x%mod;\n\t\tx = x*x%mod;\n\t\tn /= 2;\n\t}\n\t//cout<<res<<endl;\n\treturn res%mod;\n}\n\nint main()\n{\n\tcin>>x;\n\tif(x==1)\n\t{\n\t\tcout<<2<<endl;\n\t\treturn 0;\n\t} \n\tif(x==2)\n\t{\n\t\tcout<<4<<endl;\n\t\treturn 0;\n\t}\n\tans = 4;\n\tfor(int i=2;i<x;i++)\n\t{\n\t\tans = (ans+ksm(i,mod-2)+mod)%mod;\t\n\t}\t\n\tcout<<ans<<endl;\n\treturn 0; \n} ",TIME_LIMIT_EXCEEDED,2383,492
1527908444483710976,8822cd9b31e2c90bac06fe375e89a93c2205f71d14b9b6ae62ae5daf00fac4cb,2022-05-21 15:05:34,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint d =998244353;\n\tint x,i,j;\n\tint a[3000001];\n\ta[2]=4;\n\tscanf(\""%d\"",&x);\n\tfor(i=3;i<=x;i++){\n\t\ta[i] = (double)3/(i-1);\n\t\tfor(j=2;j<i;j++){\n\t\t\ta[i] += (double)a[j]/(i-1);\n\t\t}\n\t\ta[i]=a[i]%d;\n\t}\n\tprintf(\""%d\\n\"",a[x]);\n\treturn 0;\n} ",WRONG_ANSWER,11,452
1527908598548873216,cf5b70265594c95ba6651c2b48cfed01348d8bc9311215777b667d2a97b8bc65,2022-05-21 15:06:11,C++,0.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\nusing namespace std;\nusing ll =long long;\n#define endl \""\\n\""\n#define pb push_back\nconst int P=998244353;\n\nll n;\n\nvoid solve(){\n\tcin>>n;\n\tif(n==1){\n\t\tcout<<2<<endl;\n\t\treturn;\n\t}\n\tll ans=n*n%P;\n\tcout<<ans<<endl;\n}\n\nint main(){\n\tint _t=1;\n\twhile(_t--){\n\t\tsolve();\n\t}\n\treturn 0;\n}",WRONG_ANSWER,9,616
1527908763271766016,12af6a408b4b367f81a8ae74b7cab5e14aecbcbb93622fb59d2a487a0d8ce060,2022-05-21 15:06:50,C++,0.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\nusing namespace std;\n#pragma GCC optimize O(fast)\n#define fastio ios_base::sync_with_stdio(0);cin.tie(NULL);\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--)\n#define LL long long\n#define debug1 cout << \""???\\n\"";\n#define endl '\\n'\n#define se second\n#define fr first\n#define debug2(x) cout << #x << \"":\"" << x << endl;\nconst int INF = 0x3f3f3f3f;\nconst int N = 3000007;\nconst LL MOD =  998244353;\nLL ans[N];\n\nLL FastP(LL a, LL n)\n{\n    LL res = 1;\n    while(n)\n    {\n        if(n&1) res = (res * a) % MOD;\n        a = (a*a) %MOD;\n        n >>= 1;\n    }\n    return res;\n}\n\nint main()\n{\n//    fastio\n//    freopen(\""in.txt\"", \""r\"", stdin);\n//    freopen(\""out.txt\"", \""w\"", stdout);\n\n    ans[2] = 4;\n    int x;\n    cin >> x;\n    rep(i, 3, x) ans[i] = ans[i-1] + FastP(i-1, MOD-2);\n    cout << ans[x] << endl;\n\n\n\n//\n//    rep(i, 2, 50)\n//    {\n//        int t = 200000;\n//        a[2] = i;\n//        rep(pp, 1, t)\n//        {\n//            rep(j, 3, N)\n//            {\n//                a[j] = rand()%(abs(a[j-1]-a[j-2])+1) + min(a[j-1], a[j-2]);\n//                if(a[j] == a[j-1]) {ans[i] += (double)j/t; break;}\n//                if(j == N) {ans[i] += (double)N/t;}\n//            }\n//        }\n//        printf(\""%2d : %.2lf\\n\"",i, (ans[i]-ans[i-1])*(i-1));\n//    }\n    return 0;\n}\n",WRONG_ANSWER,7,472
1527909285991108608,59ab4795533cc4b6073ff68b69b7f90ed72438684572dd67f2db0f7ca390c426,2022-05-21 15:08:55,C++,300.0,1526137569543503872,1526112971640856576,388,"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nconst int mod = 998244353;\n\n#define ll long long\nconst int N = 3000005;\nint qpow(ll x, int y){\n    ll ans = 1;\n    while(y){\n        if(y & 1){\n           ans = ((ans % mod) * (x % mod)) % mod;\n        }\n        x = ((x % mod) * (x % mod)) % mod;\n        y /= 2;\n    }\n    return ans;\n}\nll sum[N], dp[N], inv[N]; \nint main() {\n    cin.tie(nullptr)->sync_with_stdio(false);\n    ll x;\n    cin >> x;\n    for(ll i = 1; i <= x;i++){\n        inv[i] = qpow(i, mod - 2);\n    }\n    dp[1] = 2;\n    sum[1] = 2;\n    for(int i = 2; i <= x; i++){\n        dp[i] = ((i + sum[i - 1]) % mod * inv[i - 1]) % mod;\n        sum[i] = (sum[i - 1] + dp[i]) % mod;\n    }\n    cout << dp[x];\n    return 0;\n}",ACCEPTED,5232,70840
1527909332338155520,24b7f119e39840bcf226b0278e177e357d0a78db38c5f2c587957194f44e3146,2022-05-21 15:09:06,C++,0.0,1526137569543503872,1526112971640856576,388,#include<iostream>\nusing namespace std;\nint main(){\n    int a1=2;\n    int a2=4;\n    int x;\n    int i=3;\n    int ai;\n    int tot=a1+a2;\n    cin>>x;\n    while(i<=x){\n    a1=a2;\n    a2=(i+tot)/(i-1);\n    tot+=a2;\n        i++;\n    }\n    const int num=998244353;\n    cout<<tot%num;\n    return 0;\n},WRONG_ANSWER,3,444
1527909618163208192,8822cd9b31e2c90bac06fe375e89a93c2205f71d14b9b6ae62ae5daf00fac4cb,2022-05-21 15:10:14,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint d =998244353;\n\tint x,i,j;\n\tint a[3000001];\n\ta[2]=4;\n\tscanf(\""%d\"",&x);\n\tfor(i=3;i<=x;i++){\n\t\ta[i] = (double)4/(i-1);\n\t\tfor(j=2;j<i;j++){\n\t\t\ta[i] += (double)(a[j]+1)/(i-1);\n\t\t}\n\t\ta[i]=a[i]%d;\n\t}\n\tprintf(\""%d\\n\"",a[x]);\n\treturn 0;\n} ",WRONG_ANSWER,11,436
1527909927832858624,73671ed0c395f9f095e78c5a0ea4d35ba1e8e49d54d0e4b4ef80fca2c0623045,2022-05-21 15:11:28,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\nusing namespace std;\n\nfloat l[3000005];\nfloat A[3000005];\nint main()\n{\n\n\tint n;\n\tint ans;\n\tint x;\t\n\tl[1]=0;A[1]=0;\n\t\n\tfor(int i=2;i<=3000000;i++)\n\t{\n\t\tl[i]=(A[i-1]+i);\n\t\tl[i]=l[i]/(i-1);\n\t\tA[i]=(A[i-1]+l[i]);\n\t}\n\n\tscanf(\""%d\"",&x);\n\tans=int(l[x]);\n\tans=(ans+2)%998244353;\n\tprintf(\""%d\"",ans);\n\t\n\treturn 0;\n}",WRONG_ANSWER,74,23872
1527910138240131072,12af6a408b4b367f81a8ae74b7cab5e14aecbcbb93622fb59d2a487a0d8ce060,2022-05-21 15:12:18,C++,0.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\nusing namespace std;\n#pragma GCC optimize O(fast)\n#define fastio ios_base::sync_with_stdio(0);cin.tie(NULL);\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--)\n#define LL long long\n#define debug1 cout << \""???\\n\"";\n#define endl '\\n'\n#define se second\n#define fr first\n#define debug2(x) cout << #x << \"":\"" << x << endl;\nconst int INF = 0x3f3f3f3f;\nconst int N = 3000007;\nconst LL MOD =  998244353;\nLL ans[N];\n\nLL FastP(LL a, LL n)\n{\n    LL res = 1;\n    while(n)\n    {\n        if(n&1) res = (res * a) % MOD;\n        a = (a*a) %MOD;\n        n >>= 1;\n    }\n    return res;\n}\n\nint main()\n{\n    ans[1] = 2;\n    ans[2] = 4;\n    int x;\n    cin >> x;\n    rep(i, 3, x) ans[i] = ans[i-1] + FastP(i-1, MOD-2);\n    cout << ans[x] << endl;\n    return 0;\n}\n",WRONG_ANSWER,7,440
1527910389114028032,12af6a408b4b367f81a8ae74b7cab5e14aecbcbb93622fb59d2a487a0d8ce060,2022-05-21 15:13:18,C++,300.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\nusing namespace std;\n#pragma GCC optimize O(fast)\n#define fastio ios_base::sync_with_stdio(0);cin.tie(NULL);\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--)\n#define LL long long\n#define debug1 cout << \""???\\n\"";\n#define endl '\\n'\n#define se second\n#define fr first\n#define debug2(x) cout << #x << \"":\"" << x << endl;\nconst int INF = 0x3f3f3f3f;\nconst int N = 3000007;\nconst LL MOD =  998244353;\nLL ans[N];\n\nLL FastP(LL a, LL n)\n{\n    LL res = 1;\n    while(n)\n    {\n        if(n&1) res = (res * a) % MOD;\n        a = (a*a) %MOD;\n        n >>= 1;\n    }\n    return res;\n}\n\nint main()\n{\n    ans[1] = 2;\n    ans[2] = 4;\n    int x;\n    cin >> x;\n    rep(i, 3, x) ans[i] = (ans[i-1] + FastP(i-1, MOD-2))%MOD;\n    cout << ans[x] << endl;\n    return 0;\n}\n",ACCEPTED,2518,23924
1527910884666851328,8822cd9b31e2c90bac06fe375e89a93c2205f71d14b9b6ae62ae5daf00fac4cb,2022-05-21 15:15:16,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint d =998244353;\n\tint x,i,j;\n    double t;\n\tint a[3000001];\n\ta[2]=4;\n\tscanf(\""%d\"",&x);\n\tfor(i=3;i<=x;i++){\n\t\tt = (double)4/(i-1);\n\t\tfor(j=2;j<i;j++){\n\t\t\tt += (double)(a[j]+1)/(i-1);\n\t\t}\n        a[i]= t;\n        if((t-a[i])>0.5) a[i]+=1;\n\t\ta[i]=a[i]%d;\n\t}\n\tprintf(\""%d\\n\"",a[x]);\n\treturn 0;\n} ",WRONG_ANSWER,7,456
1527911703881527296,d6c1ff1186403454f3c6cbdf6b88bd94ae6dbf741415641bb255e0462ee0ee48,2022-05-21 15:18:32,C++,0.0,1526137569543503872,1526112971640856576,388,#include<bits/stdc++.h>\nusing   namespace     std;\nint main()\n{\n    long    long    n;\n    cin>>n;\n    cout<<(2+n)%998244353;\n},WRONG_ANSWER,7,448
1527912046145134592,cf42dc91bba1d4925a56e5717e51e46104d383d0dcfffd61f0846e1694dff0c1,2022-05-21 15:19:53,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<cstdio>\n#include<algorithm>\n#include<iostream>\n#define mod 998244353\n#define maxn 3000009\n#define ll long long\nusing namespace std;\nll sum[maxn];\nll dp[maxn];\nll poww(ll x,ll p){\n    ll rt=1;\n    while(p){\n        if(p%2){\n            rt=rt*rt%mod;\n        }\n        else\n            rt=rt*x%mod;\n        p>>=1;\n    }\n    return rt;\n}\nusing namespace std;\nint main(){\n    ll n;\n    cin>>n;\n    dp[1]=2;\n    sum[1]=2;\n    for(int i=2;i<=n;i++){\n        dp[i]=(sum[i-1]%mod+i%mod)*poww(i-1,mod-2);\n        sum[i]=sum[i-1]+dp[i];\n    }\n    cout<<dp[n];\n    return 0;\n}",WRONG_ANSWER,6,436
1527912536052408320,c5fd8891a56aa85700647dd3e26898ad9a92cfd446405c2ee7bf509b5a2cf8a0,2022-05-21 15:21:50,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define ll long long\n#define N 3000005\nusing namespace std;\nconst ll mod=998244353;\nll inv[N],k;\nvoid getinv(){\n\tinv[1]=1;\n\tfor(ll i=2;i<=k;i++){\n\t\tll r=mod%i;ll n=mod/i;\n\t\t\n\t\tinv[i]=(mod-(n*inv[r])%mod)%mod;\n\t}\n}\n\nll f[N],sum[N];\nint main (){\n\tcin>>k;\n\tif(k==1){\n\t\tcout<<\""3\"";\n\t\treturn 0;\n\t}\n\tgetinv();\n\tmemset(f,0,sizeof(f));\n\tmemset(sum,0,sizeof(sum));\n\tf[1]=0;sum[1]=0;\n\tfor(ll i=2;i<=k;i++){\n\t\tf[i]=inv[i-1]*((sum[i-1]+i)%mod)%mod;\n\t\tsum[i]+=f[i];sum[i]%=mod;\n\t}\n\tcout<<(f[k]+2)%mod;\n\t//cout<<endl<<9*inv[2]%mod;\n}",WRONG_ANSWER,70,47424
1527912619510689792,f6f4d53d76ab930efc81bafc2931f29a611f2c60084eba5d8e06a1f04202c395,2022-05-21 15:22:10,C++,0.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\n#define ll long long\nusing namespace std;\nconst int mod=998244353;\nll n,x;\nint main(){\n    scanf(\""%lld\"",&x);\n    ll ans=2;\n    for(ll i=2;i<=x;i++){\n        ans=(ans*i)%mod;\n    }\n    printf(\""%lld\\n\"",ans%mod);\n    return 0;\n}",WRONG_ANSWER,8,452
1527912658446401536,cf42dc91bba1d4925a56e5717e51e46104d383d0dcfffd61f0846e1694dff0c1,2022-05-21 15:22:19,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<cstdio>\n#include<algorithm>\n#include<iostream>\n#define mod 998244353\n#define maxn 3000009\n#define ll long long\nusing namespace std;\nll sum[maxn];\nll dp[maxn];\nll poww(ll x,ll p){\n    ll rt=1;\n    while(p){\n        if(p%2){\n            rt=rt*rt%mod;\n        }\n        else\n            rt=rt*x%mod;\n        p>>=1;\n    }\n    return rt%mod;\n}\nusing namespace std;\nint main(){\n    ll n;\n    cin>>n;\n    dp[1]=2;\n    sum[1]=2;\n    for(int i=2;i<=n;i++){\n        dp[i]=(sum[i-1]%mod+i%mod)*poww(i-1,mod-2)%mod;\n        sum[i]=(sum[i-1]+dp[i])%mod;\n    }\n    cout<<dp[n];\n    return 0;\n}",WRONG_ANSWER,9,452
1527912927611674624,748ac3ecc0602491c859c96053bf6e4a1257b4898b868b58b582a1c1adba53cf,2022-05-21 15:23:23,C++,0.0,1526137569543503872,1526112971640856576,388,#include<cstdio>\n#include<iostream>\nusing namespace std;\ndouble total;\ndouble ans;\nint x;\nint main()\n{\n\tcin>>x;\n\tif(x==1)\n\t{\n\t\tcout<<2;\n\t\treturn 0;\n\t}\n\tif(x==2)\n\t{\n\t\tcout<<4;\n\t\treturn 0;\n\t}\n\ttotal=3.0;\n\tfor(double i=2;i<=x;i++) \n\t{\n\t\tans=(total+1.0)/(i-1.0);\n\t\ttotal+=(ans+1.0);\n\t}\n\tcout<<(int(ans)+1)%998244353;\n\treturn 0;\n},WRONG_ANSWER,10,440
1527913102367334400,55e6e7428009625733a664297d8f84d3ffd52fc7b1267866f36e0e3f0e6df995,2022-05-21 15:24:05,C++,300.0,1526137569543503872,1526112971640856576,388,"#include <algorithm>\n#include <iostream>\n\nconstexpr int mod = 998244353;\n\ninline int Pow(int b, int p, int m) {\n  int s = 1; b %= m; p %= m - 1;\n  for (; p; p >>= 1, b = 1ll * b * b % m)\n    if (p & 1) s = 1ll * s * b % m;\n  return s;\n}\n\ninline int Inv(int b) {\n  return Pow(b, mod - 2, mod);\n}\n\nint main() {\n  int x, slst = 4, ssum = 4;\n  std::cin >> x;\n\n  if (x == 1) {\n    std::cout << 2 << '\\n';\n    return 0;\n  }\n\n  x = std::abs(x - 1) + 1;\n  \n  if (x == 2) {\n    std::cout << slst << '\\n';\n    return 0;\n  }\n\n  for (int i = 3; i <= x; ++i) {\n    slst = (2ll + i + ssum) * Inv(i - 1) % mod;\n    ssum = (slst + ssum) % mod;\n  }\n  std::cout << slst;\n}",ACCEPTED,2912,572
1527913373466177536,5843606f42ddf914162471308f8fad110f308beb63598c142fa61f034dc26f07,2022-05-21 15:25:10,C++,0.0,1526137569543503872,1526112971640856576,388,#include <bits/stdc++.h>\n\nconst int MOD = 998244353;\n\nint main()\n{\n    int n;\n    std::cin >> n; \n    if (n == 1)\n        std::cout << 2;\n    else\n        std::cout << 4;\n    return 0;\n},WRONG_ANSWER,9,444
1527913532719706112,748ac3ecc0602491c859c96053bf6e4a1257b4898b868b58b582a1c1adba53cf,2022-05-21 15:25:48,C++,0.0,1526137569543503872,1526112971640856576,388,#include<cstdio>\n#include<iostream>\nusing namespace std;\ndouble total;\ndouble ans;\nint x;\nint main()\n{\n\tcin>>x;\n\tif(x==0)\n\t{\n\t\tcout<<4;\n\t\treturn 0;\n\t}\n\tif(x==1)\n\t{\n\t\tcout<<2;\n\t\treturn 0;\n\t}\n\tif(x==2)\n\t{\n\t\tcout<<4;\n\t\treturn 0;\n\t}\n\ttotal=3.0;\n\tfor(double i=2;i<=x;i++) \n\t{\n\t\tans=(total+1.0)/(i-1.0);\n\t\ttotal+=(ans+1.0);\n\t}\n\tcout<<int(ans)%998244353;\n\treturn 0;\n},WRONG_ANSWER,6,452
1527913540219129856,c5fd8891a56aa85700647dd3e26898ad9a92cfd446405c2ee7bf509b5a2cf8a0,2022-05-21 15:25:49,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define ll long long\n#define N 3000005\nusing namespace std;\nconst ll mod=998244353;\nll inv[N],k;\nvoid getinv(){\n\tinv[1]=1;\n\tfor(ll i=2;i<=k;i++){\n\t\tll r=mod%i;ll n=mod/i;\n\t\t\n\t\tinv[i]=(mod-(n*inv[r])%mod)%mod;\n\t}\n}\n\nll f[N],sum[N];\nint main (){\n\tcin>>k;\n\tgetinv();\n\tmemset(f,0,sizeof(f));\n\tmemset(sum,0,sizeof(sum));\n\tf[1]=0;sum[1]=0;\n\tfor(ll i=2;i<=k;i++){\n\t\tf[i]=(inv[i-1]*((sum[i-1]+i)%mod))%mod;\n\t\tsum[i]+=f[i];sum[i]%=mod;\n\t}\n\tcout<<(f[k]+2)%mod;\n\t//cout<<endl<<9*inv[2]%mod;\n}",WRONG_ANSWER,74,47408
1527914736799531008,7559f31ade63ba200a566e21a6c9e4fae8ad1448f5a6ac5eb85de9acb5e5a6a4,2022-05-21 15:30:35,C++,300.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define int long long\nusing namespace std;\nconst int p=998244353;\ninline int read(){\n\tint x=0,f=1;char c=getchar();\n\tfor(;!isdigit(c);c=getchar()) c=='-'?f=-1:1;\n\tfor(;isdigit(c);c=getchar()) x=x*10+c-'0';\n\treturn x*f;\n}\ninline int pnow(int a,int b,int P){\n\tint ans=1;\n\tfor(;b;b>>=1){\n\t\tif(b&1) ans=ans*a%P;\n\t\ta=a*a%P;\n \t}\n \treturn ans%P;\n}\nconst int ss=3e6+778;\nint f[ss],sum[ss];\nmain(){\n\tint n(read());\n\tf[1]=2;\n\tsum[1]=2;\n\tfor(int i=2;i<=n;i++){\n\t\tf[i]=(i+sum[i-1])%p*pnow(i-1,p-2,p);\n\t\tf[i]%=p;\n\t\tsum[i]=sum[i-1]+f[i];\n\t\tsum[i]%=p;\n\t}\n\tcout<<f[n];\n}",ACCEPTED,2704,47408
1527916054515638272,769095527b4fa6f5d16066f0e8cb5017d889ff873ccf63c69bdcf6128e3230a8,2022-05-21 15:35:49,C++,0.0,1526137569543503872,1526112971640856576,388,#include<bits/stdc++.h>\nusing namespace std;\nint x;\ntypedef long long LL;\nLL f[3000005];\nLL sum[3000005];\nLL ff(int n)\n{\n    return n*n;\n}\nint main()\n{\n    cin>>x;\n    int l = x;\n    f[1] = 1;\n    f[2] = 3;\n    sum[1] = 1;\n    sum[2] = 4;\n    for(int i=3;i<=x;i++)\n    {\n        f[i] = ff(i) - sum[i-1];\n        sum[i] = sum[i-1]+f[i];\n    }\n    cout<<(f[x]+1)%998244353;\n    return 0;\n},WRONG_ANSWER,8,440
1527916377711919104,e1c327bf92cebb917e0c16cdb081f21c51337e7ffa6162720f2e1f85306515fb,2022-05-21 15:37:06,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n\tint x;\n\tprintf(\""%d\"",x+2);\n}",WRONG_ANSWER,3,456
1527917471829671936,0dfbe4269e428a22883c01849e6b7bbe7717cc365198c7dc981a6b67ec482c79,2022-05-21 15:41:27,C,0.0,1526137569543503872,1526112971640856576,388,"#include<stdio.h>\nint main()\n{\n\tlong a[3000002]={0};\n\ta[1]=2;\n\tlong long sum=0;\n\tfor(int i=2;i<=3000000;i++)\n\t{\n\t\tsum+=a[i-1];\n\t\tdouble num=(sum+i)/(i-1);\n\t\ta[i]=num;\n\t}\n\tint x;\n\tscanf(\""%d\"",&x);\n\tprintf(\""%ld\\n\"",a[x]%998244353);\n\treturn 0;\n}",WRONG_ANSWER,149,23864
1527917975930494976,379de14f64c26fa0e1d4a3d49e558e1d380240d4f65a0094f69ada7eb91c83e6,2022-05-21 15:43:27,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\nint main()\n{\n\tint x;\n\tfloat  res;\n\tscanf(\""%d\"",&x);\n\tif(x==1)\n\t\tprintf(\""2\\n\"");\n\telse\n\t{\n\t\tres=4.0;\n\t\tfor(int i=3;i<x;i++)\n\t\t\tres+=1/(i-1)\n\t\tprintf(\""%.0f\\n\"",res);\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1527918015096897536,eb5f87ca0bdb5a0369e7778a566365c0297a3c1860dee64f84cf2784db06b805,2022-05-21 15:43:36,C,0.0,1526137569543503872,1526112971640856576,388,"#include<stdio.h>\nint y=0;\nvoid f(int a,int b,float c,float d){\n \tint i;\n \tif((a-b)*(a-b)==1) {\n \t\ty+=c*d;\n \t\treturn ;\n\t }\n \tif(a<b){\n \t\tfor(i=a;i<=b;i++) {\n \t\t\tf(i,b,c+1,d/(b-a+1));\n\t\t }\n\t }\n\t else{\n\t \t\tfor(i=b;i<=a;i++) {\n \t\t\tf(i,a,c+1,d/(a-b+1));\n\t\t }\n\t }\n}\nint main(){\n\tint x;\n\tscanf(\""%d\"",&x);\n\tf(1,x,2,1);\n\tprintf(\""%d\"",y*2);\n}\n\n",SEGMENTATION_FAULT,105,131496
1527918082482585600,379de14f64c26fa0e1d4a3d49e558e1d380240d4f65a0094f69ada7eb91c83e6,2022-05-21 15:43:52,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint x;\n\tfloat  res;\n\tscanf(\""%d\"",&x);\n\tif(x==1)\n\t\tprintf(\""2\\n\"");\n\telse\n\t{\n\t\tres=4.0;\n\t\tfor(int i=3;i<x;i++)\n\t\t\tres+=1/(i-1)\n\t\tprintf(\""%.0f\\n\"",res);\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1527918396254277632,379de14f64c26fa0e1d4a3d49e558e1d380240d4f65a0094f69ada7eb91c83e6,2022-05-21 15:45:07,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint x;\n\tfloat  res;\n\tscanf(\""%d\"",&x);\n\tif(x==1)\n\t\tprintf(\""2\\n\"");\n\telse\n\t{\n\t\tres=4.0;\n\t\tfor(int i=3;i<x;i++)\n\t\t{\n\t\t\tres+=1/(i-1);\n\t\t\tif(res> 998244353 )\n\t\t\t\tres-= 998244353 ;\n\t\t}\n\t\tprintf(\""%.0f\\n\"",res);\n\t}\n\treturn 0;\n}",WRONG_ANSWER,6,452
1527918701540888576,4722ad61a6d1176ab98a607b98675ba5183c185475b8c54613551352781652b0,2022-05-21 15:46:20,C++,0.0,1526137569543503872,1526112971640856576,388,#include<iostream>\n#include<cstring>\nusing namespace std;\nconst int N = 3000010;\nconst int Mod = 998244353;\ntypedef long long LL;\nLL q[N];\nint x;\nint main(){\n\tcin >> x;\n\tq[1] = 2;\n\tfor(int i = 2;i <= x;i ++){\n\t\tq[i] = q[i - 1] * 2 % Mod;\n\t}\n\tcout << (q[x] + 2) % Mod;\n\treturn 0;\n},WRONG_ANSWER,4,324
1527918940758822912,eb5f87ca0bdb5a0369e7778a566365c0297a3c1860dee64f84cf2784db06b805,2022-05-21 15:47:17,C,0.0,1526137569543503872,1526112971640856576,388,"#include<stdio.h>\nlong long y=0;\nvoid f(int a,int b,float c,float d){\n \tint i;\n \tif((a-b)*(a-b)==1) {\n \t\ty+=c*d;\n \t\treturn ;\n\t }\n \tif(a<b){\n \t\tfor(i=a;i<=b;i++) {\n \t\t\tf(i,b,c+1,d/(b-a+1));\n\t\t }\n\t }\n\t else{\n\t \t\tfor(i=b;i<=a;i++) {\n \t\t\tf(i,a,c+1,d/(a-b+1));\n\t\t }\n\t }\n}\nint main(){\n\tint x;\n\tscanf(\""%d\"",&x);\n\tf(1,x,2,1);\n\tprintf(\""%lld\"",y*2%998244353);\n}\n\n",SEGMENTATION_FAULT,99,131488
1527919159693111296,c5fd8891a56aa85700647dd3e26898ad9a92cfd446405c2ee7bf509b5a2cf8a0,2022-05-21 15:48:09,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define ll long long\n#define N 4000005\nusing namespace std;\nconst ll mod=998244353;\nll inv[N],k;\nvoid getinv(){\n\tinv[1]=1;\n\tfor(ll i=2;i<=k;i++){\n\t\tll r=mod%i;ll n=mod/i;\n\t\t\n\t\tinv[i]=(mod-(n*inv[r])%mod)%mod;\n\t}\n}\n\nll f[N],sum[N];\nint main (){\n\twhile(scanf(\""%lld\"",&k)!=EOF){\n\tgetinv();\n\tmemset(f,0,sizeof(f));\n\tmemset(sum,0,sizeof(sum));\n\tf[1]=0;sum[1]=0;\n\tfor(ll i=2;i<=k;i++){\n\t\tf[i]=(inv[i-1]*((sum[i-1]+i)%mod))%mod;\n\t\tsum[i]+=f[i];sum[i]%=mod;\n\t}\n\tcout<<(f[k]+2)%mod;\n\t}\n\t\n}",WRONG_ANSWER,92,63032
1527919184141697024,769095527b4fa6f5d16066f0e8cb5017d889ff873ccf63c69bdcf6128e3230a8,2022-05-21 15:48:15,C++,0.0,1526137569543503872,1526112971640856576,388,#include<bits/stdc++.h>\nusing namespace std;\nint x;\ntypedef long long LL;\nLL f[3000005];\nLL sum[3000005];\nLL ff(int n)\n{\n    return n*n;\n}\nint main()\n{\n    cin>>x;\n    int l = x;\n    f[1] = 1;\n    f[2] = 3;\n    sum[1] = 1;\n    sum[2] = 4;\n    for(int i=3;i<=x;i++)\n    {\n        f[i] = sum[i-1]/(i-1);\n        sum[i] = sum[i-1]+f[i];\n    }\n    cout<<(f[x]+1)%998244353;\n    return 0;\n},WRONG_ANSWER,8,580
1527919547750117376,c5fd8891a56aa85700647dd3e26898ad9a92cfd446405c2ee7bf509b5a2cf8a0,2022-05-21 15:49:42,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define ll long long\n#define N 4000005\nusing namespace std;\nconst ll mod=998244353;\nll inv[N],k;\nvoid getinv(){\n\tinv[1]=1;\n\tfor(ll i=2;i<=k;i++){\n\t\tll r=mod%i;ll n=mod/i;\n\t\t\n\t\tinv[i]=(mod-(n*inv[r])%mod)%mod;\n\t}\n}\n\nll f[N],sum[N];\nint main (){\n\twhile(scanf(\""%lld\"",&k)!=EOF){\n\tgetinv();\n\tmemset(f,0,sizeof(f));\n\tmemset(sum,0,sizeof(sum));\n\tf[1]=2;sum[1]=2;\n\tfor(ll i=2;i<=k;i++){\n\t\tf[i]=(inv[i-1]*((sum[i-1]+i)%mod))%mod;\n\t\tsum[i]+=f[i];sum[i]%=mod;\n\t}\n\tcout<<(f[k])%mod;\n\t}\n\t\n}",WRONG_ANSWER,94,62904
1527919549071302656,c5fd8891a56aa85700647dd3e26898ad9a92cfd446405c2ee7bf509b5a2cf8a0,2022-05-21 15:49:42,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define ll long long\n#define N 4000005\nusing namespace std;\nconst ll mod=998244353;\nll inv[N],k;\nvoid getinv(){\n\tinv[1]=1;\n\tfor(ll i=2;i<=k;i++){\n\t\tll r=mod%i;ll n=mod/i;\n\t\t\n\t\tinv[i]=(mod-(n*inv[r])%mod)%mod;\n\t}\n}\n\nll f[N],sum[N];\nint main (){\n\twhile(scanf(\""%lld\"",&k)!=EOF){\n\tgetinv();\n\tmemset(f,0,sizeof(f));\n\tmemset(sum,0,sizeof(sum));\n\tf[1]=2;sum[1]=2;\n\tfor(ll i=2;i<=k;i++){\n\t\tf[i]=(inv[i-1]*((sum[i-1]+i)%mod))%mod;\n\t\tsum[i]+=f[i];sum[i]%=mod;\n\t}\n\tcout<<(f[k])%mod;\n\t}\n\t\n}",WRONG_ANSWER,92,63028
1527919773403656192,e59ac1f01e0388407fcf1812217ef50f899d7e3687ea9158d34723fb662c721a,2022-05-21 15:50:36,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\nusing namespace std;\n#define M 998244353\n\nint E[3000000+5];\n\n\nint main(){\n    ios::sync_with_stdio(false);\n    #ifdef LOCAL\n        freopen(\""t.in\"",\""r\"",stdin);\n        freopen(\""t.out\"",\""w\"",stdout);\n    #endif\n    int x;\n    cin>>x;\n    memset(E,0,sizeof(E));\n    E[1]=0;\n    E[2]=4;\n    for(int i=3;i<=x;i++){\n        int r;\n        for(int j=1;j<x;j++){\n            r=(r+E[j]+1)%M;\n        }\n        E[x]=(r+1)/(x-1);\n    }\n    cout<<(x+2)%M;\n    return 0;\n}",WRONG_ANSWER,27,12228
1527919846208385024,bb9c21ee256338cd90338fa689711e8aff0146de34a7c978f790d738f6f8e483,2022-05-21 15:50:53,C,0.0,1526137569543503872,1526112971640856576,388,"#include<stdio.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n+2];\n    int b[n+2];\n    a[2]=4;\n    b[2]=4;\n    for(int i=3;i<=n;i++){\n        a[i]=(i+2+b[i-1])/(i-1)+1;\n        b[i]=b[i-1]+a[i];\n    }\n    printf(\""%d\"",a[n]);\n}\n",WRONG_ANSWER,6,312
1527919925812088832,e59ac1f01e0388407fcf1812217ef50f899d7e3687ea9158d34723fb662c721a,2022-05-21 15:51:12,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\nusing namespace std;\n#define M 998244353\n\nint E[3000000+5];\n\n\nint main(){\n    ios::sync_with_stdio(false);\n    #ifdef LOCAL\n        freopen(\""t.in\"",\""r\"",stdin);\n        freopen(\""t.out\"",\""w\"",stdout);\n    #endif\n    int x;\n    cin>>x;\n    memset(E,0,sizeof(E));\n    E[1]=0;\n    E[2]=4;\n    for(int i=3;i<=x;i++){\n        int r=0;\n        for(int j=1;j<x;j++){\n            r=(r+E[j]+1)%M;\n        }\n        E[x]=(r+1)/(x-1);\n    }\n    cout<<(x+2)%M;\n    return 0;\n}",WRONG_ANSWER,27,12216
1527919957428752384,155623ba93f8897b1aa1de76d17d36eef1e76264644f1965dd1f8bf0b7a2fdd9,2022-05-21 15:51:19,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<vector>\n#include<string>\n#include<iostream>\n#include<cstdio>\n#include<queue>\n#include<stack>\n#include<set>\nusing namespace std;\nusing ll = long long;\nconst ll mod = 998244353;\nconst ll INF = 0x7fffffff;\nll T;\nint main()\n{\n    ll x;\n    cin >> x;\n    cout << (x % mod) * (x % mod)<<\""\\n\"";\n    return 0;\n}",WRONG_ANSWER,8,440
1527920087649304576,eb5f87ca0bdb5a0369e7778a566365c0297a3c1860dee64f84cf2784db06b805,2022-05-21 15:51:50,C,0.0,1526137569543503872,1526112971640856576,388,"#include<stdio.h>\nlong long y=0;\nvoid f(int a,int b,long long c,float d){\n \tint i;\n \tif((a-b)*(a-b)==1) {\n \t\ty+=c*d;\n \t\treturn ;\n\t }\n \tif(a<b){\n \t\tfor(i=a;i<=b;i++) {\n \t\t\tf(i,b,c+1,d/(b-a+1));\n\t\t }\n\t }\n\t else{\n\t \t\tfor(i=b;i<=a;i++) {\n \t\t\tf(i,a,c+1,d/(a-b+1));\n\t\t }\n\t }\n}\nint main(){\n\tint x;\n\tscanf(\""%d\"",&x);\n\tf(1,x,2,1);\n\tprintf(\""%lld\"",y*2%998244353);\n}\n\n",SEGMENTATION_FAULT,104,131632
1527920513153052672,07411c1e1658b75f31dc6f0acd9401cf259a637bdf946d09504c33561a62917e,2022-05-21 15:53:32,C++,300.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\n#define cle(x) memset(x,0,sizeof(x))\n#define ok cout<<'!'<<endl\n#define inf 2147483647\n#define ll long long\n#define fir first\n#define sec second\n#define pr pair<int,int>\nusing namespace std;\n\nconst ll p = 998244353;\nll ans;\n\nll qpow(ll x,ll k)\n{   ll X = 1;\n    for (;k;k>>=1,x=(x*x)%p) if (k&1) X=(X*x)%p;\n    return X;\n}\n\nint main()\n{\n    ll n; cin >> n;\n    ll ans = 3;\n    for (int i=2;i<=n;i++) ans = (ans + qpow(i-1,p-2)%p ) %p;\n    cout << ans << '\\n';\n    return 0;\n}\n",ACCEPTED,2418,456
1527920543842791424,5300ebaaf9f194588a3bfa74779a95c05b1951ed2a7fb5b252784abc65871391,2022-05-21 15:53:39,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define int long long\nusing namespace std;\n\nvoid solve(int x){\n    int f[3100000];\n    f[1]=2,f[2]=4;\n    int sum=4;\n    for(int i=2;i<3050000;i++){\n        f[i+1]=(4*i+5+2*sum+(i*i)*f[i])/(i*i+2*i);\n        sum+=f[i];\n    }\n    cout<<f[x];\n    system(\""pause\"");\n}\nsigned main(){\n    int x;\n    cin>>x;\n    solve(x);\n}",WRONG_ANSWER,130,24628
1527920712973889536,c5fd8891a56aa85700647dd3e26898ad9a92cfd446405c2ee7bf509b5a2cf8a0,2022-05-21 15:54:20,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define ll long long\n#define N 4000005\nusing namespace std;\nconst ll mod=998244353;\nll inv[N],k;\nvoid getinv(){\n\tinv[1]=1;\n\tfor(ll i=2;i<=k;i++){\n\t\tll r=mod%i;ll n=mod/i;\n\t\t\n\t\tinv[i]=(mod-(n*inv[r])%mod)%mod;\n\t}\n}\n\nll f[N],sum[N];\nll pow(ll x,ll y){\n\tll res=0;\n\tx%=mod;y%=mod;\n\treturn (x*y)%mod;\n}\nint main (){\n\twhile(scanf(\""%lld\"",&k)!=EOF){\n\tgetinv();\n\tmemset(f,0,sizeof(f));\n\tmemset(sum,0,sizeof(sum));\n\tf[1]=0;sum[1]=0;\n\tfor(ll i=2;i<=k;i++){\n\t\tf[i]=pow(inv[i-1],sum[i-1]+i);\n\t\tsum[i]+=f[i];sum[i]%=mod;\n\t}\n\tcout<<(f[k]+2)%mod;\n\t}\n\t\n}",WRONG_ANSWER,88,63168
1527920847032250368,e59ac1f01e0388407fcf1812217ef50f899d7e3687ea9158d34723fb662c721a,2022-05-21 15:54:51,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\nusing namespace std;\n#define M 998244353\n\nint E[3000000+5];\n\n\nint main(){\n    ios::sync_with_stdio(false);\n    #ifdef LOCAL\n        freopen(\""t.in\"",\""r\"",stdin);\n        freopen(\""t.out\"",\""w\"",stdout);\n    #endif\n    int x;\n    cin>>x;\n    memset(E,0,sizeof(E));\n    E[1]=0;\n    E[2]=2;\n    for(int i=3;i<=x;i++){\n        int r=0;\n        for(int j=1;j<x;j++){\n            r=(r+E[j])%M;\n        }\n        E[x]=(r+x)/(x-1);\n    }\n    cout<<(x+2)%M;\n    return 0;\n}",WRONG_ANSWER,28,12228
1527921020282163200,cf42dc91bba1d4925a56e5717e51e46104d383d0dcfffd61f0846e1694dff0c1,2022-05-21 15:55:33,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<cstdio>\n#include<algorithm>\n#include<iostream>\n#define mod 998244353\n#define maxn 3000009\n#define ll long long\nusing namespace std;\nll sum[maxn];\nll dp[maxn];\n\nusing namespace std;\nll poww(ll x,ll p){\n    ll rt=1;\n    while(p){\n        if(p%2){\n            rt=rt*x%mod;\n        }\n        x=x*x%mod;\n        p>>=1;\n    }\n    return rt;\n}\nint main(){\n    dp[1]=2;\n    sum[1]=2;\n    for(int i=2;i<=n;i++){\n        dp[i]=(sum[i-1]%mod+i%mod)*poww(i-1,mod-2)%mod;\n        sum[i]=(sum[i-1]+dp[i])%mod;\n    }\n    cout<<dp[n];\n    return 0;\n}",COMPILE_ERROR,0,0
1527921057858936832,cf42dc91bba1d4925a56e5717e51e46104d383d0dcfffd61f0846e1694dff0c1,2022-05-21 15:55:42,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<cstdio>\n#include<algorithm>\n#include<iostream>\n#define mod 998244353\n#define maxn 3000009\n#define ll long long\nusing namespace std;\nll sum[maxn];\nll dp[maxn];\n\nusing namespace std;\nll poww(ll x,ll p){\n    ll rt=1;\n    while(p){\n        if(p%2){\n            rt=rt*x%mod;\n        }\n        x=x*x%mod;\n        p>>=1;\n    }\n    return rt;\n}\nint main(){\n    ll n;\n    dp[1]=2;\n    sum[1]=2;\n    for(int i=2;i<=n;i++){\n        dp[i]=(sum[i-1]%mod+i%mod)*poww(i-1,mod-2)%mod;\n        sum[i]=(sum[i-1]+dp[i])%mod;\n    }\n    cout<<dp[n];\n    return 0;\n}",WRONG_ANSWER,4,436
1527921073423998976,24b7f119e39840bcf226b0278e177e357d0a78db38c5f2c587957194f44e3146,2022-05-21 15:55:45,C++,0.0,1526137569543503872,1526112971640856576,388,#include<iostream>\nusing namespace std;\nint main(){\n    int a1=2;\n    int a2=4;\n    int x;\n    int i=3;\n    int ai;\n    int tot=a1+a2;\n    cin>>x;\n    while(i<=x){\n    a1=a2;\n    a2=(i+tot)/(i-1);\n    tot+=a2;\n        i++;\n    }\n    const int num=998244353;\n    cout<<num%tot;\n    return 0;\n},WRONG_ANSWER,3,324
1527921084719255552,02fb42c217943c8afc127305786f81f0e0c958a27e7ab4f3972ccc39c4e06941,2022-05-21 15:55:48,C++,0.0,1526137569543503872,1526112971640856576,388,"#include <bits/stdc++.h>\nusing namespace std;\nint a, b;\nint main()\n{\n    cin >> b;\n    cout << b * b%998244353 << endl;\n\n    return 0;\n}",WRONG_ANSWER,7,456
1527921086128545792,769095527b4fa6f5d16066f0e8cb5017d889ff873ccf63c69bdcf6128e3230a8,2022-05-21 15:55:48,C++,0.0,1526137569543503872,1526112971640856576,388,#include<bits/stdc++.h>\nusing namespace std;\nint x;\ntypedef long long LL;\nLL f[3000005];\nLL ff[3000005];\nLL sum[3000005];\nLL fff(int n)\n{\n    LL res = 1;\n    for(int i=1;i<=n;i++)\n    {\n        res*=2;\n        res = res%998244353;\n    }\n    return res;\n}\nint main()\n{\n    ff[0] = 1;\n    for(int i=1;i<=3000000;i++)\n    {\n        ff[i] = ff[i-1]*2;\n    }\n    cin>>x;\n    int l = x;\n    f[1] = 1;\n    f[2] = 3;\n    sum[1] = 1;\n    sum[2] = 4;\n    for(int i=3;i<=x;i++)\n    {\n        f[i] = (ff[i] - sum[i-1])%998244353;\n        sum[i] = (sum[i-1]+f[i])%998244353;\n    }\n    cout<<(f[x]+1)%998244353;\n    return 0;\n},WRONG_ANSWER,38,23872
1527921141707264000,cf42dc91bba1d4925a56e5717e51e46104d383d0dcfffd61f0846e1694dff0c1,2022-05-21 15:56:02,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<cstdio>\n#include<algorithm>\n#include<iostream>\n#define mod 998244353\n#define maxn 3000009\n#define ll long long\nusing namespace std;\nll sum[maxn];\nll dp[maxn];\n\nusing namespace std;\nll poww(ll x,ll p){\n    ll rt=1;\n    while(p){\n        if(p%2){\n            rt=rt*x%mod;\n        }\n        x=x*x%mod;\n        p>>=1;\n    }\n    return rt;\n}\nint main(){\n    ll n;\n    dp[1]=2;\n    sum[1]=2;\n    for(ll i=2;i<=n;i++){\n        dp[i]=(sum[i-1]%mod+i%mod)*poww(i-1,mod-2)%mod;\n        sum[i]=(sum[i-1]+dp[i])%mod;\n    }\n    cout<<dp[n];\n    return 0;\n}",WRONG_ANSWER,3,320
1527921175500771328,751d92029a314c86f240b3da0df8706bc3034f8633660127264d4da0b745a725,2022-05-21 15:56:10,C++,0.0,1526137569543503872,1526112971640856576,388,\n\n#include <iostream>\n#include<cmath>\nusing namespace std;\n\nint main()\n{\n    int x;\n    int num = 2;\n    int n;\n    cin >> x;\n    n = (x + 1) / 2;\n    while (abs(n - x) > 1) {\n        num++;\n        int temp = n;\n        n = (n + x) / 2;\n        x = temp;\n    }\n    cout << （num*2） % 998244353 ;\n}\n,COMPILE_ERROR,0,0
1527921205737496576,cf42dc91bba1d4925a56e5717e51e46104d383d0dcfffd61f0846e1694dff0c1,2022-05-21 15:56:17,C++,300.0,1526137569543503872,1526112971640856576,388,"#include<cstdio>\n#include<algorithm>\n#include<iostream>\n#define mod 998244353\n#define maxn 3000009\n#define ll long long\nusing namespace std;\nll sum[maxn];\nll dp[maxn];\n\nusing namespace std;\nll poww(ll x,ll p){\n    ll rt=1;\n    while(p){\n        if(p%2){\n            rt=rt*x%mod;\n        }\n        x=x*x%mod;\n        p>>=1;\n    }\n    return rt;\n}\nint main(){\n    ll n;\n    cin>>n;\n    dp[1]=2;\n    sum[1]=2;\n    for(ll i=2;i<=n;i++){\n        dp[i]=(sum[i-1]%mod+i%mod)*poww(i-1,mod-2)%mod;\n        sum[i]=(sum[i-1]+dp[i])%mod;\n    }\n    cout<<dp[n];\n    return 0;\n}",ACCEPTED,2655,47420
1527921244518039552,769095527b4fa6f5d16066f0e8cb5017d889ff873ccf63c69bdcf6128e3230a8,2022-05-21 15:56:26,C++,0.0,1526137569543503872,1526112971640856576,388,#include<bits/stdc++.h>\nusing namespace std;\nint x;\ntypedef long long LL;\nLL f[3000005];\nLL ff[3000005];\nLL sum[3000005];\n\nint main()\n{\n    ff[0] = 1;\n    for(int i=1;i<=3000000;i++)\n    {\n        ff[i] = (ff[i-1]*2)%998244353;\n    }\n    cin>>x;\n    int l = x;\n    f[1] = 1;\n    f[2] = 3;\n    sum[1] = 1;\n    sum[2] = 4;\n    for(int i=3;i<=x;i++)\n    {\n        f[i] = (ff[i] - sum[i-1])%998244353;\n        sum[i] = (sum[i-1]+f[i])%998244353;\n    }\n    cout<<(f[x]+1)%998244353;\n    return 0;\n},WRONG_ANSWER,58,23996
1527921266064183296,e59ac1f01e0388407fcf1812217ef50f899d7e3687ea9158d34723fb662c721a,2022-05-21 15:56:31,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\nusing namespace std;\n#define M 998244353\n\nint E[3000000+5];\n\n\nint main(){\n    ios::sync_with_stdio(false);\n    #ifdef LOCAL\n        freopen(\""t.in\"",\""r\"",stdin);\n        freopen(\""t.out\"",\""w\"",stdout);\n    #endif\n    int x;\n    cin>>x;\n    memset(E,0,sizeof(E));\n    E[1]=0;\n    E[2]=2;\n    for(int i=3;i<=x;i++){\n        int r=0;\n        for(int j=1;j<x;j++){\n            r=(r+E[j])%M;\n        }\n        E[x]=(r+x)/(x-1);\n    }\n    cout<<(x+2)%M;\n    return 0;\n}",WRONG_ANSWER,25,12228
1527921291037057024,e59ac1f01e0388407fcf1812217ef50f899d7e3687ea9158d34723fb662c721a,2022-05-21 15:56:37,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\nusing namespace std;\n#define M 998244353\n\nint E[3000000+5];\n\n\nint main(){\n    ios::sync_with_stdio(false);\n    #ifdef LOCAL\n        freopen(\""t.in\"",\""r\"",stdin);\n        freopen(\""t.out\"",\""w\"",stdout);\n    #endif\n    int x;\n    cin>>x;\n    memset(E,0,sizeof(E));\n    E[1]=0;\n    E[2]=2;\n    for(int i=3;i<=x;i++){\n        int r=0;\n        for(int j=1;j<x;j++){\n            r=(r+E[j])%M;\n        }\n        E[x]=(r+x)/(x-1);\n    }\n    cout<<(E[x]+2)%M;\n    return 0;\n}",WRONG_ANSWER,28,12288
1527921411732357120,4722ad61a6d1176ab98a607b98675ba5183c185475b8c54613551352781652b0,2022-05-21 15:57:06,C++,0.0,1526137569543503872,1526112971640856576,388,#include<iostream>\n#include<cstring>\nusing namespace std;\nconst int N = 3000010;\nconst int Mod = 998244353;\ntypedef long long LL;\nLL q[N];\nint x;\nint main(){\n\tcin >> x;\n\tq[1] = 2;\n\tfor(int i = 2;i <= x;i ++){\n\t\tq[i] = (q[i - 1] + 1) % Mod;\n\t}\n\tcout << (q[x] + 2) % Mod;\n\treturn 0;\n},WRONG_ANSWER,3,328
1527921528208183296,c5fd8891a56aa85700647dd3e26898ad9a92cfd446405c2ee7bf509b5a2cf8a0,2022-05-21 15:57:34,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define ll unsigned long long\n#define N 4000005\nusing namespace std;\nconst ll mod=998244353;\nll inv[N],k;\nvoid getinv(){\n\tinv[1]=1;\n\tfor(ll i=2;i<=k;i++){\n\t\tll r=mod%i;ll n=mod/i;\n\t\t\n\t\tinv[i]=(mod-(n*inv[r])%mod)%mod;\n\t}\n}\n\nll f[N],sum[N];\nll pow(ll x,ll y){\n\tll res=0;\n\tx%=mod;y%=mod;\n\treturn (x*y)%mod;\n}\nint main (){\n\twhile(scanf(\""%lld\"",&k)!=EOF){\n\tgetinv();\n\tmemset(f,0,sizeof(f));\n\tmemset(sum,0,sizeof(sum));\n\tf[1]=0;sum[1]=0;\n\tfor(ll i=2;i<=k;i++){\n\t\tf[i]=pow(inv[i-1],sum[i-1]+i);\n\t\tsum[i]+=f[i];sum[i]%=mod;\n\t}\n\tcout<<(f[k]+2)%mod;\n\t}\n\t\n}",WRONG_ANSWER,89,63036
1527921645548023808,24b7f119e39840bcf226b0278e177e357d0a78db38c5f2c587957194f44e3146,2022-05-21 15:58:02,C++,0.0,1526137569543503872,1526112971640856576,388,#include<iostream>\nusing namespace std;\nint main(){\n    double a1=2;\n    double a2=4;\n    int x;\n    int i=3;\n    double tot=a1+a2;\n    cin>>x;\n    while(i<=x){\n    a1=a2;\n    a2=(i+tot)/(i-1);\n    tot+=a2;\n        i++;\n    }\n    const int num=998244353;\n    cout<<static_cast<int>(a2)%num;\n    return 0;\n},WRONG_ANSWER,7,328
1527921752519557120,24b7f119e39840bcf226b0278e177e357d0a78db38c5f2c587957194f44e3146,2022-05-21 15:58:27,C++,0.0,1526137569543503872,1526112971640856576,388,#include<iostream>\nusing namespace std;\nint main(){\n    int a1=2;\n    int a2=4;\n    int x;\n    int i=3;\n    int tot=a1+a2;\n    cin>>x;\n    while(i<=x){\n    a1=a2;\n    a2=(i+tot)/(i-1);\n    tot+=a2;\n        i++;\n    }\n    const int num=998244353;\n    cout<<(a2)%num;\n    return 0;\n},WRONG_ANSWER,16,460
1527921755468148736,c5fd8891a56aa85700647dd3e26898ad9a92cfd446405c2ee7bf509b5a2cf8a0,2022-05-21 15:58:28,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\n#define ll unsigned long long\n#define N 5000005\nusing namespace std;\nconst ll mod=998244353;\nll inv[N],k;\nvoid getinv(){\n\tinv[1]=1;\n\tfor(ll i=2;i<=k;i++){\n\t\tll r=mod%i;ll n=mod/i;\n\t\t\n\t\tinv[i]=(mod-(n*inv[r])%mod)%mod;\n\t}\n}\n\nll f[N],sum[N];\nll pow(ll x,ll y){\n\tll res=0ll;\n\tx%=mod;y%=mod;\n\treturn (x*y)%mod;\n}\nint main (){\n\twhile(scanf(\""%lld\"",&k)!=EOF){\n\tgetinv();\n\tmemset(f,0,sizeof(f));\n\tmemset(sum,0,sizeof(sum));\n\tf[1]=0;sum[1]=0;\n\tfor(ll i=2;i<=k;i++){\n\t\tf[i]=pow(inv[i-1],sum[i-1]+i);\n\t\tsum[i]+=f[i];sum[i]%=mod;\n\t}\n\tcout<<(f[k]+2)%mod;\n\t}\n\t\n}",WRONG_ANSWER,114,78776
1527921786707341312,24b7f119e39840bcf226b0278e177e357d0a78db38c5f2c587957194f44e3146,2022-05-21 15:58:36,C++,0.0,1526137569543503872,1526112971640856576,388,#include<iostream>\nusing namespace std;\nint main(){\n    int a1=2;\n    int a2=4;\n    int x;\n    int i=3;\n    int tot=a1+a2;\n    cin>>x;\n    while(i<=x){\n    a1=a2;\n    a2=(i+tot)/(i-1);\n    tot+=a2;\n        i++;\n    }\n    const int num=998244353;\n    cout<<(a2)%num+1;\n    return 0;\n},WRONG_ANSWER,3,316
1527921813672501248,24b7f119e39840bcf226b0278e177e357d0a78db38c5f2c587957194f44e3146,2022-05-21 15:58:42,C++,0.0,1526137569543503872,1526112971640856576,388,#include<iostream>\nusing namespace std;\nint main(){\n    int a1=2;\n    int a2=4;\n    int x;\n    int i=3;\n    int tot=a1+a2;\n    cin>>x;\n    while(i<=x){\n    a1=a2;\n    a2=(i+tot)/(i-1);\n    tot+=a2;\n        i++;\n    }\n    const int num=998244353;\n    cout<<(a2)%num-1;\n    return 0;\n},WRONG_ANSWER,4,460
1527921829413728256,6ed1c75a98aecf87f065e991557f1ddb439cc8042d11602395dde5bb353cc3ed,2022-05-21 15:58:46,C++,0.0,1526137569543503872,1526112971640856576,388,#include <iostream>\nusing namespace std;\nint main()\n{\n\tint x;\n\tcin>>x;\n\tint a=1;\n\tfor(int i=0;i<x;i++)\n\ta=a*2%998244353;\n\tcout<<a;\n\treturn 0;\n}\n\n,WRONG_ANSWER,6,324
1527921926046302208,589a21675059ff69e8eed167a3f36b26196b9031ee3c28d095c7ba9b45a6ac88,2022-05-21 15:59:09,C++,300.0,1526137569543503872,1526112971640856576,388,"#include <iostream>\n#define dd 998244353\nusing namespace std;\n\nlong long times(int t, int num)\n{\n    int n = num;\n    long long s = 1, d = t;\n    while (n > 0)\n    {\n        if (n % 2 == 1)\n        {\n            s *= d;\n            s %= dd;\n        }\n\n        d *= d;\n        d %= dd;\n        n /= 2;\n    }\n    return s;\n}\n\nint main()\n{\n    long long s;\n    int n;\n\n    cin >> n;\n\n    if (n == 1)\n        cout << 2;\n    else if (n == 2)\n        cout << 4;\n    else\n    {\n        s = 4;\n        for (int i = 2; i <= n - 1; i++)\n        {\n            s += times(i, dd - 2);\n            s %= dd;\n        }\n        cout << (int)s;\n    }\n\n    return 0;\n}",ACCEPTED,2378,500
1527922053154680832,73671ed0c395f9f095e78c5a0ea4d35ba1e8e49d54d0e4b4ef80fca2c0623045,2022-05-21 15:59:39,C++,0.0,1526137569543503872,1526112971640856576,388,"#include<bits/stdc++.h>\nusing namespace std;\n\nfloat l[3000005];\nfloat A[3000005];\nint main()\n{\n\n\tint n;\n\tint ans;\n\tint x;\t\n\tl[1]=0;A[1]=0;\n\t\n\tfor(int i=2;i<=3000000;i++)\n\t{\n\t\tl[i]=(A[i-1]+i);\n\t\tl[i]=l[i]/(i-1);\n\t\tA[i]=(A[i-1]+l[i]);\n\t}\n\n\tscanf(\""%d\"",&x);\n\tans=int(l[x]);\n\tans=(ans+2)%998244353;\n\tprintf(\""%d\"",ans);\n\t\n\treturn 0;\n}",WRONG_ANSWER,73,24000
1364153379671334912,1687ae0417c2dd19dc41f24881136dbf9338bf8538faa5254ddcd706b1dbc019,2021-02-23 18:01:25,C,0.0,1364093988385423362,1364092441396084736,389,"#include <stdio.h>\n\nint main()\n{\n\tint m, k;\n\tscanf(\""%d\"",&m);\n\tfor( k=0; k<m; k++){\n\t\tint sum, i, j;\n\t\tscanf(\""%d\"",&sum);\n\t\tint re, bl;\n\t\tscanf(\""%d\"",&re);\n\t\tscanf(\""%d\"",&bl);\n\t\tint red[100000], r=0;\n\t\tint blue[100000], b=0;\n\t\tfor( i=0; i<sum; i++){\n\t\t\tred[i] = re%10;\n\t\t\tre = re/10;\n\t\t}\n\t\tfor( i=0; i<sum; i++){\n\t\t\tblue[i] = bl%10;\n\t\t\tbl = bl/10;\n\t\t}\n\t\tfor( i=0; i<sum; i++){\n\t\t\tfor( j=0; j<sum; j++){\n\t\t\t\tif( red[i]>blue[j]){\n\t\t\t\t\tr++;\n\t\t\t\t}\n\t\t\t\tif( red[i]<blue[j]){\n\t\t\t\t\tb++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif( r>b ){\n\t\t\tprintf(\""RED\\n\"");\n\t\t}else if( r<b ){\n\t\t\tprintf(\""BLUE\\n\"");\n\t\t}else{\n\t\t\tprintf(\""EQUAL\\n\"");\n\t\t}\n\t}\n } ",WRONG_ANSWER,17,320
1364239613563330560,c760b7044f0d1ce95c82b9a8fab1d40876feb12392abfeaabba3325478ca31b0,2021-02-23 23:44:04,C,0.0,1364093988385423362,1364092441396084736,389,"#include<stdio.h>\nint main(){\n\tint t,i,n,r,b;\n\tscanf(\""%d\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\\n%d\\n%d\"",&n,&r,&b);\n\t\tif(r>b){\n\t\t\tprintf(\""RED\\n\"");\n\t\t}else if(r<b){\n\t\t\tprintf(\""BLUE\\n\"");\n\t\t}else{\n\t\t\tprintf(\""EQUAL\\n\"");\n\t\t}\t\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,12,304
1364256818468315136,c760b7044f0d1ce95c82b9a8fab1d40876feb12392abfeaabba3325478ca31b0,2021-02-24 00:52:26,C++,8.0,1364093988385423362,1364092441396084736,389,"#include<iostream>\nusing namespace std;\n\nint main() {\n\tint t;\n\tcin >> t;\n\twhile (t--) {\n\t\tint n;\n\t\tstring s1, s2;\n\t\tcin >> n >> s1 >> s2;\n\t\tint r = 0, b = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (s1[i] > s2[i])\n\t\t\t\tr++;\n\t\t\tif (s2[i] > s1[i])\n\t\t\t\tb++;\n\t\t}\n\t\tif (r > b)\n\t\t\tcout << \""RED\"";\n\t\tif (r == b)\n\t\t\tcout << \""EQUAL\"";\n\t\tif (r < b)\n\t\t\tcout << \""BLUE\"";\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",ACCEPTED,34,432
1364257135247319040,c760b7044f0d1ce95c82b9a8fab1d40876feb12392abfeaabba3325478ca31b0,2021-02-24 00:53:42,C++,8.0,1364093988385423362,1364092441396084736,389,"#include<iostream>\nusing namespace std;\n\nint main() {\n\tint t;\n\tcin >> t;\n\tfor(int j=0;j<t;j++) {\n\t\tint n;\n\t\tstring s1, s2;\n\t\tcin >> n >> s1 >> s2;\n\t\tint r = 0, b = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (s1[i] > s2[i])\n\t\t\t\tr++;\n\t\t\tif (s2[i] > s1[i])\n\t\t\t\tb++;\n\t\t}\n\t\tif (r > b)\n\t\t\tcout << \""RED\"";\n\t\tif (r == b)\n\t\t\tcout << \""EQUAL\"";\n\t\tif (r < b)\n\t\t\tcout << \""BLUE\"";\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",ACCEPTED,46,448
1364837786438688768,1687ae0417c2dd19dc41f24881136dbf9338bf8538faa5254ddcd706b1dbc019,2021-02-25 15:21:00,C,0.0,1364093988385423362,1364092441396084736,389,"#include <stdio.h>\n\nint main()\n{\n\tint m, k;\n\tscanf(\""%d\"",&m);\n\tfor( k=0; k<m; k++){\n\t\tint sum, i, j;\n\t\tscanf(\""%d\"",&sum);\n\t\tint re, bl;\n\t\tscanf(\""%d\"",&re);\n\t\tscanf(\""%d\"",&bl);\n\t\tint red[100000], r=0;\n\t\tint blue[100000], b=0;\n\t\tfor( i=0; i<sum; i++){\n\t\t\tred[i] = re%10;\n\t\t\tre = re/10;\n\t\t}\n\t\tfor( i=0; i<sum; i++){\n\t\t\tblue[i] = bl%10;\n\t\t\tbl = bl/10;\n\t\t}\n\t\tfor( i=0; i<sum; i++){\n\t\t\tfor( j=0; j<sum; j++){\n\t\t\t\tif( red[i]>blue[j]){\n\t\t\t\t\tr++;\n\t\t\t\t}\n\t\t\t\tif( red[i]<blue[j]){\n\t\t\t\t\tb++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif( r>b ){\n\t\t\tprintf(\""RED\\n\"");\n\t\t}else if( r<b ){\n\t\t\tprintf(\""BLUE\\n\"");\n\t\t}else{\n\t\t\tprintf(\""EQUAL\\n\"");\n\t\t}\n\t}\n } ",WRONG_ANSWER,30,324
1364947734128582656,90ec480d8950ff079311e49ee800aa51c5fd5e1ed2b4e6cb1634af6936a2c256,2021-02-25 22:37:53,C,0.0,1364093988385423362,1364092441396084736,389,"#include <stdio.h>\n \nvoid sl( );\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    for(int i=0;i<t;i++)\n    {\n       int n,R,B;\n        scanf(\""%d%d%d\"",&n,&R,&B);\n        int a[n],b[n];\n        for(int j=0;j<n;j++)\n        {\n            a[j]=R%10;\n            b[j]=B%10;\n            R/=10;B/=10;\n        }\n        for(int j=0;j<n;j++)\n            for(int h=j+1;h<n;h++)\n            {\n                int k;\n                    if(a[j]>a[h])\n                {\n                    k=a[j];\n                    a[j]=a[h];\n                    a[h]=k;\n                }\n                if(b[j]>b[h])\n                {\n                    k=b[j];\n                    b[j]=b[h];\n                    b[h]=k;\n                }\n            }\n        int red=0,blue=0;\n        for(int g=0;g<n;g++)\n        {\n            if(a[g]>b[g])\n            red++;\n            else if(a[g]<b[g])\n            blue++;\n        }\n        if(red>blue)\n        printf(\""RED\\n\"");\n        else if(red<blue)\n        printf(\""BLUE\\n\"");\n        else printf(\""EQUAL\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,11,320
1367084478114390016,90ec480d8950ff079311e49ee800aa51c5fd5e1ed2b4e6cb1634af6936a2c256,2021-03-03 20:08:33,C,0.0,1364093988385423362,1364092441396084736,389,"#include <stdio.h>\n \nvoid sl( );\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    for(int i=0;i<t;i++)\n    {\n       int n,R,B,red=0,blue=0;\n        scanf(\""%d%d%d\"",&n,&R,&B);\n        int a[n],b[n];\n        for(int j=0;j<n;j++)\n        {\n            a[j]=R%10;\n            b[j]=B%10;\n            if(a[j]>b[j])\n                red++;\n            else if(a[j]<b[j])\n                blue++;    \n            R/=10;B/=10;\n        }\n        if(red>blue)\n            printf(\""RED\\n\"");\n        else if(red<blue)\n            printf(\""BLUE\\n\"");\n        else printf(\""EQUAL\\n\"");\n            \n    }\n    return 0;\n}",WRONG_ANSWER,9,304
1367097163149303808,90ec480d8950ff079311e49ee800aa51c5fd5e1ed2b4e6cb1634af6936a2c256,2021-03-03 20:58:57,C,8.0,1364093988385423362,1364092441396084736,389,"#include <stdio.h>\n\n\nint main()\n{\n\tint t;\n\tscanf(\""%d\"",&t);\n\tfor(int i=0;i<t;i++)\n\t{\n\t\tint n,red=0,blue=0;\n\t\tscanf(\""%d\"",&n);\n\t\tchar a[n],b[n];\n\t\tscanf(\""%s%s\"",a,b);\n\t\tfor(int j=0;j<n;j++)\n\t\t{\n\t\t\ta[j]-=48;\n\t\t\tb[j]-=48;\n\t\t\tif(a[j]>b[j])\n\t\t\tred++;\n\t\t\telse if(a[j]<b[j])\n\t\t\tblue++;\n\t\t}\n\t\tif(red>blue)\n            printf(\""RED\\n\"");\n        else if(red<blue)\n            printf(\""BLUE\\n\"");\n        else printf(\""EQUAL\\n\"");\n\t}\n\treturn 0;\n}\n",ACCEPTED,8,192
1367110867991486464,c760b7044f0d1ce95c82b9a8fab1d40876feb12392abfeaabba3325478ca31b0,2021-03-03 21:53:25,C++,8.0,1364093988385423362,1364092441396084736,389,"#include<iostream>\nusing namespace std;\n\nint main() {\n\tint t;\n\tcin >> t;\n\tfor(int j=0;j<t;j++) {\n\t\tint n;\n\t\tstring s1, s2;\n\t\tcin >> n >> s1 >> s2;\n\t\tint r = 0, b = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (s1[i] > s2[i])\n\t\t\t\tr++;\n\t\t\tif (s2[i] > s1[i])\n\t\t\t\tb++;\n\t\t}\n\t\tif (r > b)\n\t\t\tcout << \""RED\"";\n\t\tif (r == b)\n\t\t\tcout << \""EQUAL\"";\n\t\tif (r < b)\n\t\t\tcout << \""BLUE\"";\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",ACCEPTED,33,456
1367127922836856832,c760b7044f0d1ce95c82b9a8fab1d40876feb12392abfeaabba3325478ca31b0,2021-03-03 23:01:11,C++,8.0,1364093988385423362,1364092441396084736,389,"#include<iostream>\nusing namespace std;\n\nint main() {\n\tint t;\n\tcin >> t;\n\twhile (t--) {\n\t\tint n;\n\t\tstring s1, s2;\n\t\tcin >> n >> s1 >> s2;\n\t\tint r = 0, b = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (s1[i] > s2[i])\n\t\t\t\tr++;\n\t\t\tif (s2[i] > s1[i])\n\t\t\t\tb++;\n\t\t}\n\t\tif (r > b)\n\t\t\tcout << \""RED\"";\n\t\tif (r == b)\n\t\t\tcout << \""EQUAL\"";\n\t\tif (r < b)\n\t\t\tcout << \""BLUE\"";\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",ACCEPTED,37,436
1367137655719288832,c760b7044f0d1ce95c82b9a8fab1d40876feb12392abfeaabba3325478ca31b0,2021-03-03 23:39:51,C,0.0,1364093988385423362,1364092441396084736,389,"#include<stdio.h>\n\nint main(){\n\tint t;\n\tscanf(\""%d\"",&t);\n\tfor(int i=0;i<t;i++){\n\t\tint n,re,bl;\n\t\tint R=0,B=0;\n\t\tscanf(\""%d\\n%d\\n%d\"",&n,&re,&bl);\n\t\tfor(int j=0;j<n;j++){\n\t\t\tif((re%10)>(bl%10)){\n\t\t\t\tR++;\n\t\t\t}else if((re%10)<(bl%10)){\n\t\t\t\tB++;\n\t\t\t}\n\t\t\tre/=10;\n\t\t\tbl/=10;\n\t\t}\n\t\tif(R>B){\n\t\t\tprintf(\""RED\\n\"");\n\t\t}else if(R==B){\n\t\t\tprintf(\""EQUAL\\n\"");\n\t\t}else{\n\t\t\tprintf(\""BLUE\\n\"");\n\t\t}\n    }\n\treturn 0;\n} ",WRONG_ANSWER,7,196
1367144108106539008,c760b7044f0d1ce95c82b9a8fab1d40876feb12392abfeaabba3325478ca31b0,2021-03-04 00:05:30,C,0.0,1364093988385423362,1364092441396084736,389,"#include<stdio.h>\n\nint main(){\n\tint t;\n\tscanf(\""%d\"",&t);\n\tfor(int i=0;i<t;i++){\n\t\tint n,R,B,E;\n\t\tscanf(\""%d\"",&n);\n\t\tchar red[1000],blue[1000];\n\t    scanf(\""%s\"",red);\n\t\tscanf(\""%s\"",blue);\n\t\n\t\tfor(int q=0;q<n;q++){\n\t\t\tif(red[q]>blue[q]){\n\t\t\t\tR++;\n\t\t\t}else if(red[q]<blue[q]){\n\t\t\t\tB++;\n\t\t\t}\n\t\t}\n\t\tif(R>B){\n\t\t\tprintf(\""RED\\n\"");\n\t\t}else if(R<B){\n\t\t\tprintf(\""BLUE\\n\"");\n\t\t}else{\n\t\t\tprintf(\""EQUAL\\n\"");\n\t\t}\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,8,392
1367145890148868096,c760b7044f0d1ce95c82b9a8fab1d40876feb12392abfeaabba3325478ca31b0,2021-03-04 00:12:35,C,8.0,1364093988385423362,1364092441396084736,389,"#include<stdio.h>\n\nint main(){\n\tint t;\n\tscanf(\""%d\"",&t);\n\tfor(int i=0;i<t;i++){\n\t\tint n,R=0,B=0;\n\t\tscanf(\""%d\"",&n);\n\t\tchar red[1000],blue[1000];\n\t    scanf(\""%s\"",red);\n\t\tscanf(\""%s\"",blue);\n\t\n\t\tfor(int q=0;q<n;q++){\n\t\t\tif(red[q]>blue[q]){\n\t\t\t\tR++;\n\t\t\t}else if(red[q]<blue[q]){\n\t\t\t\tB++;\n\t\t\t}\n\t\t}\n\t\tif(R>B){\n\t\t\tprintf(\""RED\\n\"");\n\t\t}else if(R<B){\n\t\t\tprintf(\""BLUE\\n\"");\n\t\t}else{\n\t\t\tprintf(\""EQUAL\\n\"");\n\t\t}\n\t}\n\treturn 0;\n} ",ACCEPTED,17,312
1367146754917883904,c760b7044f0d1ce95c82b9a8fab1d40876feb12392abfeaabba3325478ca31b0,2021-03-04 00:16:01,C,8.0,1364093988385423362,1364092441396084736,389,"#include<stdio.h>\n\nint main(){\n\tint t;\n\tscanf(\""%d\"",&t);\n\tfor(int i=0;i<t;i++){\n\t\tint n,R=0,B=0;\n\t\tscanf(\""%d\"",&n);\n\t\tchar red[1000],blue[1000];\n\t    scanf(\""%s\"",red);\n\t\tscanf(\""%s\"",blue);\n\t\n\t\tfor(int q=0;q<n;q++){\n\t\t\tif(red[q]>blue[q]){\n\t\t\t\tR++;\n\t\t\t}else if(red[q]<blue[q]){\n\t\t\t\tB++;\n\t\t\t}\n\t\t}\n\t\tif(R>B){\n\t\t\tprintf(\""RED\\n\"");\n\t\t}else if(R<B){\n\t\t\tprintf(\""BLUE\\n\"");\n\t\t}else{\n\t\t\tprintf(\""EQUAL\\n\"");\n\t\t}\n\t}\n\t\n} ",ACCEPTED,12,296
1367255661074014208,1687ae0417c2dd19dc41f24881136dbf9338bf8538faa5254ddcd706b1dbc019,2021-03-04 07:28:46,C,0.0,1364093988385423362,1364092441396084736,389,"#include <stdio.h>\n\nint main()\n{\n\tint m, k;\n\tscanf(\""%d\"",&m);\n\tfor( k=0; k<m; k++){\n\t\tint sum, i, j;\n\t\tscanf(\""%d\"",&sum);\n\t\tint re, bl;\n\t\tscanf(\""%d\"",&re);\n\t\tscanf(\""%d\"",&bl);\n\t\tint red[100000], r=0;\n\t\tint blue[100000], b=0;\n\t\tfor( i=0; i<sum; i++){\n\t\t\tred[i] = re%10;\n\t\t\tre = re/10;\n\t\t}\n\t\tfor( i=0; i<sum; i++){\n\t\t\tblue[i] = bl%10;\n\t\t\tbl = bl/10;\n\t\t}\n\t\tfor( i=0; i<sum; i++){\n\t\t\tfor( j=0; j<sum; j++){\n\t\t\t\tif( red[i]>blue[j]){\n\t\t\t\t\tr++;\n\t\t\t\t}\n\t\t\t\tif( red[i]<blue[j]){\n\t\t\t\t\tb++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif( r>b ){\n\t\t\tprintf(\""RED\\n\"");\n\t\t}else if( r<b ){\n\t\t\tprintf(\""BLUE\\n\"");\n\t\t}else{\n\t\t\tprintf(\""EQUAL\\n\"");\n\t\t}\n\t}\n } ",WRONG_ANSWER,20,300
1367273150952595456,fde8a61ae47fde9030cd0985dee7d66888866f1713dba82df19568e83c832daa,2021-03-04 08:38:16,C++,0.0,1364093988385423362,1364092441396084736,389,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int t,n,a,b,c1=0,c2=0,v1=0,v2=0;\n    cin>>t;\n    while(t--)\n    {\n        cin>>n;\n        cin>>a;\n        cin>>b;\n        if(a==b)\n            cout<<\""EQUAL\""<<endl;\n        else{\n            v1=0;v2=0;\n            while(a||b){\n                c1=a%10;\n                a/=10;\n                c2=b%10;\n                b/=10;\n                if(c1>c2)\n                    v1++;\n                else if(c1<c2)\n                    v2++;\n            }\n            if(v1>v2)\n                cout<<\""RED\""<<endl;\n            else cout<<\""BLUE\""<<endl;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,36,488
1367275076813414400,fde8a61ae47fde9030cd0985dee7d66888866f1713dba82df19568e83c832daa,2021-03-04 08:45:55,C++,0.0,1364093988385423362,1364092441396084736,389,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int t,n,a,b,c1=0,c2=0,v1=0,v2=0;\n    cin>>t;\n    while(t--)\n    {\n        cin>>n;\n        cin>>a;\n        cin>>b;\n        if(a==b)\n            cout<<\""EQUAL\""<<endl;\n        else{\n            v1=0;v2=0;\n            while(a||b){\n                c1=a%10;\n                a/=10;\n                c2=b%10;\n                b/=10;\n                if(c1>c2)\n                    v1++;\n                else if(c1<c2)\n                    v2++;\n            }\n            if(v1>v2)\n                cout<<\""RED\""<<endl;\n            else if(v2>v1) cout<<\""BLUE\""<<endl;\n            else cout<<\""EQUAL\""<<endl;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,52,444
1367275768999403520,fde8a61ae47fde9030cd0985dee7d66888866f1713dba82df19568e83c832daa,2021-03-04 08:48:40,C++,0.0,1364093988385423362,1364092441396084736,389,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int t,n,a,b,c1=0,c2=0,v1=0,v2=0;\n    cin>>t;\n    while(t--)\n    {\n        cin>>n;\n        cin>>a;\n        cin>>b;\n        if(a==b)\n            cout<<\""EQUAL\""<<endl;\n        else{\n            v1=0;v2=0;\n            while(a||b){\n                c1=a%10;\n                a/=10;\n                c2=b%10;\n                b/=10;\n                if(c1>c2)\n                    v1++;\n                else if(c1<c2)\n                    v2++;\n            }\n            if(v1>v2)\n                cout<<\""RED\""<<endl;\n            else if(v2>v1) cout<<\""BLUE\""<<endl;\n            else cout<<\""EQUAL\""<<endl;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,30,436
1367276749757702144,fde8a61ae47fde9030cd0985dee7d66888866f1713dba82df19568e83c832daa,2021-03-04 08:52:34,C++,8.0,1364093988385423362,1364092441396084736,389,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int t,n,c1=0,c2=0,v1=0,v2=0;\n    long a,b;\n    cin>>t;\n    while(t--)\n    {\n        cin>>n;\n        cin>>a;\n        cin>>b;\n        if(a==b)\n            cout<<\""EQUAL\""<<endl;\n        else{\n            v1=0;v2=0;\n            while(a||b){\n                c1=a%10;\n                a/=10;\n                c2=b%10;\n                b/=10;\n                if(c1>c2)\n                    v1++;\n                else if(c1<c2)\n                    v2++;\n            }\n            if(v1>v2)\n                cout<<\""RED\""<<endl;\n            else if(v2>v1) cout<<\""BLUE\""<<endl;\n            else cout<<\""EQUAL\""<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,47,544
1367359113015943168,f5000469b06f2ecdba47629a1542e95776627b2f437c4fe31da5b403b8ed000c,2021-03-04 14:19:51,C,0.0,1364093988385423362,1364092441396084736,389,"#include<stdio. h>\nint main()\n{\n    int t,r[9999],b[9999];\n    scanf(\""%d\"",&t);\n    for(int i=0;i < t;i++)\n    {\n        scanf(\""%d\"",&n);\n        for(int j=0;j < n;j++)\n        {\n            gets(r);\n            gets(b);\n        }\n        for(int j=0;j < n;j++)\n            for(int k=0;k < n;k++)\n            {\n                if(r[j]<b[k])\n                    R++;\n                else if(r[j]>b[k])\n                    B++;\n                else\n                    E++;\n            }\n        if(R>B)\n            printf(\""RED\\n\"");\n        else if(R<B)\n            printf(\""BLUE\\n\"");\n        else\n            printf(\""EQUAL\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1367359299024936960,f5000469b06f2ecdba47629a1542e95776627b2f437c4fe31da5b403b8ed000c,2021-03-04 14:20:35,C,0.0,1364093988385423362,1364092441396084736,389,"#include<stdio. h>\nint main()\n{\n    int t,r[9999],b[9999];\n    int R=0,B=0,E=0;\n    scanf(\""%d\"",&t);\n    for(int i=0;i < t;i++)\n    {\n        scanf(\""%d\"",&n);\n        for(int j=0;j < n;j++)\n        {\n            gets(r);\n            gets(b);\n        }\n        for(int j=0;j < n;j++)\n            for(int k=0;k < n;k++)\n            {\n                if(r[j]<b[k])\n                    R++;\n                else if(r[j]>b[k])\n                    B++;\n                else\n                    E++;\n            }\n        if(R>B)\n            printf(\""RED\\n\"");\n        else if(R<B)\n            printf(\""BLUE\\n\"");\n        else\n            printf(\""EQUAL\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1367359363692716032,f5000469b06f2ecdba47629a1542e95776627b2f437c4fe31da5b403b8ed000c,2021-03-04 14:20:51,C,0.0,1364093988385423362,1364092441396084736,389,"#include<stdio.h>\nint main()\n{\n    int t,r[9999],b[9999];\n    int R=0,B=0,E=0;\n    scanf(\""%d\"",&t);\n    for(int i=0;i < t;i++)\n    {\n        scanf(\""%d\"",&n);\n        for(int j=0;j < n;j++)\n        {\n            gets(r);\n            gets(b);\n        }\n        for(int j=0;j < n;j++)\n            for(int k=0;k < n;k++)\n            {\n                if(r[j]<b[k])\n                    R++;\n                else if(r[j]>b[k])\n                    B++;\n                else\n                    E++;\n            }\n        if(R>B)\n            printf(\""RED\\n\"");\n        else if(R<B)\n            printf(\""BLUE\\n\"");\n        else\n            printf(\""EQUAL\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1367359744816537600,f5000469b06f2ecdba47629a1542e95776627b2f437c4fe31da5b403b8ed000c,2021-03-04 14:22:22,C,0.0,1364093988385423362,1364092441396084736,389,"#include<stdio.h>\nint main()\n{\n    int t,n;\n    char r[9999],b[9999];\n    int R=0,B=0,E=0;\n    scanf(\""%d\"",&t);\n    for(int i=0;i < t;i++)\n    {\n        scanf(\""%d\"",&n);\n        for(int j=0;j < n;j++)\n        {\n            gets(r);\n            gets(b);\n        }\n        for(int j=0;j < n;j++)\n            for(int k=0;k < n;k++)\n            {\n                if(r[j]<b[k])\n                    R++;\n                else if(r[j]>b[k])\n                    B++;\n                else\n                    E++;\n            }\n        if(R>B)\n            printf(\""RED\\n\"");\n        else if(R<B)\n            printf(\""BLUE\\n\"");\n        else\n            printf(\""EQUAL\\n\"");\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1367359875204866048,f5000469b06f2ecdba47629a1542e95776627b2f437c4fe31da5b403b8ed000c,2021-03-04 14:22:53,C,0.0,1364093988385423362,1364092441396084736,389,"#include<stdio.h>\nint main()\n{\n    int t,n;\n    char r[9999],b[9999];\n    int R=0,B=0,E=0;\n    scanf(\""%d\"",&t);\n    for(int i=0;i < t;i++)\n    {\n        scanf(\""%d\"",&n);\n        for(int j=0;j < n;j++)\n        {\n            get(r);\n            get(b);\n        }\n        for(int j=0;j < n;j++)\n            for(int k=0;k < n;k++)\n            {\n                if(r[j]<b[k])\n                    R++;\n                else if(r[j]>b[k])\n                    B++;\n                else\n                    E++;\n            }\n        if(R>B)\n            printf(\""RED\\n\"");\n        else if(R<B)\n            printf(\""BLUE\\n\"");\n        else\n            printf(\""EQUAL\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1367360712744460288,f5000469b06f2ecdba47629a1542e95776627b2f437c4fe31da5b403b8ed000c,2021-03-04 14:26:12,C,0.0,1364093988385423362,1364092441396084736,389,"#include<stdio.h>\nint main()\n{\n    int t,n;\n    char r[9999],b[9999];\n    int R=0,B=0,E=0;\n    scanf(\""%d\"",&t);\n    for(int i=0;i < t;i++)\n    {\n        scanf(\""%d\"",&n);\n        get(r);\n        get(b);\n        for(int j=0;j < n;j++)\n            for(int k=0;k < n;k++)\n            {\n                if(r[j]<b[k])\n                    R++;\n                else if(r[j]>b[k])\n                    B++;\n                else\n                    E++;\n            }\n        if(R>B)\n            printf(\""RED\\n\"");\n        else if(R<B)\n            printf(\""BLUE\\n\"");\n        else\n            printf(\""EQUAL\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1367366873891823616,f5000469b06f2ecdba47629a1542e95776627b2f437c4fe31da5b403b8ed000c,2021-03-04 14:50:41,C,0.0,1364093988385423362,1364092441396084736,389,"#include<stdio.h>\nint main()\n{\n    int t,n;\n    int r[9999],b[9999];\n    int R=0,B=0,E=0;\n    scanf(\""%d\"",&t);\n    for(int i=0;i < t;i++)\n    {\n        scanf(\""%d\"",&n);\n        for(int j=0;j < n;j++)\n        {\n            scanf(\""%d\"",&r[j]);\n        }\n        for(int j=0;j < n;j++)\n        {\n            scanf(\""%d\"",&b[j]);\n        }\n        for(int j=0;j < n;j++)\n            for(int k=0;k < n;k++)\n            {\n                if(r[j]<b[k])\n                    R++;\n                else if(r[j]>b[k])\n                    B++;\n                else\n                    E++;\n            }\n        if(R>B)\n            printf(\""BLUE\\n\"");\n        else if(R<B)\n            printf(\""RED\\n\"");\n        else\n            printf(\""EQUAL\\n\"");\n    }\n    return 0;\n}",SEGMENTATION_FAULT,27,324
1367368139606941696,f5000469b06f2ecdba47629a1542e95776627b2f437c4fe31da5b403b8ed000c,2021-03-04 14:55:43,C,0.0,1364093988385423362,1364092441396084736,389,"#include<stdio.h>\nint main()\n{\n    int t,n;\n    int r[9999],b[9999];\n    int R=0,B=0,E=0;\n    scanf(\""%d\"",&t);\n    for(int i=0;i < t;i++)\n    {\n        scanf(\""%d\"",&n);\n        for(int j=0;j < n;j++)\n        {\n            r[j]=getchar();\n        }\n        for(int j=0;j < n;j++)\n        {\n            b[j]=getchar();\n        }\n        for(int j=0;j < n;j++)\n            for(int k=0;k < n;k++)\n            {\n                if(r[j]<b[k])\n                    R++;\n                else if(r[j]>b[k])\n                    B++;\n                else\n                    E++;\n            }\n        if(R>B)\n            printf(\""BLUE\\n\"");\n        else if(R<B)\n            printf(\""RED\\n\"");\n        else\n            printf(\""EQUAL\\n\"");\n    }\n    return 0;\n}",SEGMENTATION_FAULT,16,324
1367414196936204288,90ec480d8950ff079311e49ee800aa51c5fd5e1ed2b4e6cb1634af6936a2c256,2021-03-04 17:58:44,C,8.0,1364093988385423362,1364092441396084736,389,"#include <stdio.h>\n\n\nint main()\n{\n\tint t;\n\tscanf(\""%d\"",&t);\n\tfor(int i=0;i<t;i++)\n\t{\n\t\tint n,red=0,blue=0;\n\t\tscanf(\""%d\"",&n);\n\t\tchar a[n],b[n];\n\t\tscanf(\""%s%s\"",a,b);\n\t\tfor(int j=0;j<n;j++)\n\t\t{\n\t\t\ta[j]-=48;\n\t\t\tb[j]-=48;\n\t\t\tif(a[j]>b[j])\n\t\t\tred++;\n\t\t\telse if(a[j]<b[j])\n\t\t\tblue++;\n\t\t}\n\t\tif(red>blue)\n            printf(\""RED\\n\"");\n        else if(red<blue)\n            printf(\""BLUE\\n\"");\n        else printf(\""EQUAL\\n\"");\n\t}\n\treturn 0;\n}\n",ACCEPTED,7,216
1367422878679916544,f5000469b06f2ecdba47629a1542e95776627b2f437c4fe31da5b403b8ed000c,2021-03-04 18:33:14,C,8.0,1364093988385423362,1364092441396084736,389,"#include<stdio.h>\nint main()\n{\n    int t,n,i,j,k;\n    char r[9999],b[9999];\n    int R,B;\n    scanf(\""%d\"",&t);\n    for(i = 0;i < t;i++)\n    {\n    \tR = 0;\n    \tB = 0;\n        scanf(\""%d\"",&n);\n        scanf(\""%s\"",&r);\n        scanf(\""%s\"",&b);\n        for(j = 0;j < n;j++)\n        {\n            if(r[j] < b[j])\n                R++;\n        \telse if(r[j] > b[j])\n                B++;\n        }\n        if(R > B)\n            printf(\""BLUE\\n\"");\n        else if(R < B)\n            printf(\""RED\\n\"");\n        else\n            printf(\""EQUAL\\n\"");\n    }\n    return 0;\n}",ACCEPTED,18,316
1368100381660635136,887005e8556dc3abf8e85377b53e6dffdc5699a2adcf096efe12b3262d0fd5cf,2021-03-06 15:25:23,C,0.0,1364093988385423362,1364092441396084736,389,"#include <stdio.h>\nint main()\n{\n\tint i,j,num,T,m=0,n=0;\n\tscanf(\""%d\"",&T);\n\tint a[10],b[10];\n\tfor(i=0;i<T;i++);\n\t{\n\t\tscanf(\""%d\"",&num);\n\t\tfor(j=0;j<num;j++)\n\t\tscanf(\""%d\"",&a[j]);\n\t\n\t\tscanf(\""%d\"",&b[j]);\n\t\t\n\t\t{if(a[j]>b[j])\n\t\tm++;\n\t\tif(a[j]<b[j])\n\t\tn++;} \n\tif(m+n==0 || m==n)\n\tprintf(\""EQUAL\"");\n\tif(m>n)\n\tprintf(\""RED\"");\n\tif(m<n)\n\tprintf(\""BLUE\"");\n\t}\n}",WRONG_ANSWER,4,192
1368209856505667584,887005e8556dc3abf8e85377b53e6dffdc5699a2adcf096efe12b3262d0fd5cf,2021-03-06 22:40:24,C,0.0,1364093988385423362,1364092441396084736,389,"#include <stdio.h>\nint main()\n{\n\tint i,j,num,T,m=0,n=0;\n\tscanf(\""%d\"",&T);\n\tchar a[10],b[10];\n\tfor(i=0;i<T;i++)\n\t{ \n\t\tscanf(\""%d\"",&num);\n\t\tscanf(\""%s\"",a);\n\t\tscanf(\""%s\"",b);\n\t\tfor(j=0;j<num;j++)\n\t\t{if(a[j]>b[j])\n\t\tm++;\n\t\tif(a[j]<b[j])\n\t\tn++;\n\t\t}\n\tif(m+n==0 || m==n)\n\tprintf(\""EQUAL\\n\"");\n\telse if(m>n)\n\tprintf(\""RED\\n\"");\n\telse if(m<n)\n\tprintf(\""BLUE\\n\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,24,424
1368210244432650240,887005e8556dc3abf8e85377b53e6dffdc5699a2adcf096efe12b3262d0fd5cf,2021-03-06 22:41:57,C,8.0,1364093988385423362,1364092441396084736,389,"#include <stdio.h>\nint main()\n{\n\tint i,j,num,T;\n\tscanf(\""%d\"",&T);\n\tchar a[10],b[10];\n\tfor(i=0;i<T;i++)\n\t{ \n        int m=0,n=0;\n\t\tscanf(\""%d\"",&num);\n\t\tscanf(\""%s\"",a);\n\t\tscanf(\""%s\"",b);\n\t\tfor(j=0;j<num;j++)\n\t\t{if(a[j]>b[j])\n\t\tm++;\n\t\tif(a[j]<b[j])\n\t\tn++;\n\t\t}\n\tif(m+n==0 || m==n)\n\tprintf(\""EQUAL\\n\"");\n\telse if(m>n)\n\tprintf(\""RED\\n\"");\n\telse if(m<n)\n\tprintf(\""BLUE\\n\"");\n\t}\n\treturn 0;\n}",ACCEPTED,12,312
1509832615853654016,30fc28609fe1519f274ec71b258649ab4ce12cc260625217c6145aedd461a328,2022-04-01 17:58:41,C++,5.0,1509167559855869952,1509167250769543168,401,"#include <iostream>\nmain(){\nputs(\""dlrowolleh\"");\n}\n",ACCEPTED,4,452
1510173116332597248,ca0af9ac77b25720e3de521622545734e29fa1cea9df1747e2ce4dbf0e784fb7,2022-04-02 16:31:43,C++,5.0,1509167559855869952,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int>P;\nvector<P>V;\nint main(){\n\n    ios::sync_with_stdio(0);\n    cin.tie(0);cout.tie(0);\n    cout<<\""dlrowolleh\"";return 0;\n    int t;cin>>t;\n    while(t--){\n        int n,m;cin>>n>>m;\n        int in[n+1]={0};\n        V.clear();\n        for(int i=1,x,y;i<=m;i++){\n            cin>>x>>y;\n            in[x]++;\n            in[y]++;\n            if(x==y)cout<<\""fuck\"";\n            if(x>y)swap(x,y);\n            V.push_back(P(x,y));\n        }\n        sort(V.begin(),V.end());\n        if(unique(V.begin(),V.end())!=V.end())cout<<\""fuck\"";\n        int f=0;\n        if(n==1)f=1;\n        else if(n>3&&m==n*(n-1)/2)f=5;\n        else {\n            int a,b;a=b=0;\n            for(int i=1;i<=n;i++)\n            if(in[i]==1)a++;\n            else if(in[i]==2)b++;\n            if(a==2&&a+b==n)f=2;\n            else if(b==n)f=3;\n            else f=4;\n        }\n        cout<<char('A'+f-1)<<endl;\n    }\n}\n",ACCEPTED,3,328
1510173145340403712,ca0af9ac77b25720e3de521622545734e29fa1cea9df1747e2ce4dbf0e784fb7,2022-04-02 16:31:50,C++,5.0,1509167559855869952,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int>P;\nvector<P>V;\nint main(){\n\n    ios::sync_with_stdio(0);\n    cin.tie(0);cout.tie(0);\n    cout<<\""dlrowolleh\\n\"";return 0;\n    int t;cin>>t;\n    while(t--){\n        int n,m;cin>>n>>m;\n        int in[n+1]={0};\n        V.clear();\n        for(int i=1,x,y;i<=m;i++){\n            cin>>x>>y;\n            in[x]++;\n            in[y]++;\n            if(x==y)cout<<\""fuck\"";\n            if(x>y)swap(x,y);\n            V.push_back(P(x,y));\n        }\n        sort(V.begin(),V.end());\n        if(unique(V.begin(),V.end())!=V.end())cout<<\""fuck\"";\n        int f=0;\n        if(n==1)f=1;\n        else if(n>3&&m==n*(n-1)/2)f=5;\n        else {\n            int a,b;a=b=0;\n            for(int i=1;i<=n;i++)\n            if(in[i]==1)a++;\n            else if(in[i]==2)b++;\n            if(a==2&&a+b==n)f=2;\n            else if(b==n)f=3;\n            else f=4;\n        }\n        cout<<char('A'+f-1)<<endl;\n    }\n}\n",ACCEPTED,3,456
1510173166323777536,ca0af9ac77b25720e3de521622545734e29fa1cea9df1747e2ce4dbf0e784fb7,2022-04-02 16:31:55,C++,0.0,1509167559855869952,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int>P;\nvector<P>V;\nint main(){\n\n    ios::sync_with_stdio(0);\n    cin.tie(0);cout.tie(0);\n    cout<<\""dlrowolleh \\n\"";return 0;\n    int t;cin>>t;\n    while(t--){\n        int n,m;cin>>n>>m;\n        int in[n+1]={0};\n        V.clear();\n        for(int i=1,x,y;i<=m;i++){\n            cin>>x>>y;\n            in[x]++;\n            in[y]++;\n            if(x==y)cout<<\""fuck\"";\n            if(x>y)swap(x,y);\n            V.push_back(P(x,y));\n        }\n        sort(V.begin(),V.end());\n        if(unique(V.begin(),V.end())!=V.end())cout<<\""fuck\"";\n        int f=0;\n        if(n==1)f=1;\n        else if(n>3&&m==n*(n-1)/2)f=5;\n        else {\n            int a,b;a=b=0;\n            for(int i=1;i<=n;i++)\n            if(in[i]==1)a++;\n            else if(in[i]==2)b++;\n            if(a==2&&a+b==n)f=2;\n            else if(b==n)f=3;\n            else f=4;\n        }\n        cout<<char('A'+f-1)<<endl;\n    }\n}\n",PRESENTATION_ERROR,5,604
1510467741198204928,8f9829c440d21ac0f8cd5550d39db6f01c3b06aac20990782576abc6726bb38b,2022-04-03 12:02:27,C++,0.0,1509167559855869952,1509167250769543168,401,"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\tcout<<\""DLROWOLLEH\""<<endl;\n\n}\n",WRONG_ANSWER,5,444
1510565330992848896,43407cff329998389b73c53b8778e3453560bd007aa7fb0a9269e34a83edc8ee,2022-04-03 18:30:14,C,0.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> PII;\n \nconst int N=1e6+5;\n\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n} ",COMPILE_ERROR,0,0
1510565349087076352,43407cff329998389b73c53b8778e3453560bd007aa7fb0a9269e34a83edc8ee,2022-04-03 18:30:18,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> PII;\n \nconst int N=1e6+5;\n\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n} ",ACCEPTED,3,316
1510565351914037248,b223fac391309ff1e664e2d883f66507e004cad9d2a5c29f4d9a94834b04d1be,2022-04-03 18:30:19,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\n\nint main() {\n\t\n\tcout<<\""dlrowolleh\"";\n\t\n\t\n\t\n\treturn 0;\n} ",ACCEPTED,4,316
1510565371039334400,61e5968a852e1e58f8c0e0ff5977fa5896108df51f4655b844a8be03e11a0531,2022-04-03 18:30:24,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n\nusing namespace std;\n\nint main(){\n\t\n\tcout << \""dlrowolleh\""<<endl;\n\treturn 0;\n} ",ACCEPTED,4,320
1510565386236026880,d9b527ee4234e687f1af0ad37ae8cf1bde8bc10772e79c224c078c3152660ec6,2022-04-03 18:30:27,C++,0.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\nconst int maxn=1e5+10;\nconst int inf=0x3f3f3f3f;\n\nint getInt(string s){\n\tint ans=0;\n\tfor(int i=0;i<s.size();i++){\n\t\tans*=10;\n\t\tans+=s[i]-'0';\n\t}\n\treturn ans;\n}\nstring getStr(int x){\n\tstring ans;\n\twhile(x){\n\t\tint tmp=x%10;\n\t\tans=(char)(tmp+'0')+ans;\n\t\tx/=10;\n\t}\n\treturn ans;\n}\n\n\n\n\nint main(){\n\tcout<<dlrowolleh<<endl;\n}\n\n\n\n/*void bfs(int x){\t//int a[][]\n\tqueue<int> q;\n\tq.push(x);\n\tvis[tmp]=1;\n\twhile(!q.empty()){\n\t\tint tmp=q.front();q.pop();\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(vis[tmp]==0&&a[tmp][i]){\n\t\t\tq.push(i);\n\t\t\tvis[i]=1;\n\t\t\t}\n\t\t}\n\t}\n}*/\n\n/*int Find(int x){\t//fa[i]\n\tif(fa[x]!=x) fa[x]=Find(x);\n\treturn x;\n}\n\nvoid Union(int x,int y){\n\tint x=Find(x);\n\tint y=Find(y);\n\tif(x!=y) fa[y]=fa[x];\n}*/\n\n\n/*int bag(){\n\tdp[0]=0;\n\tfor(int i=1;i<=n;i++)\n\t\tfor(int j=V;j>=v[i];j++)\n\t\t\tdp[j]=max(dp[j],dp[j-v[i]]+w[i]);\n}*/\n\n\n/*int l,r;\n\twhile(l<=r){\n\t\tint mid=(l+r)>>1;\n\t\tif(check()) l=mid+1;\n\t\telse r=mid-1;\n\t}*/",COMPILE_ERROR,0,0
1510565387309039616,c5ac2b8ea5388f1d21649ee6b998761be42ffed19cbdf6a199a56dafca66883a,2022-04-03 18:30:27,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\n#include<iostream>\nusing namespace std;\n\nint main() {\n    cout<<\""dlrowolleh\"";\n    \n    \n\n\n\t\n}\n",ACCEPTED,4,480
1510565392967884800,92ad9cb50ba1675af4f9fe793bf2a0ac4912fc42bd6f46cb14ae3f2921f857e6,2022-04-03 18:30:29,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n\tcout<<\""dlrowolleh\""; \n\treturn 0;\n}",ACCEPTED,3,324
1510565405344546816,39514ee1cdb80c54fa0879fd559e4c6c3d45943af71c3b7c60976db2133a78f1,2022-04-03 18:30:32,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\t\n\t\n\tcout<<\""dlrowolleh\""<<endl;\n\t\n\t\n\treturn 0;\n} ",ACCEPTED,3,324
1510565405391413248,c21ac407d7d8be6ce2bd33909b27c34bddc5c45a9c73ac8b927ff144da0ce938,2022-04-03 18:30:32,Java,0.0,1510521134800797696,1509167250769543168,401,"package eclipse_test;\n\npublic class Solution {\n\t\n\tpublic static void main(String[] args) {\n\t\tSystem.out.print(\""dlrowolleh\"");\n\t}\n}\n",COMPILE_ERROR,0,0
1510565405553717248,19fec932fd36b8904eb7e20a25bf940ecf4f289eed831cc6fd26c20c3bd595c3,2022-04-03 18:30:32,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\t\n\t\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,3,320
1510565406489047040,15760e27a0235767f96bb9515eb25759473356065629fda2b3c815fc796f63f9,2022-04-03 18:30:32,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h> \nusing namespace std;\ntypedef long long ll;\nint main(){\n\tcout<<\""dlrowolleh\""; \n\treturn 0;\n}",ACCEPTED,4,436
1510565407068405760,e82da4709fea1cae36b2ec4ad480daa999e75b76466a853aada582870870e05d,2022-04-03 18:30:32,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n} ",ACCEPTED,4,452
1510565407848546304,bf6df3b9cbbdea83dfd8907f8148fa0771d4181713ddc8c59938afb16c8cbd5e,2022-04-03 18:30:32,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main() {\n\tcout << \""dlrowolleh\"";\n}",ACCEPTED,3,448
1510565409857073152,4654765b3e20d51cc448c5a59db71a470433deb7217b6e97b033cb05388219b8,2022-04-03 18:30:33,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"" ;\n\t \n} ",ACCEPTED,5,440
1510565409996029952,ace08c6cb007ddeb34a5221bf5d2b44ea0a81328cd35e07c1e189b789824c34a,2022-04-03 18:30:33,C,0.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\n\nint main() {\n    printf(\""dlrowolleh\\n\"");\n    return 0 ;\n}",COMPILE_ERROR,0,0
1510565411652235264,cc22be3d5eb735ef278f30b53f3be0c8037e5a766ab84a377dda48d9ee4230c2,2022-04-03 18:30:33,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\n\tcout << \""dlrowolleh\"";\n\n    return 0;\n}",ACCEPTED,4,444
1510565412760076288,60e638a83e5b19cbe789ced297f703bb0c8023910446a60f7d071909cbc9130a,2022-04-03 18:30:34,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tios_base::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tcout.tie(nullptr); \n\t\n\t\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n} ",ACCEPTED,3,328
1510565415373856768,d0c513158bf7434c6c2a0d75ae0fa6e7fe89d5cec641992204d0ca44f6dec60d,2022-04-03 18:30:34,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<set>\n#include<algorithm>\n#include<vector>\n#include<map>\n#include<queue>\n#include<stack>\nusing namespace std;\nint main() {\n\tcout << \""dlrowolleh\"";\n}",ACCEPTED,3,328
1510565420365078528,862adcaac668f53fb1fe20d4ccaaaef76dcdb60ca4b2608a1fcd2c9f304f7023,2022-04-03 18:30:35,Python,0.0,1510521134800797696,1509167250769543168,401,print(dlrowolleh),NON_ZERO_EXIT_CODE,15,3164
1510565422105714688,f5f19fbe584bcae32491371ad126ba09612c3024585d256ccfb801cff88a95f4,2022-04-03 18:30:36,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint n = 10;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,3,452
1510565422179938304,fb26fae32e0bfe3bdecb15ebbb0ea9280c997cbf0ccda83125e9aeb1e27a223b,2022-04-03 18:30:36,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\n\nint main()\n{\n    cout<<\""dlrowolleh\""<<endl;\n    return 0;\n}",ACCEPTED,4,320
1510565424155455488,4c41d24781151f0c29fe18018c807ed1e8fb8d91ab2ce3f92bec9402cc3945dd,2022-04-03 18:30:36,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\tcout << \""dlrowolleh\"" << endl;\n\treturn 0;\n}",ACCEPTED,4,456
1510565428525920256,66dd614d7f9cb53175ab47f02a06270c7ffa84d656616f6fc49dcb62ca960fe1,2022-04-03 18:30:37,Java,5.0,1510521134800797696,1509167250769543168,401,"\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tSystem.out.println(\""dlrowolleh\"");\n\t}\n}\n",ACCEPTED,79,13532
1510565432692137984,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2022-04-03 18:30:38,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,3,452
1510565433643515904,ac771c63d43511c542f21899f7c22d11f14db87963d5cac3373f091e3bf38d15,2022-04-03 18:30:38,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n}",ACCEPTED,4,440
1510565434638295040,ace08c6cb007ddeb34a5221bf5d2b44ea0a81328cd35e07c1e189b789824c34a,2022-04-03 18:30:39,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\n\nint main() {\n    printf(\""dlrowolleh\\n\"");\n    return 0 ;\n}",ACCEPTED,5,308
1510565435523293184,8ef689d92f15064e412d191fae5aa336676ca15c5d502e0c50c96776f6327e74,2022-04-03 18:30:39,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n    cout << \""dlrowolleh\"";\n}\n\n",ACCEPTED,5,452
1510565435921752064,4977dd4883b10b1bbfae37535de142dc5146f70bedfcf480fa5d97c68558fe1e,2022-04-03 18:30:39,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\t\n\t\n\t\n\tcout<<\""dlrowolleh\"";\nreturn 0; \n}\n",ACCEPTED,4,320
1510565438059573248,580047f946d72abac7c6665f7ec699f6142b72827b5195a6019bd54279b5ec0d,2022-04-03 18:30:40,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<algorithm>\n#include<queue>\nusing namespace std;\n\nint main(){\n\tcout<<\""dlrowolleh\""; \n} ",ACCEPTED,3,448
1510565441175941120,9c0292ac46829c630c916bb82a0ae40b8dcc2265f2f85d81974dad0a3e54e242,2022-04-03 18:30:40,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<cmath>\n#include<string>\n#include<vector>\n#include<iomanip>\n#include<algorithm>\n#include<queue>\n#include<stack>\n#include<cmath>\nusing namespace std;\n\nint main()\n{\n\tcout << \""dlrowolleh\"" << endl;\n\t/*vector<int> a;\n\tfor (int i = 9; i >= 0; i--)\n\t{\n\t\ta.push_back(i);\n\t}\n\tsort(a.begin(), a.end());\n\tfor (int i = 0; i <a.size(); i++)\n\t{\n\t\tcout << a[i] << \"" \"";\n\t}*/\n\treturn 0;\n}\n\n",ACCEPTED,3,324
1510565442383900672,d15c4f44862d36f832c9dba6eeb6df8bebf72f46f794e024fed3f4e11c03324f,2022-04-03 18:30:41,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<math.h>\n#include<algorithm>\n#include<string>\nusing namespace std;\nint main() {\n\tcout << \""dlrowolleh\"" << endl;\n}",ACCEPTED,4,448
1510565445841281024,fbb2f0c603242b0fd46bf10128c91f572cbd038ef9f8aa5e3aa5bc99ae9cc89e,2022-04-03 18:30:41,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,3,456
1510565445895806976,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2022-04-03 18:30:41,Python,5.0,1510521134800797696,1509167250769543168,401,"import math\ndef isprme(n):\n    if n < 2:\n        return False\n    if n == 2:\n        return True\n    for i in range(2,int(n**0.5)+1):\n        if n%i==0:\n            return False\n    return False\n\n#n = int(input())\nprint(\""dlrowolleh\"")\n",ACCEPTED,15,3004
1510565451692335104,31146e6a24c070dcbed74f1e600f7ad681dc13c8b339daca6ac8812aa9cc3ad3,2022-04-03 18:30:43,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <bits/stdc++.h>\nusing namespace std;\nint main(void)\n{\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n} ",ACCEPTED,3,324
1510565452764803072,400433bf9a2144772c0b40639b41187fe0d8c777aa634158c91c9cfa6575af8a,2022-04-03 18:30:43,Python,5.0,1510521134800797696,1509167250769543168,401,"print(\""dlrowolleh\"")",ACCEPTED,15,3264
1510565453349085184,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2022-04-03 18:30:43,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""; \n\treturn 0;\n} ",ACCEPTED,4,452
1510565455839227904,dfec8198309c1c9fbbf22492bcb1fb30935dbe0905a50669c485c6f9402910e1,2022-04-03 18:30:44,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n}",ACCEPTED,3,452
1510565457652441088,47a1dc28f1b69743c6dbd9ed188e9f9a71d6d3ee08ac01a094b2fa2752c656bc,2022-04-03 18:30:44,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<iomanip>\n#include<algorithm>\n#include<sstream>\n#include<stack>\n#include<cmath>\n#include<queue>\n\nusing namespace std;\n\nint main(){\n\t\n\tcout<<\""dlrowolleh\"";\n\t\n\t\n\treturn 0;\n} ",ACCEPTED,4,320
1510565457815289856,9ef757d34dbd9ae4f25da432daf2c8658f170ee328eab1c55e3a9fe91515643f,2022-04-03 18:30:44,Python,5.0,1510521134800797696,1509167250769543168,401,"print(\""dlrowolleh\"")",ACCEPTED,15,3004
1510565463611273216,d9b527ee4234e687f1af0ad37ae8cf1bde8bc10772e79c224c078c3152660ec6,2022-04-03 18:30:46,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\nconst int maxn=1e5+10;\nconst int inf=0x3f3f3f3f;\n\nint getInt(string s){\n\tint ans=0;\n\tfor(int i=0;i<s.size();i++){\n\t\tans*=10;\n\t\tans+=s[i]-'0';\n\t}\n\treturn ans;\n}\nstring getStr(int x){\n\tstring ans;\n\twhile(x){\n\t\tint tmp=x%10;\n\t\tans=(char)(tmp+'0')+ans;\n\t\tx/=10;\n\t}\n\treturn ans;\n}\n\n\n\n\nint main(){\n\tcout<<\""dlrowolleh\""<<endl;\n}\n\n\n\n/*void bfs(int x){\t//int a[][]\n\tqueue<int> q;\n\tq.push(x);\n\tvis[tmp]=1;\n\twhile(!q.empty()){\n\t\tint tmp=q.front();q.pop();\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(vis[tmp]==0&&a[tmp][i]){\n\t\t\tq.push(i);\n\t\t\tvis[i]=1;\n\t\t\t}\n\t\t}\n\t}\n}*/\n\n/*int Find(int x){\t//fa[i]\n\tif(fa[x]!=x) fa[x]=Find(x);\n\treturn x;\n}\n\nvoid Union(int x,int y){\n\tint x=Find(x);\n\tint y=Find(y);\n\tif(x!=y) fa[y]=fa[x];\n}*/\n\n\n/*int bag(){\n\tdp[0]=0;\n\tfor(int i=1;i<=n;i++)\n\t\tfor(int j=V;j>=v[i];j++)\n\t\t\tdp[j]=max(dp[j],dp[j-v[i]]+w[i]);\n}*/\n\n\n/*int l,r;\n\twhile(l<=r){\n\t\tint mid=(l+r)>>1;\n\t\tif(check()) l=mid+1;\n\t\telse r=mid-1;\n\t}*/",ACCEPTED,4,452
1510565465435795456,1e682dfcec9d703b72c19935cf02bc347a3e6c043bd94fa737550304de4f2214,2022-04-03 18:30:46,C++,0.0,1510521134800797696,1509167250769543168,401,"include<iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n}",COMPILE_ERROR,0,0
1510565466263347200,c21ac407d7d8be6ce2bd33909b27c34bddc5c45a9c73ac8b927ff144da0ce938,2022-04-03 18:30:46,Java,0.0,1510521134800797696,1509167250769543168,401,"\n\npublic class Solution {\n\t\n\tpublic static void main(String[] args) {\n\t\tSystem.out.print(\""dlrowolleh\"");\n\t}\n}\n",COMPILE_ERROR,0,0
1510565466535976960,9f765a7750953636e7071fc8af3e975e42914bbb6da7d8073b78593f8ced5722,2022-04-03 18:30:46,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n    return 0; \n}",ACCEPTED,4,452
1510565467688136704,94980fbf2aa555f8ff0e9f7be24eaea9df7734a2f60318ec9b7ea4d327526394,2022-04-03 18:30:47,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\n#include <bits/stdc++.h>\nusing namespace std;\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\n\nint main(int argc, char** argv) {\n\tcout<<\""dlrowolleh\""; \n\treturn 0;\n}",ACCEPTED,4,316
1510565469220331520,981fcea4af5b388931133b5df074af3636635b2ab46b3668f45141b7faa52f82,2022-04-03 18:30:47,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\n#include <unordered_map>\n#include <vector>\n#include <algorithm>\n#include <cstring>\n#include <string.h>\nusing namespace std;\n\nconst int N = 1e5 + 10;\nint main()\n{\n\tcout << \""dlrowolleh\"";\n}\n\n\n",ACCEPTED,4,460
1510565471665610752,55b954d06b007704714ac13e07b04b88b654ea529009d8fdcacaeac848284a5c,2022-04-03 18:30:48,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std; \nint main() {\n\tcout<<\""dlrowolleh\""<<endl;\n\t\n}",ACCEPTED,3,456
1510565471795634176,8263288289d4c9e633a3aeb5026b1742b5c6243c52d21168e9a682b7700fa3c7,2022-04-03 18:30:48,C,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",COMPILE_ERROR,0,0
1510565474416345088,310eba0734e7f2c6279bb4c268428ca421c1dc245355720fde2caa1c330bb0eb,2022-04-03 18:30:48,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout << \""dlrowolleh\"" << endl;\n}",ACCEPTED,4,476
1510565474844164096,899805456fb5f5d9c8bac3a308efe8f87b008ca2c014705e604e2db766569d67,2022-04-03 18:30:48,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<cstdio>\n#include<string>\n#include<string.h>\n#include<algorithm>\n#include<cstring>\n#include<stack>\n#include<cmath>\n//#include<bits/stdc++.h>\nusing namespace std;\n// typedef\nconst int N = 1e5;\nint sz[N];\nint c1, c2, c3;\n\nint main()\n{    \n\n\n\n\n\n\tcout<< \""dlrowolleh\"";\n\n\n\treturn 0;\n}",ACCEPTED,4,452
1510565480209408000,3a2236b18297a6cd20e727de89fbb262db82578827b4cf92f23ae7acd4976769,2022-04-03 18:30:50,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <bits/stdc++.h>\n#define M 10005 \nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n}",ACCEPTED,4,452
1510565480263933952,379cd087fd67d450b4f64e11856a5205da0d4420df5dffe780fc92e629cc0f4e,2022-04-03 18:30:50,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    puts(\""dlrowolleh\"");\n}",ACCEPTED,4,448
1510565480272322560,17b87dd50849af4a00e93c6313711663aabe3c427020f0ede76e99ac15021433,2022-04-03 18:30:50,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,4,448
1510565482549829632,210d966c7cc6eda883f0ecf83f877b3b3b48f3e324dd4ce6c350bfe3e17e44d5,2022-04-03 18:30:50,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\n\nint main()\n{\n\tcout << \""dlrowolleh\"";\n}",ACCEPTED,4,452
1510565484885327872,f08e232946565b378620b7a7b63439a772f1d5f74d2a3c3fdfb4fda60df44e34,2022-04-03 18:30:51,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n}",ACCEPTED,3,456
1510565488170196992,5a31b8f8c8c717ecfcaad94533b0fcf0af9285cdd7fbc6b0f93b00dd314a869a,2022-04-03 18:30:51,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n   cout<<\""dlrowolleh\"";\n}",ACCEPTED,4,444
1510565489926336512,fe1e154510817bc5eeefef6ea49585d173a2e3d26bd988bf921f0e54fee56597,2022-04-03 18:30:52,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\""<<endl; \n\treturn 0;\n} ",ACCEPTED,4,448
1510565490522472448,151cf01a33e26a038984d2da9ae6bbb8bb7eebb94bb0ab8f02199b9321ba4f2a,2022-04-03 18:30:52,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\ncout<<\""dlrowolleh\""<<endl;\n} ",ACCEPTED,4,456
1510565491324313600,a46ca428268d5a310aee34f2898fcad098dc33ee320ca8605ea27220366ef48a,2022-04-03 18:30:52,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n}",ACCEPTED,4,452
1510565492322557952,866f20f55486c596ad1025ec4d935c62463514157bd1c67a812d6f670d58dcb0,2022-04-03 18:30:52,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n    cout<<\""dlrowolleh\"";\n    \n    return 0;\n}",ACCEPTED,3,456
1510565496495890432,083a43ae8d583a369c019e9f05bf7c300b9ffee9a17faac3a02f14d7c8e7e639,2022-04-03 18:30:53,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n } ",ACCEPTED,4,460
1510565498374209536,584bba5b75bf10fde074cceb16e7984da0aed43b735d24d18af6471b2499e0be,2022-04-03 18:30:54,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\n\nint main()\n{\n\tcout << \""dlrowolleh\"" << endl;\n    return 0;\n}\n",ACCEPTED,4,460
1510565501250957312,c21ac407d7d8be6ce2bd33909b27c34bddc5c45a9c73ac8b927ff144da0ce938,2022-04-03 18:30:55,Java,0.0,1510521134800797696,1509167250769543168,401,"public static void main(String[] args) {\n\t\tSystem.out.print(\""dlrowolleh\"");\n}\n",COMPILE_ERROR,0,0
1510565502678294528,e43a6b275382d4de707ad9fe9a0c910690c66d7d8d6f9b28f68d2e75883214c5,2022-04-03 18:30:55,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    cout<<\""dlrowolleh\"";\n}",ACCEPTED,3,324
1510565504434978816,a4151103851a45a7e7bc783c6ec1e18d3d11fd955befc8047a1f90119d5f45e9,2022-04-03 18:30:55,C,0.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\n\nint main()\n{\n\tcout << \""dlrowolleh\"" << endl;\n}",COMPILE_ERROR,0,0
1510565508448927744,1b04369cfe5b7290159c9f2b857e3805ccd898be9b142566d818efaf2f9e7485,2022-04-03 18:30:56,C,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\n\nint main(){\n\tprintf(\""dlrowolleh\"");\n\treturn 0;\n}",ACCEPTED,3,324
1510565509559873536,ecf2fd58bcc17797e309b456075638cec843b7f8a94819430ec127b480f7f95d,2022-04-03 18:30:57,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,5,308
1510565511170486272,de49e32d4f757a26add59bc9c0e0b2e7a05043749816555e56bff13ce94f5a63,2022-04-03 18:30:57,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,3,324
1510565515486969856,d4fb07f1350c5c7f3981fdb1d5830980b6ee65588005cbc6f2bcb2c7c3e800ad,2022-04-03 18:30:58,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\n#include<iostream>\nusing namespace std;\nint main(){\ncout<<\""dlrowolleh\""<<endl;\n\n\treturn 0;\n}\n",ACCEPTED,4,444
1510565516593721344,193f2f52accf72aed38752af6d4c9ab677e5e5ae15fe0f7b7137d3a6c729d7a3,2022-04-03 18:30:58,C++,0.0,1510521134800797696,1509167250769543168,401,#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    string a; cin>>a;\n    for(int i=a.size()-1;i>=0;i--)\n        cout<<a[i];\n},WRONG_ANSWER,4,452
1510565518083973120,3efbb1daf161f4cf2f11002e07ef33c1835ac0e2a28a2966bcb8ec41a3a18bd5,2022-04-03 18:30:59,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main() {\n    cout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n}",ACCEPTED,3,320
1510565518566318080,be901ae6667a27a7e41ec4d8b4c987c749e49a12c0f3c134f32c83b44149183e,2022-04-03 18:30:59,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\n\n\nint main ()\n{\ncout<<\""dlrowolleh\"";\n}",ACCEPTED,4,320
1510565521082171392,ae96b9dd2968e514037d9053a5bd7c0aa03247d5e37a8c7948bfbb881445a4bb,2022-04-03 18:30:59,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    cout << \""dlrowolleh\"";\n}",ACCEPTED,4,308
1510565521141620736,a4151103851a45a7e7bc783c6ec1e18d3d11fd955befc8047a1f90119d5f45e9,2022-04-03 18:30:59,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\n\nint main()\n{\n\tcout << \""dlrowolleh\"" << endl;\n}",ACCEPTED,3,320
1510565523674251264,cddad6e4ddf1d92f4f59aed92bf60358f8031d1be57b7963de8502ee37877540,2022-04-03 18:31:00,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<vector>\n#include<sstream>\n#include<iomanip>\n#include<algorithm>\nusing namespace std;\nint main() {\n\tcout <<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,4,440
1510565525242920960,eaede10d19efab27b2020190fcc6c16d540166b88438b63bfc0149d59fae3847,2022-04-03 18:31:00,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\n#include <map>\n#include <vector>\n#include <iomanip>\n#include <math.h>\nusing namespace std;\nint main()\n{\n    cout << \""dlrowolleh\"";\n}\n",ACCEPTED,3,320
1510565526119530496,761aaf5fea1dcd515648f118b12987dafad70b7eb50d22e170e829a6c2e1b1b1,2022-04-03 18:31:01,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,4,324
1510565531853144064,e45115beb1642065387bd4c6ec972493b278c9543ae263f045232b32528e273f,2022-04-03 18:31:02,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,4,604
1510565535251259392,1e682dfcec9d703b72c19935cf02bc347a3e6c043bd94fa737550304de4f2214,2022-04-03 18:31:03,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n}",ACCEPTED,4,476
1510565535645523968,9980b561e03fb9b154d28eddf2cab08f88e746587d4a71ddf37b0c4893c729fb,2022-04-03 18:31:03,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n\t\n}",ACCEPTED,3,456
1510565536424935424,193fbdd8a0b0a10e661ba7d63e1339c173fb70c9757db535cac5885c0117f4ac,2022-04-03 18:31:03,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n} ",ACCEPTED,3,452
1510565536667660288,978e085d24e1752e53714a36f6e74434bc050839dd82383ea3765cf162db29e9,2022-04-03 18:31:03,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<algorithm>\n#include<cstring>\n\nusing namespace std;\n\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n}",ACCEPTED,3,452
1510565536735313920,7c31176201084f35ca3a74aefdf00ec73ac16bbdd53f68e00bd80d71a12c60f5,2022-04-03 18:31:03,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,3,456
1510565536991895552,1a28a58367da9fd50ad3061a9cfb14c1c14608907febb8d15680988474ea83c5,2022-04-03 18:31:03,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,3,448
1510565538261495808,1f23353996f2b06ea03e536a9b064c0bf1685dc174b482a280cda71279ee3bd4,2022-04-03 18:31:03,C++,0.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\n\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\nusing namespace std;\nint main(int argc, char** argv)\n {\n \tcout<<\""dlrowolleh\""\n\treturn 0;\n}",COMPILE_ERROR,0,0
1510565539499360256,ffe115b35dddd386f46bef80246c2a0a2802b47f59fe19e7b951a9e92aac0414,2022-04-03 18:31:04,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n\nusing namespace std;\n\nint main(){\n    cout<<\""dlrowolleh\"";\n}",ACCEPTED,4,444
1510565541479071744,d14ee5ef545e508de9294550a12fb0db2aef40e1965f11c365e32e947d260a64,2022-04-03 18:31:04,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nsigned main(){\n\tcout<<\""dlrowolleh\"";\n}",ACCEPTED,6,612
1510565542473850880,8263288289d4c9e633a3aeb5026b1742b5c6243c52d21168e9a682b7700fa3c7,2022-04-03 18:31:04,C,0.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",COMPILE_ERROR,0,0
1510565542812315648,f8cd93d263cde8e44fa95998b7c64102d4210a94c73fce5f27ada95a3fcfd7a7,2022-04-03 18:31:05,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n#include<algorithm>\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n } ",ACCEPTED,4,452
1510565544850747392,e5d9a741f1fb8a720de1b60ed288ff2bc6394804ff75d7d118e469324d08bba5,2022-04-03 18:31:05,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    string str=\""helloworld\"";\n    for(int i=str.length()-1;i>=0;--i)\n    {\n    \tcout<<str[i];\n    }\n    return  0;\n}",ACCEPTED,4,436
1510565547870646272,ab6ad9bbaa0f264a3b862710a38569d6ffe806d131ff81f0c1535514c30e33fc,2022-04-03 18:31:06,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,3,320
1510565548140355584,f681fb56800625452e852b74b1575730462f15f99840b5cb014e484778a825f9,2022-04-03 18:31:06,C,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\n\n\n\nint main()\n{\n\t\n\tprintf(\""dlrowolleh\"");\n\t\n\t\n\t\n\t\n\treturn 0;\n}",ACCEPTED,3,200
1510565548861775872,32c6a08eeb2da90d725c4c1d02b6683ddee40eebe203496a6f00648d7f5a3d61,2022-04-03 18:31:06,C,0.0,1510521134800797696,1509167250769543168,401,"printf(\""dlrowolleh\"");",COMPILE_ERROR,0,0
1510565551989997568,a691f6a06fa04e55abc32f49dec60bfae3321c72fb5c31593e614307af37dab3,2022-04-03 18:31:07,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nint main() {\n\tcout << \""dlrowolleh\"";\n\n}",ACCEPTED,3,460
1510565553944543232,7c221ea8a429499e4234a916f60119ee4cfe7bb9a7e8fc62f55378330ba53dd0,2022-04-03 18:31:07,C++,0.0,1510521134800797696,1509167250769543168,401,"#incldue <iostream>\nusing namespace std;\n    int main ()\n{\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",COMPILE_ERROR,0,0
1510565553999798272,c21ac407d7d8be6ce2bd33909b27c34bddc5c45a9c73ac8b927ff144da0ce938,2022-04-03 18:31:07,Java,0.0,1510521134800797696,1509167250769543168,401,"\n\nclass Solution {\n\t\n\tpublic static void main(String[] args) {\n\t\tSystem.out.print(\""dlrowolleh\"");\n\t}\n}\n",COMPILE_ERROR,0,0
1510565554556366848,43112248ceaa8e186b7fe7deeab5b882d46b6b1226fc1028598c2a4332d9429d,2022-04-03 18:31:07,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n} ",ACCEPTED,3,324
1510565562001801216,c7fef31d6baf561494878b41fcfaf76261dd2da7113dd105ca482ef5f1245367,2022-04-03 18:31:09,C,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout << \""dlrowolleh\"";\n\treturn 0;\n}",COMPILE_ERROR,0,0
1510565564396204032,af098392bea033208458a25e7e17bba52f89355bbbb95e9ada9144115b27c042,2022-04-03 18:31:10,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n}",ACCEPTED,4,316
1510565564577103872,e92f99c617417b9687faadf56ea766275cd6262c10ef827c30dfb7dafb3bf2e2,2022-04-03 18:31:10,Python,5.0,1510521134800797696,1509167250769543168,401,"print(\""dlrowolleh\"")",ACCEPTED,18,3136
1510565564678496256,8b097557cd16cb18ba64fecac18951a5676e9152ae561f88bcfd73e706601621,2022-04-03 18:31:10,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n    cout<<\""dlrowolleh\""<<endl;\n    return 0;\n}",ACCEPTED,4,456
1510565565315301376,ec941ff4848697faa006008c4c2e772fa22603710b20b1c1aa933ed337093d68,2022-04-03 18:31:10,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\nint main()\n{\n\tprintf(\""dlrowolleh\"");\n\treturn 0;\n} ",ACCEPTED,3,200
1510565570033348608,5fcdf37c98df44ecf444022f7b9ee6b9636687d9a60cf095ef664c71c39f0f74,2022-04-03 18:31:11,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n}",ACCEPTED,3,456
1510565570859626496,e5fd69e644b3d48ae051efca395aae6e74522626fccc66b8b2d023d530057b48,2022-04-03 18:31:11,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n   cout<<\""dlrowolleh\"";\n}",ACCEPTED,4,452
1510565571195715584,00d66a836edc434af14bd10d58b07cd497fa7e1a722ee9905e58854602e74e3a,2022-04-03 18:31:11,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\nint main(){\n    cout<<\""dlrowolleh\""<<endl;\n    return 0;\n}",ACCEPTED,3,328
1510565571807539200,1f19cf1e0aa879bf253088d44e320f0c837c902a0444a801080af34b15210f3a,2022-04-03 18:31:11,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<iomanip>\n#include<vector>\nusing namespace std;\nint main()\n{\n\tcout << \""dlrowolleh\"";\n}",ACCEPTED,4,328
1510565573444591616,976fdce5b450866de25e4307801525ddb6460287cad60021e4791139d09a065e,2022-04-03 18:31:12,C,0.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\n\nint main()\n{\n    cout << \""dlrowolleh\"";\n\n\n}",COMPILE_ERROR,0,0
1510565577084518400,8c9db4400a9b9eebbd918957d2110842582f3ba8f1a2fcb95e817216ef3f3e28,2022-04-03 18:31:13,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\t\n\treturn 0;\n}\n ",ACCEPTED,4,320
1510565577734090752,89729530788f24a63d937ecf4697cbdae5025fc795bbb3f6ccde72bd376a1c5a,2022-04-03 18:31:13,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    cout<<\""dlrowolleh\"";\n}",ACCEPTED,4,452
1510565580032569344,bafcc71fda59f72e8529ccec8adec719f07bd00bca361b9ccf62ae4ad3543c38,2022-04-03 18:31:13,C++,0.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\n\nint main() \n{\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",COMPILE_ERROR,0,0
1510565580691619840,63302db0f410a411e2927028b8f2ebd0a8dbba645d9475bbab9ebf2cc5482e43,2022-04-03 18:31:14,Java,0.0,1510521134800797696,1509167250769543168,401,"\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t     \n\t\t\tSystem.out.println(\""dlrrowolleh\"");\n\n\t      \n\t}\n\t    \n\t}\n\n",WRONG_ANSWER,90,16116
1510565581181808640,3f267be2c9b47ff6e45ec7db5311c4fed252cb81ec8bd3227b8bc64985115a84,2022-04-03 18:31:14,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n}",ACCEPTED,3,460
1510565582360952832,32b43f25a486ac40705e8fb032ef3401ee911263e48df617c358ea4c5f61fb5e,2022-04-03 18:31:14,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<string>\nusing namespace std;\nint main() {\n\tcout << \""dlrowolleh\"" << endl;\n}",ACCEPTED,3,328
1510565582821781504,22c4f586314e587d91b667d0d81d0eb8182967394a0e8d45305657fa43ca75fa,2022-04-03 18:31:14,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n    cout<<\""dlrowolleh\"";\n}",ACCEPTED,4,452
1510565583405334528,8cf56b94ffb421ffc1aaf4e8d387a61450eb16e195e99aefd5c919ccd1c20659,2022-04-03 18:31:14,C,5.0,1510521134800797696,1509167250769543168,401,"#include <stdio.h>\n\nint main(){\n    printf(\""dlrowolleh\"");\n    return 0;\n}",ACCEPTED,3,344
1510565583745802240,4192d9fc583eab46e860b8a0384d741b4e46fdf9e8c0bf75f20e09006a907a69,2022-04-03 18:31:14,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\n#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main()\n{\n    cout << \""dlrowolleh\"" << endl;\n}",ACCEPTED,4,588
1510565584449171456,f7b76ac534f3d9eea465b4d1b4972f656855ce06cdbc916e75382e4da8290098,2022-04-03 18:31:14,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n} ",ACCEPTED,3,456
1510565584517554176,6cd5969c541c56d3fa9b5223fcf312fd4d791faa1b6f4fe53bd4103ddcb05375,2022-04-03 18:31:14,C++,5.0,1510521134800797696,1509167250769543168,401,"\n#include <iostream>\nusing namespace std;\nint main()\n{\n    cout << \""dlrowolleh\"";\n}\n",ACCEPTED,4,456
1510565589985652736,ec5966f1aafab541aef69501fed31fdd1418de5e1d591507851ff878a761260f,2022-04-03 18:31:16,Python,5.0,1510521134800797696,1509167250769543168,401,"print(\""dlrowolleh\"")",ACCEPTED,14,2996
1510565590040723456,0602cde71f8aa024f748b269e93c3b16111a5a057be9c8983d4197f943fa4c0b,2022-04-03 18:31:16,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<cstdio>\n#include<cstring>\n#include<iostream>\n\nusing namespace std;\nint main(){\n    cout << \""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,4,452
1510565590937759744,3c729174056634fec655082fe5bb1a566d8c3906d20b97e4072ede47c15e1d2e,2022-04-03 18:31:16,C++,0.0,1510521134800797696,1509167250769543168,401,"using namespace std;\nint main()\n{\n\tcout << \""dlrowolleh\"" << endl;\n}\n",COMPILE_ERROR,0,0
1510565591828226048,1772d0fd5664ef7eb2e3fe036a21018e20e873ab729ff2d3f64cbafbcff5f2ee,2022-04-03 18:31:16,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    printf(\""dlrowolleh\"");\n    return 0;\n}",ACCEPTED,4,444
1510565595165618176,862adcaac668f53fb1fe20d4ccaaaef76dcdb60ca4b2608a1fcd2c9f304f7023,2022-04-03 18:31:17,Python,5.0,1510521134800797696,1509167250769543168,401,print('dlrowolleh'),ACCEPTED,17,3136
1510565597326958592,c443a9451005d0e4258b14fd528fe5bd95e30e20ddf4b73c6ffb06425e6065fa,2022-04-03 18:31:18,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\ncout<<\""dlrowolleh\"";\n} ",ACCEPTED,4,324
1510565599826763776,02d3e37513bd79df8bf329f2fc11a150d2e5cadd69331325bd3fa42def0037fa,2022-04-03 18:31:18,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\n\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\""<<endl;\n} ",ACCEPTED,4,452
1510565602857971712,976fdce5b450866de25e4307801525ddb6460287cad60021e4791139d09a065e,2022-04-03 18:31:19,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\n\nint main()\n{\n    cout << \""dlrowolleh\"";\n\n\n}",ACCEPTED,4,448
1510565602980151296,9ceb39689d3ae063b39b3642e773d70246dd2248d0e532b4d065492791d3eee2,2022-04-03 18:31:19,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tprintf(\""dlrowolleh\"");\n\treturn 0;\n}",ACCEPTED,4,604
1510565603705765888,3c45a09bc6f0a678ce8e704796af86fdf5e6691aef23cd0adaba6b91bfddbdaa,2022-04-03 18:31:19,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\""<<endl;\n}",ACCEPTED,4,452
1510565605623291904,846026c061b22a1b47169b4d2718ec5b38f31891a40baa6922a406d21cec4506,2022-04-03 18:31:19,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n    cout << \""dlrowolleh\"";\n}\n",ACCEPTED,4,452
1510565607996538880,c21ac407d7d8be6ce2bd33909b27c34bddc5c45a9c73ac8b927ff144da0ce938,2022-04-03 18:31:20,Java,0.0,1510521134800797696,1509167250769543168,401,"package eclipse_test;\n\nclass Solution {\n\t\n\tpublic static void main(String[] args) {\n\t\tSystem.out.print(\""dlrowolleh\"");\n\t}\n}\n",COMPILE_ERROR,0,0
1510565608658694144,ba95b10de75fe3042c8787319f5d03552706c43489375b3df371164005c3e23e,2022-04-03 18:31:20,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n\tcout << \""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,4,448
1510565608743124992,bdd0ebf21fd661ceb6d2d5cadfbdb53077a34b3d44a0a35a0bda2713e84bc153,2022-04-03 18:31:20,C,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\nint main(){\n    printf(\""dlrowolleh\\n\"");\n    return 0;\n}",ACCEPTED,3,476
1510565614061502464,8263288289d4c9e633a3aeb5026b1742b5c6243c52d21168e9a682b7700fa3c7,2022-04-03 18:31:22,C,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream.h>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",COMPILE_ERROR,0,0
1510565614543302656,f23f51f43ea986dc56d273a0d63bdcb04d0671e44dd66a490d161d6696faa54a,2022-04-03 18:31:22,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n} ",ACCEPTED,4,320
1510565615730835456,fe017004d97de798874420073668788f0c0cdcc4cd6276ab0c95869845de0474,2022-04-03 18:31:22,C,0.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n} ",COMPILE_ERROR,0,0
1510565618034237440,2758ee74a1edf42c7ff9941898ec4a02ae833cb0dd9d59735de2ed0ced545b35,2022-04-03 18:31:22,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout << \""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,3,328
1510565619233079296,94530a379f5dce80ecad1eea6fc6e5d28aace83896f4fefb4ec7c81449caebc0,2022-04-03 18:31:23,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n}",ACCEPTED,4,448
1510565623600078848,5f5e838e34b03cd6ec17351640a46ede89f02a20615878101875545a1ffc73c1,2022-04-03 18:31:24,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<(\""dlrowolleh\"");\n\treturn 0;\n} ",ACCEPTED,3,448
1510565624924749824,666b350e11b8c5165eb221c97becc4a02e9399ed243bc7a2b556e154395451ea,2022-04-03 18:31:24,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main() {\n\tcout << \""dlrowolleh\"";\n}",ACCEPTED,3,328
1510565626619977728,193f2f52accf72aed38752af6d4c9ab677e5e5ae15fe0f7b7137d3a6c729d7a3,2022-04-03 18:31:24,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    cout<<\""dlrowolleh\"";\n}",ACCEPTED,4,452
1510565630288719872,73ef2aa586b22820178287ce8f85ead5cc0a5b835524684512f4d1bbb8402f9b,2022-04-03 18:31:25,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n    \n    cout << \""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,3,320
1510565631028191232,14be90fe33c79c3f03568174166d00e326d090e97ed446af9595a2ad089038f5,2022-04-03 18:31:26,Java,0.0,1510521134800797696,1509167250769543168,401,"package test;\n\nimport java.util.Scanner;\n\npublic class test1 {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\t\n\t\t\tSystem.out.print(\""dlrowolleh\"");\n\t\t\n\t\t\n\t}\n\n}\n",COMPILE_ERROR,0,0
1510565631224594432,2e3766042635433a3e6a0075809290f6f517a15a1dd19b5e66798ff69b157536,2022-04-03 18:31:26,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n    cout << \""dlrowolleh\"" <<endl;\n    \n    return 0;\n}",ACCEPTED,3,452
1510565633308618752,b5996ef651c3ecd72601b1d7cfc7c4ccd7d6aa58490c347a8be22b90f85588e5,2022-04-03 18:31:26,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n    string s=\""dlrowolleh\"";\n    cout<<s;\n}",ACCEPTED,4,448
1510565635411238912,3a4d40fe07fedb06cd2db8441101162fab17d55fadd78c1878814dd3f28688f1,2022-04-03 18:31:27,C,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\nint main()\n{\n    printf(\""dlrowolleh\"");\n    return 0;   \n}",ACCEPTED,3,192
1510565637197283328,8263288289d4c9e633a3aeb5026b1742b5c6243c52d21168e9a682b7700fa3c7,2022-04-03 18:31:27,C++,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream.h>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",COMPILE_ERROR,0,0
1510565638849839104,1f23353996f2b06ea03e536a9b064c0bf1685dc174b482a280cda71279ee3bd4,2022-04-03 18:31:27,C++,0.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\n\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\nusing namespace std;\nint main(int argc, char** argv)\n {\n \tcout<<\""dlrowolleh\""；\n\treturn 0;\n}",COMPILE_ERROR,0,0
1510565642025656320,f3920c3086b2bc31f70ad0de93430e0c4073527458f7a4431ea5520715570d8d,2022-04-03 18:31:28,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\n\n\nint main()\n{\n    cout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n}",ACCEPTED,4,456
1510565643077152768,f41ec44c982aa8de0ad03db515d30f1e4a221c1a61b6c340b1ce0bc15a65f5fb,2022-04-03 18:31:28,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<stdio.h>\n\nusing namespace std;\n\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\t\n\treturn 0;\n}",ACCEPTED,4,476
1510565643572625408,6bebbeec8dfc10eb4c150b41f1327dcd83ee90b7748e1c8c0ce3bbf45cf43034,2022-04-03 18:31:29,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,4,456
1510565643987861504,331a8a945c98789f0dcd885f1c4f0a79064c1fa7bb730b8756cc453e93341120,2022-04-03 18:31:29,Java,5.0,1510521134800797696,1509167250769543168,401,"class Main {\n\tpublic static void main(String[] args) {\n\t\tSystem.out.print(\""dlrowolleh\"");\n\t}\n}",ACCEPTED,82,12840
1510565644570324992,82920008be29705b63946c5b451badb05d80e52c34c6bbd4126cdf3553e22542,2022-04-03 18:31:29,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n}",ACCEPTED,4,436
1510565650212937728,3994a1d252afae33a66f1934c0ec093062029515f71d9241cacec98c76a5444f,2022-04-03 18:31:30,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\n\nint main(void)\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n} ",ACCEPTED,3,312
1510565651738935296,5caf43e93d4ee4783fbc92cabd57cebc986641d575ca16cdcf16fc88233006cf,2022-04-03 18:31:30,C,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\nint main()\n{\n    printf(\""dlrowolleh\"");\n    return 0;\n}",ACCEPTED,3,452
1510565654373687296,302676f1d93b0b9ea5341903f1122dd5351359f89da3895ad7f12ee42c7dc6cb,2022-04-03 18:31:31,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout << \""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,4,436
1510565655636172800,e792fd8b97de491cb9b8566fb2ba76dd7a54f466fd4804947b0828e3ad76bce9,2022-04-03 18:31:31,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\n\nint main(int argc, char** argv) {\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,3,500
1510565659578818560,73a8773af7860813ad22425ee46338fe2544bd66c29ef119058ecb9f7ef26f81,2022-04-03 18:31:32,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\t\n\t\n\tcout<<\""dlrowolleh\"";\n\t\n\t\n}",ACCEPTED,4,452
1510565661817847808,63302db0f410a411e2927028b8f2ebd0a8dbba645d9475bbab9ebf2cc5482e43,2022-04-03 18:31:33,Java,5.0,1510521134800797696,1509167250769543168,401,"\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t     \n\t\t\tSystem.out.println(\""dlrowolleh\"");\n\n\t      \n\t}\n\t    \n\t}\n\n",ACCEPTED,89,16788
1510565664644808704,d1d29b6d9692a485e752d953d95933d77801ad9268174c414c641d991131da56,2022-04-03 18:31:34,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <bits/stdc++.h>\nusing namespace std;\nint main() \n{\n\tcout<<\""dlrowolleh\"";\n}",ACCEPTED,4,320
1510565665034878976,bafcc71fda59f72e8529ccec8adec719f07bd00bca361b9ccf62ae4ad3543c38,2022-04-03 18:31:34,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main() \n{\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,3,336
1510565666737766400,c11e7e5b61542107056f5247c068c6859906aabf9cf8d7b26ae71d182fd2af20,2022-04-03 18:31:34,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,3,456
1510565667928403968,3c729174056634fec655082fe5bb1a566d8c3906d20b97e4072ede47c15e1d2e,2022-04-03 18:31:34,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout << \""dlrowolleh\"" << endl;\n}\n",ACCEPTED,4,448
1510565668586909696,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2022-04-03 18:31:35,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n}",ACCEPTED,3,452
1510565669367595008,5d81a150a2fdafe76a6608a03f1be9c89da5bf25a1d0f2a96d2e3b53315e36b3,2022-04-03 18:31:35,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tprintf(\""dlrowolleh\"");\n\treturn 0;\n} ",ACCEPTED,4,444
1510565669673234432,8263288289d4c9e633a3aeb5026b1742b5c6243c52d21168e9a682b7700fa3c7,2022-04-03 18:31:35,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,4,452
1510565670902710272,27519715840f60be1dfab8eaeaed73942d47f671be97b4c89b2a550f772759a3,2022-04-03 18:31:35,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n\nusing namespace std;\n\nint main()\n{\n    cout<<\""dlrowolleh\""<<endl;\n    return 0;\n\n}",ACCEPTED,3,320
1510565671694888960,a5de48e25511c29921bd15c561fbc27f5637456e32e930f5170ff4e34222f7ce,2022-04-03 18:31:35,Python,5.0,1510521134800797696,1509167250769543168,401,"print(\""dlrowolleh\"")",ACCEPTED,15,3012
1510565672258199552,cbec2398274e5076ef3852e7815bd6b3b5f31b8482522b3e40ddf08662878a36,2022-04-03 18:31:35,C++,5.0,1510521134800797696,1509167250769543168,401,"\n#include <iostream>\nusing namespace std;\nint main()\n{\n    cout << \""dlrowolleh\"" << endl;\n}\n\n",ACCEPTED,3,328
1510565672404271104,33e01dec803d2d4c8e1db853dd81d607063b60b1886cab1709089a96bde17165,2022-04-03 18:31:35,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n    std::ios::sync_with_stdio(false);\n    cin.tie(NULL);\n    cout.tie(NULL);\n    cout << \""dlrowolleh\"" << endl;\n    return 0;\n}\n\n",ACCEPTED,4,320
1510565674535706624,f79bfe33e7a57654a82d9827c3e8d05f63d3090c815baeb3672fd2c9e9d83900,2022-04-03 18:31:36,Python,5.0,1510521134800797696,1509167250769543168,401,"print(\""dlrowolleh\"")",ACCEPTED,15,3140
1510565677949870080,dbfd3b1efe1bccb14c2410616a663c5735d40d3ec51272492069d4253d73bf94,2022-04-03 18:31:37,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n}",ACCEPTED,4,612
1510565680193093632,eec48ea930b7b6cec317284cc32e41ad075ec286675dd2adf6ced4a979d4274b,2022-04-03 18:31:37,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main() {\n\tcout << \""dlrowolleh\"";\n}",ACCEPTED,3,452
1510565685074718720,c06cf25eded01cd3f790834c74285be6c6110aa641ecfb9a234fb1bb2e50c8f8,2022-04-03 18:31:38,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n } ",ACCEPTED,4,448
1510565686492393472,b589b6f51e84c23627c83dddf8cfd1156a41c64caec27d09848e572734c83453,2022-04-03 18:31:39,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,3,324
1510565687721324544,5cd7665473da133d0558770dcc653feda4562bc868b90acffd3a5aaa4d071d50,2022-04-03 18:31:39,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n}",ACCEPTED,4,456
1510565690842431489,2164c9a528516a18e1c5aaf023bf6c97d1bc9c070a15001b34bf6c61ca6ba4ce,2022-04-03 18:31:40,C,0.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main() {\n\n\tcout << \""dlrowolleh\"" << endl;\n}",COMPILE_ERROR,0,0
1510565697608572928,2a218d1f332cf0ce7d74fac8feecee5eabf01c3ed0029334c70e03dc666d04d6,2022-04-03 18:31:41,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tcout << \""dlrowolleh\"";\n\treturn 0;\n}\n\n",ACCEPTED,4,468
1510565697931534336,e604938e100041c48e8407f1ab07120a92a6047b53e58a209724a0f2035ad470,2022-04-03 18:31:41,Java,0.0,1510521134800797696,1509167250769543168,401,"public class Frist {\n    public static void main(String[] args) {\n        System.out.println(\""dlrowolleh\"");\n    }\n}\n",COMPILE_ERROR,0,0
1510565698370662401,41bef9d3e3b4964699a1f994518273596d2858749f4ea8a79f6ba982979f0739,2022-04-03 18:31:42,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<string>\n//#include<bits/stdc++.h>\n#include<algorithm>\nusing namespace std;\nint main()\n{\n\t\n\tcout << \""dlrowolleh\"";\n\n\n}",ACCEPTED,5,436
1510565698845163520,b639145294c42849a311824e53c162d65053dbd9cd10473314eeb796850240cc,2022-04-03 18:31:42,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n\nusing namespace std;\n\nint main()\n{\n    cout<<\""dlrowolleh\""<<endl;\n}",ACCEPTED,4,476
1510565699210797056,4d6f5b37bc739a4e5ffcbddc42644496fb47d7cb190382acd0c8aa63a693343e,2022-04-03 18:31:42,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n}",ACCEPTED,3,456
1510565701042434048,fa35eb0f7e4e58df18bf26abb4d9a5deb230c8aed1a325ee4b4c41eaa75babbd,2022-04-03 18:31:42,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<string>\nusing namespace std;\n\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,4,320
1510565701843546112,6b30bdc0f4347045639b242da3000b06163c698a174d4362c473087239cea30d,2022-04-03 18:31:42,C++,0.0,1510521134800797696,1509167250769543168,401,"#include<iostrea#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n}",COMPILE_ERROR,0,0
1510565704088043520,d649fdf475cfb6a3e5a684b696134cdeb1185860bc06d34c85c5956ece5ec7d5,2022-04-03 18:31:43,Java,0.0,1510521134800797696,1509167250769543168,401,"public class text {\n    public static void main(String[] args) {\n        System.out.println(\""dlrowolleh\"");\n    }\n}\n",COMPILE_ERROR,0,0
1510565704259465216,77fca0badb457da11b1e5956382de454493723383cc3321d985642cf0a88aea8,2022-04-03 18:31:43,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tcout << \""dlrowolleh\"";\n}",ACCEPTED,4,456
1510565704285904896,726a70a2cc3a5ce1b752c01b391aa6272b7674daa88e84abe4246a1727ed7964,2022-04-03 18:31:43,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,4,452
1510565704910856192,c7fef31d6baf561494878b41fcfaf76261dd2da7113dd105ca482ef5f1245367,2022-04-03 18:31:43,C,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout << \""dlrowolleh\"";\n\treturn 0;\n}",COMPILE_ERROR,0,0
1510565705175097344,16aabfcbadf7d2a303c448781d8f2bc75972b1f011f9f6c8c009cb900f58b2a4,2022-04-03 18:31:43,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\t\n}",ACCEPTED,4,484
1510565707074387968,0401d5a2a06c8236d475127c7ad57844f769d3c88901effe131680c99bbabc38,2022-04-03 18:31:44,C,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\nint main()\n{\n\tprintf(\""dlrowolleh\"");\n\treturn 0;\n}",ACCEPTED,3,192
1510565707724505088,60f9b654cf23e5aa371f9b9f412beea8be8b05f15403231e3d03e60e78491beb,2022-04-03 18:31:44,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n    std::cout << \""dlrowolleh\"";\n}",ACCEPTED,4,512
1510565709994352640,3025ebab7d89601e2736b55306dff033a6d6cfd191b03bd39f02dfb267329901,2022-04-03 18:31:44,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,3,452
1510565715135840256,8d6a84f87cd62516d37cf7dd0f4df8360f70238e9d494606b4df6b944a1b0abc,2022-04-03 18:31:46,Python,5.0,1510521134800797696,1509167250769543168,401,"x=\""helloworld\""\nx=x[::-1]\n\nprint(x)\n",ACCEPTED,15,3000
1510565716188065792,475c4005031a141d86de12945a8ae06e3762fbbd1dac63672d452ad34934f590,2022-04-03 18:31:46,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<stdio.h>\n\nusing namespace std;\n\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n}",ACCEPTED,4,452
1510565717724454912,915f617707e5404a9c1fa603e1c31e3f8daec86ff7e66b3688c6dc5b103c4cf6,2022-04-03 18:31:46,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main() {\n\tcout << \""dlrowolleh\"" ;\n\treturn 0;\n}",ACCEPTED,4,612
1510565718310383616,458acad83f6504cf614d9ab89d33a45a9be0db53672c3cffe007962be74d15c6,2022-04-03 18:31:46,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""; \n\treturn 0;\n}\n ",ACCEPTED,4,452
1510565719804829696,df9d710aabf23d433adc122b4c2a118036a9136fb0ddd33f6d8f2bff79c6c972,2022-04-03 18:31:47,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n} ",ACCEPTED,4,476
1510565722879254528,a9a4f2315aa1ccffa8c645d787eb4872d87355fc2bdff7adc4646782715eec01,2022-04-03 18:31:47,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n} ",ACCEPTED,3,324
1510565724975132672,14be90fe33c79c3f03568174166d00e326d090e97ed446af9595a2ad089038f5,2022-04-03 18:31:48,Java,0.0,1510521134800797696,1509167250769543168,401,"package test1;\n\nimport java.util.Scanner;\n\npublic class test1 {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\t\n\t\t\tSystem.out.print(\""dlrowolleh\"");\n\t\t\n\t\t\n\t}\n\n}\n",COMPILE_ERROR,0,0
1510565726289223680,5978a8921d3ffff20fdbca000df9993340c8b47370411301652732b0f633470e,2022-04-03 18:31:48,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\n\nint main()\n{\n    cout << \""dlrowolleh\"";\n}\n",ACCEPTED,4,320
1510565727182610432,1d522c61e99599e7e39a715f957ad72c5795488ceba535c01b5d951abddd32e2,2022-04-03 18:31:48,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n} ",ACCEPTED,4,452
1510565728247234560,eec48ea930b7b6cec317284cc32e41ad075ec286675dd2adf6ced4a979d4274b,2022-04-03 18:31:49,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main() {\n\tcout << \""dlrowolleh\"";\n}",ACCEPTED,4,452
1510565728456404992,5c3faf19a9ae031decd3cac0aa100ba4dc72f772e979d070e69e8390168b2cc3,2022-04-03 18:31:49,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0; \n } ",ACCEPTED,4,324
1510565729114910720,97ea9a48cdc0383c90869ad787023a657383a0d9beec07d2471fce6407b4306d,2022-04-03 18:31:49,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\n#include<bits/stdc++.h>\nusing namespace std;\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\n\nint main(int argc, char** argv) {\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n}",ACCEPTED,4,324
1510565729819553792,91f595c4c8127783039f054657da6ce2bc103d183b39bc54e23132a69742076f,2022-04-03 18:31:49,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n} ",ACCEPTED,3,332
1510565729946656768,f8e7139e2ae559046989fcf83fc72ea878ea8a3f1ae83caa0585edb8cc4bd3d8,2022-04-03 18:31:49,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,4,452
1510565738527473664,c52800713987593fe6d8687ac7087a841fb2950f9327ac7795f26cf54142e4f1,2022-04-03 18:31:51,Python,5.0,1510521134800797696,1509167250769543168,401,"print(\""dlrowolleh\"")",ACCEPTED,15,3004
1510565739302875136,c9dca7ba6ff8a0095efa08947233deb40503f287bc3b40eea51ee551b813d385,2022-04-03 18:31:51,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tprintf(\""dlrowolleh\"");\n\treturn 0;\n}",ACCEPTED,3,320
1510565744814190592,c8079ca3612f8214380ecebe287f72c48b77df74a57b2205204693809ac4eaee,2022-04-03 18:31:53,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\n\nint main() {\n\tcout<<\""dlrowolleh\"";\n\t\n\treturn 0;\n}",ACCEPTED,3,324
1510565749114626048,6b30bdc0f4347045639b242da3000b06163c698a174d4362c473087239cea30d,2022-04-03 18:31:54,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n}",ACCEPTED,4,448
1510565749156569088,05d56753d07b0cf26828a97499599e0b3cddb40407e1cff21acdcd0b7be439a4,2022-04-03 18:31:54,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,4,448
1510565749986312192,5d73396b92bef4b289cb21dd1d4aec41b0e1bac980b894b769b636f2fc65be23,2022-04-03 18:31:54,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\nint main(){\n\tcout<<\""dlrowolleh\"";\n} ",ACCEPTED,5,448
1510565751396327424,efd9bf9cae1f87da2022740b4d3987bf276ff97dac88b997cae903eeae07bed3,2022-04-03 18:31:54,C,0.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n}",COMPILE_ERROR,0,0
1510565754008104960,6ba7dc292a306bed428c57a6f31105c3a587bce2d1974dad1a1c6999da6465a9,2022-04-03 18:31:55,C,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n}",COMPILE_ERROR,0,0
1510565755468996608,c21ac407d7d8be6ce2bd33909b27c34bddc5c45a9c73ac8b927ff144da0ce938,2022-04-03 18:31:55,Java,5.0,1510521134800797696,1509167250769543168,401,"\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tSystem.out.print(\""dlrowolleh\"");\n\t}\n}\n",ACCEPTED,83,17384
1510565759927541760,7b7b05717b4d5e3256901006f34a1ce5c4df8042156e338b2aa9bdfb72408d04,2022-04-03 18:31:56,Python,5.0,1510521134800797696,1509167250769543168,401,"print(\""dlrowolleh\"")",ACCEPTED,15,3008
1510565765619212288,1f23353996f2b06ea03e536a9b064c0bf1685dc174b482a280cda71279ee3bd4,2022-04-03 18:31:58,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\n\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\nusing namespace std;\nint main(int argc, char** argv)\n {\n \tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,3,332
1510565766386040832,590f832dc7a42d19cf5129477708c74a08bf62551df28692a381e3a28058717b,2022-04-03 18:31:58,C,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\nint main()\n{\n\tprintf(\""dlrowolleh\"");\n\treturn 0;\n} ",ACCEPTED,3,324
1510565766399352832,b4be1f3ef50cda0d6fda865ff3ff19c26d698410a1153e8c2cf7b693166f9ec2,2022-04-03 18:31:58,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout << \""dlrowolleh\"";\n\n}",ACCEPTED,4,384
1510565768538447872,11b5ffc650043cd69cb47dafa2628cb06da7a182ab41e438ad79e5cc388883c8,2022-04-03 18:31:58,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n\t\n\treturn 0;\n}",ACCEPTED,4,444
1510565768918855680,8bcba3e263aa63bddc2e1986d63ac205a11839e5f3b5713287027691458de15b,2022-04-03 18:31:58,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,4,444
1510565774104289280,6ba7dc292a306bed428c57a6f31105c3a587bce2d1974dad1a1c6999da6465a9,2022-04-03 18:32:00,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n}",ACCEPTED,3,328
1510565777354145792,efd9bf9cae1f87da2022740b4d3987bf276ff97dac88b997cae903eeae07bed3,2022-04-03 18:32:00,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n}",ACCEPTED,4,324
1510565778444120064,ed7643621583302cf5b4b593e3e6e0d46f5700c641b03ec18158ba8df871b803,2022-04-03 18:32:01,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <bits/stdc++.h>\nusing namespace std;\nint main(int argc, char *argv[]) {\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,4,320
1510565780945199104,c118514b9494c219ce92d2176fb3e7a2095835e5de0066e8d43db71c7f5bc672,2022-04-03 18:32:01,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\n \n \nint main()\n{\n\n\tcout<<\""dlrowolleh\"";\n}",ACCEPTED,4,316
1510565791828144128,efaeb7ac5b15c8ecb1fdbc64b8c4d5454b03bb3b7e48db23aad09b259cf923d5,2022-04-03 18:32:04,C,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\t\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",COMPILE_ERROR,0,0
1510565793593946112,aafd38def781a4e160b0df248d6bad0efff20a05f20d663af17009f610870659,2022-04-03 18:32:04,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n}",ACCEPTED,3,324
1510565795590434816,286ddfbfae051d01fa1f344391aea9cda60bfa7dcb4dc35bd272266bc74b0f0d,2022-04-03 18:32:05,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream> \n#include<algorithm>\nusing namespace std;\n int main()\n {\n \tcout<<\""dlrowolleh\"";\n \treturn 0;\n }",ACCEPTED,3,456
1510565801336631296,f75c9b57f21c3c26eb230359b44dd811169d4daf5d8e41737c8b6ac49e0daffa,2022-04-03 18:32:06,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n\t\n} ",ACCEPTED,3,324
1510565806420127744,c463654594d358bcbfcfbac444997ef3421970681d97df922c5392c8511b9524,2022-04-03 18:32:07,Python,5.0,1510521134800797696,1509167250769543168,401,print('dlrowolleh'),ACCEPTED,14,3164
1510565809804931072,be4621605895cf04d051e96bf64c8b0a7239bb212ccde86b6a96a1719079e2dc,2022-04-03 18:32:08,C,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",COMPILE_ERROR,0,0
1510565810287276032,7b7b05717b4d5e3256901006f34a1ce5c4df8042156e338b2aa9bdfb72408d04,2022-04-03 18:32:08,Python,5.0,1510521134800797696,1509167250769543168,401,"print(\""dlrowolleh\"")",ACCEPTED,16,3140
1510565811123216384,32c6a08eeb2da90d725c4c1d02b6683ddee40eebe203496a6f00648d7f5a3d61,2022-04-03 18:32:08,C,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\nint main()\n{\n    printf(\""dlrowolleh\"");\n    return 0;\n}\n",ACCEPTED,3,192
1510565815099416576,c7fef31d6baf561494878b41fcfaf76261dd2da7113dd105ca482ef5f1245367,2022-04-03 18:32:09,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout << \""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,3,320
1510565816533868544,4335ca4ad32ca49554876ce4ccf7761ebf86601ac29d4f5054f44616851b820b,2022-04-03 18:32:10,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main (){\n\t\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,3,324
1510565826426957824,efaeb7ac5b15c8ecb1fdbc64b8c4d5454b03bb3b7e48db23aad09b259cf923d5,2022-04-03 18:32:12,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\t\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,3,452
1510565826842738688,350e7971c64162c620b0c61cb3787e8921ea7ef665c44a0629524c3c444b0a1e,2022-04-03 18:32:12,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n    cout << \""dlrowolleh\"";\n}\n",ACCEPTED,3,332
1510565830886047744,fe017004d97de798874420073668788f0c0cdcc4cd6276ab0c95869845de0474,2022-04-03 18:32:13,C,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n} ",COMPILE_ERROR,0,0
1510565835864141824,be4621605895cf04d051e96bf64c8b0a7239bb212ccde86b6a96a1719079e2dc,2022-04-03 18:32:14,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,4,320
1510565838259089408,0c28674a9b92fd25c865b7bc114e8bada1069ccc91ea35d7f1b678d64d06aa6b,2022-04-03 18:32:15,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n    cout << \""dlrowolleh\"";\n    return 0;\n}\n",ACCEPTED,4,504
1510565841337708544,7352087c8e45a27c395136acde8c7e66efd014a438a6e28f84760f15bcba6183,2022-04-03 18:32:16,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n}",ACCEPTED,4,320
1510565843791921152,e604938e100041c48e8407f1ab07120a92a6047b53e58a209724a0f2035ad470,2022-04-03 18:32:16,Java,0.0,1510521134800797696,1509167250769543168,401,"\n    public static void main(String[] args) {\n        System.out.println(\""dlrowolleh\"");\n    }\n\n",COMPILE_ERROR,0,0
1510565844282109952,288896739d85d192be7ba17d74aa69361148b73ac53e12a5e45baab12c9a2d3d,2022-04-03 18:32:16,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    printf(\""dlrowolleh\"");\n    return 0;\n}",ACCEPTED,3,324
1510565845923356672,e619f1c66ca88e7b96a995b1f29c6e9c6ed33a683e63be12284346e082c6329b,2022-04-03 18:32:17,C,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\n\nint main() {\n\tcout << \""dlrowolleh\"" << endl;\n\treturn 0;\n }",COMPILE_ERROR,0,0
1510565857105371136,ffd2532a0e4601a4682efbe1bb83b4eaaa9f3efaaa02e5c3948a9fd0d8920e7b,2022-04-03 18:32:19,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n\tsystem(\""pause\"");\n\treturn 0;\n}",ACCEPTED,5,972
1510565858601463808,338334e9c1ab6c4068c384f13bda3ddf101f22170f2b2728a5da7e1219dac0dd,2022-04-03 18:32:20,Python,0.0,1510521134800797696,1509167250769543168,401,"a=input(\""\"")\nptint(a[;;-1])",NON_ZERO_EXIT_CODE,16,3164
1510565864729886720,2fda7a617301bddd39ea8ae6f55c005c52029ccda99e8affd85340ea33423576,2022-04-03 18:32:21,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main() {\n\tcout << \""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,3,448
1510565874310406144,37cba55c5a0141ecb5d00e56061b324362df39fc39e185bbab3d1b1e75a39fc4,2022-04-03 18:32:24,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,4,736
1510565876554358784,22f31c044ea582ec88c46ec68130be370119834d65277e2ce1dfd820e4560afa,2022-04-03 18:32:24,C,0.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n} ",COMPILE_ERROR,0,0
1510565883621761024,4d4db2128c4593a9850d38b0f20fd02110fac3ea7a7eea5c38dfb4fe520f3961,2022-04-03 18:32:26,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream> \nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n}",ACCEPTED,8,644
1510565890126397440,7c221ea8a429499e4234a916f60119ee4cfe7bb9a7e8fc62f55378330ba53dd0,2022-04-03 18:32:27,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main ()\n{\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,3,324
1510565911920730112,c56db6a4040810872f303c0988232eb56be6a1ba40c484fe367b96a2cb9ec517,2022-04-03 18:32:33,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,4,324
1510565923853524992,403e2e20de5462ae78b84d2b8719304fb2b7cb673089675d25e4cf18db664fbf,2022-04-03 18:32:35,C++,0.0,1510521134800797696,1509167250769543168,401,"include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n}",COMPILE_ERROR,0,0
1510565934413508608,e491615085b05bf6415876c48dd8eff94c7db48caedc01f10d0b47fffd3e5d30,2022-04-03 18:32:38,C++,0.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n    cout>>\""dlrowolleh\"";\n}",COMPILE_ERROR,0,0
1510565945445072896,705f0d22cf86b5a3f1d2effa36be65eac3e06c910f0ff67f238142609a1d020a,2022-04-03 18:32:41,C,0.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n\tcout << \""dlrowolleh\"";\n\treturn 0;\n } ",COMPILE_ERROR,0,0
1510565951018758144,7ccf23ee3266f9b786815ca430f53f9680449726d22de0aaa1be8ab1c3e24c19,2022-04-03 18:32:42,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<string>\n#include<iomanip>\n#include<math.h>\n#include <algorithm>\n#include<vector>\n#include<string.h>\n#include<string>\n#include<set>\nusing namespace std;\n\nint main()\n{\n\tcout << \""dlrowolleh\"" << endl;\n\treturn 0;\n}\n\n",ACCEPTED,3,324
1510565954239983616,ea633c8664d62179d52db1a2e17e624da8839fbe51ea637da6edfc132857e029,2022-04-03 18:32:43,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n  cout<<\""dlrowolleh\"";\n}",ACCEPTED,3,316
1510565959354114048,2b3a817b5d1999d4f4cc5a238570ef39dcc5da255e299ac1f00077db43fe042a,2022-04-03 18:32:44,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n} ",ACCEPTED,3,328
1510565959651909632,7537ed21806802712933ec3b325dd15e6cce4de7173f5f74094845b7e832d85f,2022-04-03 18:32:44,C++,0.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespaced std;\nint main(){\n    cout<<\""dlrowollen\"";\n    return 0;\n}",COMPILE_ERROR,0,0
1510565959696773120,60d12f4996e93e9487fd844e0275ce346ec8b54e72e63ea6679a1a15d4b9a4ff,2022-04-03 18:32:44,C,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\nint main(){\n    printf(\""dlrowolleh\"");\n    return 0;\n}",ACCEPTED,3,496
1510565963018661888,ed7b45f2b475b1d28da2f862cd9c76aedeac4c528bc1fb289b54eaf8a322b0fe,2022-04-03 18:32:45,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<vector>\n#include<bits/stdc++.h>\nusing namespace std;\n\n\n\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\tsystem(\""pause\"");\n\treturn 0;\n}",ACCEPTED,4,704
1510565973513355264,5e3ca9cf8fee6563de5ae33b62a54915df0d9bf6d245e940fd3768821227f5d8,2022-04-03 18:32:47,C,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\nint main()\n{\n\tprintf(\""dlrowolleh\"");\n\treturn 0;\n}",ACCEPTED,3,184
1510565975070171136,3001b16c6b2dcd18ea9b78fb12697cba821ed4a6cb08b85f79a02fe9922218b7,2022-04-03 18:32:48,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n    printf(\""%s\"",\""dlrowolleh\"");\n    return 0;\n}",ACCEPTED,4,452
1510565986449317888,4ce6bf8ba7c3113ca0fedd12711b11bbd962571cdc46de3db3cafa2ff1adb420,2022-04-03 18:32:50,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,4,448
1510565998143037440,e619f1c66ca88e7b96a995b1f29c6e9c6ed33a683e63be12284346e082c6329b,2022-04-03 18:32:53,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\n\nint main() {\n\tcout << \""dlrowolleh\"" << endl;\n\treturn 0;\n }",ACCEPTED,4,448
1510565999879479296,705f0d22cf86b5a3f1d2effa36be65eac3e06c910f0ff67f238142609a1d020a,2022-04-03 18:32:53,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n\tcout << \""dlrowolleh\"";\n\treturn 0;\n } ",ACCEPTED,3,452
1510566001556471808,48f67f30fe92bba9e37d6e9df42c2080836f8acaf07442734e5686e5059682d4,2022-04-03 18:32:54,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n\n}",ACCEPTED,4,464
1510566003871727616,4ab61514405ac1e259dfcb57efb9b7512370490317c338e09948e270ac756ff6,2022-04-03 18:32:54,Python,5.0,1510521134800797696,1509167250769543168,401,"print(\""dlrowolleh\"")",ACCEPTED,15,3000
1510566010108112896,8f9a4827823e7a686ff0ff06ba160262c7402f4c6b32d8c3f9b4f3f753f08597,2022-04-03 18:32:56,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\n#include <bits/stdc++.h>\n\nint main() {\n\ncout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,4,452
1510566010926002176,c9a96c133358e4794de71e308f433255498f823c019576c788e364d2dbbc6358,2022-04-03 18:32:56,C,0.0,1510521134800797696,1509167250769543168,401,#include<iostream>\n#include<algorithm>\n#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tstring s;\n\tcin>>s;\n\tfor(int i=s.size()-1;i>=0;i--) cout<<s[i];\n\treturn 0;\n    \n},COMPILE_ERROR,0,0
1510566013808033792,1c7443d21aff2c6b642ca73b779677af548635086da76e6ad2a15c44bb8f0bb3,2022-04-03 18:32:57,Python,5.0,1510521134800797696,1509167250769543168,401,"a=\""helloworld\""\nb=a[::-1]\nprint(b)",ACCEPTED,15,3140
1510566014793150464,e491615085b05bf6415876c48dd8eff94c7db48caedc01f10d0b47fffd3e5d30,2022-04-03 18:32:57,C++,0.0,1510521134800797696,1509167250769543168,401,"#include <iostream>;\nusing namespace std;\nint main()\n{\n    cout>>\""dlrowolleh\"";\n}",COMPILE_ERROR,0,0
1510566018182148096,2f4b91a2604a05396b7bc3789886dbd905bd5c8de3472c1609b29f87382afd3a,2022-04-03 18:32:58,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n\t\n}",ACCEPTED,5,596
1510566020284768256,7ef1d4d1ad2f3ba3b00163f4da8670f59da75270236ad15028c3550f637874e7,2022-04-03 18:32:58,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\n#include <iomanip>\nusing namespace std;\n\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\n\nint main() {\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n}",ACCEPTED,4,448
1510566022184058880,c1409d4e92e998f6d29940a26f42acfe7f6c386f3fd12f182ec8ff1540dbda99,2022-04-03 18:32:59,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main() {\n    cout<<\""dlrowolleh\"";\n}",ACCEPTED,4,452
1510566031658991616,7537ed21806802712933ec3b325dd15e6cce4de7173f5f74094845b7e832d85f,2022-04-03 18:33:01,C++,0.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowollen\"";\n    return 0;\n}",WRONG_ANSWER,4,452
1510566033450688512,403e2e20de5462ae78b84d2b8719304fb2b7cb673089675d25e4cf18db664fbf,2022-04-03 18:33:01,C++,0.0,1510521134800797696,1509167250769543168,401,"include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n}",COMPILE_ERROR,0,0
1510566035081543680,4407e79e6b7dc6fd68a9c5ca7e6e83de160d09eb27f74cc996b25274f129a4ff,2022-04-03 18:33:02,C++,5.0,1510521134800797696,1509167250769543168,401,"using namespace std;\n#include <iostream>\n\nint main()\n{\n\tstring s = \""helloworld\"";\n\tstring ss = \""\"";\n\tfor (int i = 0;i < s.length();i++)\n\t{\n\t\tss += s[9 - i];\n\t}\n\tcout << ss;\n}\n\n",ACCEPTED,4,448
1510566039628898304,338334e9c1ab6c4068c384f13bda3ddf101f22170f2b2728a5da7e1219dac0dd,2022-04-03 18:33:03,Python,0.0,1510521134800797696,1509167250769543168,401,a=dlrowolleh\n\nptint(a[;;-1]),NON_ZERO_EXIT_CODE,15,3136
1510566049917526016,d3e761d6eb6e6d73a9e9b1026fab7cf11c040b1aa1e7118f754590e5b4d0e69e,2022-04-03 18:33:05,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n}\n ",ACCEPTED,3,324
1510566056103395328,e3dc2e11ed558156bee31aa7628b01657558e9d86d3ea299dc5297c52bed52ff,2022-04-03 18:33:07,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n    \n    \n    cout<<\""dlrowolleh\""<<endl;\n    return 0;\n}",ACCEPTED,4,324
1510566077305602048,22f31c044ea582ec88c46ec68130be370119834d65277e2ce1dfd820e4560afa,2022-04-03 18:33:12,C,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n} ",COMPILE_ERROR,0,0
1510566078714343424,c9a96c133358e4794de71e308f433255498f823c019576c788e364d2dbbc6358,2022-04-03 18:33:12,C,0.0,1510521134800797696,1509167250769543168,401,\n#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tstring s;\n\tcin>>s;\n\tfor(int i=s.size()-1;i>=0;i--) cout<<s[i];\n\treturn 0;\n    \n},COMPILE_ERROR,0,0
1510566081420214272,7537ed21806802712933ec3b325dd15e6cce4de7173f5f74094845b7e832d85f,2022-04-03 18:33:13,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,4,452
1510566087954939904,9f03a6602638826d074aac5ae169561bf26a57ba05655fc71ef5917c4c8443d2,2022-04-03 18:33:14,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std ;\nint main (){\n    printf(\""dlrowolleh\"");\n    return 0; \n}",ACCEPTED,3,320
1510566092669337600,957d7a1e528741c3dae04bbec0e29ffa9da75ca292559d294420b8a8018bdfbb,2022-04-03 18:33:16,Python,5.0,1510521134800797696,1509167250769543168,401,"s = 'helloworld'\nfor i in range(len(s)-1,-1,-1):\n    print(s[i],end='')\n",ACCEPTED,16,3012
1510566100114956288,b7f946f8004311861e3754a4dae74a538c5a8dfa28fe5ea9c01a943b63cd57e2,2022-04-03 18:33:17,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n\n}",ACCEPTED,3,480
1510566103766921216,4ef28a1342b2cffe180466ff0c121252d91b4895df5d8438b91716134462e338,2022-04-03 18:33:18,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tstring a,b;\n\t\n\tfor(int i=0;i<a.length();++i)\n\t{\n\t\tb[i]=a[a.length()-i];\n\t}\n\tcout<<\""dlrowolleh\"";\n} ",ACCEPTED,3,328
1510566107689869312,035ca87c9ba0ba2182a0ad3ffd27606f6d7dfef3ba4eb678c30dd4ea2747b483,2022-04-03 18:33:19,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\""<<endl;\n\t\n\treturn 0;\n} ",ACCEPTED,3,324
1510566117935280128,ce48145128642fd13e832b34b0e9049716259d44cd1ec3ace1a0a9ef6fbc4df6,2022-04-03 18:33:22,C++,5.0,1510521134800797696,1509167250769543168,401,"\n\n#include <iostream>\nusing namespace std;\nint main()\n{\n\tcout << \""dlrowolleh\"";\n}\n\n\n",ACCEPTED,3,324
1510566118594330624,e604938e100041c48e8407f1ab07120a92a6047b53e58a209724a0f2035ad470,2022-04-03 18:33:22,Java,5.0,1510521134800797696,1509167250769543168,401,"public class Main {\n    public static void main(String[] args) {\n        System.out.println(\""dlrowolleh\"");\n    }\n}",ACCEPTED,81,12952
1510566126474883072,c9a96c133358e4794de71e308f433255498f823c019576c788e364d2dbbc6358,2022-04-03 18:33:24,C++,0.0,1510521134800797696,1509167250769543168,401,\n#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tstring s;\n\tcin>>s;\n\tfor(int i=s.size()-1;i>=0;i--) cout<<s[i];\n\treturn 0;\n    \n},WRONG_ANSWER,3,320
1510566147326042112,ac8e78a440b60379f7cfd3aaf7961e921dda350aa4421ca73cd613dac8adaee8,2022-04-03 18:33:29,C++,0.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\nstring s ;\ngetline(cin,s);\nfor(int i =s.length()-1;i>0;i--){\n    cout<<s[i];\n}\nreturn 0;\n}",WRONG_ANSWER,4,456
1510566182439481344,338334e9c1ab6c4068c384f13bda3ddf101f22170f2b2728a5da7e1219dac0dd,2022-04-03 18:33:37,Python,0.0,1510521134800797696,1509167250769543168,401,a=dlrowolleh\n\nptint(a),NON_ZERO_EXIT_CODE,15,3140
1510566190137303040,8145901a5461b10d7813dfe3bf62d43f5a0613654c9e3dc37fa93e72aff2096a,2022-04-03 18:33:39,C,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",COMPILE_ERROR,0,0
1510566191022301184,40898c18315ba6ce0b4463e2fbfd4c92f9a8cd4dbcd7a937f9b44d62a6272f5a,2022-04-03 18:33:39,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n} ",ACCEPTED,4,452
1510566204414713856,d88fd0504eabf752058b8b7f653612fbe36ad431dfc0131d521fb715fc1c32d0,2022-04-03 18:33:42,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tstring s = \""helloworld\"";\n    cout<<\""dlrowolleh\"";\n} ",ACCEPTED,3,328
1510566210127355904,71c4613fbcc1bf2b6bf3caf8ae161cdeace7cb6e006d44ca9d130fc353ef2b1e,2022-04-03 18:33:44,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n} \n",ACCEPTED,3,324
1510566223825223680,fe017004d97de798874420073668788f0c0cdcc4cd6276ab0c95869845de0474,2022-04-03 18:33:47,C,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nint main()\n{\n\tprintf(\""dlrowolleh\"");\n\treturn 0;\n} ",COMPILE_ERROR,0,0
1510566235381260288,8145901a5461b10d7813dfe3bf62d43f5a0613654c9e3dc37fa93e72aff2096a,2022-04-03 18:33:50,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,4,480
1510566240842244096,d649fdf475cfb6a3e5a684b696134cdeb1185860bc06d34c85c5956ece5ec7d5,2022-04-03 18:33:51,C,0.0,1510521134800797696,1509167250769543168,401,"include <stdio.h>\nint main()\n{\n    printf(\""dlrowolleh\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1510566257988558848,c5591ffb3c33289d267cc05c519e3bbae818b22f7ba9363458d8b6e6e7144457,2022-04-03 18:33:55,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n} ",ACCEPTED,3,324
1510566259217489920,2164c9a528516a18e1c5aaf023bf6c97d1bc9c070a15001b34bf6c61ca6ba4ce,2022-04-03 18:33:55,C,0.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main() {\n\tcout << \""dlrowolleh\"" << endl;\n}",COMPILE_ERROR,0,0
1510566262107365376,d649fdf475cfb6a3e5a684b696134cdeb1185860bc06d34c85c5956ece5ec7d5,2022-04-03 18:33:56,C,0.0,1510521134800797696,1509167250769543168,401,"include <stdio.h>\nint main()\n{\n    printf(\""dlrowolleh\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1510566277529821184,e491615085b05bf6415876c48dd8eff94c7db48caedc01f10d0b47fffd3e5d30,2022-04-03 18:34:00,C++,0.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n    cout<<\""dlrowolleh\""<<;\n}",COMPILE_ERROR,0,0
1510566281912868864,20cfb9644ee678d9e9d404cf9e0e61518cea4802fa87190a3250d27edc29f201,2022-04-03 18:34:01,Python,5.0,1510521134800797696,1509167250769543168,401,print('dlrowolleh'),ACCEPTED,17,3164
1510566296302252032,fe017004d97de798874420073668788f0c0cdcc4cd6276ab0c95869845de0474,2022-04-03 18:34:04,C,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\nint main()\n{\n\tprintf(\""dlrowolleh\"");\n\treturn 0;\n} ",ACCEPTED,3,328
1510566308750946304,22f31c044ea582ec88c46ec68130be370119834d65277e2ce1dfd820e4560afa,2022-04-03 18:34:07,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n} ",ACCEPTED,4,476
1510566312945795072,403e2e20de5462ae78b84d2b8719304fb2b7cb673089675d25e4cf18db664fbf,2022-04-03 18:34:08,C++,0.0,1510521134800797696,1509167250769543168,401,"include<iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n}",COMPILE_ERROR,0,0
1510566313767333888,e491615085b05bf6415876c48dd8eff94c7db48caedc01f10d0b47fffd3e5d30,2022-04-03 18:34:08,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n    cout<<\""dlrowolleh\""<<endl;\n}",ACCEPTED,5,448
1510566319770656768,8341b614ca20e27432ce58c7c7e0003c3fd0c7403673a3a18a167aa501f7f042,2022-04-03 18:34:10,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n    return 0;\n}",ACCEPTED,3,324
1510566344646344704,c9a96c133358e4794de71e308f433255498f823c019576c788e364d2dbbc6358,2022-04-03 18:34:16,C++,5.0,1510521134800797696,1509167250769543168,401,"\n#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n    cout<<\""dlrowolleh\"";\n    \n}",ACCEPTED,5,448
1510566346568065024,ff1dd7dadab976417649b9c9d6a71c0a00acd9800e76758083b4bc31805fbe08,2022-04-03 18:34:16,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\n#include<iostream>\nusing namespace std;\nint main(){\n\tcout<<\""dlrowolleh\"";\n} ",ACCEPTED,4,324
1510566349599272960,403e2e20de5462ae78b84d2b8719304fb2b7cb673089675d25e4cf18db664fbf,2022-04-03 18:34:17,C++,0.0,1510521134800797696,1509167250769543168,401,"including<iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n}",COMPILE_ERROR,0,0
1510566363806654464,076358a4337ef5385e5aa64e3ac4d87a7e9fc1595457a2e1503e795a7fbc1dbe,2022-04-03 18:34:20,C++,5.0,1510521134800797696,1509167250769543168,401,"# include<bits/stdc++.h>\n# include<string>\nusing namespace std;\nint main()\n{\n\tstring s=\""dlrowolleh\"";\n\tcout<<s;\n\treturn 0;\n}",ACCEPTED,4,448
1510566371397070848,c9a96c133358e4794de71e308f433255498f823c019576c788e364d2dbbc6358,2022-04-03 18:34:22,C++,5.0,1510521134800797696,1509167250769543168,401,"\n#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n    cout<<\""dlrowolleh\"";\n    \n}",ACCEPTED,3,324
1510566373670383616,d649fdf475cfb6a3e5a684b696134cdeb1185860bc06d34c85c5956ece5ec7d5,2022-04-03 18:34:23,Java,0.0,1510521134800797696,1509167250769543168,401,"public class text {\n    public static void main(String[] args) {\n        System.out.println(\""dlrowolleh\"");\n    }\n}\n",COMPILE_ERROR,0,0
1510566387630301184,13f4cb30bf6b236cfe324fe16cb8fdf6d86f6e81374d4a17f5c730abd8e4f9ab,2022-04-03 18:34:26,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\n#define int long long\n#define rep(i,l,r) for(int i=l;i<=r;i++)\n#define per(i,l,r) for(int i=l;i>=r;i--)\n#define MAXN 1000001\n#define inf 0x3f3f3f3f\nusing namespace std;\nsigned main()\n{\n\tcout<<\""dlrowolleh\\n\"";\n\treturn 0;\n}",ACCEPTED,3,456
1510566391531003904,4439c00d0c46c9ee7b0ee07b9e237e93f3fdced8476ef04eb47e6d1b64a183e5,2022-04-03 18:34:27,Python,0.0,1510521134800797696,1509167250769543168,401,"\n    print(\""dlrowolleh\n\"")\n ",NON_ZERO_EXIT_CODE,15,3132
1510566413395910656,6cd2e3a82c815be71466f862c2fa3328adb97b23e4cb81b3662a671b517b2296,2022-04-03 18:34:32,C++,0.0,1510521134800797696,1509167250769543168,401,#include<iostream>\nusing namespace std;\n#include<string>\nint main()\n{\n\tstring str;\n\tcin >> str;\n\tfor (int i = str.length; i > 0; i--)\n\t{\n\t\tcout << str[i];\n\t}\n},COMPILE_ERROR,0,0
1510566430428979200,e2a39aaa5e70449b6dbcc1d96d5d39eb096dc0d1b3025bf7a83e9ee36a9319fd,2022-04-03 18:34:36,C++,5.0,1510521134800797696,1509167250769543168,401,"\n#include<iostream>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std;\n\n\nint main() {\n\n\tcout << \""dlrowolleh\"" << endl;\n\treturn 0;\n}\n",ACCEPTED,4,476
1510566473947803648,0693eb6983e6666ac374441320832fbf47189dbc0121e866793272690a07911f,2022-04-03 18:34:47,C++,0.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\n#include<string>\nusing namespace std;\n\nint main()\n{\n\tstring str;\n\tscanf_s(\""%d\"", &str);\n\tfor (int i = 0; i < str.length(); i++)\n\t\tprintf(\""%d\"", str[i]);\n\treturn 0;\n}",COMPILE_ERROR,0,0
1510566491421818880,9a5ebbfa43702d1290003b30866775ee6b7d41d47052f2ba19340dc00c48af98,2022-04-03 18:34:51,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tcout<<\""dlrowolleh\"";\n}",ACCEPTED,3,312
1510566509381283840,ac8e78a440b60379f7cfd3aaf7961e921dda350aa4421ca73cd613dac8adaee8,2022-04-03 18:34:55,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\nstring s =\""helloworld\"";\n\nfor(int i =s.length()-1;i>=0;i--){\n    cout<<s[i];\n}\nreturn 0;\n}",ACCEPTED,4,452
1510566514825490432,0c30f57df5b33bf6c9017955f7bd7e7af572fa61f84ad5ecfed3b9ac39f93f38,2022-04-03 18:34:56,C++,0.0,1510521134800797696,1509167250769543168,401,#include <iostream>\n#include <string>\nusing namespace std;\nint main()\n{\n\tint n = 0;\n\tstring s;\n\tcin >> s;\n\tfor (int i = s.length(); i >=0; i--)\n\t{\n\t\tcout << s[i];\n\t}\n},WRONG_ANSWER,4,452
1510566523625140224,403e2e20de5462ae78b84d2b8719304fb2b7cb673089675d25e4cf18db664fbf,2022-04-03 18:34:58,C++,0.0,1510521134800797696,1509167250769543168,401,"include<iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",COMPILE_ERROR,0,0
1510566537072078848,793f2b73583a2f7e5f297c2445303afd02372b15d4d99716cf4782fcc2664b23,2022-04-03 18:35:02,C,0.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\nmain()\n{\n    char a={'h','e','l','l','0','w','o','r','l','d'};\n    int i=0;\n    for(i=strlen(a);i>=0;i--)\n    {\n        printf(\""%c\"",a[i]);\n    }\n    getchar();\n    return 0;\n}",COMPILE_ERROR,0,0
1510566550800035840,4439c00d0c46c9ee7b0ee07b9e237e93f3fdced8476ef04eb47e6d1b64a183e5,2022-04-03 18:35:05,Python,0.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\n\t\tcout<<\""dlrowolleh\"";\n\n}",NON_ZERO_EXIT_CODE,15,3136
1510566573847736320,4439c00d0c46c9ee7b0ee07b9e237e93f3fdced8476ef04eb47e6d1b64a183e5,2022-04-03 18:35:10,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\n\t\tcout<<\""dlrowolleh\"";\n\n}",ACCEPTED,4,444
1510566615971676160,0c30f57df5b33bf6c9017955f7bd7e7af572fa61f84ad5ecfed3b9ac39f93f38,2022-04-03 18:35:20,C++,0.0,1510521134800797696,1509167250769543168,401,#include <iostream>\n#include <string>\nusing namespace std;\nint main()\n{\n\tstring s;\n\tcin >> s;\n\tfor (int i = s.length(); i >=0; i--)\n\t{\n\t\tcout << s[i];\n\t}\n},WRONG_ANSWER,4,452
1510566663405060096,0c30f57df5b33bf6c9017955f7bd7e7af572fa61f84ad5ecfed3b9ac39f93f38,2022-04-03 18:35:32,C++,0.0,1510521134800797696,1509167250769543168,401,#include <iostream>\n#include <string>\nusing namespace std;\nint main()\n{\n\tstring s;\n\tcin >> s;\n\tfor (int i = s.length()-1; i >=0; i--)\n\t{\n\t\tcout << s[i];\n\t}\n},WRONG_ANSWER,4,452
1510566669201043456,e38bd6aed27e40438267f73c2be6a1efd683f1360cab46fc198d70b33578f562,2022-04-03 18:35:33,C++,5.0,1510521134800797696,1509167250769543168,401,"using namespace std;\n#include <iostream>\n\nint main()\n{\n   cout << \""dlrowolleh\""<<endl;\n}",ACCEPTED,4,308
1510566692898861056,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 18:35:39,Java,0.0,1510521134800797696,1509167250769543168,401,"package com.ysu.gzx;\n\npublic class Main{\n    public static void main(String[] args){\n        char[] str = {\""h\"",\""e\"",\""l\"",\""l\"",\""o\"",\""w\"",\""o\"",\""r\"",\""l\"",\""d\""};\n        for(int i = str.length -1;i>=0;i--){\n            System.out.print(str[i]);\n        }\n    }\n}",COMPILE_ERROR,0,0
1510566702923792384,9099a758a4d3372191dcd4f65e730d089e502b6ab95452dc9f3996debd8cd664,2022-04-03 18:35:41,C,0.0,1510521134800797696,1509167250769543168,401,s='helloworld'\nprint(s[::-1]),COMPILE_ERROR,0,0
1510566778970718208,403e2e20de5462ae78b84d2b8719304fb2b7cb673089675d25e4cf18db664fbf,2022-04-03 18:35:59,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,3,460
1510566806187556864,0c30f57df5b33bf6c9017955f7bd7e7af572fa61f84ad5ecfed3b9ac39f93f38,2022-04-03 18:36:06,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\n#include <string>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n}",ACCEPTED,4,320
1510566806765826048,0693eb6983e6666ac374441320832fbf47189dbc0121e866793272690a07911f,2022-04-03 18:36:06,C++,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<string>\nusing namespace std;\n\nint main()\n{\n\tstring str;\n\tgetline(cin, str);\n\tfor (int i = 0; i < str.length(); i++)\n\t\tcout << str[i];\n\treturn 0;\n}",WRONG_ANSWER,4,324
1510566808268660736,9099a758a4d3372191dcd4f65e730d089e502b6ab95452dc9f3996debd8cd664,2022-04-03 18:36:06,C,0.0,1510521134800797696,1509167250769543168,401,s='helloworld'\nprint(s[::-1])；,COMPILE_ERROR,0,0
1510566841620492288,4c117e2d0632a0b9c2cb590479930294013ac54a333f2b950e6a87a2814883cd,2022-04-03 18:36:14,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\n#include<string>\n\nusing namespace std;\nint main()\n{\n    cout << \""dlrowolleh\"";\n}\n",ACCEPTED,4,456
1510566906356654080,7f6bb3e75754d370322fa02606720292013623dab98551c6a797a6a3ae98711e,2022-04-03 18:36:30,C,0.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main(int argc, char *argv[]) {\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",COMPILE_ERROR,0,0
1510566930561982464,8aa0ab968b9873cf92911d528dbb34be354d6901c6291d7fa10e228ab4a69bb1,2022-04-03 18:36:35,Python,5.0,1510521134800797696,1509167250769543168,401,print ('dlrowolleh'),ACCEPTED,15,3008
1510566965299208192,0693eb6983e6666ac374441320832fbf47189dbc0121e866793272690a07911f,2022-04-03 18:36:44,C++,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<string>\nusing namespace std;\n\nint main()\n{\n\tstring str;\n\tgetline(cin, str);\n\tfor (int i = str.length()-1; i >=0; i--)\n\t\tcout << str[i];\n\treturn 0;\n}",WRONG_ANSWER,4,448
1510566967529848832,9099a758a4d3372191dcd4f65e730d089e502b6ab95452dc9f3996debd8cd664,2022-04-03 18:36:44,C,0.0,1510521134800797696,1509167250769543168,401,s='helloworld'；\nprint(s[::-1])；,COMPILE_ERROR,0,0
1510566976878952448,14be90fe33c79c3f03568174166d00e326d090e97ed446af9595a2ad089038f5,2022-04-03 18:36:46,Java,0.0,1510521134800797696,1509167250769543168,401,"\nimport java.util.Scanner;\n\npublic class test1 {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\t\tSystem.out.print(\""dlrowolleh\"");\n\n\t}\n\n}",COMPILE_ERROR,0,0
1510567024698941440,d5ee1943f4ea30c5e58c5ee465fcea2902c2b2df4c5997d3cf5426561cbdc168,2022-04-03 18:36:58,C++,0.0,1510521134800797696,1509167250769543168,401,#include <iostream>\nusing namespace std;\nint main()\n{\n\tchar cha[10];\n\tfor (int i = 0; i < 10; i++) {\n\t\tcin >> cha[i];\n\t}\n\tfor (int i = 9; i >= 0; i--) {\n\t\tcout << cha[i];\n\t}\n\n},WRONG_ANSWER,3,324
1510567071128612864,9099a758a4d3372191dcd4f65e730d089e502b6ab95452dc9f3996debd8cd664,2022-04-03 18:37:09,C,0.0,1510521134800797696,1509167250769543168,401,s='helloworld'\nprint(s[::-1]),COMPILE_ERROR,0,0
1510567200553525248,d649fdf475cfb6a3e5a684b696134cdeb1185860bc06d34c85c5956ece5ec7d5,2022-04-03 18:37:40,C,5.0,1510521134800797696,1509167250769543168,401,"#include <stdio.h>\n\nint main(int argc, char** argv) {\n\tprintf(\""dlrowolleh\"");\n\treturn 0;\n}",ACCEPTED,3,316
1510567219603324928,7f6bb3e75754d370322fa02606720292013623dab98551c6a797a6a3ae98711e,2022-04-03 18:37:44,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main(int argc, char *argv[]) {\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n}",ACCEPTED,4,456
1510567280396296192,d5ee1943f4ea30c5e58c5ee465fcea2902c2b2df4c5997d3cf5426561cbdc168,2022-04-03 18:37:59,C++,0.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n\tchar cha[10]={h,e,l,l,o,w,o,r,l,d};\n\t\n\tfor (int i = 9; i >= 0; i--) {\n\t\tcout << cha[i];\n\t}\n\n}",COMPILE_ERROR,0,0
1510567309646098432,0693eb6983e6666ac374441320832fbf47189dbc0121e866793272690a07911f,2022-04-03 18:38:06,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<string>\nusing namespace std;\n\nint main()\n{\n\tstring str = \""helloworld\"";\n\t\n\tfor (int i = str.length()-1; i >=0; i--)\n\t\tcout << str[i];\n\treturn 0;\n}",ACCEPTED,4,448
1510567366786375680,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 18:38:19,Java,0.0,1510521134800797696,1509167250769543168,401,"package com.ysu.gzx;\n\npublic class Main{\n    public static void main(String[] args){\n        String str=\""dlrowolleh\"";\n        System.out.print(str);\n    }\n}",WRONG_ANSWER,92,13780
1510567389766967296,2164c9a528516a18e1c5aaf023bf6c97d1bc9c070a15001b34bf6c61ca6ba4ce,2022-04-03 18:38:25,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main() {\n\tcout << \""dlrowolleh\"" << endl;\n}",ACCEPTED,3,328
1510567427866750976,0d2373b883cd0436a3ea88716d9a4e27142589db8d13e6d9e598a203fb86e9c0,2022-04-03 18:38:34,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\n#include <cstdio>\nusing namespace std;\n\nint main()\n{\n      cout << \""dlrowolleh\""  ;\n       return 0;\n}",ACCEPTED,4,452
1510567442317402112,a4da943f1c2689602fb099f7db61f3e51b3e8ce88001f25bfac3839529a0b4fe,2022-04-03 18:38:37,Python,5.0,1510521134800797696,1509167250769543168,401,"my_str = \""helloworld\""\nL = len(my_str)\nfor i in range(L):\n    print(my_str[-(i+1)],end='')",ACCEPTED,14,3132
1510567492786188288,8142c1dcf7dbfe7347c80aa7c39c60a94e44b0cf767ebfecca60364f852bf64e,2022-04-03 18:38:49,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n\nusing namespace std;\n\nint main()\n{\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,4,320
1510567524998443008,33f40d999dc83afe7408796a5778b1ddf2166c1b3f4af4a052a06741b97f6095,2022-04-03 18:38:57,Java,5.0,1510521134800797696,1509167250769543168,401,"public class Main {\n    public static void main(String[] args) {\n        System.out.println(\""dlrowolleh\"");\n    }\n}",ACCEPTED,83,17020
1510567542266937344,9ca54398b7639b0bb7fc3bca13959941b91866f6981888ac5b618b3a67bb8d0e,2022-04-03 18:39:01,Python,5.0,1510521134800797696,1509167250769543168,401,print('dlrowolleh'),ACCEPTED,15,3012
1510567556343750656,6cd2e3a82c815be71466f862c2fa3328adb97b23e4cb81b3662a671b517b2296,2022-04-03 18:39:05,C++,0.0,1510521134800797696,1509167250769543168,401,#include<iostream>\nusing namespace std;\n#include<string>\nint main()\n{\n\tchar a[100];\n\tfor (int i = 0; i < 10; i++)\n\t{\n\t\tcin >> a[i];\n\t}\n\tfor (int i = 10; i > 0; i++)\n\t{\n\t\tcout << a[i];\n\t}\n},SEGMENTATION_FAULT,4,448
1510567594279956480,793f2b73583a2f7e5f297c2445303afd02372b15d4d99716cf4782fcc2664b23,2022-04-03 18:39:14,C,0.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n    char a[10]={'h','e','l','l','0','w','o','r','l','d'};\n    int i=0;\n    for(i=strlen(a);i>=0;i--)\n    {\n        printf(\""%c\"",a[i]);\n    }\n    getchar();\n    return 0;\n}",WRONG_ANSWER,3,328
1510567649309769728,d5ee1943f4ea30c5e58c5ee465fcea2902c2b2df4c5997d3cf5426561cbdc168,2022-04-03 18:39:27,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n\t\n\tchar cha[10] = { 'h','e','l','l','o','w','o','r','l','d'};\n\tfor (int i = 9; i >= 0; i--) {\n\t\tcout << cha[i];\n\t}\n\n}",ACCEPTED,3,452
1510567693584297984,6cd2e3a82c815be71466f862c2fa3328adb97b23e4cb81b3662a671b517b2296,2022-04-03 18:39:37,C++,0.0,1510521134800797696,1509167250769543168,401,#include<iostream>\nusing namespace std;\n#include<string>\nint main()\n{\n\tchar a[100];\n\tfor (int i = 0; i < 10; i++)\n\t{\n\t\tcin >> a[i];\n\t}\n\tfor (int i = 9; i >= 0; i++)\n\t{\n\t\tcout << a[i];\n\t}\n},SEGMENTATION_FAULT,4,448
1510567764997062656,793f2b73583a2f7e5f297c2445303afd02372b15d4d99716cf4782fcc2664b23,2022-04-03 18:39:54,C,0.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n    char a[10]={'h','e','l','l','o','w','o','r','l','d'};\n    int i=0;\n    for(i=strlen(a);i>=0;i--)\n    {\n        printf(\""%c\"",a[i]);\n    }\n    getchar();\n    return 0;\n}",WRONG_ANSWER,3,192
1510567799381422080,6cd2e3a82c815be71466f862c2fa3328adb97b23e4cb81b3662a671b517b2296,2022-04-03 18:40:03,C++,0.0,1510521134800797696,1509167250769543168,401,#include<iostream>\nusing namespace std;\n#include<string>\nint main()\n{\n\tchar a[100];\n\tfor (int i = 0; i < 10; i++)\n\t{\n\t\tcin >> a[i];\n\t}\n\tfor (int i = 9; i >= 0; i--)\n\t{\n\t\tcout << a[i];\n\t}\n},WRONG_ANSWER,3,452
1510567865946300416,9099a758a4d3372191dcd4f65e730d089e502b6ab95452dc9f3996debd8cd664,2022-04-03 18:40:18,C,0.0,1510521134800797696,1509167250769543168,401,"s=\""helloworld\"";\nprint(s[::-1]);\n",COMPILE_ERROR,0,0
1510567887218536448,1568a21a49708e8d3be1a871adcc5e9deded60064be9d7fba1c13fdcb80ccb8c,2022-04-03 18:40:23,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main(){\n    cout << \""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,3,456
1510568010981138432,0744a917d2ded2e251d45d2bf30ba9516e18f209dc31159d857defee34ec627a,2022-04-03 18:40:53,C++,0.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\n#include<string.h>\n#include<iostream>\nusing namespace std;\n\nint main(){\n\tchar str1[50],str2[50];\n\tint j=9;\n\tcin>>str1;\n\tfor(int i=0;i<10;i++){\n\t\tstr2[j]=str1[i];\n\t\tj--;\n\t}\n\tcout<<str2;\n\treturn 0;\n} ",WRONG_ANSWER,4,324
1510568196415512576,6e364ead73a2681d3a9c2f2e85605ae7c500a24f3544101bbba9138b30f9a6da,2022-04-03 18:41:37,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <cstdio>\n\nusing namespace std;\n\n\nint main()\n{\n\tprintf(\""dlrowolleh\"");\n\treturn 0;\n}",ACCEPTED,3,320
1510568281143373824,7b5a689957e471fd1530ff1e112fcf7aac3e1dd3e6206a458467ba9587f03fad,2022-04-03 18:41:57,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tstring s=\""helloworld\"";\n\tfor(int i=s.length()-1;i>=0;i--){\n\t\tcout<<s[i];\n\t}\n\treturn 0;\n}",ACCEPTED,4,640
1510568339713908736,6cd2e3a82c815be71466f862c2fa3328adb97b23e4cb81b3662a671b517b2296,2022-04-03 18:42:11,C++,5.0,1510521134800797696,1509167250769543168,401,#include<iostream>\nusing namespace std;\n#include<string>\nint main()\n{\n\tchar a[100];\n\ta[0] = 'h';\n\ta[1] = 'e';\n\ta[2] = 'l';\n\ta[3] = 'l';\n\ta[4] = 'o';\n\ta[5] = 'w';\n\ta[6] = 'o';\n\ta[7] = 'r';\n\ta[8] = 'l';\n\ta[9] = 'd';\n\tfor (int i = 9; i >= 0; i--)\n\t{\n\t\tcout << a[i];\n\t}\n},ACCEPTED,4,428
1510568389734449152,0dc5748f49c623dd0fcb89d2067bc07a0ce99a56a158c541d6ef28fa613aca03,2022-04-03 18:42:23,C,0.0,1510521134800797696,1509167250769543168,401," #include <stdio.h>\nchar a[10]=\""helloworld\"";\nint main\n{\nfor(i=9;i>=0;i--)\na[9-i]=a[i];\nprintf(\""%c\"",a[9-i]);\n\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1510568512123695104,32741e2bb7818937d90006f824e7539491e815c5e1a8bee70c4c4ea555c54991,2022-04-03 18:42:52,C++,5.0,1510521134800797696,1509167250769543168,401,"# include<iostream>\nusing namespace std;\nint main()\n{\n    cout<<\""dlrowolleh\"";\n    return 0;\n}",ACCEPTED,3,328
1510568552452472832,4d7ac4adf8fca7f84f99420f803aa7a7a62246711a70cc7b950aa5f0c0ce4273,2022-04-03 18:43:02,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\tsystem(\""pause\"");\n\treturn 0;\n}",ACCEPTED,4,692
1510568821747761152,b35f483504cfb2b1db6a8876b058b223a91a1b479245279c352cdb46a12998d9,2022-04-03 18:44:06,C,5.0,1510521134800797696,1509167250769543168,401,"#include <stdio.h>\nint main()\n{\n\t\n\tprintf(\""dlrowolleh\"");\n\t\n\t\n\t\n}",ACCEPTED,3,196
1510568832547549184,793f2b73583a2f7e5f297c2445303afd02372b15d4d99716cf4782fcc2664b23,2022-04-03 18:44:09,C,0.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n    char a[10]={'h','e','l','l','o','w','o','r','l','d'};\n    int i=0;\n    for(i=strlen(a);i>=0;i--)\n    {\n        printf(\""%c\"",a[i]);\n    }\n    return 0;\n}",WRONG_ANSWER,3,200
1510568923602968576,793f2b73583a2f7e5f297c2445303afd02372b15d4d99716cf4782fcc2664b23,2022-04-03 18:44:31,C,0.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n    char a[10]={'h','e','l','l','o','w','o','r','l','d'};\n    int i=0;\n    for(i=strlen(a);i>=0;i--)\n    {\n        printf(\""%c\"",a[i]);\n    }\n    printf(\""\\n\"");\n    return 0;\n}",WRONG_ANSWER,3,184
1510569070167453696,0dc5748f49c623dd0fcb89d2067bc07a0ce99a56a158c541d6ef28fa613aca03,2022-04-03 18:45:06,C,0.0,1510521134800797696,1509167250769543168,401," #include <stdio.h>\n\nint main\n{\n\nprintf(\""dlrowolleh\"");\n\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1510569169065492480,14be90fe33c79c3f03568174166d00e326d090e97ed446af9595a2ad089038f5,2022-04-03 18:45:29,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\n#include<iostream>\nusing namespace std;\nint main(){\n    cout<<\""dlrowolleh\"";\n}",ACCEPTED,4,308
1510569195142209536,0dc5748f49c623dd0fcb89d2067bc07a0ce99a56a158c541d6ef28fa613aca03,2022-04-03 18:45:35,C,0.0,1510521134800797696,1509167250769543168,401," #include <stdio.h>\nint main\n{\nprintf(\""dlrowolleh\"");\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1510569421944274944,13c0a63bbdfa7f4ba48ad24d0bc04623f78e027babaeb83e0af274cc5585b223,2022-04-03 18:46:29,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream> \nusing namespace std;\nint main()\n{\n\tprintf(\""dlrowolleh\\n\"");\n\treturn 0;\n}",ACCEPTED,4,324
1510569595010375680,b71f6c3488c89c510972dc732029590dc6cd3ca48a60e77c0e854a22f7522d8c,2022-04-03 18:47:11,C,0.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tprintt(\""dlrowolleh\"");\n\treturn 0;\n}",COMPILE_ERROR,0,0
1510569710810914816,b71f6c3488c89c510972dc732029590dc6cd3ca48a60e77c0e854a22f7522d8c,2022-04-03 18:47:38,C,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tprintf(\""dlrowolleh\"");\n\treturn 0;\n}",ACCEPTED,3,192
1510569807668703232,a99494d258c46727ebd8fc4ab87c8cfdec1a16fa0af40fe4c4780ec42c42e89f,2022-04-03 18:48:01,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<cstring>\nint main()\n{\n    /*string s = 'helloworld';\n    char a[n];\n    n = strlen(s)+1;\n    while(n){\n        p=s;\n        a[n--]=p;\n        p++;\n    }*/\n    \n    printf(\""dlrowolleh\"");\n    return 0;\n}",ACCEPTED,5,436
1510569840087752704,0dc5748f49c623dd0fcb89d2067bc07a0ce99a56a158c541d6ef28fa613aca03,2022-04-03 18:48:09,C,0.0,1510521134800797696,1509167250769543168,401," #include <stdio.h>\nchar a;\nint main\n{\na=dlrowolleh;\nprintf(\""%c\"",a);\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1510569877218652160,a99494d258c46727ebd8fc4ab87c8cfdec1a16fa0af40fe4c4780ec42c42e89f,2022-04-03 18:48:18,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<cstring>\nint main()\n{\n    printf(\""dlrowolleh\"");\n    return 0;\n}",ACCEPTED,4,444
1510569978201260032,eee1f622a788ea512ad25bef8295deda03a687766bea4900c3c1fd276aeec4b6,2022-04-03 18:48:42,C++,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\nint main(){\n    String s = \""helloworld\"";\n    \n    for( int i=0; i<10; i++ ){\n        cout << s[9-i];\n    }\n}",COMPILE_ERROR,0,0
1510570109869580288,29ea2c94bbcad916d7d26c838dc9e167bc78d9ade6200a449ede16dd305b2fa2,2022-04-03 18:49:13,C++,0.0,1510521134800797696,1509167250769543168,401,"#include<string>\n#include<iosteam>\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n}",COMPILE_ERROR,0,0
1510570129809301504,eee1f622a788ea512ad25bef8295deda03a687766bea4900c3c1fd276aeec4b6,2022-04-03 18:49:18,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\nint main(){\n    char s[15] = \""helloworld\"";\n    \n    for( int i=0; i<10; i++ ){\n        cout << s[9-i];\n    }\n}",ACCEPTED,3,452
1510570152756338688,eee1f622a788ea512ad25bef8295deda03a687766bea4900c3c1fd276aeec4b6,2022-04-03 18:49:24,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\nint main(){\n    char s[15] = \""helloworld\"";\n    \n    for( int i=0; i<10; i++ ){\n        cout << s[9-i];\n    }\n}",ACCEPTED,4,444
1510570733422899200,793f2b73583a2f7e5f297c2445303afd02372b15d4d99716cf4782fcc2664b23,2022-04-03 18:51:42,C,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n    char a[10]={'h','e','l','l','o','w','o','r','l','d'};\n    int i=0;\n    for(i=9;i>=0;i--)\n    {\n        printf(\""%c\"",a[i]);\n    }\n    return 0;\n}",ACCEPTED,3,320
1510570759277862912,b3951d4348667f05cb4e1e039684e73736da4813389a378c11d924cf782b073f,2022-04-03 18:51:48,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\nint main()\n{\n    cout <<\""dlrowolleh\""<< endl;\n    return 0;\n}",ACCEPTED,3,324
1510570826034405376,9099a758a4d3372191dcd4f65e730d089e502b6ab95452dc9f3996debd8cd664,2022-04-03 18:52:04,C,0.0,1510521134800797696,1509167250769543168,401,"s=\""helloworld\"";\nprint(s[::-1]);\n",COMPILE_ERROR,0,0
1510570959144108032,fdbc16bce6aecd53767c6601a7fd6e48be7c002be0638b21ef912664907fc109,2022-04-03 18:52:36,Java,0.0,1510521134800797696,1509167250769543168,401,"\npublic calss Main{\n    public  static void main(String[] args){\n        System.out.println(\""dlrowolleh\"");\n    }\n}",COMPILE_ERROR,0,0
1510571123304972288,29ea2c94bbcad916d7d26c838dc9e167bc78d9ade6200a449ede16dd305b2fa2,2022-04-03 18:53:15,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n\n#include<string>\n\n\nusing namespace std;\nint main()\n{\n\tcout<<\""dlrowolleh\""<<endl;\n\treturn 0;\n}",ACCEPTED,4,448
1510571187758297088,9099a758a4d3372191dcd4f65e730d089e502b6ab95452dc9f3996debd8cd664,2022-04-03 18:53:30,C,0.0,1510521134800797696,1509167250769543168,401,"char s;\ns=\""helloworld\"";\nprint(s[::-1]);\n",COMPILE_ERROR,0,0
1510571316129165312,9099a758a4d3372191dcd4f65e730d089e502b6ab95452dc9f3996debd8cd664,2022-04-03 18:54:01,C,0.0,1510521134800797696,1509167250769543168,401,"print(\""dlrowolleh\"")\n",COMPILE_ERROR,0,0
1510571349323431936,154f32c7daeb367c9fff9ad92a2ee2d0457c3ffd4ae75b24f7608bbbb6a79652,2022-04-03 18:54:09,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main() {\n\tcout << \""dlrowolleh\"";\n}",ACCEPTED,4,328
1510571485541298176,3c02c10102efa42c4d5a546fc5531613fa27c9505a7ac4a6d14e08f23f5d70bc,2022-04-03 18:54:41,Python,0.0,1510521134800797696,1509167250769543168,401,s='helloword'\nprint(s[::-1]),WRONG_ANSWER,14,3012
1510571593285853184,fdbc16bce6aecd53767c6601a7fd6e48be7c002be0638b21ef912664907fc109,2022-04-03 18:55:07,Java,0.0,1510521134800797696,1509167250769543168,401,"\npublic calss Main{\n    public  static void main(String[] args){\n        System.out.println(\""dlrowolleh\"");\n    }\n}",COMPILE_ERROR,0,0
1510571643100872704,9099a758a4d3372191dcd4f65e730d089e502b6ab95452dc9f3996debd8cd664,2022-04-03 18:55:19,C,0.0,1510521134800797696,1509167250769543168,401,"print(\"" dlrowolleh\"")\n",COMPILE_ERROR,0,0
1510571702534160384,d649fdf475cfb6a3e5a684b696134cdeb1185860bc06d34c85c5956ece5ec7d5,2022-04-03 18:55:33,Java,0.0,1510521134800797696,1509167250769543168,401,"import java.io.*;\npublic class text {\n    public static void main(String[] args) {\n        System.out.println(\""dlrowolleh\"");\n    }\n}\n",COMPILE_ERROR,0,0
1510571838023491584,9099a758a4d3372191dcd4f65e730d089e502b6ab95452dc9f3996debd8cd664,2022-04-03 18:56:05,Python,5.0,1510521134800797696,1509167250769543168,401,"print(\""dlrowolleh\"")\n",ACCEPTED,18,3060
1510572753400979456,3c02c10102efa42c4d5a546fc5531613fa27c9505a7ac4a6d14e08f23f5d70bc,2022-04-03 18:59:44,Python,5.0,1510521134800797696,1509167250769543168,401,s='helloworld'\nprint(s[::-1]),ACCEPTED,16,3064
1510573096809619456,0dc5748f49c623dd0fcb89d2067bc07a0ce99a56a158c541d6ef28fa613aca03,2022-04-03 19:01:06,C++,0.0,1510521134800797696,1509167250769543168,401," #include <iostream>\nusing namespace std;\n\nint main\n{\n\ncout>>\""dlrowlleh\""\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1510573236742909952,0dc5748f49c623dd0fcb89d2067bc07a0ce99a56a158c541d6ef28fa613aca03,2022-04-03 19:01:39,C++,0.0,1510521134800797696,1509167250769543168,401," #include <iostream>\nusing namespace std;\n\nint main\n{\n\ncout<<\""dlrowlleh\""\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1510573298408112128,0744a917d2ded2e251d45d2bf30ba9516e18f209dc31159d857defee34ec627a,2022-04-03 19:01:54,C++,0.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\n#include<string.h>\n#include<iostream>\nusing namespace std;\n\nint main(){\n\tchar str1[10],str2[10];\n\tint j=9;\n\tcin>>str1;\n\tfor(int i=0;i<10;i++){\n\t\tstr2[j]=str1[i];\n\t\tj--;\n\t}\n\tcout<<str2;\n\treturn 0;\n} ",WRONG_ANSWER,3,324
1510573338224095232,20fa8916a93b874389e22eb1c69eed24e298c0da9b5f29e35ef54f0b0db4747e,2022-04-03 19:02:03,Python,0.0,1510521134800797696,1509167250769543168,401,"a=\""helloworid\""\nb=sti(a)\nc=s[0:]",NON_ZERO_EXIT_CODE,14,3004
1510573339172552704,0dc5748f49c623dd0fcb89d2067bc07a0ce99a56a158c541d6ef28fa613aca03,2022-04-03 19:02:03,C++,0.0,1510521134800797696,1509167250769543168,401," #include <iostream>\nusing namespace std;\n\nint main\n{\n\ncout<<\""dlrowlleh\"";\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1510573452875939840,20fa8916a93b874389e22eb1c69eed24e298c0da9b5f29e35ef54f0b0db4747e,2022-04-03 19:02:30,Python,0.0,1510521134800797696,1509167250769543168,401,"a=\""helloworid\""\nb=sti(a)\nc=s[0:]\nprint(c)",NON_ZERO_EXIT_CODE,15,3012
1510573555288260608,0744a917d2ded2e251d45d2bf30ba9516e18f209dc31159d857defee34ec627a,2022-04-03 19:02:55,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\n#include<string.h>\n#include<iostream>\nusing namespace std;\n\nint main(){\n\tchar str1[10],str2[10];\n\tint j=9;\n\tcin>>str1;\n\tfor(int i=0;i<10;i++){\n\t\tstr2[j]=str1[i];\n\t\tj--;\n\t}\n\tcout<<\""dlrowolleh\"";\n\treturn 0;\n} ",ACCEPTED,3,320
1510573574389850112,a74dd2f1d8fef391a63ee9b2e1978a98943eab830c1e6012b6090eb20a3462b4,2022-04-03 19:02:59,C,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\nint main()\n{\n\tprintf(\""dlrowolleh\"");\n\treturn 0;\n}",ACCEPTED,3,204
1510573599635365888,c91233662627a4142e13b90d0752de1c502422be7e5c43580b2a3497f2801299,2022-04-03 19:03:05,Python,5.0,1510521134800797696,1509167250769543168,401,a='helloworld'\nb=''\nfor i in range(10):\n    b=a[i]+b\nprint(b),ACCEPTED,15,3164
1510573733331726336,9b5af297300065a7b0a8d0e96c282f7e0cbb4123d8a15bbd63a58f6d2023b539,2022-04-03 19:03:37,Python,5.0,1510521134800797696,1509167250769543168,401,a='helloworld'\nb=9\nd=''\nfor i in range(10):\n    c=a[b-i]\n    d=d+c\nprint(d),ACCEPTED,16,3060
1510574504040554496,7bfc09d48e09a4466c4b472a298a117781588588692297b9eae04628d4f00152,2022-04-03 19:06:41,Python,0.0,1510521134800797696,1509167250769543168,401,"n=str(\""helloword\"")\nprint(n[::-1])",WRONG_ANSWER,15,3012
1510574633703268352,0dc5748f49c623dd0fcb89d2067bc07a0ce99a56a158c541d6ef28fa613aca03,2022-04-03 19:07:12,C++,0.0,1510521134800797696,1509167250769543168,401," #include <iostream>\nusing namespace std;\n\nint main\n{\n\ncout<<\""dlrowlleh\"";\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1510574670280519680,7bfc09d48e09a4466c4b472a298a117781588588692297b9eae04628d4f00152,2022-04-03 19:07:21,Python,0.0,1510521134800797696,1509167250769543168,401,"n=str(\""hellowold\"")\nprint(n[::-1])",WRONG_ANSWER,15,3016
1510574718935719936,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 19:07:32,C,0.0,1510521134800797696,1509167250769543168,401,"#include <stdio.h>\n\nvoid main(){\n    int i;\n    char a[10]={\""h\"",\""e\"",\""l\"",\""l\"",\""o\"",\""w\"",\""o\"",\""r\"",\""l\"",\""d\""};\n    for(i=9;i>=0;i--){\n        print(\""%c\"",a[i]);\n    }\n}",COMPILE_ERROR,0,0
1510574775449772032,7bfc09d48e09a4466c4b472a298a117781588588692297b9eae04628d4f00152,2022-04-03 19:07:46,Python,5.0,1510521134800797696,1509167250769543168,401,"n=str(\""helloworld\"")\nprint(n[::-1])",ACCEPTED,15,3268
1510574983319478272,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 19:08:35,C,0.0,1510521134800797696,1509167250769543168,401,"#include <stdio.h>\n\nint main(){\n    int i;\n    char a[10]={\""h\"",\""e\"",\""l\"",\""l\"",\""o\"",\""w\"",\""o\"",\""r\"",\""l\"",\""d\""};\n    for(i=8;i>=0;i--){\n        print(\""%c\"",a[i]);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1510575463235936256,151cf01a33e26a038984d2da9ae6bbb8bb7eebb94bb0ab8f02199b9321ba4f2a,2022-04-03 19:10:30,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\nint main(){\ncout<<\""dlrowolleh\""<<endl;\n} ",ACCEPTED,4,452
1510578243458428928,0dc5748f49c623dd0fcb89d2067bc07a0ce99a56a158c541d6ef28fa613aca03,2022-04-03 19:21:33,C++,0.0,1510521134800797696,1509167250769543168,401," #include <iostream>\nusing namespace std;\n\nint main\n{\n\ncout<<\""dlrowlleh\"";\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1510578665443160064,a0bfafd032ad0f5f4143b82adf5b4636e372b1574d974767663d2785d66264bf,2022-04-03 19:23:13,C++,0.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n    char str=\""helloworld\"";\n    char str1[11];\n    int i,j;\n    for(i=0;str[i]!='\\0';i++)\n    {\n        j=9-i;\n        str1[j]=str[i];\n        str1[10]='\\0';\n    }\n    cout<<str1;\n    return 0;\n}",COMPILE_ERROR,0,0
1510579125935796224,a0bfafd032ad0f5f4143b82adf5b4636e372b1574d974767663d2785d66264bf,2022-04-03 19:25:03,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n    char str[]=\""helloworld\"";\n    char str1[11];\n    int i,j;\n    for(i=0;str[i]!='\\0';i++)\n    {\n        j=9-i;\n        str1[j]=str[i];\n        str1[10]='\\0';\n    }\n    cout<<str1;\n    return 0;\n}",ACCEPTED,4,448
1510580908452626432,0dc5748f49c623dd0fcb89d2067bc07a0ce99a56a158c541d6ef28fa613aca03,2022-04-03 19:32:08,C++,5.0,1510521134800797696,1509167250769543168,401," #include <stdio.h>\n\n\nint main()\n{\n\nprintf(\""dlrowolleh\"");\nreturn 0;\n}\n",ACCEPTED,3,200
1510583689032364032,fdbc16bce6aecd53767c6601a7fd6e48be7c002be0638b21ef912664907fc109,2022-04-03 19:43:11,Java,5.0,1510521134800797696,1509167250769543168,401,"\npublic class Main{\n    public  static void main(String[] args){\n        System.out.println(\""dlrowolleh\"");\n    }\n}\n",ACCEPTED,77,13528
1510586538265014272,338334e9c1ab6c4068c384f13bda3ddf101f22170f2b2728a5da7e1219dac0dd,2022-04-03 19:54:30,Python,0.0,1510521134800797696,1509167250769543168,401,"a=\""dlrowolleh\""\n\nptint(a)",NON_ZERO_EXIT_CODE,15,3132
1510586891949699072,338334e9c1ab6c4068c384f13bda3ddf101f22170f2b2728a5da7e1219dac0dd,2022-04-03 19:55:55,Python,5.0,1510521134800797696,1509167250769543168,401,"a=\""dlrowolleh\""\nprint(a)",ACCEPTED,16,3152
1510587203158667264,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 19:57:09,C,0.0,1510521134800797696,1509167250769543168,401,"#include <stdio.h>\n\nint main(){\n    int i;\n    char* a[10]={\""h\"",\""e\"",\""l\"",\""l\"",\""o\"",\""w\"",\""o\"",\""r\"",\""l\"",\""d\""};\n    for(i=8;i>=0;i--){\n        print(\""%c\"",a[i]);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1510587249220513792,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 19:57:20,C,0.0,1510521134800797696,1509167250769543168,401,"#include <stdio.h>\n\nint main(){\n    int i;\n    char* a[10]={\""h\"",\""e\"",\""l\"",\""l\"",\""o\"",\""w\"",\""o\"",\""r\"",\""l\"",\""d\""};\n    for(i=8;i>=0;i--){\n        print(\""%s\"",a[i]);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1510588617012953088,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 20:02:46,C,0.0,1510521134800797696,1509167250769543168,401,"#include <stdio.h>\n\nint main(){\n    int i;\n    char* a={\""h\"",\""e\"",\""l\"",\""l\"",\""o\"",\""w\"",\""o\"",\""r\"",\""l\"",\""d\""};\n    for(i=9;i>=0;i--){\n        print(\""%c\"",a[i]);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1510588926912753664,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 20:04:00,C,0.0,1510521134800797696,1509167250769543168,401,"#include <stdio.h>\n\nint main(){\n    int i;\n    char* a={\""h\"",\""e\"",\""l\"",\""l\"",\""o\"",\""w\"",\""o\"",\""r\"",\""l\"",\""d\""};\n    for(i=10;i>=0;i--){\n        print(\""%c\"",a[i]);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1510590364972367872,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 20:09:43,Java,0.0,1510521134800797696,1509167250769543168,401,"package com.ysu.gz;\n\npublic class Main{\n    public static void main(String[] args){\n        char[] s={'h','e','l','l','o','w','o','r','l','d'};\n        for(int i=9;i>=0;i--){\n            System.out.print(s[i]);\n        }\n    }\n}",WRONG_ANSWER,117,18152
1510591141930164224,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 20:12:48,Java,0.0,1510521134800797696,1509167250769543168,401,"package com.ysu.gz;\n\npublic class Main{\n    public static void main(String[] args){\n        char[] s={'h','e','l','l','o','w','o','r','l','d'};\n        for(int i=10;i>=0;i--){\n            System.out.print(s[i]);\n        }\n    }\n}",WRONG_ANSWER,101,17504
1510591283503427584,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 20:13:22,Java,0.0,1510521134800797696,1509167250769543168,401,"package com.ysu.gz;\n\npublic class Main{\n    public static void main(String[] args){\n        char[] s={'h','e','l','l','o','w','o','r','l','d'};\n        for(int i=s.length -1;i>=0;i--){\n            System.out.print(s[i]);\n        }\n    }\n}",WRONG_ANSWER,89,13888
1510591406741741568,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 20:13:51,Java,0.0,1510521134800797696,1509167250769543168,401,"package com.ysu.gz;\n\npublic class Main{\n    public static void main(String[] args){\n        char[] s={'h','e','l','l','o','w','o','r','l','d'};\n        for(int i=s.length -1;i>0;i--){\n            System.out.print(s[i]);\n        }\n    }\n}",WRONG_ANSWER,91,13748
1510591961467805696,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 20:16:03,Java,0.0,1510521134800797696,1509167250769543168,401,"package com.ysu.gz;\n\npublic class Main{\n    public static void main(String[] args){\n        char[] s={'h','e','l','l','o','w','o','r','l','d'};\n        for(int i=s.length -2;i>=0;i--){\n            System.out.print(s[i]);\n        }\n    }\n}",WRONG_ANSWER,100,13432
1510592332876345344,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 20:17:32,Java,0.0,1510521134800797696,1509167250769543168,401,"package com.ysu.gz;\n\npublic class Main{\n    public static void main(String[] args){\n        char[] s={'h','e','l','l','o','w','o','r','l','d'};\n        for(int i=s.length -1;i>=0;i--){\n            System.out.print(s[i]);\n        }\n    }\n}",WRONG_ANSWER,97,16976
1510592665317425152,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 20:18:51,Java,0.0,1510521134800797696,1509167250769543168,401,"package com.ysu.gz;\n\npublic class Main{\n    public static void main(String[] args){\n        char[] s={'h','e','l','l','o','w','o','r','l','d'};\n        for(int i=9;i>=0;i--){\n            System.out.print(s[i]);\n        }\n    }\n}",WRONG_ANSWER,97,17352
1510592784918732800,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 20:19:20,Java,0.0,1510521134800797696,1509167250769543168,401,"package com.ysu.gz;\n\npublic class Main{\n    public static void main(String[] args){\n        char[] s={'h','e','l','l','o','w','o','r','l','d'};\n        for(int i=10;i>=0;i--){\n            System.out.print(s[i]);\n        }\n    }\n}",WRONG_ANSWER,96,17396
1510592883442204672,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 20:19:43,Java,0.0,1510521134800797696,1509167250769543168,401,"package com.ysu.gz;\n\npublic class Main{\n    public static void main(String[] args){\n        char[] s={'h','e','l','l','o','w','o','r','l','d'};\n        for(int i=s.length -1;i>=0;i--){\n            System.out.print(s[i]);\n        }\n    }\n}",WRONG_ANSWER,98,16916
1510593737763209216,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 20:23:07,C,0.0,1510521134800797696,1509167250769543168,401,"#include <stdio.h>\n\nint main(){\n    char[] s={'h','e','l','l','o','w','o','r','l','d'};\n    for(int i=9;i>=0;i--){\n        System.out.print(s[i]);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1510593815878656000,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 20:23:25,C,0.0,1510521134800797696,1509167250769543168,401,"#include <stdio.h>\n\nint main(){\n    char s[10]={'h','e','l','l','o','w','o','r','l','d'};\n    for(int i=9;i>=0;i--){\n        System.out.print(s[i]);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1510593868872957952,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 20:23:38,C,0.0,1510521134800797696,1509167250769543168,401,"#include <stdio.h>\n\nint main(){\n    char s[10]={'h','e','l','l','o','w','o','r','l','d'};\n    for(int i=9;i>=0;i--){\n        print(s[i]);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1510593934871060480,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 20:23:54,C,0.0,1510521134800797696,1509167250769543168,401,"#include <stdio.h>\n\nint main(){\n    char s[10]={'h','e','l','l','o','w','o','r','l','d'};\n    for(int i=9;i>=0;i--){\n        printf(s[i]);\n    }\n    return 0;\n}",SEGMENTATION_FAULT,3,360
1510594095528951808,f878e2696dc584216a3ad07d5a41d8bbae7f745d0c7c3b94f4ff9f88714b0829,2022-04-03 20:24:32,C,5.0,1510521134800797696,1509167250769543168,401,"#include <stdio.h>\n\nint main(){\n    char s[10]={'h','e','l','l','o','w','o','r','l','d'};\n    for(int i=9;i>=0;i--){\n        printf(\""%c\"",s[i]);\n    }\n    return 0;\n}",ACCEPTED,3,192
1510594876625797120,210d966c7cc6eda883f0ecf83f877b3b3b48f3e324dd4ce6c350bfe3e17e44d5,2022-04-03 20:27:38,C++,5.0,1510521134800797696,1509167250769543168,401,"#include <iostream>\nusing namespace std;\n\nint main()\n{\n\tcout << \""dlrowolleh\"";\n}",ACCEPTED,3,320
1510599587344543744,dfd2ae28f4ba9072838e69e352304c3fc722c0eac8456f8137280478e9d8a7d1,2022-04-03 20:46:21,C,5.0,1510521134800797696,1509167250769543168,401,"#include<stdio.h>\nint main(void)\n{\n\tchar a[]=\""helloworld\"";\n\tchar b[11];\n\tint i;\n\tfor(i=0;i<10;i++)\n\t{\n\t\tb[i]=a[9-i];\n\t}\n\tb[10]='\\0';\n\tfputs(b,stdout);\n    return 0;\n} ",ACCEPTED,3,192
1510599896041123840,b246ca83c39eeab29672d9b26557c39ac39f8b7f7cf726514ef328dd5350df3c,2022-04-03 20:47:35,C++,5.0,1510521134800797696,1509167250769543168,401,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n   cout<<\""dlrowolleh\"";\n\treturn 0;\n} ",ACCEPTED,4,328
1516014591749660672,771f901284811688e74c405684ab5394277e3f631143e8816e06077d5592c377,2022-04-18 19:23:39,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<stdio.h>\nint main()\n{\n    printf(\""12.2567433\\n\"");\n    return 0;\n}",WRONG_ANSWER,62,432
1516014664428560384,771f901284811688e74c405684ab5394277e3f631143e8816e06077d5592c377,2022-04-18 19:23:56,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<stdio.h>\nint main()\n{\n    printf(\""4.9\\n\"");\n    return 0;\n}",WRONG_ANSWER,60,348
1516014725522251776,771f901284811688e74c405684ab5394277e3f631143e8816e06077d5592c377,2022-04-18 19:24:11,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<stdio.h>\nint main()\n{\n    printf(\""3.5\\n\"");\n    return 0;\n}",WRONG_ANSWER,62,476
1516018348411232256,174cd5a983dcbd37c1ea5f291a9761f26a048301d673db70fbeffaad8eae5917,2022-04-18 19:38:35,C++,0.0,1515989953941843982,1502534371362201600,406,"#include <bits/stdc++.h>\n\nusing namespace std;\nmap<string,int>mp;\nint main() {\n    cout << 0 << endl;\n    return 0;\n}\n",WRONG_ANSWER,83,480
1516018411170603008,174cd5a983dcbd37c1ea5f291a9761f26a048301d673db70fbeffaad8eae5917,2022-04-18 19:38:50,C++,0.0,1515989953941843982,1502534371362201600,406,"#include <bits/stdc++.h>\n\nusing namespace std;\nmap<string,int>mp;\nint main() {\n    cout << 2.1 << endl;\n    return 0;\n}\n",WRONG_ANSWER,97,604
1516018539180580864,174cd5a983dcbd37c1ea5f291a9761f26a048301d673db70fbeffaad8eae5917,2022-04-18 19:39:20,C++,0.0,1515989953941843982,1502534371362201600,406,"#include <bits/stdc++.h>\n\nusing namespace std;\nmap<string,int>mp;\nint main() {\n    cout << 6.5 << endl;\n    return 0;\n}\n",WRONG_ANSWER,81,604
1516018557644087296,174cd5a983dcbd37c1ea5f291a9761f26a048301d673db70fbeffaad8eae5917,2022-04-18 19:39:25,C++,0.0,1515989953941843982,1502534371362201600,406,"#include <bits/stdc++.h>\n\nusing namespace std;\nmap<string,int>mp;\nint main() {\n    cout << 6.4 << endl;\n    return 0;\n}\n",WRONG_ANSWER,85,488
1516044122925031424,355c712704d5f43801fa2694d64b5559a69e7e706626d34b83067fadc9611110,2022-04-18 21:21:00,C++,0.0,1515989953941843982,1502534371362201600,406,"#include <iostream>\n#include <string.h>\n\nusing namespace std;\n\n\nint main()\n{\n    int a;\n    int b,c;\n    cin >> a >>b >> c;\n    if(a==2){\n        printf(\""3.5\"");\n    }\n    if(a==3){\n        printf(\""4.9\"");\n    }\n    if(a==5){\n        printf(\""12.2567433\"");\n    }\n    return 0;\n}\n",MULTIPLE_ERROR,95,512
1516046770378645504,a2072afe7f39d0309ea172de8fbd59403c861cdc0c402881ff3de9c8cdf16c0d,2022-04-18 21:31:31,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstring>\n#include<vector>\n#include<queue>\n#define ll long long\n\nusing namespace std;\n\nconst int inf = 0x3f3f3f3f;\n\nconst int N = 1e5 + 10;\n\nint main()\n{\n\tprintf(\""3.5\"");\n\treturn 0;\n}",WRONG_ANSWER,94,768
1516046870698008576,a2072afe7f39d0309ea172de8fbd59403c861cdc0c402881ff3de9c8cdf16c0d,2022-04-18 21:31:55,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstring>\n#include<vector>\n#include<queue>\n#define ll long long\n\nusing namespace std;\n\nconst int inf = 0x3f3f3f3f;\n\nconst int N = 1e5 + 10;\n\nint main()\n{\n\tprintf(\""4.9\"");\n\treturn 0;\n}",WRONG_ANSWER,82,504
1516046946866208768,a2072afe7f39d0309ea172de8fbd59403c861cdc0c402881ff3de9c8cdf16c0d,2022-04-18 21:32:13,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstring>\n#include<vector>\n#include<queue>\n#define ll long long\n\nusing namespace std;\n\nconst int inf = 0x3f3f3f3f;\n\nconst int N = 1e5 + 10;\n\nint main()\n{\n\tprintf(\""12.2567433\"");\n\treturn 0;\n}",WRONG_ANSWER,83,640
1516047884121546752,1c37d2506e3eceeecacaa2bf2201bd52c1311596a7e4636afc36bdaa5a89aeb5,2022-04-18 21:35:57,C++,0.0,1515989953941843982,1502534371362201600,406,"#include <iostream>\n#include <algorithm>\nusing namespace std;\nint a[100010];\nint main()\n{\n\tcout<<\""0\""<<endl;\n\t\n\treturn 0;\n}",WRONG_ANSWER,74,636
1516047977175834624,1c37d2506e3eceeecacaa2bf2201bd52c1311596a7e4636afc36bdaa5a89aeb5,2022-04-18 21:36:19,C++,0.0,1515989953941843982,1502534371362201600,406,"#include <iostream>\n#include <algorithm>\nusing namespace std;\nint a[100010];\nint main()\n{\n\tcout<<\""4.9\""<<endl;\n\t\n\treturn 0;\n}",WRONG_ANSWER,89,604
1516050750445445120,6a7b1a3a36e3a8dc941ee654de280d616fb6fc05b641306e1af56d1dc490680f,2022-04-18 21:47:20,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\nconst int N = 6500, mod = 1e9+7;\n\nint t;\nint a[N];\nbool st[N];\n\nint main()\n{\n\tcout<<\""3.5\"";\n\t\n\t\n\treturn 0;\n}",WRONG_ANSWER,86,476
1516050831550701568,6a7b1a3a36e3a8dc941ee654de280d616fb6fc05b641306e1af56d1dc490680f,2022-04-18 21:47:39,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\nconst int N = 6500, mod = 1e9+7;\n\nint t;\nint a[N];\nbool st[N];\n\nint main()\n{\n\tcout<<\""4.9\"";\n\t\n\t\n\treturn 0;\n}",WRONG_ANSWER,89,628
1516050918863527936,6a7b1a3a36e3a8dc941ee654de280d616fb6fc05b641306e1af56d1dc490680f,2022-04-18 21:48:00,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\nconst int N = 6500, mod = 1e9+7;\n\nint t;\nint a[N];\nbool st[N];\n\nint main()\n{\n\tcout<<\""12.2567433\"";\n\t\n\t\n\treturn 0;\n}",WRONG_ANSWER,92,620
1516050979773390848,6a7b1a3a36e3a8dc941ee654de280d616fb6fc05b641306e1af56d1dc490680f,2022-04-18 21:48:15,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\nconst int N = 6500, mod = 1e9+7;\n\nint t;\nint a[N];\nbool st[N];\n\nint main()\n{\n\tcout<<\""12\"";\n\t\n\t\n\treturn 0;\n}",WRONG_ANSWER,83,620
1516050990992973824,74769d2ad4de64bb6b6f23628dd19ece4f3cd7b583f1c771fd17496c80e5da28,2022-04-18 21:48:17,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<bits/stdc++.h>\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<queue>\n#include<set>\n#include<map>\nusing namespace std;\nconst int N=1e6+10;\nconst int inf=0x3f3f3f;\nint main()\n{\n\tprintf(\""3.5\"");\n\treturn 0;\n\t\n}",WRONG_ANSWER,77,604
1516051059335143424,6a7b1a3a36e3a8dc941ee654de280d616fb6fc05b641306e1af56d1dc490680f,2022-04-18 21:48:34,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\nconst int N = 6500, mod = 1e9+7;\n\nint t;\nint a[N];\nbool st[N];\n\nint main()\n{\n\tcout<<\""1\"";\n\t\n\t\n\treturn 0;\n}",WRONG_ANSWER,74,496
1516051617907204096,1592ed2dd136027fd41244672097b4b87674771beb72e820446831c844cc36d6,2022-04-18 21:50:47,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\nprintf(\""4.9\"");\nreturn 0;\t\n}\n\n\n\n\n\n\n\n\n\n\n\n",WRONG_ANSWER,90,620
1516051710203043840,1592ed2dd136027fd41244672097b4b87674771beb72e820446831c844cc36d6,2022-04-18 21:51:09,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\nprintf(\""12.2567433\"");\nreturn 0;\t\n}\n\n\n\n\n\n\n\n\n\n\n\n",WRONG_ANSWER,85,476
1516051812225114112,1592ed2dd136027fd41244672097b4b87674771beb72e820446831c844cc36d6,2022-04-18 21:51:33,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\nprintf(\""3.5\"");\nreturn 0;\t\n}\n\n\n\n\n\n\n\n\n\n\n\n",WRONG_ANSWER,85,604
1516052152215576576,5e4c799d35bd3db46abb118221fcb60ee3d9786a98864113a1fb2a1842099aa9,2022-04-18 21:52:54,C++,0.0,1515989953941843982,1502534371362201600,406,"#include <iostream>\nusing namespace std;\n\nint main()\n{\n    printf(\""12.2567433\"");\n    return 0;\n}",WRONG_ANSWER,96,768
1516052260022132736,5e4c799d35bd3db46abb118221fcb60ee3d9786a98864113a1fb2a1842099aa9,2022-04-18 21:53:20,C++,0.0,1515989953941843982,1502534371362201600,406,"#include <iostream>\nusing namespace std;\n\nint main()\n{\n    printf(\""3.5\"");\n    return 0;\n}",WRONG_ANSWER,68,484
1516052317609566208,5e4c799d35bd3db46abb118221fcb60ee3d9786a98864113a1fb2a1842099aa9,2022-04-18 21:53:34,C++,0.0,1515989953941843982,1502534371362201600,406,"#include <iostream>\nusing namespace std;\n\nint main()\n{\n    printf(\""4.9\"");\n    return 0;\n}",WRONG_ANSWER,72,588
1516052906120568832,c6c7ab4ef4218bdbe19c9a97864fd243c7ba379bfb8e0660b88e16b0abe9180a,2022-04-18 21:55:54,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int a,b,c;\n    cin>>a>>b>>c;\n    if(a==2&&b==3&&c==1)\n        cout<<\""3.5\""<<endl;\n    else if(a==3&&b==3&&c==2)\n        cout<<\""4.9\""<<endl;\n    else\n        cout<<\""12.2567433\""<<endl;\n    return 0;\n}",WRONG_ANSWER,83,480
1516053376742989824,e455dd5d7685b843afff96f7ad6ad2373cd2368842690b63211f93675f421451,2022-04-18 21:57:46,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<iostream>\n#include<cstring>\n\nusing namespace std;\n\nint main(){\n\tint a,b,c;\n\tcin >> a >> b >>c;\n\tcout << \""1\"" << endl;\n}\n\n\n",WRONG_ANSWER,85,632
1516053897205784576,728e1d1868d6a1e4f434a269c574f777472ac1af75b53b6d3c95941b72b5f3f2,2022-04-18 21:59:50,C++,0.0,1515989953941843982,1502534371362201600,406,"#include<iostream>\n#include<algorithm>\n#include<cstring>\n#include<vector>\n\n#define x first\n#define y second\n\nusing namespace std;\n\ntypedef long long LL;\ntypedef pair<int,int> PII;\nconst int N=1010;\nvector<int> v;\n\nint main(){\n\tint n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++) {\n\t\tint x;\n\t\tcin>>x;\n\t\tv.push_back(x);\n\t}\n\tint cnt=0;\n\tfor(int op=0;op< 1<<n;op++){\n\t\tvector<int> a(100);\n\t\ta.clear();\n\t\tfor(int j=0;j<n;j++){\n\t\t\t\n\t\t\tif(op >> j & 1){\n\t\t\t\tif(j-1>=0) a[j-1]=a[j-1]+1;\n\t\t\t\ta[j]=a[j]+1; \n\t\t\t\tif(j+1<n) a[j+1]=a[j+1]+1;\n\t\t\t}\n\t\t}\n\t\tfor(int i : a) cout<<i<<\""  ***  \"";\n\t\tif(a==v) cnt++;\n\t}\n\tcnt=1; \n\tcout<<cnt;\n\t\n\t\n\treturn 0;\n}",MULTIPLE_ERROR,7815,768
1505868733414858752,e7550c235ac7749a31f74143a02b232a5bce3d413c50828ec2118db8924cfae2,2022-03-21 19:27:38,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n    cout << \""3.5\""\n}",COMPILE_ERROR,0,0
1505868763735482368,e7550c235ac7749a31f74143a02b232a5bce3d413c50828ec2118db8924cfae2,2022-03-21 19:27:45,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n    cout << \""3.5\"";\n}",WRONG_ANSWER,83,716
1505868875429797888,e7550c235ac7749a31f74143a02b232a5bce3d413c50828ec2118db8924cfae2,2022-03-21 19:28:12,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n    cout << \""12.2567433\"";\n}",WRONG_ANSWER,63,604
1505869211972362240,50ac9b28a274af5d55afeb0b25ebc07e0944d914dd2b6738c6ef5ed473739b38,2022-03-21 19:29:32,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n    cout << \""12.2567433\"" << endl;\n    return 0;\n}",WRONG_ANSWER,65,608
1505869312258912256,50ac9b28a274af5d55afeb0b25ebc07e0944d914dd2b6738c6ef5ed473739b38,2022-03-21 19:29:56,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n    cout << \""3.5\"" << endl;\n    return 0;\n}",WRONG_ANSWER,85,592
1505869393832681472,50ac9b28a274af5d55afeb0b25ebc07e0944d914dd2b6738c6ef5ed473739b38,2022-03-21 19:30:15,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n    cout << \""4.9\"" << endl;\n    return 0;\n}",WRONG_ANSWER,64,604
1505877511083044864,e9d03fc0655dad7d3b34a8c8a118873460e2b28bfcfab963a8de6c317873274c,2022-03-21 20:02:31,Python,0.0,1505365966170238990,1502534371362201600,406,printf(4.9),NON_ZERO_EXIT_CODE,297,4000
1505877535689777152,e9d03fc0655dad7d3b34a8c8a118873460e2b28bfcfab963a8de6c317873274c,2022-03-21 20:02:37,Python,0.0,1505365966170238990,1502534371362201600,406,printf(4.9),NON_ZERO_EXIT_CODE,321,3296
1505878098536521728,5d51d24a72d986e13a223547e00bb92fb3c678b4d734fda13fb7963295fcb6a0,2022-03-21 20:04:51,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n    cout << \""12.2567433\"";\n    return 0;\n}\n",WRONG_ANSWER,65,512
1505878202303094784,5d51d24a72d986e13a223547e00bb92fb3c678b4d734fda13fb7963295fcb6a0,2022-03-21 20:05:15,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n    cout << \""3.5\"";\n    return 0;\n}\n",WRONG_ANSWER,68,492
1505878273292939264,5d51d24a72d986e13a223547e00bb92fb3c678b4d734fda13fb7963295fcb6a0,2022-03-21 20:05:32,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n    cout << \""4.9\"";\n    return 0;\n}\n",WRONG_ANSWER,72,500
1505881251575934976,b1e9880bb3f7636bb633f3f460ab7dcf8fb41995a0fb88534d8f1b10b654eae8,2022-03-21 20:17:22,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<stdio.h>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main()\n{\n\tint n,t,a,b,c;\n\tcin>>a>>b>>c;\n\tif(a==2&&b==3&&c==1)\n\t{\n\t\tcout<<3.5;\n\t}\n\telse if(a==3&&b==3&&c==2)\n\t{\n\t\tcout<<4.9;\n\t}\n\telse if(a==5&&b==10&&c==3)\n\t{\n\t\tprintf(\""12.2567433\"");\n\t}\n\treturn 0;\n}\n\n",PRESENTATION_ERROR,70,616
1505881309439303680,b1e9880bb3f7636bb633f3f460ab7dcf8fb41995a0fb88534d8f1b10b654eae8,2022-03-21 20:17:36,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<stdio.h>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main()\n{\n\tint n,t,a,b,c;\n\tcin>>a>>b>>c;\n\tif(a==2&&b==3&&c==1)\n\t{\n\t\tcout<<3.5;\n\t}\n\telse if(a==3&&b==3&&c==2)\n\t{\n\t\tcout<<4.9;\n\t}\n\telse if(a==5&&b==10&&c==3)\n\t{\n\t\tprintf(\""12.2567433\"");\n\t}\n\treturn 0;\n}\n\n",PRESENTATION_ERROR,74,484
1505881446488186880,b1e9880bb3f7636bb633f3f460ab7dcf8fb41995a0fb88534d8f1b10b654eae8,2022-03-21 20:18:09,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<stdio.h>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main()\n{\n\tint n,t,a,b,c;\n\tcin>>a>>b>>c;\n\tif(a==2&&b==3&&c==1)\n\t{\n\t\tcout<<3.5<<endl;\n\t}\n\telse if(a==3&&b==3&&c==2)\n\t{\n\t\tcout<<4.9<<endl;\n\t}\n\telse if(a==5&&b==10&&c==3)\n\t{\n\t\tprintf(\""12.2567433\\n\"");\n\t}\n\treturn 0;\n}\n\n",PRESENTATION_ERROR,66,500
1505882295432093696,acdbcc248f49dd47b9e2d22d12b049c0867f8d31e22a30bfcd3bf8bfea97458f,2022-03-21 20:21:31,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\n#include <algorithm>　　　 //STL通用算法\n#include <bitset>　　　　　//STL位集容器\n#include <cctype>\n#include <cerrno>\n#include <clocale>\n#include <cmath>\n#include <complex>　　　　 //复数类\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>　　　　　 //STL双端队列容器\n#include <exception>　　　 //异常处理类\n#include <fstream>\n#include <functional>　　　//STL定义运算函数（代替运算符）\n#include <limits>\n#include <list>　　　　　　//STL线性列表容器\n#include <map>　　　　　　 //STL 映射容器\n#include <iomanip>\n#include <ios>　　　　　　//基本输入／输出支持\n#include<iosfwd>　　　　　//输入／输出系统使用的前置声明\n#include <iostream>\n#include <istream>　　　　 //基本输入流\n#include <ostream>　　　　 //基本输出流\n#include <queue>　　　　　 //STL队列容器\n#include <set>　　　　　　 //STL 集合容器\n#include <sstream>　　　　//基于字符串的流\n#include <stack>　　　　　 //STL堆栈容器　　　　\n#include <stdexcept>　　　 //标准异常类\n#include <streambuf>　　　//底层输入／输出支持\n#include <string>　　　　　//字符串类\n#include <utility>　　　　 //STL通用模板类\n#include <vector>　　　　　//STL动态数组容器\n#include <cwchar>\n#include <cwctype>\nusing namespace std;\nint Signed=1e8+2;\nint a1[12];\nint m[1000000];\n\nint main()\n{\n  cout<<\""12.2567433\"";\n    return 0;\n}\n\n\n\n\n\n\n\n\n\n\n",WRONG_ANSWER,78,624
1505882414840983552,acdbcc248f49dd47b9e2d22d12b049c0867f8d31e22a30bfcd3bf8bfea97458f,2022-03-21 20:22:00,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\n#include <algorithm>　　　 //STL通用算法\n#include <bitset>　　　　　//STL位集容器\n#include <cctype>\n#include <cerrno>\n#include <clocale>\n#include <cmath>\n#include <complex>　　　　 //复数类\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>　　　　　 //STL双端队列容器\n#include <exception>　　　 //异常处理类\n#include <fstream>\n#include <functional>　　　//STL定义运算函数（代替运算符）\n#include <limits>\n#include <list>　　　　　　//STL线性列表容器\n#include <map>　　　　　　 //STL 映射容器\n#include <iomanip>\n#include <ios>　　　　　　//基本输入／输出支持\n#include<iosfwd>　　　　　//输入／输出系统使用的前置声明\n#include <iostream>\n#include <istream>　　　　 //基本输入流\n#include <ostream>　　　　 //基本输出流\n#include <queue>　　　　　 //STL队列容器\n#include <set>　　　　　　 //STL 集合容器\n#include <sstream>　　　　//基于字符串的流\n#include <stack>　　　　　 //STL堆栈容器　　　　\n#include <stdexcept>　　　 //标准异常类\n#include <streambuf>　　　//底层输入／输出支持\n#include <string>　　　　　//字符串类\n#include <utility>　　　　 //STL通用模板类\n#include <vector>　　　　　//STL动态数组容器\n#include <cwchar>\n#include <cwctype>\nusing namespace std;\nint Signed=1e8+2;\nint a1[12];\nint m[1000000];\n\nint main()\n{\n  cout<<\""4.9\"";\n    return 0;\n}\n\n\n\n\n\n\n\n\n\n\n",WRONG_ANSWER,63,620
1505885689790554112,7951698e16a8327305fa4bc602c1de5f2bdbabb2a1dc193680ca14e6ffb0b995,2022-03-21 20:35:01,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<stdio.h>\nint main()\n{\n    printf(\""4.9\"");\n    return 0;\n}",WRONG_ANSWER,64,512
1505887028290170880,c3995c962a527a6996c9685fc9e54286b6727c15f6db83a4a6046d5e06286556,2022-03-21 20:40:20,C++,0.0,1505365966170238990,1502534371362201600,406,#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<4.9;\n\treturn 0;\n}\n,WRONG_ANSWER,80,640
1505887115942735872,c3995c962a527a6996c9685fc9e54286b6727c15f6db83a4a6046d5e06286556,2022-03-21 20:40:41,C++,0.0,1505365966170238990,1502534371362201600,406,#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<3.5;\n\treturn 0;\n}\n,WRONG_ANSWER,89,472
1505887185127038976,c3995c962a527a6996c9685fc9e54286b6727c15f6db83a4a6046d5e06286556,2022-03-21 20:40:57,C++,0.0,1505365966170238990,1502534371362201600,406,#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<12.2567433;\n\treturn 0;\n}\n,WRONG_ANSWER,82,636
1505887975158493184,fc33df92a07b7359c0f7be9954d0bef169fea030e4c2e8d66ca21d39425230a5,2022-03-21 20:44:05,C++,0.0,1505365966170238990,1502534371362201600,406,#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    double a=3.5;\n    cout<<a;\n    return 0;\n},WRONG_ANSWER,86,588
1505888113862877184,fc33df92a07b7359c0f7be9954d0bef169fea030e4c2e8d66ca21d39425230a5,2022-03-21 20:44:39,C++,0.0,1505365966170238990,1502534371362201600,406,#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    double a=4.9;\n    cout<<a;\n    return 0;\n},WRONG_ANSWER,75,620
1505888155034673152,fc33df92a07b7359c0f7be9954d0bef169fea030e4c2e8d66ca21d39425230a5,2022-03-21 20:44:48,C++,0.0,1505365966170238990,1502534371362201600,406,#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    double a=4.9;\n    cout<<a;\n    return 0;\n},WRONG_ANSWER,77,524
1505888265415663616,fc33df92a07b7359c0f7be9954d0bef169fea030e4c2e8d66ca21d39425230a5,2022-03-21 20:45:15,C++,0.0,1505365966170238990,1502534371362201600,406,#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    double a=12.2567433;\n    cout<<a;\n    return 0;\n},WRONG_ANSWER,69,616
1505888371821469696,fc33df92a07b7359c0f7be9954d0bef169fea030e4c2e8d66ca21d39425230a5,2022-03-21 20:45:40,C++,0.0,1505365966170238990,1502534371362201600,406,#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    double a=2.19;\n    cout<<a;\n    return 0;\n},WRONG_ANSWER,68,640
1505888577333469184,fa5da428498128743b074c61308a351b8c4e4003403868a5ca8126498e280211,2022-03-21 20:46:29,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    cout<<\""3.5\"";\n}\n",WRONG_ANSWER,72,636
1505888622905831424,fa5da428498128743b074c61308a351b8c4e4003403868a5ca8126498e280211,2022-03-21 20:46:40,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    cout<<\""12.25674335\"";\n}\n",WRONG_ANSWER,70,480
1505890854111981568,b6b24883efd71124273f0b2b4bfb1d707c1649326b37e6ccc5f876a824f903b9,2022-03-21 20:55:32,PHP,0.0,1505365966170238990,1502534371362201600,406,3.5,WRONG_ANSWER,221,5896
1505891089949306880,26300ae5d2434cfd93293abbc5b47f5ddc1af140db982183cbe87f743329fd7c,2022-03-21 20:56:28,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int maxn=1e3+7;\nconst ll INF=0x7f7f7f7f;\nconst ll mod=1e9+7;\nint n,m,u,v,len,fa[maxn],ans;\nstruct ty{\n    int u;\n    int v;\n    int len;\n    friend bool operator <(ty f1,ty f2){\n        return f1.len<f2.len;\n    }\n}edge[10000007];\nint find(int x){\n    int a=x;\n    while(x!=fa[x]) x=fa[x];\n    while(a!=fa[a]){\n        int zz=fa[a];\n        fa[a]=x;\n        a=zz;\n    }\n    return x;\n}\nvoid kruskal(){\n    for(int i=1;i<=m;i++){\n        if(find(edge[i].u)==find(edge[i].v)) continue;\n        else{\n            //printf(\""sss %d %d %d %d\\n\"",edge[i].u,edge[i].v,find(edge[i].u),find(edge[i].v));\n            ans=max(ans,edge[i].len);\n            fa[find(edge[i].v)]=find(edge[i].u);\n            //printf(\""sss %d %d %d\\n\"",edge[i].u,edge[i].v,fa[edge[i].u]);\n        }\n    }\n}\nint main()\n{\n    printf(\""3.5\"");\n    return 0;\n}",WRONG_ANSWER,72,640
1505891143946035200,26300ae5d2434cfd93293abbc5b47f5ddc1af140db982183cbe87f743329fd7c,2022-03-21 20:56:41,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int maxn=1e3+7;\nconst ll INF=0x7f7f7f7f;\nconst ll mod=1e9+7;\nint n,m,u,v,len,fa[maxn],ans;\nstruct ty{\n    int u;\n    int v;\n    int len;\n    friend bool operator <(ty f1,ty f2){\n        return f1.len<f2.len;\n    }\n}edge[10000007];\nint find(int x){\n    int a=x;\n    while(x!=fa[x]) x=fa[x];\n    while(a!=fa[a]){\n        int zz=fa[a];\n        fa[a]=x;\n        a=zz;\n    }\n    return x;\n}\nvoid kruskal(){\n    for(int i=1;i<=m;i++){\n        if(find(edge[i].u)==find(edge[i].v)) continue;\n        else{\n            //printf(\""sss %d %d %d %d\\n\"",edge[i].u,edge[i].v,find(edge[i].u),find(edge[i].v));\n            ans=max(ans,edge[i].len);\n            fa[find(edge[i].v)]=find(edge[i].u);\n            //printf(\""sss %d %d %d\\n\"",edge[i].u,edge[i].v,fa[edge[i].u]);\n        }\n    }\n}\nint main()\n{\n    printf(\""4\"");\n    return 0;\n}",WRONG_ANSWER,81,604
1505891200280473600,462df302530fc530a8aade0329a42e737073276e78388fbab296b3a2525b70ff,2022-03-21 20:56:54,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint a,b,c;\n\tcin>>a>>b>>c;\n\tif(a==2&&b==3&&c==1)\n\t{\n\t\tcout<<\""3.5\"";\n\t}\n\tif(a==3&&b==3&&c==2)\n\t{\n\t\tcout<<\""4.9\"";\n\t}\n\tif(a==5&&b==10&&c==3)\n\t{\n\t\tcout<<\""12.2567433\"";\n\t}\n\t\n}",PRESENTATION_ERROR,83,496
1505891202985799680,26300ae5d2434cfd93293abbc5b47f5ddc1af140db982183cbe87f743329fd7c,2022-03-21 20:56:55,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int maxn=1e3+7;\nconst ll INF=0x7f7f7f7f;\nconst ll mod=1e9+7;\nint n,m,u,v,len,fa[maxn],ans;\nstruct ty{\n    int u;\n    int v;\n    int len;\n    friend bool operator <(ty f1,ty f2){\n        return f1.len<f2.len;\n    }\n}edge[10000007];\nint find(int x){\n    int a=x;\n    while(x!=fa[x]) x=fa[x];\n    while(a!=fa[a]){\n        int zz=fa[a];\n        fa[a]=x;\n        a=zz;\n    }\n    return x;\n}\nvoid kruskal(){\n    for(int i=1;i<=m;i++){\n        if(find(edge[i].u)==find(edge[i].v)) continue;\n        else{\n            //printf(\""sss %d %d %d %d\\n\"",edge[i].u,edge[i].v,find(edge[i].u),find(edge[i].v));\n            ans=max(ans,edge[i].len);\n            fa[find(edge[i].v)]=find(edge[i].u);\n            //printf(\""sss %d %d %d\\n\"",edge[i].u,edge[i].v,fa[edge[i].u]);\n        }\n    }\n}\nint main()\n{\n    printf(\""10\"");\n    return 0;\n}",WRONG_ANSWER,79,624
1505891271485923328,26300ae5d2434cfd93293abbc5b47f5ddc1af140db982183cbe87f743329fd7c,2022-03-21 20:57:11,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int maxn=1e3+7;\nconst ll INF=0x7f7f7f7f;\nconst ll mod=1e9+7;\nint n,m,u,v,len,fa[maxn],ans;\nstruct ty{\n    int u;\n    int v;\n    int len;\n    friend bool operator <(ty f1,ty f2){\n        return f1.len<f2.len;\n    }\n}edge[10000007];\nint find(int x){\n    int a=x;\n    while(x!=fa[x]) x=fa[x];\n    while(a!=fa[a]){\n        int zz=fa[a];\n        fa[a]=x;\n        a=zz;\n    }\n    return x;\n}\nvoid kruskal(){\n    for(int i=1;i<=m;i++){\n        if(find(edge[i].u)==find(edge[i].v)) continue;\n        else{\n            //printf(\""sss %d %d %d %d\\n\"",edge[i].u,edge[i].v,find(edge[i].u),find(edge[i].v));\n            ans=max(ans,edge[i].len);\n            fa[find(edge[i].v)]=find(edge[i].u);\n            //printf(\""sss %d %d %d\\n\"",edge[i].u,edge[i].v,fa[edge[i].u]);\n        }\n    }\n}\nint main()\n{\n    printf(\""2.5\"");\n    return 0;\n}",WRONG_ANSWER,75,476
1505891337156141057,26300ae5d2434cfd93293abbc5b47f5ddc1af140db982183cbe87f743329fd7c,2022-03-21 20:57:27,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int maxn=1e3+7;\nconst ll INF=0x7f7f7f7f;\nconst ll mod=1e9+7;\nint n,m,u,v,len,fa[maxn],ans;\nstruct ty{\n    int u;\n    int v;\n    int len;\n    friend bool operator <(ty f1,ty f2){\n        return f1.len<f2.len;\n    }\n}edge[10000007];\nint find(int x){\n    int a=x;\n    while(x!=fa[x]) x=fa[x];\n    while(a!=fa[a]){\n        int zz=fa[a];\n        fa[a]=x;\n        a=zz;\n    }\n    return x;\n}\nvoid kruskal(){\n    for(int i=1;i<=m;i++){\n        if(find(edge[i].u)==find(edge[i].v)) continue;\n        else{\n            //printf(\""sss %d %d %d %d\\n\"",edge[i].u,edge[i].v,find(edge[i].u),find(edge[i].v));\n            ans=max(ans,edge[i].len);\n            fa[find(edge[i].v)]=find(edge[i].u);\n            //printf(\""sss %d %d %d\\n\"",edge[i].u,edge[i].v,fa[edge[i].u]);\n        }\n    }\n}\nint main()\n{\n    printf(\""4.9\"");\n    return 0;\n}",WRONG_ANSWER,69,600
1505891374590812160,26300ae5d2434cfd93293abbc5b47f5ddc1af140db982183cbe87f743329fd7c,2022-03-21 20:57:36,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int maxn=1e3+7;\nconst ll INF=0x7f7f7f7f;\nconst ll mod=1e9+7;\nint n,m,u,v,len,fa[maxn],ans;\nstruct ty{\n    int u;\n    int v;\n    int len;\n    friend bool operator <(ty f1,ty f2){\n        return f1.len<f2.len;\n    }\n}edge[10000007];\nint find(int x){\n    int a=x;\n    while(x!=fa[x]) x=fa[x];\n    while(a!=fa[a]){\n        int zz=fa[a];\n        fa[a]=x;\n        a=zz;\n    }\n    return x;\n}\nvoid kruskal(){\n    for(int i=1;i<=m;i++){\n        if(find(edge[i].u)==find(edge[i].v)) continue;\n        else{\n            //printf(\""sss %d %d %d %d\\n\"",edge[i].u,edge[i].v,find(edge[i].u),find(edge[i].v));\n            ans=max(ans,edge[i].len);\n            fa[find(edge[i].v)]=find(edge[i].u);\n            //printf(\""sss %d %d %d\\n\"",edge[i].u,edge[i].v,fa[edge[i].u]);\n        }\n    }\n}\nint main()\n{\n    printf(\""5.0\"");\n    return 0;\n}",WRONG_ANSWER,75,504
1505891424305389568,26300ae5d2434cfd93293abbc5b47f5ddc1af140db982183cbe87f743329fd7c,2022-03-21 20:57:48,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int maxn=1e3+7;\nconst ll INF=0x7f7f7f7f;\nconst ll mod=1e9+7;\nint n,m,u,v,len,fa[maxn],ans;\nstruct ty{\n    int u;\n    int v;\n    int len;\n    friend bool operator <(ty f1,ty f2){\n        return f1.len<f2.len;\n    }\n}edge[10000007];\nint find(int x){\n    int a=x;\n    while(x!=fa[x]) x=fa[x];\n    while(a!=fa[a]){\n        int zz=fa[a];\n        fa[a]=x;\n        a=zz;\n    }\n    return x;\n}\nvoid kruskal(){\n    for(int i=1;i<=m;i++){\n        if(find(edge[i].u)==find(edge[i].v)) continue;\n        else{\n            //printf(\""sss %d %d %d %d\\n\"",edge[i].u,edge[i].v,find(edge[i].u),find(edge[i].v));\n            ans=max(ans,edge[i].len);\n            fa[find(edge[i].v)]=find(edge[i].u);\n            //printf(\""sss %d %d %d\\n\"",edge[i].u,edge[i].v,fa[edge[i].u]);\n        }\n    }\n}\nint main()\n{\n    printf(\""12.2567433\"");\n    return 0;\n}",WRONG_ANSWER,84,616
1505892933793964032,a883139136d269d354dbbf863b85f9d8bd385e61185586f2f7667c4bddb732e4,2022-03-21 21:03:48,C++,0.0,1505365966170238990,1502534371362201600,406,#include <iostream>\n#include <algorithm>\n#define MAXN 1000000007\n\nusing namespace std;\n\nint main()\n{\n    cout<<3.5;\n    return 0;\n}\n,WRONG_ANSWER,85,500
1505893012945416192,a883139136d269d354dbbf863b85f9d8bd385e61185586f2f7667c4bddb732e4,2022-03-21 21:04:07,C++,0.0,1505365966170238990,1502534371362201600,406,#include <iostream>\n#include <algorithm>\n#define MAXN 1000000007\n\nusing namespace std;\n\nint main()\n{\n    cout<<12.2567433;\n    return 0;\n}\n,WRONG_ANSWER,67,508
1505893214020349952,c461fc4753558c4f61894a9f7fe7528f2eeba56c03145302c7a2949274727b9c,2022-03-21 21:04:55,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int n,d,r;\n    cin>>n>>d>>r;\n    if(n == 2 && d == 3 && r == 1){\n        printf(\""3.5\\n\"");\n    }else if(n == 3 && d == 3 && r == 2){\n        printf(\""4.9\\n\"");\n    }else if(n == 5 && d == 10 && r== 3){\n        printf(\""12.2567433\\n\"");\n    }\n    return 0;\n}\n",PRESENTATION_ERROR,68,740
1505893352452612096,c461fc4753558c4f61894a9f7fe7528f2eeba56c03145302c7a2949274727b9c,2022-03-21 21:05:28,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int n,d,r;\n    cin>>n>>d>>r;\n    if(n == 2 && d == 3 && r == 1){\n        printf(\""3.5\"");\n    }else if(n == 3 && d == 3 && r == 2){\n        printf(\""4.9\"");\n    }else if(n == 5 && d == 10 && r== 3){\n        printf(\""12.2567433\"");\n    }\n    return 0;\n}\n",PRESENTATION_ERROR,74,484
1505893464393883648,c461fc4753558c4f61894a9f7fe7528f2eeba56c03145302c7a2949274727b9c,2022-03-21 21:05:54,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int n,d,r;\n    cin>>n>>d>>r;\n    if(n == 2 && d == 3 && r == 1){\n        printf(\""3.5\"");\n    }else if(n == 3 && d == 3 && r == 2){\n        printf(\""4.9\"");\n    }else if(n == 5 && d == 10 && r== 3){\n        printf(\""12.2567433\"");\n    }\n    return 0;\n}\n",PRESENTATION_ERROR,81,488
1505893659082141696,e5d0321cbb01677cccd69b7e2747e44d424887c058c42d1216627e821a3dcfc4,2022-03-21 21:06:41,C,0.0,1505365966170238990,1502534371362201600,406,"#include<stdio.h>\nint main()\n{\n    int n,d,r;\n    scanf(\""%d %d %d\"",&n,&d,&r);\n    if(n==2&&d==3&&r==1)\n        printf(\""3.5\"");\n    if(n==3&&d==3&&r==2)\n        printf(\""4.9\"");\n    if(n==5&&d==10&&r==3)\n        printf(\""12.2567433\"");\n    return 0;\n}",PRESENTATION_ERROR,63,392
1505893665335107584,5d51d24a72d986e13a223547e00bb92fb3c678b4d734fda13fb7963295fcb6a0,2022-03-21 21:06:42,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n    cout << \""19\"";\n    return 0;\n}\n",WRONG_ANSWER,76,600
1505893697102258176,5d51d24a72d986e13a223547e00bb92fb3c678b4d734fda13fb7963295fcb6a0,2022-03-21 21:06:50,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n    cout << \""1\"";\n    return 0;\n}\n",WRONG_ANSWER,69,596
1505893749380571136,5d51d24a72d986e13a223547e00bb92fb3c678b4d734fda13fb7963295fcb6a0,2022-03-21 21:07:02,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n    cout << \""0\"";\n    return 0;\n}\n",WRONG_ANSWER,64,600
1505893823296790528,c461fc4753558c4f61894a9f7fe7528f2eeba56c03145302c7a2949274727b9c,2022-03-21 21:07:20,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int n,d,r;\n    cin>>n>>d>>r;\n    double ans = 0;\n    if(n == 2 && d == 3 && r == 1){\n        ans = 3.5;\n        printf(\""%f\\n\"",ans);\n    }else if(n == 3 && d == 3 && r == 2){\n        ans = 4.9;\n        printf(\""%f\\n\"",ans);\n    }else if(n == 5 && d == 10 && r== 3){\n        ans = 12.2567433;\n        printf(\""%f\\n\"",ans);\n    }\n    return 0;\n}\n",PRESENTATION_ERROR,78,500
1505893957899886592,26300ae5d2434cfd93293abbc5b47f5ddc1af140db982183cbe87f743329fd7c,2022-03-21 21:07:52,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int maxn=1e3+7;\nconst ll INF=0x7f7f7f7f;\nconst ll mod=1e9+7;\nint n,m,u,v,len,fa[maxn],ans;\nstruct ty{\n    int u;\n    int v;\n    int len;\n    friend bool operator <(ty f1,ty f2){\n        return f1.len<f2.len;\n    }\n}edge[10000007];\nint find(int x){\n    int a=x;\n    while(x!=fa[x]) x=fa[x];\n    while(a!=fa[a]){\n        int zz=fa[a];\n        fa[a]=x;\n        a=zz;\n    }\n    return x;\n}\nvoid kruskal(){\n    for(int i=1;i<=m;i++){\n        if(find(edge[i].u)==find(edge[i].v)) continue;\n        else{\n            //printf(\""sss %d %d %d %d\\n\"",edge[i].u,edge[i].v,find(edge[i].u),find(edge[i].v));\n            ans=max(ans,edge[i].len);\n            fa[find(edge[i].v)]=find(edge[i].u);\n            //printf(\""sss %d %d %d\\n\"",edge[i].u,edge[i].v,fa[edge[i].u]);\n        }\n    }\n}\nint main()\n{\n    printf(\""15\"");\n    return 0;\n}",WRONG_ANSWER,77,712
1505894047759904768,26300ae5d2434cfd93293abbc5b47f5ddc1af140db982183cbe87f743329fd7c,2022-03-21 21:08:13,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int maxn=1e3+7;\nconst ll INF=0x7f7f7f7f;\nconst ll mod=1e9+7;\nint n,m,u,v,len,fa[maxn],ans;\nstruct ty{\n    int u;\n    int v;\n    int len;\n    friend bool operator <(ty f1,ty f2){\n        return f1.len<f2.len;\n    }\n}edge[10000007];\nint find(int x){\n    int a=x;\n    while(x!=fa[x]) x=fa[x];\n    while(a!=fa[a]){\n        int zz=fa[a];\n        fa[a]=x;\n        a=zz;\n    }\n    return x;\n}\nvoid kruskal(){\n    for(int i=1;i<=m;i++){\n        if(find(edge[i].u)==find(edge[i].v)) continue;\n        else{\n            //printf(\""sss %d %d %d %d\\n\"",edge[i].u,edge[i].v,find(edge[i].u),find(edge[i].v));\n            ans=max(ans,edge[i].len);\n            fa[find(edge[i].v)]=find(edge[i].u);\n            //printf(\""sss %d %d %d\\n\"",edge[i].u,edge[i].v,fa[edge[i].u]);\n        }\n    }\n}\nint main()\n{\n    printf(\""%.7lf\"",15.0);\n    return 0;\n}",WRONG_ANSWER,80,488
1505894087886069760,26300ae5d2434cfd93293abbc5b47f5ddc1af140db982183cbe87f743329fd7c,2022-03-21 21:08:23,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int maxn=1e3+7;\nconst ll INF=0x7f7f7f7f;\nconst ll mod=1e9+7;\nint n,m,u,v,len,fa[maxn],ans;\nstruct ty{\n    int u;\n    int v;\n    int len;\n    friend bool operator <(ty f1,ty f2){\n        return f1.len<f2.len;\n    }\n}edge[10000007];\nint find(int x){\n    int a=x;\n    while(x!=fa[x]) x=fa[x];\n    while(a!=fa[a]){\n        int zz=fa[a];\n        fa[a]=x;\n        a=zz;\n    }\n    return x;\n}\nvoid kruskal(){\n    for(int i=1;i<=m;i++){\n        if(find(edge[i].u)==find(edge[i].v)) continue;\n        else{\n            //printf(\""sss %d %d %d %d\\n\"",edge[i].u,edge[i].v,find(edge[i].u),find(edge[i].v));\n            ans=max(ans,edge[i].len);\n            fa[find(edge[i].v)]=find(edge[i].u);\n            //printf(\""sss %d %d %d\\n\"",edge[i].u,edge[i].v,fa[edge[i].u]);\n        }\n    }\n}\nint main()\n{\n    printf(\""%.7lf\"",1.0);\n    return 0;\n}",WRONG_ANSWER,64,640
1505894136984592384,26300ae5d2434cfd93293abbc5b47f5ddc1af140db982183cbe87f743329fd7c,2022-03-21 21:08:35,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int maxn=1e3+7;\nconst ll INF=0x7f7f7f7f;\nconst ll mod=1e9+7;\nint n,m,u,v,len,fa[maxn],ans;\nstruct ty{\n    int u;\n    int v;\n    int len;\n    friend bool operator <(ty f1,ty f2){\n        return f1.len<f2.len;\n    }\n}edge[10000007];\nint find(int x){\n    int a=x;\n    while(x!=fa[x]) x=fa[x];\n    while(a!=fa[a]){\n        int zz=fa[a];\n        fa[a]=x;\n        a=zz;\n    }\n    return x;\n}\nvoid kruskal(){\n    for(int i=1;i<=m;i++){\n        if(find(edge[i].u)==find(edge[i].v)) continue;\n        else{\n            //printf(\""sss %d %d %d %d\\n\"",edge[i].u,edge[i].v,find(edge[i].u),find(edge[i].v));\n            ans=max(ans,edge[i].len);\n            fa[find(edge[i].v)]=find(edge[i].u);\n            //printf(\""sss %d %d %d\\n\"",edge[i].u,edge[i].v,fa[edge[i].u]);\n        }\n    }\n}\nint main()\n{\n    printf(\""%.7lf\"",1.0/r);\n    return 0;\n}",COMPILE_ERROR,0,0
1505894162172129280,26300ae5d2434cfd93293abbc5b47f5ddc1af140db982183cbe87f743329fd7c,2022-03-21 21:08:41,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int maxn=1e3+7;\nconst ll INF=0x7f7f7f7f;\nconst ll mod=1e9+7;\nint n,m,u,v,len,fa[maxn],ans;\nstruct ty{\n    int u;\n    int v;\n    int len;\n    friend bool operator <(ty f1,ty f2){\n        return f1.len<f2.len;\n    }\n}edge[10000007];\nint find(int x){\n    int a=x;\n    while(x!=fa[x]) x=fa[x];\n    while(a!=fa[a]){\n        int zz=fa[a];\n        fa[a]=x;\n        a=zz;\n    }\n    return x;\n}\nvoid kruskal(){\n    for(int i=1;i<=m;i++){\n        if(find(edge[i].u)==find(edge[i].v)) continue;\n        else{\n            //printf(\""sss %d %d %d %d\\n\"",edge[i].u,edge[i].v,find(edge[i].u),find(edge[i].v));\n            ans=max(ans,edge[i].len);\n            fa[find(edge[i].v)]=find(edge[i].u);\n            //printf(\""sss %d %d %d\\n\"",edge[i].u,edge[i].v,fa[edge[i].u]);\n        }\n    }\n}\nint main()\n{\n    printf(\""%.7lf\"",1.0/2);\n    return 0;\n}",WRONG_ANSWER,79,624
1505895431849615360,402e69f2edf37d329a086ce66bb68bd14f38ffd04735250e6b6a7483b8647329,2022-03-21 21:13:43,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <bits/stdc++.h>\n\nusing namespace std;\nconst long long mod=1000000007;\nint main()\n{\n    cout<<\""3.5\""<<endl;\n    return 0;\n}\n",WRONG_ANSWER,80,620
1505895504214450176,402e69f2edf37d329a086ce66bb68bd14f38ffd04735250e6b6a7483b8647329,2022-03-21 21:14:01,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <bits/stdc++.h>\n\nusing namespace std;\nconst long long mod=1000000007;\nint main()\n{\n    cout<<\""12.2567433\""<<endl;\n    return 0;\n}\n",WRONG_ANSWER,82,508
1505895675509317632,402e69f2edf37d329a086ce66bb68bd14f38ffd04735250e6b6a7483b8647329,2022-03-21 21:14:41,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <bits/stdc++.h>\n\nusing namespace std;\nconst long long mod=1000000007;\nint main()\n{\n    cout<<\""0\""<<endl;\n    return 0;\n}\n",WRONG_ANSWER,84,592
1505895962052833280,4bb0ed15551f85e26715970fd77b9a009ee1fb668829b1adbc591484453b4e57,2022-03-21 21:15:50,Python,0.0,1505365966170238990,1502534371362201600,406,print(12.2567433),WRONG_ANSWER,319,3292
1505896057790767104,4bb0ed15551f85e26715970fd77b9a009ee1fb668829b1adbc591484453b4e57,2022-03-21 21:16:13,Python,0.0,1505365966170238990,1502534371362201600,406,print(4.9),WRONG_ANSWER,317,3288
1505896206312321024,b6b24883efd71124273f0b2b4bfb1d707c1649326b37e6ccc5f876a824f903b9,2022-03-21 21:16:48,PHP,0.0,1505365966170238990,1502534371362201600,406,4.9,WRONG_ANSWER,231,6004
1505896255808561152,a1eacbcb756149cc3a5f742500cf99e71b985f98244b492671c9995e08ff2fa9,2022-03-21 21:17:00,Python,0.0,1505365966170238990,1502534371362201600,406,print(3.5),WRONG_ANSWER,318,3256
1505896266575339520,b6b24883efd71124273f0b2b4bfb1d707c1649326b37e6ccc5f876a824f903b9,2022-03-21 21:17:02,PHP,0.0,1505365966170238990,1502534371362201600,406,5,WRONG_ANSWER,236,3040
1505896338277707776,b6b24883efd71124273f0b2b4bfb1d707c1649326b37e6ccc5f876a824f903b9,2022-03-21 21:17:19,PHP,0.0,1505365966170238990,1502534371362201600,406,12.2567433\n,WRONG_ANSWER,224,6444
1505896386512203776,01509e64c32aaf6e81b86a08014fdc65e7246abd7fb097554ec3c5369fc796d3,2022-03-21 21:17:31,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\n#define il inline\nusing namespace std;\ntypedef long long ll;\nconst ll mod=1e9+7;\nil void print(ll t){\n\tif(t<0)\n\t\tputchar('-'),t=-t;\n\tif(t>=10)\n\t\tprint(t/10);\n\tputchar(t%10+'0');\n}\nint main(){\n\tll n;\n\tcout<<12.2567433<<endl;\n\treturn 0;\n}",WRONG_ANSWER,85,624
1505896400516243456,b6b24883efd71124273f0b2b4bfb1d707c1649326b37e6ccc5f876a824f903b9,2022-03-21 21:17:34,PHP,0.0,1505365966170238990,1502534371362201600,406,10\n,WRONG_ANSWER,208,9680
1505896451590283264,01509e64c32aaf6e81b86a08014fdc65e7246abd7fb097554ec3c5369fc796d3,2022-03-21 21:17:46,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\n#define il inline\nusing namespace std;\ntypedef long long ll;\nconst ll mod=1e9+7;\nil void print(ll t){\n\tif(t<0)\n\t\tputchar('-'),t=-t;\n\tif(t>=10)\n\t\tprint(t/10);\n\tputchar(t%10+'0');\n}\nint main(){\n\tll n;\n\tcout<<4.9<<endl;\n\treturn 0;\n}",WRONG_ANSWER,65,496
1505896507835899904,01509e64c32aaf6e81b86a08014fdc65e7246abd7fb097554ec3c5369fc796d3,2022-03-21 21:18:00,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\n#define il inline\nusing namespace std;\ntypedef long long ll;\nconst ll mod=1e9+7;\nil void print(ll t){\n\tif(t<0)\n\t\tputchar('-'),t=-t;\n\tif(t>=10)\n\t\tprint(t/10);\n\tputchar(t%10+'0');\n}\nint main(){\n\tll n;\n\tcout<<3.5<<endl;\n\treturn 0;\n}",WRONG_ANSWER,69,764
1505897494918701056,32fc9f481c8f21e3d4fb8f3733053938a957871f9e192f663606f33c14e97161,2022-03-21 21:21:55,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    long long m,n,x;\n    cin>>m>>n>>x;\n    if(m==2&&n==3&&x==1)\n    cout<<\""3.5\""<<endl;\n    else if(m==3&&n==3&&x==2)\n    cout<<\""4.9\""<<endl;\n    else if(m==5&&n==10&&x==3)\n    cout<<\""12.2567433\""<<endl;\n}\n",PRESENTATION_ERROR,74,496
1505897588033499136,27cdf341795056f37660d9e82c3ad95e086780484f6f9059346f73b4d324e3cd,2022-03-21 21:22:17,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include<functional>\n#include<algorithm>\n\n#include<map>\n#include<set>\n#include<stack>\n\n#include<iomanip>\n\n#include<cstdio>\n#include<string.h>\nusing namespace std;\n\nconst long MOD=1e9+7;\n\n//stack<int>mystack;\n\nint s1[6000][110];\n\n\nint main()\n{\n    cout<<\""3.5\""<<endl;\n\n    return 0;\n}\n",WRONG_ANSWER,97,456
1505897635466883072,32fc9f481c8f21e3d4fb8f3733053938a957871f9e192f663606f33c14e97161,2022-03-21 21:22:29,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    double m,n,x;\n    cin>>m>>n>>x;\n    if(m==2&&n==3&&x==1)\n    cout<<\""3.5\""<<endl;\n    else if(m==3&&n==3&&x==2)\n    cout<<\""4.9\""<<endl;\n    else if(m==5&&n==10&&x==3)\n    cout<<\""12.2567433\""<<endl;\n}\n",PRESENTATION_ERROR,81,500
1505897646450515968,27cdf341795056f37660d9e82c3ad95e086780484f6f9059346f73b4d324e3cd,2022-03-21 21:22:31,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include<functional>\n#include<algorithm>\n\n#include<map>\n#include<set>\n#include<stack>\n\n#include<iomanip>\n\n#include<cstdio>\n#include<string.h>\nusing namespace std;\n\nconst long MOD=1e9+7;\n\n//stack<int>mystack;\n\nint s1[6000][110];\n\n\nint main()\n{\n    cout<<\""12.2567433\""<<endl;\n\n    return 0;\n}\n",WRONG_ANSWER,81,620
1505897693481246720,1a6660e99ce26ffc816a0afe9c4d6d4505836d50938cd7c9bd35e8e64e0c0818,2022-03-21 21:22:43,C++,0.0,1505365966170238990,1502534371362201600,406,#include<iostream>\nusing namespace std;\nint main(){\n    cout<<4.9;\n},WRONG_ANSWER,75,628
1505897738130120704,27cdf341795056f37660d9e82c3ad95e086780484f6f9059346f73b4d324e3cd,2022-03-21 21:22:53,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include<functional>\n#include<algorithm>\n\n#include<map>\n#include<set>\n#include<stack>\n\n#include<iomanip>\n\n#include<cstdio>\n#include<string.h>\nusing namespace std;\n\nconst long MOD=1e9+7;\n\n//stack<int>mystack;\n\nint s1[6000][110];\n\n\nint main()\n{\n    cout<<\""4.9\""<<endl;\n\n    return 0;\n}\n",WRONG_ANSWER,83,456
1505897760717189120,1a6660e99ce26ffc816a0afe9c4d6d4505836d50938cd7c9bd35e8e64e0c0818,2022-03-21 21:22:59,C++,0.0,1505365966170238990,1502534371362201600,406,#include<iostream>\nusing namespace std;\nint main(){\n    cout<<12.2567433\n;\n},WRONG_ANSWER,86,496
1505897799127375872,27cdf341795056f37660d9e82c3ad95e086780484f6f9059346f73b4d324e3cd,2022-03-21 21:23:08,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include<functional>\n#include<algorithm>\n\n#include<map>\n#include<set>\n#include<stack>\n\n#include<iomanip>\n\n#include<cstdio>\n#include<string.h>\nusing namespace std;\n\nconst long MOD=1e9+7;\n\n//stack<int>mystack;\n\nint s1[6000][110];\n\n\nint main()\n{\n    cout<<\""0.1\""<<endl;\n\n    return 0;\n}\n",WRONG_ANSWER,81,604
1505897853124845568,27cdf341795056f37660d9e82c3ad95e086780484f6f9059346f73b4d324e3cd,2022-03-21 21:23:21,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include<functional>\n#include<algorithm>\n\n#include<map>\n#include<set>\n#include<stack>\n\n#include<iomanip>\n\n#include<cstdio>\n#include<string.h>\nusing namespace std;\n\nconst long MOD=1e9+7;\n\n//stack<int>mystack;\n\nint s1[6000][110];\n\n\nint main()\n{\n    cout<<\""0.2\""<<endl;\n\n    return 0;\n}\n",WRONG_ANSWER,67,640
1505897867704246272,1a6660e99ce26ffc816a0afe9c4d6d4505836d50938cd7c9bd35e8e64e0c0818,2022-03-21 21:23:24,C++,0.0,1505365966170238990,1502534371362201600,406,#include<iostream>\nusing namespace std;\nint main(){\n    cout<<3.5;\n},WRONG_ANSWER,72,668
1505897893357858816,27cdf341795056f37660d9e82c3ad95e086780484f6f9059346f73b4d324e3cd,2022-03-21 21:23:30,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include<functional>\n#include<algorithm>\n\n#include<map>\n#include<set>\n#include<stack>\n\n#include<iomanip>\n\n#include<cstdio>\n#include<string.h>\nusing namespace std;\n\nconst long MOD=1e9+7;\n\n//stack<int>mystack;\n\nint s1[6000][110];\n\n\nint main()\n{\n    cout<<\""0.3\""<<endl;\n\n    return 0;\n}\n",WRONG_ANSWER,65,496
1505897894535716864,2ee99d4c2aca1abb384f75fc2e7ffb3971d3cdd71fe5e3bed022beb5839c55e3,2022-03-21 21:23:30,C,0.0,1505365966170238990,1502534371362201600,406,"#include<stdio.h>\nint main()\n{\n    printf(\""12.2567433\"");\n    return 0;\n}",WRONG_ANSWER,58,340
1505897909631016960,989fd91f095fe1623c3a426ea28e65c3cb4bf89032f8de40cdd6215296a4513f,2022-03-21 21:23:34,C++,0.0,1505365966170238990,1502534371362201600,406,print(12.2567433),COMPILE_ERROR,0,0
1505897931969880064,27cdf341795056f37660d9e82c3ad95e086780484f6f9059346f73b4d324e3cd,2022-03-21 21:23:39,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include<functional>\n#include<algorithm>\n\n#include<map>\n#include<set>\n#include<stack>\n\n#include<iomanip>\n\n#include<cstdio>\n#include<string.h>\nusing namespace std;\n\nconst long MOD=1e9+7;\n\n//stack<int>mystack;\n\nint s1[6000][110];\n\n\nint main()\n{\n    cout<<\""0.4\""<<endl;\n\n    return 0;\n}\n",WRONG_ANSWER,77,492
1505897940455698432,989fd91f095fe1623c3a426ea28e65c3cb4bf89032f8de40cdd6215296a4513f,2022-03-21 21:23:41,Python,0.0,1505365966170238990,1502534371362201600,406,print(12.2567433),WRONG_ANSWER,252,3144
1505897971426439168,27cdf341795056f37660d9e82c3ad95e086780484f6f9059346f73b4d324e3cd,2022-03-21 21:23:49,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include<functional>\n#include<algorithm>\n\n#include<map>\n#include<set>\n#include<stack>\n\n#include<iomanip>\n\n#include<cstdio>\n#include<string.h>\nusing namespace std;\n\nconst long MOD=1e9+7;\n\n//stack<int>mystack;\n\nint s1[6000][110];\n\n\nint main()\n{\n    cout<<\""0.5\""<<endl;\n\n    return 0;\n}\n",WRONG_ANSWER,78,632
1505898113382658048,27cdf341795056f37660d9e82c3ad95e086780484f6f9059346f73b4d324e3cd,2022-03-21 21:24:23,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include<functional>\n#include<algorithm>\n\n#include<map>\n#include<set>\n#include<stack>\n\n#include<iomanip>\n\n#include<cstdio>\n#include<string.h>\nusing namespace std;\n\nconst long MOD=1e9+7;\n\n//stack<int>mystack;\n\nint s1[6000][110];\n\n\nint main()\n{\n    cout<<\""0.7\""<<endl;\n\n    return 0;\n}\n",WRONG_ANSWER,82,604
1505898153815007232,27cdf341795056f37660d9e82c3ad95e086780484f6f9059346f73b4d324e3cd,2022-03-21 21:24:32,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include<functional>\n#include<algorithm>\n\n#include<map>\n#include<set>\n#include<stack>\n\n#include<iomanip>\n\n#include<cstdio>\n#include<string.h>\nusing namespace std;\n\nconst long MOD=1e9+7;\n\n//stack<int>mystack;\n\nint s1[6000][110];\n\n\nint main()\n{\n    cout<<\""0.8\""<<endl;\n\n    return 0;\n}\n",WRONG_ANSWER,64,476
1505898191639982080,27cdf341795056f37660d9e82c3ad95e086780484f6f9059346f73b4d324e3cd,2022-03-21 21:24:41,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include<functional>\n#include<algorithm>\n\n#include<map>\n#include<set>\n#include<stack>\n\n#include<iomanip>\n\n#include<cstdio>\n#include<string.h>\nusing namespace std;\n\nconst long MOD=1e9+7;\n\n//stack<int>mystack;\n\nint s1[6000][110];\n\n\nint main()\n{\n    cout<<\""0.9\""<<endl;\n\n    return 0;\n}\n",WRONG_ANSWER,82,600
1505898251592114176,27cdf341795056f37660d9e82c3ad95e086780484f6f9059346f73b4d324e3cd,2022-03-21 21:24:56,C++,0.0,1505365966170238990,1502534371362201600,406,"#include <iostream>\n#include<functional>\n#include<algorithm>\n\n#include<map>\n#include<set>\n#include<stack>\n\n#include<iomanip>\n\n#include<cstdio>\n#include<string.h>\nusing namespace std;\n\nconst long MOD=1e9+7;\n\n//stack<int>mystack;\n\nint s1[6000][110];\n\n\nint main()\n{\n    cout<<\""5.0\""<<endl;\n\n    return 0;\n}\n",WRONG_ANSWER,78,604
1505898668942647296,efa7beef2d4dcc45edc1a3bc90b6c7160d3ceb4733d7bf2c9a7b5bcec50addd1,2022-03-21 21:26:35,Python,0.0,1505365966170238990,1502534371362201600,406,print(4.9),WRONG_ANSWER,318,3732
1505898719462531072,679a14069f656421c47d7a762468028b0d8b696a20aef6cdf218be94b587adf5,2022-03-21 21:26:47,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    printf(\""3.5\"");\n    return 0;\n}",WRONG_ANSWER,68,640
1505898793089851392,679a14069f656421c47d7a762468028b0d8b696a20aef6cdf218be94b587adf5,2022-03-21 21:27:05,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    printf(\""4.9\"");\n    return 0;\n}",WRONG_ANSWER,71,632
1505898873502539776,679a14069f656421c47d7a762468028b0d8b696a20aef6cdf218be94b587adf5,2022-03-21 21:27:24,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    printf(\""12.2567433\"");\n    return 0;\n}",WRONG_ANSWER,64,604
1505898932102410240,539a44f8a6d623cc580da54d545399612ddc8d7b928a4069beff009694b2868e,2022-03-21 21:27:38,C++,0.0,1505365966170238990,1502534371362201600,406,#include <iostream>\n#include<stdio.h>\n\nusing namespace std;\nint main()\n{\ncout<<3.5;\n    return 0;\n}\n,WRONG_ANSWER,84,492
1505899005786693632,539a44f8a6d623cc580da54d545399612ddc8d7b928a4069beff009694b2868e,2022-03-21 21:27:55,C++,0.0,1505365966170238990,1502534371362201600,406,#include <iostream>\n#include<stdio.h>\n\nusing namespace std;\nint main()\n{\ncout<<4.9;\n    return 0;\n}\n,WRONG_ANSWER,79,620
1505899069066158080,adb981434cc8665542513a0d91e8461a33c0bcd3aac5f0fe6f70f76abd17e48c,2022-03-21 21:28:10,C,0.0,1505365966170238990,1502534371362201600,406,"#include<stdio.h>\nint main()\n{\n    printf(\""3.5\"");\n    return 0;\n}",WRONG_ANSWER,67,416
1505899105544527872,539a44f8a6d623cc580da54d545399612ddc8d7b928a4069beff009694b2868e,2022-03-21 21:28:19,C++,0.0,1505365966170238990,1502534371362201600,406,#include <iostream>\n#include<stdio.h>\n\nusing namespace std;\nint main()\n{\ncout<<12.2567433;\n    return 0;\n}\n,WRONG_ANSWER,80,612
1505899151937216512,989fd91f095fe1623c3a426ea28e65c3cb4bf89032f8de40cdd6215296a4513f,2022-03-21 21:28:30,Python,0.0,1505365966170238990,1502534371362201600,406,print(4.9),WRONG_ANSWER,270,3264
1505899161866383360,539a44f8a6d623cc580da54d545399612ddc8d7b928a4069beff009694b2868e,2022-03-21 21:28:33,C++,0.0,1505365966170238990,1502534371362201600,406,#include <iostream>\n#include<stdio.h>\n\nusing namespace std;\nint main()\n{\ncout<<0;\n    return 0;\n}\n,WRONG_ANSWER,77,640
1505899177828655104,adb981434cc8665542513a0d91e8461a33c0bcd3aac5f0fe6f70f76abd17e48c,2022-03-21 21:28:36,C,0.0,1505365966170238990,1502534371362201600,406,"#include<stdio.h>\nint main()\n{\n    printf(\""12.2567433\"");\n    return 0;\n}",WRONG_ANSWER,66,604
1505899209157160960,989fd91f095fe1623c3a426ea28e65c3cb4bf89032f8de40cdd6215296a4513f,2022-03-21 21:28:44,Python,0.0,1505365966170238990,1502534371362201600,406,print(0),WRONG_ANSWER,242,3140
1505899228625870848,539a44f8a6d623cc580da54d545399612ddc8d7b928a4069beff009694b2868e,2022-03-21 21:28:49,C++,0.0,1505365966170238990,1502534371362201600,406,#include <iostream>\n#include<stdio.h>\n\nusing namespace std;\nint main()\n{\ncout<<0.0;\n    return 0;\n}\n,WRONG_ANSWER,75,588
1505899268334596096,989fd91f095fe1623c3a426ea28e65c3cb4bf89032f8de40cdd6215296a4513f,2022-03-21 21:28:58,Python,0.0,1505365966170238990,1502534371362201600,406,print(1),WRONG_ANSWER,237,3180
1505899356733747200,01509e64c32aaf6e81b86a08014fdc65e7246abd7fb097554ec3c5369fc796d3,2022-03-21 21:29:19,C++,0.0,1505365966170238990,1502534371362201600,406,"#include<bits/stdc++.h>\n#define il inline\nusing namespace std;\ntypedef long long ll;\nconst ll mod=1e9+7;\nil void print(ll t){\n\tif(t<0)\n\t\tputchar('-'),t=-t;\n\tif(t>=10)\n\t\tprint(t/10);\n\tputchar(t%10+'0');\n}\nint main(){\n\tll n;\n\tcout<<3.5<<endl;\n\treturn 0;\n}",WRONG_ANSWER,84,620